--- _id: '792' author: - first_name: Tobias full_name: Volkhausen, Tobias last_name: Volkhausen - first_name: Kornelius full_name: Dridger, Kornelius last_name: Dridger - first_name: Hermann full_name: S. Lichte, Hermann last_name: S. Lichte - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Volkhausen T, Dridger K, S. Lichte H, Karl H. Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware. In: 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012. ; 2012:299--304.' apa: Volkhausen, T., Dridger, K., S. Lichte, H., & Karl, H. (2012). Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware. In 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012 (pp. 299--304). bibtex: '@inproceedings{Volkhausen_Dridger_S. Lichte_Karl_2012, title={Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware}, booktitle={10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012}, author={Volkhausen, Tobias and Dridger, Kornelius and S. Lichte, Hermann and Karl, Holger}, year={2012}, pages={299--304} }' chicago: Volkhausen, Tobias, Kornelius Dridger, Hermann S. Lichte, and Holger Karl. “Efficient Cooperative Relaying in Wireless Multi-Hop Networks with Commodity WiFi Hardware.” In 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012, 299--304, 2012. ieee: T. Volkhausen, K. Dridger, H. S. Lichte, and H. Karl, “Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware,” in 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012, 2012, pp. 299--304. mla: Volkhausen, Tobias, et al. “Efficient Cooperative Relaying in Wireless Multi-Hop Networks with Commodity WiFi Hardware.” 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012, 2012, pp. 299--304. short: 'T. Volkhausen, K. Dridger, H. S. Lichte, H. Karl, in: 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012, 2012, pp. 299--304.' date_created: 2017-11-27T10:22:26Z date_updated: 2022-01-06T07:03:48Z department: - _id: '75' page: 299--304 project: - _id: '20' name: Minitarusisierte energieautarke Komponenten mit verlässlicher drahtloser Kommunikation für die Automatisierungstechnik publication: 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012 status: public title: Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware type: conference user_id: '15572' year: '2012' ... --- _id: '8055' author: - first_name: Matthias full_name: Becker, Matthias last_name: Becker - first_name: Markus full_name: Luckey, Markus last_name: Luckey - first_name: Steffen full_name: Becker, Steffen last_name: Becker citation: ama: 'Becker M, Luckey M, Becker S. Model-driven Performance Engineering of Self-Adaptive Systems: A Survey. In: Proceedings of the International Conference on Quality of Software Architecture. QoSA’12. New York, NY, USA: ACM; 2012.' apa: 'Becker, M., Luckey, M., & Becker, S. (2012). Model-driven Performance Engineering of Self-Adaptive Systems: A Survey. In Proceedings of the International Conference on Quality of Software Architecture. New York, NY, USA: ACM.' bibtex: '@inproceedings{Becker_Luckey_Becker_2012, place={New York, NY, USA}, series={QoSA’12}, title={Model-driven Performance Engineering of Self-Adaptive Systems: A Survey}, booktitle={Proceedings of the International Conference on Quality of Software Architecture}, publisher={ACM}, author={Becker, Matthias and Luckey, Markus and Becker, Steffen}, year={2012}, collection={QoSA’12} }' chicago: 'Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” In Proceedings of the International Conference on Quality of Software Architecture. QoSA’12. New York, NY, USA: ACM, 2012.' ieee: 'M. Becker, M. Luckey, and S. Becker, “Model-driven Performance Engineering of Self-Adaptive Systems: A Survey,” in Proceedings of the International Conference on Quality of Software Architecture, 2012.' mla: 'Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” Proceedings of the International Conference on Quality of Software Architecture, ACM, 2012.' short: 'M. Becker, M. Luckey, S. Becker, in: Proceedings of the International Conference on Quality of Software Architecture, ACM, New York, NY, USA, 2012.' date_created: 2019-02-21T20:58:50Z date_updated: 2022-01-06T07:03:50Z department: - _id: '66' language: - iso: eng place: New York, NY, USA publication: Proceedings of the International Conference on Quality of Software Architecture publisher: ACM series_title: QoSA'12 status: public title: 'Model-driven Performance Engineering of Self-Adaptive Systems: A Survey' type: conference user_id: '52534' year: '2012' ... --- _id: '8056' abstract: - lang: eng text: Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers. However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners. 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. Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In: Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS’12). Vol 7590. LNCS. Berlin/Heidelberg: Springer-Verlag; 2012:709-725. doi:http://dx.doi.org/10.1007/978-3-642-33666-9_45' apa: 'Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2012). Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS’12) (Vol. 7590, pp. 709–725). Berlin/Heidelberg: Springer-Verlag. http://dx.doi.org/10.1007/978-3-642-33666-9_45' bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2012, place={Berlin/Heidelberg}, series={LNCS}, title={Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}, volume={7590}, DOI={http://dx.doi.org/10.1007/978-3-642-33666-9_45}, booktitle={Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS’12)}, publisher={Springer-Verlag}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={709–725}, collection={LNCS} }' chicago: 'Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” In Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS’12), 7590:709–25. LNCS. Berlin/Heidelberg: Springer-Verlag, 2012. http://dx.doi.org/10.1007/978-3-642-33666-9_45.' ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Towards an Automatic Service Discovery for UML-based Rich Service Descriptions,” in Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS’12), 2012, vol. 7590, pp. 709–725. mla: Huma, Zille, et al. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS’12), vol. 7590, Springer-Verlag, 2012, pp. 709–25, doi:http://dx.doi.org/10.1007/978-3-642-33666-9_45. short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS’12), Springer-Verlag, Berlin/Heidelberg, 2012, pp. 709–725.' date_created: 2019-02-21T20:58:51Z date_updated: 2022-01-06T07:03:50Z department: - _id: '66' doi: http://dx.doi.org/10.1007/978-3-642-33666-9_45 intvolume: ' 7590' language: - iso: eng page: 709-725 place: Berlin/Heidelberg publication: Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS'12) publisher: Springer-Verlag series_title: LNCS status: public title: Towards an Automatic Service Discovery for UML-based Rich Service Descriptions type: conference user_id: '52534' volume: 7590 year: '2012' ... --- _id: '8226' author: - first_name: Marion full_name: Kremer, Marion last_name: Kremer - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Alexander full_name: Hofmann, Alexander last_name: Hofmann - first_name: Jörg full_name: Hohwiller, Jörg last_name: Hohwiller - first_name: Oliver full_name: E. Nandico, Oliver last_name: E. Nandico - first_name: Thomas full_name: Nötzold, Thomas last_name: Nötzold - first_name: Karl full_name: Prott, Karl last_name: Prott - first_name: Diethelm full_name: Schlegel, Diethelm last_name: Schlegel - first_name: Andreas full_name: Seidl, Andreas last_name: Seidl - first_name: Thomas full_name: Wolf, Thomas last_name: Wolf citation: ama: Kremer M, Engels G, Hofmann A, et al. Quasar 3.0 - A Situational Approach to Software Engineering. Capgemini CSD Research, Offenbach 2012; 2012. apa: Kremer, M., Engels, G., Hofmann, A., Hohwiller, J., E. Nandico, O., Nötzold, T., … Wolf, T. (2012). Quasar 3.0 - A Situational Approach to Software Engineering. Capgemini CSD Research, Offenbach 2012. bibtex: '@book{Kremer_Engels_Hofmann_Hohwiller_E. Nandico_Nötzold_Prott_Schlegel_Seidl_Wolf_2012, title={Quasar 3.0 - A Situational Approach to Software Engineering}, publisher={Capgemini CSD Research, Offenbach 2012}, author={Kremer, Marion and Engels, Gregor and Hofmann, Alexander and Hohwiller, Jörg and E. Nandico, Oliver and Nötzold, Thomas and Prott, Karl and Schlegel, Diethelm and Seidl, Andreas and Wolf, Thomas}, year={2012} }' chicago: Kremer, Marion, Gregor Engels, Alexander Hofmann, Jörg Hohwiller, Oliver E. Nandico, Thomas Nötzold, Karl Prott, Diethelm Schlegel, Andreas Seidl, and Thomas Wolf. Quasar 3.0 - A Situational Approach to Software Engineering. Capgemini CSD Research, Offenbach 2012, 2012. ieee: M. Kremer et al., Quasar 3.0 - A Situational Approach to Software Engineering. Capgemini CSD Research, Offenbach 2012, 2012. mla: Kremer, Marion, et al. Quasar 3.0 - A Situational Approach to Software Engineering. Capgemini CSD Research, Offenbach 2012, 2012. short: M. Kremer, G. Engels, A. Hofmann, J. Hohwiller, O. E. Nandico, T. Nötzold, K. Prott, D. Schlegel, A. Seidl, T. Wolf, Quasar 3.0 - A Situational Approach to Software Engineering, Capgemini CSD Research, Offenbach 2012, 2012. date_created: 2019-03-03T17:08:54Z date_updated: 2022-01-06T07:03:52Z department: - _id: '66' language: - iso: eng publisher: Capgemini CSD Research, Offenbach 2012 status: public title: Quasar 3.0 - A Situational Approach to Software Engineering type: book user_id: '52534' year: '2012' ... --- _id: '568' abstract: - lang: eng text: A major goal of the On-The-Fly Computing project is the automated composition of individual services based on services that are available in dynamic markets. Dependent on the granularity of a market, different alternatives that satisfy the requested functional requirements may emerge. In order to select the best solution, services are usually selected with respect to their quality in terms of inherent non-functional properties. In this paper, we describe our idea of how to model this service selection process as a Markov Decision Process, which we in turn intend to solve by means of Reinforcement Learning techniques in order to control the underlying service composition process. In addition, some initial issues with respect to our approach are addressed. 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. Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition. In: Proceedings of the 9th IEEE International Conference on Service Computing (SCC). ; 2012:701-702. doi:10.1109/SCC.2012.76' apa: Jungmann, A., & Kleinjohann, B. (2012). Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition. In Proceedings of the 9th IEEE International Conference on Service Computing (SCC) (pp. 701–702). https://doi.org/10.1109/SCC.2012.76 bibtex: '@inproceedings{Jungmann_Kleinjohann_2012, title={Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition}, DOI={10.1109/SCC.2012.76}, booktitle={Proceedings of the 9th IEEE International Conference on Service Computing (SCC)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2012}, pages={701–702} }' chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition.” In Proceedings of the 9th IEEE International Conference on Service Computing (SCC), 701–2, 2012. https://doi.org/10.1109/SCC.2012.76. ieee: A. Jungmann and B. Kleinjohann, “Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition,” in Proceedings of the 9th IEEE International Conference on Service Computing (SCC), 2012, pp. 701–702. mla: Jungmann, Alexander, and Bernd Kleinjohann. “Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition.” Proceedings of the 9th IEEE International Conference on Service Computing (SCC), 2012, pp. 701–02, doi:10.1109/SCC.2012.76. short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 9th IEEE International Conference on Service Computing (SCC), 2012, pp. 701–702.' date_created: 2017-10-17T12:42:43Z date_updated: 2022-01-06T07:02:31Z ddc: - '040' doi: 10.1109/SCC.2012.76 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:19:51Z date_updated: 2018-03-15T10:19:51Z file_id: '1274' file_name: 568-Towards_the_Application_of_Reinforcement_Learning_Techniques_for_Quality-Based_Service_Selection_in_Automated_Service_Composition.pdf file_size: 122607 relation: main_file success: 1 file_date_updated: 2018-03-15T10:19:51Z has_accepted_license: '1' page: 701-702 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 9th IEEE International Conference on Service Computing (SCC) status: public title: Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition type: conference user_id: '15504' year: '2012' ... --- _id: '5680' author: - first_name: Tim full_name: Püschel, Tim last_name: Püschel - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen - first_name: Diana full_name: Hristova, Diana last_name: Hristova - first_name: Dirk full_name: Neumann, Dirk last_name: Neumann citation: ama: 'Püschel T, Schryen G, Hristova D, Neumann D. Cloud Service Revenue Management. In: European Conference on Information Systems. ; 2012.' apa: Püschel, T., Schryen, G., Hristova, D., & Neumann, D. (2012). Cloud Service Revenue Management. In European Conference on Information Systems. bibtex: '@inproceedings{Püschel_Schryen_Hristova_Neumann_2012, title={Cloud Service Revenue Management}, booktitle={European Conference on Information Systems}, author={Püschel, Tim and Schryen, Guido and Hristova, Diana and Neumann, Dirk}, year={2012} }' chicago: Püschel, Tim, Guido Schryen, Diana Hristova, and Dirk Neumann. “Cloud Service Revenue Management.” In European Conference on Information Systems, 2012. ieee: T. Püschel, G. Schryen, D. Hristova, and D. Neumann, “Cloud Service Revenue Management,” in European Conference on Information Systems, 2012. mla: Püschel, Tim, et al. “Cloud Service Revenue Management.” European Conference on Information Systems, 2012. short: 'T. Püschel, G. Schryen, D. Hristova, D. Neumann, in: European Conference on Information Systems, 2012.' date_created: 2018-11-14T15:40:59Z date_updated: 2022-01-06T07:02:31Z ddc: - '000' department: - _id: '277' extern: '1' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2018-12-11T15:00:25Z date_updated: 2018-12-13T15:14:33Z file_id: '6177' file_name: Proceedings version.pdf file_size: 476955 relation: main_file file_date_updated: 2018-12-13T15:14:33Z has_accepted_license: '1' language: - iso: eng oa: '1' publication: European Conference on Information Systems status: public title: Cloud Service Revenue Management type: conference user_id: '61579' year: '2012' ... --- _id: '5683' author: - first_name: Fabian full_name: Lang, Fabian last_name: Lang - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen - first_name: Andreas full_name: Fink, Andreas last_name: Fink citation: ama: 'Lang F, Schryen G, Fink A. Elicitating, modeling, and processing uncertain human preferences for software agents in electronic negotiations: An empirical study. In: International Conference on Information Systems. ; 2012.' apa: 'Lang, F., Schryen, G., & Fink, A. (2012). Elicitating, modeling, and processing uncertain human preferences for software agents in electronic negotiations: An empirical study. In International Conference on Information Systems.' bibtex: '@inproceedings{Lang_Schryen_Fink_2012, title={Elicitating, modeling, and processing uncertain human preferences for software agents in electronic negotiations: An empirical study}, booktitle={International Conference on Information Systems}, author={Lang, Fabian and Schryen, Guido and Fink, Andreas}, year={2012} }' chicago: 'Lang, Fabian, Guido Schryen, and Andreas Fink. “Elicitating, Modeling, and Processing Uncertain Human Preferences for Software Agents in Electronic Negotiations: An Empirical Study.” In International Conference on Information Systems, 2012.' ieee: 'F. Lang, G. Schryen, and A. Fink, “Elicitating, modeling, and processing uncertain human preferences for software agents in electronic negotiations: An empirical study,” in International Conference on Information Systems, 2012.' mla: 'Lang, Fabian, et al. “Elicitating, Modeling, and Processing Uncertain Human Preferences for Software Agents in Electronic Negotiations: An Empirical Study.” International Conference on Information Systems, 2012.' short: 'F. Lang, G. Schryen, A. Fink, in: International Conference on Information Systems, 2012.' date_created: 2018-11-14T15:44:07Z date_updated: 2022-01-06T07:02:32Z department: - _id: '277' extern: '1' language: - iso: eng publication: International Conference on Information Systems status: public title: 'Elicitating, modeling, and processing uncertain human preferences for software agents in electronic negotiations: An empirical study' type: conference user_id: '61579' year: '2012' ... --- _id: '5688' author: - first_name: Christian full_name: Bodenstein, Christian last_name: Bodenstein - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen - first_name: Dirk full_name: Neumann, Dirk last_name: Neumann citation: ama: 'Bodenstein C, Schryen G, Neumann D. Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers. European Journal of Operational Research : EJOR. 2012;222(1):157-167.' apa: 'Bodenstein, C., Schryen, G., & Neumann, D. (2012). Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers. European Journal of Operational Research : EJOR, 222(1), 157–167.' bibtex: '@article{Bodenstein_Schryen_Neumann_2012, title={Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers}, volume={222}, number={1}, journal={European Journal of Operational Research : EJOR}, publisher={Elsevier}, author={Bodenstein, Christian and Schryen, Guido and Neumann, Dirk}, year={2012}, pages={157–167} }' chicago: 'Bodenstein, Christian, Guido Schryen, and Dirk Neumann. “Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers.” European Journal of Operational Research : EJOR 222, no. 1 (2012): 157–67.' ieee: 'C. Bodenstein, G. Schryen, and D. Neumann, “Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers,” European Journal of Operational Research : EJOR, vol. 222, no. 1, pp. 157–167, 2012.' mla: 'Bodenstein, Christian, et al. “Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers.” European Journal of Operational Research : EJOR, vol. 222, no. 1, Elsevier, 2012, pp. 157–67.' short: 'C. Bodenstein, G. Schryen, D. Neumann, European Journal of Operational Research : EJOR 222 (2012) 157–167.' date_created: 2018-11-14T15:47:32Z date_updated: 2022-01-06T07:02:33Z ddc: - '000' department: - _id: '277' extern: '1' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2018-12-11T14:54:18Z date_updated: 2018-12-13T15:13:35Z file_id: '6172' file_name: 1-s2.0-S0377221712002810-main.pdf file_size: 520239 relation: main_file file_date_updated: 2018-12-13T15:13:35Z has_accepted_license: '1' intvolume: ' 222' issue: '1' language: - iso: eng oa: '1' page: 157-167 publication: 'European Journal of Operational Research : EJOR' publisher: Elsevier status: public title: Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers type: journal_article user_id: '61579' volume: 222 year: '2012' ... --- _id: '569' abstract: - lang: eng text: Today's real-time embedded systems operate in frequently changing environments on which they react by self-adaptations. Such an approach needs adequate modeling support of these reconfigurations to enable verification of safety properties, e.g., by timed model checking. Component-based development of such systems realizes these self-adaptations by structural reconfigurations of components and their connectors. However, component models proposed in literature do not support reconfigurable components in real-time embedded context but focus on other domains like business information systems. In this paper, we present an extension of our modeling language MechatronicUML to support structural reconfigurations taking the specific requirements of our domain into account. Based on the proposed extension we outline our research roadmap to achieve verification and realization of systems modeled in MechatronicUML. author: - first_name: Steffen full_name: Becker, Steffen last_name: Becker - first_name: Christian full_name: Heinzemann, Christian last_name: Heinzemann - first_name: 'Claudia ' full_name: 'Priesterjahn, Claudia ' last_name: Priesterjahn citation: ama: 'Becker S, Heinzemann C, Priesterjahn C. Towards Modeling Reconfiguration in Hierarchical Component Architectures. In: Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE). ; 2012:23--28. doi:10.1145/2304736.2304742' apa: Becker, S., Heinzemann, C., & Priesterjahn, C. (2012). Towards Modeling Reconfiguration in Hierarchical Component Architectures. In Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE) (pp. 23--28). https://doi.org/10.1145/2304736.2304742 bibtex: '@inproceedings{Becker_Heinzemann_Priesterjahn_2012, title={Towards Modeling Reconfiguration in Hierarchical Component Architectures}, DOI={10.1145/2304736.2304742}, booktitle={Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE)}, author={Becker, Steffen and Heinzemann, Christian and Priesterjahn, Claudia }, year={2012}, pages={23--28} }' chicago: Becker, Steffen, Christian Heinzemann, and Claudia Priesterjahn. “Towards Modeling Reconfiguration in Hierarchical Component Architectures.” In Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE), 23--28, 2012. https://doi.org/10.1145/2304736.2304742. ieee: S. Becker, C. Heinzemann, and C. Priesterjahn, “Towards Modeling Reconfiguration in Hierarchical Component Architectures,” in Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE), 2012, pp. 23--28. mla: Becker, Steffen, et al. “Towards Modeling Reconfiguration in Hierarchical Component Architectures.” Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE), 2012, pp. 23--28, doi:10.1145/2304736.2304742. short: 'S. Becker, C. Heinzemann, C. Priesterjahn, in: Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE), 2012, pp. 23--28.' date_created: 2017-10-17T12:42:43Z date_updated: 2022-01-06T07:02:34Z ddc: - '040' doi: 10.1145/2304736.2304742 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:19:12Z date_updated: 2018-03-15T10:19:12Z file_id: '1273' file_name: 569-CBSE12-Becker_Heinzemann_Priesterjahn.pdf file_size: 139679 relation: main_file success: 1 file_date_updated: 2018-03-15T10:19:12Z has_accepted_license: '1' page: 23--28 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 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE) status: public title: Towards Modeling Reconfiguration in Hierarchical Component Architectures type: conference user_id: '15504' year: '2012' ... --- _id: '570' abstract: - lang: eng text: 'This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks' author: - first_name: Riko full_name: Jacob, Riko last_name: Jacob - first_name: Stephan full_name: Ritscher, Stephan last_name: Ritscher - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science. 2012:137-148. doi:10.1016/j.tcs.2012.07.029' apa: 'Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2012). Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science, 137–148. https://doi.org/10.1016/j.tcs.2012.07.029' bibtex: '@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}, DOI={10.1016/j.tcs.2012.07.029}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012}, pages={137–148} }' chicago: 'Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, 2012, 137–48. https://doi.org/10.1016/j.tcs.2012.07.029.' ieee: 'R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs,” Theoretical Computer Science, pp. 137–148, 2012.' mla: 'Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.' short: R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science (2012) 137–148. date_created: 2017-10-17T12:42:43Z date_updated: 2022-01-06T07:02:36Z ddc: - '040' department: - _id: '79' doi: 10.1016/j.tcs.2012.07.029 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:16:20Z date_updated: 2018-03-15T10:16:20Z file_id: '1272' file_name: 570-Delaunay-Journal.pdf file_size: 250051 relation: main_file success: 1 file_date_updated: 2018-03-15T10:16:20Z has_accepted_license: '1' page: 137-148 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Theoretical Computer Science publisher: Elsevier status: public title: 'Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs' type: journal_article user_id: '477' year: '2012' ... --- _id: '571' abstract: - lang: eng text: The paradigm shift from purchasing monolithic software solutions to a dynamic composition of individual solutions entails many new possibilities yet great challenges, too. In order to satisfy user requirements, complex services have to be automatically composed of elementary services. Multiple possibilities of composing a complex service inevitably emerge. The problem of selecting the most appropriate services has to be solved by comparing the different service candidates with respect to their quality in terms of inherent non-functional properties while simultaneously taking the user requirements into account. We are aiming for an integrated service rating and ranking methodology in order to support the automation of the underlying decision-making process. The main contribution of this paper is a first decomposition of the quality-based service selection process, while emphasizing major issues and challenges, which we are addressing in the On-The-Fly Computing project. 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. Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition. In: Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION). ; 2012:43-47.' apa: Jungmann, A., & Kleinjohann, B. (2012). Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition. In Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION) (pp. 43–47). bibtex: '@inproceedings{Jungmann_Kleinjohann_2012, title={Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition}, booktitle={Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2012}, pages={43–47} }' chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition.” In Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 43–47, 2012. ieee: A. Jungmann and B. Kleinjohann, “Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition,” in Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2012, pp. 43–47. mla: Jungmann, Alexander, and Bernd Kleinjohann. “Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition.” Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2012, pp. 43–47. short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2012, pp. 43–47.' date_created: 2017-10-17T12:42:43Z date_updated: 2022-01-06T07:02:37Z ddc: - '040' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:39:02Z date_updated: 2018-03-15T09:39:02Z file_id: '1271' file_name: 571-Towards_an_Integrated_Service_Rating_and_Ranking_Methodology__for_Quality_Based_Service_Selection_in_Automatic_Service_Composition.pdf file_size: 103343 relation: main_file success: 1 file_date_updated: 2018-03-15T09:39:02Z has_accepted_license: '1' page: 43-47 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subproject B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION) status: public title: Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition type: conference user_id: '15504' year: '2012' ... --- _id: '5716' abstract: - lang: eng text: The tendency of managers to focus on short-term results rather than on sustained company success is of particular importance to retail marketing managers, because marketing activities involve expenditures which may only pay off in the longer term. To address the issue of myopic management, our study shows how the complexity of the service profit chain (SPC) can cause managers to make suboptimal decisions. Hence, our paper departs from past research by recognizing that understanding the temporal interplay between operational investments, employee satisfaction, customer satisfaction, and operating profit is essential to achieving sustained success. In particular, we intend to improve understanding of the functioning of the SPC with respect to time lags and feedback loops. Results of our large-scale longitudinal study set in a multi-outlet retail chain reveal time-lag effects between operational investments and employee satisfaction, as well as between customer satisfaction and performance. These findings, along with evidence of a negative interaction effect of employee satisfaction on the relationship between current performance and future investments, show the substantial risk of mismanaging the SPC. We identify specific situations in which the dynamic approach leads to superior marketing investment decisions, when compared to the conventional static view of the SCP. These insights provide valuable managerial guidance for effectively managing the SPC over time. article_type: original author: - first_name: Heiner full_name: Evanschitzky, Heiner last_name: Evanschitzky - first_name: Florian v full_name: Wangenheim, Florian v last_name: Wangenheim - first_name: Nancy full_name: Wünderlich, Nancy id: '36392' last_name: Wünderlich citation: ama: 'Evanschitzky H, Wangenheim F v, Wünderlich N. Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops. Journal of Retailing. 2012;88(3):356-366.' apa: 'Evanschitzky, H., Wangenheim, F. v, & Wünderlich, N. (2012). Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops. Journal of Retailing, 88(3), 356–366.' bibtex: '@article{Evanschitzky_Wangenheim_Wünderlich_2012, title={Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops.}, volume={88}, number={3}, journal={Journal of Retailing}, publisher={Elsevier}, author={Evanschitzky, Heiner and Wangenheim, Florian v and Wünderlich, Nancy}, year={2012}, pages={356–366} }' chicago: 'Evanschitzky, Heiner, Florian v Wangenheim, and Nancy Wünderlich. “Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops.” Journal of Retailing 88, no. 3 (2012): 356–66.' ieee: 'H. Evanschitzky, F. v Wangenheim, and N. Wünderlich, “Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops.,” Journal of Retailing, vol. 88, no. 3, pp. 356–366, 2012.' mla: 'Evanschitzky, Heiner, et al. “Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops.” Journal of Retailing, vol. 88, no. 3, Elsevier, 2012, pp. 356–66.' short: H. Evanschitzky, F. v Wangenheim, N. Wünderlich, Journal of Retailing 88 (2012) 356–366. date_created: 2018-11-16T09:37:06Z date_updated: 2022-01-06T07:02:37Z department: - _id: '181' intvolume: ' 88' issue: '3' keyword: - Employee satisfaction - Customer satisfaction - Performance - Service profit chain - Feedback loops - Time lags - Myopic marketing management language: - iso: eng page: 356-366 publication: Journal of Retailing publication_status: published publisher: Elsevier status: public title: 'Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops.' type: journal_article user_id: '37741' volume: 88 year: '2012' ... --- _id: '5717' abstract: - lang: eng text: Although professional service providers increasingly deliver their services globally, little is known about cross-cultural differences in customers’ motivation to participate in service production. To address this lacuna, we survey a total of 2,284 banking customers in 11 countries on their motivation to provide personal information to, and follow the advice of, their service providers. We find differences in both aspects, but only the differences in providing personal information can be explained by the cultural values of uncertainty avoidance, individualism/collectivism, and masculinity/femininity. To perform certain tasks in the service process, global professional service providers should acknowledge cultural differences in customers’ motivations. article_type: original author: - first_name: Jan H full_name: Schumann, Jan H last_name: Schumann - first_name: Nancy full_name: Wünderlich, Nancy id: '36392' last_name: Wünderlich - first_name: Marcus S full_name: Zimmer, Marcus S last_name: Zimmer citation: ama: Schumann JH, Wünderlich N, Zimmer MS. Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments. Schmalenbach Business Review. 2012;64(2):141-165. apa: Schumann, J. H., Wünderlich, N., & Zimmer, M. S. (2012). Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments. Schmalenbach Business Review, 64(2), 141–165. bibtex: '@article{Schumann_Wünderlich_Zimmer_2012, title={Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.}, volume={64}, number={2}, journal={Schmalenbach Business Review}, publisher={Springer}, author={Schumann, Jan H and Wünderlich, Nancy and Zimmer, Marcus S}, year={2012}, pages={141–165} }' chicago: 'Schumann, Jan H, Nancy Wünderlich, and Marcus S Zimmer. “Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.” Schmalenbach Business Review 64, no. 2 (2012): 141–65.' ieee: J. H. Schumann, N. Wünderlich, and M. S. Zimmer, “Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.,” Schmalenbach Business Review, vol. 64, no. 2, pp. 141–165, 2012. mla: Schumann, Jan H., et al. “Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.” Schmalenbach Business Review, vol. 64, no. 2, Springer, 2012, pp. 141–65. short: J.H. Schumann, N. Wünderlich, M.S. Zimmer, Schmalenbach Business Review 64 (2012) 141–165. date_created: 2018-11-16T09:40:23Z date_updated: 2022-01-06T07:02:37Z department: - _id: '181' intvolume: ' 64' issue: '2' keyword: - Co-Production - Culture - Customer Participation - Professional Services language: - iso: eng page: 141-165 publication: Schmalenbach Business Review publication_status: published publisher: Springer status: public title: Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments. type: journal_article user_id: '37741' volume: 64 year: '2012' ... --- _id: '5718' abstract: - lang: eng text: The role of information and communication technology for economic growth has been emphasized repeatedly. Technological breakthroughs have generated new forms of services, such as self-services or remote services. Although these encounters are qualitatively different from traditional service provision, prior service management literature thus far had paid little attention to theory development and the systematization of technology-based service encounters. To fill this research gap, the present study outlines how new types of technology-based services fit into existing service typologies and provides an extension of existing frameworks to capture their unique characteristics. These insights in turn offer managerial implications and highlight open research questions. article_type: original author: - first_name: Jan H full_name: Schumann, Jan H last_name: Schumann - first_name: Nancy full_name: Wünderlich, Nancy id: '36392' last_name: Wünderlich - first_name: Florian full_name: Wangenheim, Florian last_name: Wangenheim citation: ama: 'Schumann JH, Wünderlich N, Wangenheim F. Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics. Technovation. 2012;32(2):133-143.' apa: 'Schumann, J. H., Wünderlich, N., & Wangenheim, F. (2012). Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics. Technovation, 32(2), 133–143.' bibtex: '@article{Schumann_Wünderlich_Wangenheim_2012, title={Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.}, volume={32}, number={2}, journal={Technovation}, publisher={Elsevier}, author={Schumann, Jan H and Wünderlich, Nancy and Wangenheim, Florian}, year={2012}, pages={133–143} }' chicago: 'Schumann, Jan H, Nancy Wünderlich, and Florian Wangenheim. “Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.” Technovation 32, no. 2 (2012): 133–43.' ieee: 'J. H. Schumann, N. Wünderlich, and F. Wangenheim, “Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.,” Technovation, vol. 32, no. 2, pp. 133–143, 2012.' mla: 'Schumann, Jan H., et al. “Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.” Technovation, vol. 32, no. 2, Elsevier, 2012, pp. 133–43.' short: J.H. Schumann, N. Wünderlich, F. Wangenheim, Technovation 32 (2012) 133–143. date_created: 2018-11-16T09:43:45Z date_updated: 2022-01-06T07:02:37Z department: - _id: '181' intvolume: ' 32' issue: '2' keyword: - Services - Remote services - Self-services - Technology mediation language: - iso: eng page: 133-143 publication: Technovation publication_status: published publisher: Elsevier status: public title: 'Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.' type: journal_article user_id: '37741' volume: 32 year: '2012' ... --- _id: '572' abstract: - lang: eng text: Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers.However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners. 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. Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In: Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS). LNCS. ; 2012:709--725. doi:10.1007/978-3-642-33666-9_45' apa: Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2012). Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS) (pp. 709--725). https://doi.org/10.1007/978-3-642-33666-9_45 bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={LNCS}, title={Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}, DOI={10.1007/978-3-642-33666-9_45}, booktitle={Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={709--725}, collection={LNCS} }' chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” In Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS), 709--725. LNCS, 2012. https://doi.org/10.1007/978-3-642-33666-9_45. ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Towards an Automatic Service Discovery for UML-based Rich Service Descriptions,” in Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS), 2012, pp. 709--725. mla: Huma, Zille, et al. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS), 2012, pp. 709--725, doi:10.1007/978-3-642-33666-9_45. short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS), 2012, pp. 709--725.' date_created: 2017-10-17T12:42:43Z date_updated: 2022-01-06T07:02:37Z ddc: - '040' department: - _id: '66' doi: 10.1007/978-3-642-33666-9_45 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:38:22Z date_updated: 2018-03-15T09:38:22Z file_id: '1270' file_name: 572-MODELS2012-Huma_Gerth_Engels_Juwig.pdf file_size: 518982 relation: main_file success: 1 file_date_updated: 2018-03-15T09:38:22Z has_accepted_license: '1' language: - iso: eng page: 709--725 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 ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS) series_title: LNCS status: public title: Towards an Automatic Service Discovery for UML-based Rich Service Descriptions type: conference user_id: '477' year: '2012' ... --- _id: '573' abstract: - lang: eng text: In software markets of the future, customer-specific software will be developed on demand from distributed software and hardware services available on world-wide markets. Having a request, services have to be automatically discovered and composed. For that purpose, services have to be matched based on their specifications. For the accurate matching, services have to be described comprehensively that requires the integration of different domain-specific languages (DSLs) used for functional, non-functional, and infrastructural properties. Since different service providers use plenty of language dialects to model the same service property, their integration is needed for the matching. In this paper, we propose a framework for integration of DSLs. It is based on a parameterized abstract core language that integrates key concepts needed to describe a service. Parts of the core language can be substituted with concrete DSLs. Thus, the framework serves as a basis for the comprehensive specification and automatic matching of services. author: - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina citation: ama: 'Arifulina S. Towards a Framework for the Integration of Modeling Languages. In: W. Eisenecker U, Bucholdt C, eds. Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)). CEUR Workshop Proceedings. ; 2012:23--26.' apa: Arifulina, S. (2012). Towards a Framework for the Integration of Modeling Languages. In U. W. Eisenecker & C. Bucholdt (Eds.), Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)) (pp. 23--26). bibtex: '@inproceedings{Arifulina_2012, series={CEUR Workshop Proceedings}, title={Towards a Framework for the Integration of Modeling Languages}, booktitle={Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))}, author={Arifulina, Svetlana}, editor={W. Eisenecker, Ulrich and Bucholdt, ChristianEditors}, year={2012}, pages={23--26}, collection={CEUR Workshop Proceedings} }' chicago: Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.” In Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)), edited by Ulrich W. Eisenecker and Christian Bucholdt, 23--26. CEUR Workshop Proceedings, 2012. ieee: S. Arifulina, “Towards a Framework for the Integration of Modeling Languages,” in Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)), 2012, pp. 23--26. mla: Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.” Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)), edited by Ulrich W. Eisenecker and Christian Bucholdt, 2012, pp. 23--26. short: 'S. Arifulina, in: U. W. Eisenecker, C. Bucholdt (Eds.), Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)), 2012, pp. 23--26.' date_created: 2017-10-17T12:42:43Z date_updated: 2022-01-06T07:02:37Z ddc: - '040' department: - _id: '66' editor: - first_name: Ulrich full_name: W. Eisenecker, Ulrich last_name: W. Eisenecker - first_name: Christian full_name: Bucholdt, Christian last_name: Bucholdt file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:37:48Z date_updated: 2018-03-15T09:37:48Z file_id: '1269' file_name: 573-Framework_for_Integration_of_Modeling_Languages.pdf file_size: 321930 relation: main_file success: 1 file_date_updated: 2018-03-15T09:37:48Z has_accepted_license: '1' language: - iso: eng page: 23--26 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 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)) series_title: CEUR Workshop Proceedings status: public title: Towards a Framework for the Integration of Modeling Languages type: conference user_id: '477' year: '2012' ... --- _id: '574' abstract: - lang: eng text: 'We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.' author: - first_name: Thomas full_name: Clouser, Thomas last_name: Clouser - first_name: Mikhail full_name: Nesterenko, Mikhail last_name: Nesterenko - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science. 2012:18-35. doi:10.1016/j.tcs.2011.12.079' apa: 'Clouser, T., Nesterenko, M., & Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079' bibtex: '@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={10.1016/j.tcs.2011.12.079}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }' chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, 2012, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079.' ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” Theoretical Computer Science, pp. 18–35, 2012.' mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079.' short: T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35. date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:38Z ddc: - '040' department: - _id: '79' doi: 10.1016/j.tcs.2011.12.079 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:09:29Z date_updated: 2018-03-15T09:09:29Z file_id: '1268' file_name: 574-tiara.pdf file_size: 315843 relation: main_file success: 1 file_date_updated: 2018-03-15T09:09:29Z has_accepted_license: '1' page: 18-35 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Theoretical Computer Science publisher: Elsevier status: public title: 'Tiara: A self-stabilizing deterministic skip list and skip graph' type: journal_article user_id: '477' year: '2012' ... --- _id: '575' author: - first_name: Lars full_name: Bremer, Lars last_name: Bremer citation: ama: Bremer L. Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität Paderborn; 2012. apa: Bremer, L. (2012). Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität Paderborn. bibtex: '@book{Bremer_2012, title={Symbiotic Coupling of Peer-to-Peer and Cloud Systems}, publisher={Universität Paderborn}, author={Bremer, Lars}, year={2012} }' chicago: Bremer, Lars. Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität Paderborn, 2012. ieee: L. Bremer, Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität Paderborn, 2012. mla: Bremer, Lars. Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität Paderborn, 2012. short: L. Bremer, Symbiotic Coupling of Peer-to-Peer and Cloud Systems, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:38Z 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: Symbiotic Coupling of Peer-to-Peer and Cloud Systems type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '5753' author: - first_name: Benjamin full_name: Nagel, Benjamin last_name: Nagel - first_name: Christian full_name: Gerth, Christian last_name: Gerth - first_name: Enes full_name: Yigitbas, Enes id: '8447' last_name: Yigitbas orcid: 0000-0002-5967-833X - first_name: Fabian full_name: Christ, Fabian last_name: Christ - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Nagel B, Gerth C, Yigitbas E, Christ F, Engels G. Model-driven specification of adaptive cloud-based systems. In: Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012. ; 2012:4. doi:10.1145/2446224.2446228' apa: Nagel, B., Gerth, C., Yigitbas, E., Christ, F., & Engels, G. (2012). Model-driven specification of adaptive cloud-based systems. In Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012 (p. 4). https://doi.org/10.1145/2446224.2446228 bibtex: '@inproceedings{Nagel_Gerth_Yigitbas_Christ_Engels_2012, title={Model-driven specification of adaptive cloud-based systems}, DOI={10.1145/2446224.2446228}, booktitle={Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012}, author={Nagel, Benjamin and Gerth, Christian and Yigitbas, Enes and Christ, Fabian and Engels, Gregor}, year={2012}, pages={4} }' chicago: Nagel, Benjamin, Christian Gerth, Enes Yigitbas, Fabian Christ, and Gregor Engels. “Model-Driven Specification of Adaptive Cloud-Based Systems.” In Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012, 4, 2012. https://doi.org/10.1145/2446224.2446228. ieee: B. Nagel, C. Gerth, E. Yigitbas, F. Christ, and G. Engels, “Model-driven specification of adaptive cloud-based systems,” in Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012, 2012, p. 4. mla: Nagel, Benjamin, et al. “Model-Driven Specification of Adaptive Cloud-Based Systems.” Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012, 2012, p. 4, doi:10.1145/2446224.2446228. short: 'B. Nagel, C. Gerth, E. Yigitbas, F. Christ, G. Engels, in: Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012, 2012, p. 4.' date_created: 2018-11-19T15:18:29Z date_updated: 2022-01-06T07:02:38Z department: - _id: '66' doi: 10.1145/2446224.2446228 language: - iso: eng page: '4' publication: Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012 status: public title: Model-driven specification of adaptive cloud-based systems type: conference user_id: '8447' year: '2012' ... --- _id: '576' author: - first_name: Henning full_name: Schmitz, Henning last_name: Schmitz citation: ama: Schmitz H. Stereo Matching on a Convey HC-1 Hybrid Core Computer. Universität Paderborn; 2012. apa: Schmitz, H. (2012). Stereo Matching on a Convey HC-1 Hybrid Core Computer. Universität Paderborn. bibtex: '@book{Schmitz_2012, title={Stereo Matching on a Convey HC-1 Hybrid Core Computer}, publisher={Universität Paderborn}, author={Schmitz, Henning}, year={2012} }' chicago: Schmitz, Henning. Stereo Matching on a Convey HC-1 Hybrid Core Computer. Universität Paderborn, 2012. ieee: H. Schmitz, Stereo Matching on a Convey HC-1 Hybrid Core Computer. Universität Paderborn, 2012. mla: Schmitz, Henning. Stereo Matching on a Convey HC-1 Hybrid Core Computer. Universität Paderborn, 2012. short: H. Schmitz, Stereo Matching on a Convey HC-1 Hybrid Core Computer, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:38Z 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: Stereo Matching on a Convey HC-1 Hybrid Core Computer type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '5760' author: - first_name: Enes full_name: Yigitbas, Enes id: '8447' last_name: Yigitbas orcid: 0000-0002-5967-833X citation: ama: Yigitbas E. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen.; 2012. apa: Yigitbas, E. (2012). Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen. bibtex: '@book{Yigitbas_2012, title={Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen}, author={Yigitbas, Enes}, year={2012} }' chicago: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen, 2012. ieee: E. Yigitbas, Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen. 2012. mla: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen. 2012. short: E. Yigitbas, Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen, 2012. date_created: 2018-11-19T15:29:59Z date_updated: 2022-01-06T07:02:38Z department: - _id: '66' language: - iso: eng status: public title: Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen type: mastersthesis user_id: '8447' year: '2012' ... --- _id: '577' abstract: - lang: eng text: 'SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems.' citation: ama: Richa AW, Scheideler C, eds. Stabilization, Safety, and Security of Distributed Systems.; 2012. doi:10.1007/978-3-642-33536-5 apa: Richa, A. W., & Scheideler, C. (Eds.). (2012). Stabilization, Safety, and Security of Distributed Systems. Presented at the Stabilization, Safety, and Security of Distributed Systems (SSS), Paderborn, Germany. https://doi.org/10.1007/978-3-642-33536-5 bibtex: '@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security of Distributed Systems}, DOI={10.1007/978-3-642-33536-5}, year={2012} }' chicago: Richa, Andrea W., and Christian Scheideler, eds. Stabilization, Safety, and Security of Distributed Systems, 2012. https://doi.org/10.1007/978-3-642-33536-5. ieee: A. W. Richa and C. Scheideler, Eds., Stabilization, Safety, and Security of Distributed Systems. 2012. mla: Richa, Andrea W., and Christian Scheideler, editors. Stabilization, Safety, and Security of Distributed Systems. 2012, doi:10.1007/978-3-642-33536-5. short: A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012. conference: end_date: 2012-10-04 location: Paderborn, Germany name: Stabilization, Safety, and Security of Distributed Systems (SSS) start_date: 2012-10-01 date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:39Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33536-5 editor: - first_name: Andrea W. full_name: Richa, Andrea W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:09:19Z date_updated: 2018-03-21T13:09:19Z file_id: '1569' file_name: 577-SSS2012Richa-Scheideler.pdf file_size: 169564 relation: main_file success: 1 file_date_updated: 2018-03-21T13:09:19Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C status: public title: Stabilization, Safety, and Security of Distributed Systems type: conference_editor user_id: '15504' year: '2012' ... --- _id: '578' abstract: - lang: eng text: 'This paper analyzes the stability of capital tax harmonization agreements in a stylized model where countries have formed coalitions which set a common tax rate in order to avoid the inefficient fully non-cooperative Nash equilibrium. In particular, for a given coalition structure we study to what extend the stability of tax agreements is affected by the coalitions that have formed. In our set-up, countries are symmetric, but coalitions can be of arbitrary size. We analyze stability by means of a repeated game setting employing simple trigger strategies and we allow a sub-coalition to deviate from the coalitional equilibrium. For a given form of punishment we are able to rank the stability of different coalition structures as long as the size of the largest coalition does not change. Our main results are: (1) singleton regions have the largest incentives to deviate, (2) the stability of cooperation depends on the degree of cooperative behavior ex-ante.' author: - first_name: Sonja full_name: Brangewitz, Sonja last_name: Brangewitz - first_name: Sarah full_name: Brockhoff, Sarah last_name: Brockhoff citation: ama: Brangewitz S, Brockhoff S. Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn; 2012. apa: Brangewitz, S., & Brockhoff, S. (2012). Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn. bibtex: '@book{Brangewitz_Brockhoff_2012, title={Stability of Coalitional Equilibria within Repeated Tax Competition}, publisher={Universität Paderborn}, author={Brangewitz, Sonja and Brockhoff, Sarah}, year={2012} }' chicago: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn, 2012. ieee: S. Brangewitz and S. Brockhoff, Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn, 2012. mla: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn, 2012. short: S. Brangewitz, S. Brockhoff, Stability of Coalitional Equilibria within Repeated Tax Competition, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:40Z ddc: - '040' department: - _id: '205' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:08:24Z date_updated: 2018-03-15T09:08:24Z file_id: '1267' file_name: 578-WP48Brangewitz.pdf file_size: 876927 relation: main_file success: 1 file_date_updated: 2018-03-15T09:08:24Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Stability of Coalitional Equilibria within Repeated Tax Competition type: report user_id: '477' year: '2012' ... --- _id: '579' abstract: - lang: eng text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space. author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Bodo full_name: Manthey, Bodo last_name: Manthey - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Till full_name: Tantau, Till last_name: Tantau citation: ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174 apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174 bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }' chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.' ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with applications,” Transactions on Algorithms, no. 3, p. 30, 2012. mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174. short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30. date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:41Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1145/2229163.2229174 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:04:58Z date_updated: 2018-03-15T09:04:58Z file_id: '1266' file_name: 579-a30-damerow.pdf file_size: 329282 relation: main_file success: 1 file_date_updated: 2018-03-15T09:04:58Z has_accepted_license: '1' issue: '3' page: '30' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Algorithms publisher: ACM status: public title: Smoothed analysis of left-to-right maxima with applications type: journal_article user_id: '477' year: '2012' ... --- _id: '580' abstract: - lang: eng text: We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \cite{Chan:2010} we transfer our results to processors with a fixed maximum speed. author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Fredrik full_name: Mallmann Trenn, Fredrik last_name: Mallmann Trenn citation: ama: 'Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down & Sleep for Profit in Online Deadline Scheduling. In: Even G, Rawitz D, eds. Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg). LNCS. ; 2012:218-231. doi:10.1007/978-3-642-34862-4_17' apa: Cord-Landwehr, A., Kling, P., & Mallmann Trenn, F. (2012). Slow Down & Sleep for Profit in Online Deadline Scheduling. In G. Even & D. Rawitz (Eds.), Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg) (pp. 218–231). https://doi.org/10.1007/978-3-642-34862-4_17 bibtex: '@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS}, title={Slow Down & Sleep for Profit in Online Deadline Scheduling}, DOI={10.1007/978-3-642-34862-4_17}, booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}, author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}, editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS} }' chicago: Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow Down & Sleep for Profit in Online Deadline Scheduling.” In Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), edited by Guy Even and Dror Rawitz, 218–31. LNCS, 2012. https://doi.org/10.1007/978-3-642-34862-4_17. ieee: A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down & Sleep for Profit in Online Deadline Scheduling,” in Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231. mla: Cord-Landwehr, Andreas, et al. “Slow Down & Sleep for Profit in Online Deadline Scheduling.” Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:10.1007/978-3-642-34862-4_17. short: 'A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.), Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231.' date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:42Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-642-34862-4_17 editor: - first_name: Guy full_name: Even, Guy last_name: Even - first_name: Dror full_name: Rawitz, Dror last_name: Rawitz file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:03:39Z date_updated: 2018-03-15T09:03:39Z file_id: '1265' file_name: 580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf file_size: 325939 relation: main_file success: 1 file_date_updated: 2018-03-15T09:03:39Z has_accepted_license: '1' language: - iso: eng page: 218-231 project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '16' name: SFB 901 - Subproject C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg) series_title: LNCS status: public title: Slow Down & Sleep for Profit in Online Deadline Scheduling type: conference user_id: '477' year: '2012' ... --- _id: '581' abstract: - lang: eng text: 'Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Martina full_name: 'Hüllmann (married name: Eikel), Martina' last_name: 'Hüllmann (married name: Eikel)' - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116' apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler, C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283). https://doi.org/10.1109/IPDPS.2012.116' bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }' chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.' ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.' mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116. short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.' date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:42Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1109/IPDPS.2012.116 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:39:33Z date_updated: 2018-03-15T08:39:33Z file_id: '1263' file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf file_size: 373131 relation: main_file success: 1 file_date_updated: 2018-03-15T08:39:33Z has_accepted_license: '1' language: - iso: eng page: 1272-1283 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: Self-Organizing Particle Systems type: conference user_id: '14955' year: '2012' ... --- _id: '582' author: - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: Strothmann TF. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn; 2012. apa: Strothmann, T. F. (2012). Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn. bibtex: '@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }' chicago: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012. ieee: T. F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012. mla: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012. short: T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:42Z department: - _id: '79' 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: Universität Paderborn status: public title: Self-Optimizing Binary Search Trees - A Game Theoretic Approach type: mastersthesis user_id: '477' year: '2012' ... --- _id: '583' author: - first_name: Julian full_name: Drücker, Julian last_name: Drücker citation: ama: Drücker J. Revenue-Maximizing Order of Sale in Sequential Auctions. Universität Paderborn; 2012. apa: Drücker, J. (2012). Revenue-maximizing Order of Sale in Sequential Auctions. Universität Paderborn. bibtex: '@book{Drücker_2012, title={Revenue-maximizing Order of Sale in Sequential Auctions}, publisher={Universität Paderborn}, author={Drücker, Julian}, year={2012} }' chicago: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions. Universität Paderborn, 2012. ieee: J. Drücker, Revenue-maximizing Order of Sale in Sequential Auctions. Universität Paderborn, 2012. mla: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions. Universität Paderborn, 2012. short: J. Drücker, Revenue-Maximizing Order of Sale in Sequential Auctions, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:43Z 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: Revenue-maximizing Order of Sale in Sequential Auctions type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '584' author: - first_name: Till full_name: Hohenberger, Till last_name: Hohenberger citation: ama: Hohenberger T. Queuing Latency at Cooperative Base Stations. Universität Paderborn; 2012. apa: Hohenberger, T. (2012). Queuing Latency at Cooperative Base Stations. Universität Paderborn. bibtex: '@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations}, publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }' chicago: Hohenberger, Till. Queuing Latency at Cooperative Base Stations. Universität Paderborn, 2012. ieee: T. Hohenberger, Queuing Latency at Cooperative Base Stations. Universität Paderborn, 2012. mla: Hohenberger, Till. Queuing Latency at Cooperative Base Stations. Universität Paderborn, 2012. short: T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:43Z 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: Queuing Latency at Cooperative Base Stations type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '585' abstract: - lang: eng text: In a cloud-computing scenario where users buy software from software providers and execute it at computing centers, a digital rights management (DRM) system has to be in place to check the software licenses during each software execution. However, the exposure of users to privacy invasion in the presence of DRM systems is problematic.We come up with a concept that unites software providers' and users' demands for a secure and privacy-preserving DRM system for cloud computing. The employment of proxy re-encryption allows for a prevention of profile building (under pseudonym) of users by any party. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic citation: ama: 'Petrlic R. Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS). LNCS. ; 2012:194-211. doi:10.1007/978-3-642-35362-8_16' apa: Petrlic, R. (2012). Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS) (pp. 194–211). https://doi.org/10.1007/978-3-642-35362-8_16 bibtex: '@inproceedings{Petrlic_2012, series={LNCS}, title={Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme}, DOI={10.1007/978-3-642-35362-8_16}, booktitle={Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)}, author={Petrlic, Ronald}, year={2012}, pages={194–211}, collection={LNCS} }' chicago: Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” In Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 194–211. LNCS, 2012. https://doi.org/10.1007/978-3-642-35362-8_16. ieee: R. Petrlic, “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme,” in Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211. mla: Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211, doi:10.1007/978-3-642-35362-8_16. short: 'R. Petrlic, in: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:43Z ddc: - '040' doi: 10.1007/978-3-642-35362-8_16 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:38:58Z date_updated: 2018-03-15T08:38:58Z file_id: '1262' file_name: 585-privacy-drm-cloud-1-css-camera-ready.pdf file_size: 582557 relation: main_file success: 1 file_date_updated: 2018-03-15T08:38:58Z has_accepted_license: '1' page: 194-211 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS) series_title: LNCS status: public title: Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme type: conference user_id: '15504' year: '2012' ... --- _id: '586' abstract: - lang: eng text: FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety. - lang: ger text: FPGAs, System on Chips und eingebettete Systeme sind heutzutage kaum mehr wegzudenken. Sie kombinieren die Rechenleistung von spezialisierter Hardware mit einer Software-ähnlichen Flexibilität. Zur Laufzeit können sie ihre Funktionalität anpassen, indem sie online neue Hardware Module beziehen und deren Funktionalität integrieren. Mit der Leistung wachsen auch die Anforderungen an rekonfigurierbare Hardware. Ihr Einsatz in immer sicherheitskritischeren Szenarien erfordert neue Wege um Sicherheit zu gewährleisten, da ein Versagen der Sicherheit gravierende Folgen mit sich bringt. Neben finanziellen Verlusten sind auch der Verlust von Menschenleben oder Einbußen in der nationalen Sicherheit denkbar. In dieser Arbeit stelle ich das neue und wegweisende Konzept der beweistragenden Hardware vor. Es ist eine Methode zur Verifizierung von Eigenschaften von Hardware Modulen um die Sicherheit der Zielplatformen zur Laufzeit zu garantieren. Der Produzent eines Hardware Moduls liefert, basierend auf den Sicherheitsbestimmungen des Konsumenten, einen Beweis der Sicherheit mit dem Rekonfigurierungsbitstrom. Die aufwendige Berechnung des Beweises steht im Kontrast zu der vergleichsweise unaufwendigen Überprüfung durch den Konsumenten. Ich präsentiere einen Prototypen basierend auf Open Source Werkzeugen und einer eigenen abstrakten FPGA Architektur samt Bitstromformat. Den Nachweis über die Nutzbarkeit von beweistragender Hardware erbringt die Evaluierung des Prototypen zur beispielhaften Anwendung der Sicherung von kombinatorischer und begrenzt sequenzieller Äquivalenz von Referenzmonitor-Modulen zur Speichersicherheit. author: - first_name: Stephanie full_name: Drzevitzky, Stephanie last_name: Drzevitzky citation: ama: 'Drzevitzky S. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn; 2012.' apa: 'Drzevitzky, S. (2012). Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn.' bibtex: '@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky, Stephanie}, year={2012} }' chicago: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' ieee: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' mla: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' short: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:44Z ddc: - '040' department: - _id: '78' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:38:19Z date_updated: 2018-03-15T08:38:19Z file_id: '1261' file_name: 586-Drzevitzky-PhD_01.pdf file_size: 1438436 relation: main_file success: 1 file_date_updated: 2018-03-15T08:38:19Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423 oa: '1' page: '114' project: - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publication_status: published publisher: Universität Paderborn status: public supervisor: - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: 'Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security' type: dissertation user_id: '477' year: '2012' ... --- _id: '587' author: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Andreas full_name: Agne, Andreas last_name: Agne - first_name: Markus full_name: Happe, Markus last_name: Happe - first_name: Enno full_name: Lübbers, Enno last_name: Lübbers citation: ama: Plessl C, Platzner M, Agne A, Happe M, Lübbers E. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine; 2012. apa: Plessl, C., Platzner, M., Agne, A., Happe, M., & Lübbers, E. (2012). Programming models for reconfigurable heterogeneous multi-cores. Awareness Magazine. bibtex: '@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine}, author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}, year={2012} }' chicago: Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno Lübbers. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine, 2012. ieee: C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, Programming models for reconfigurable heterogeneous multi-cores. Awareness Magazine, 2012. mla: Plessl, Christian, et al. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine, 2012. short: C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012. date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:44Z ddc: - '040' department: - _id: '27' - _id: '518' - _id: '78' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:37:02Z date_updated: 2018-03-15T08:37:02Z file_id: '1260' file_name: 587-2012_plessl_awareness_magazine.pdf file_size: 353057 relation: main_file success: 1 file_date_updated: 2018-03-15T08:37:02Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Awareness Magazine status: public title: Programming models for reconfigurable heterogeneous multi-cores type: misc user_id: '398' year: '2012' ... --- _id: '588' abstract: - lang: eng text: We come up with a digital rights management (DRM) concept for cloud computing and show how license management for software within the cloud can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and their validity is checked before execution. We employ a software re-encryption scheme so that computing centers which execute users’ software are not able to build user profiles—not even under pseudonym—of their users. We combine secret sharing and homomorphic encryption. We make sure that malicious users are unable to relay software to others. DRM constitutes an incentive for software providers to take part in a future cloud computing scenario.We make this scenario more attractive for users by preserving their privacy. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic - first_name: Christoph full_name: Sorge, Christoph last_name: Sorge citation: ama: 'Petrlic R, Sorge C. Privacy-Preserving DRM for Cloud Computing. In: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA). ; 2012:1286-1291. doi:10.1109/WAINA.2012.92' apa: Petrlic, R., & Sorge, C. (2012). Privacy-Preserving DRM for Cloud Computing. In Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA) (pp. 1286–1291). https://doi.org/10.1109/WAINA.2012.92 bibtex: '@inproceedings{Petrlic_Sorge_2012, title={Privacy-Preserving DRM for Cloud Computing}, DOI={10.1109/WAINA.2012.92}, booktitle={Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)}, author={Petrlic, Ronald and Sorge, Christoph}, year={2012}, pages={1286–1291} }' chicago: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” In Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 1286–91, 2012. https://doi.org/10.1109/WAINA.2012.92. ieee: R. Petrlic and C. Sorge, “Privacy-Preserving DRM for Cloud Computing,” in Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291. mla: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–91, doi:10.1109/WAINA.2012.92. short: 'R. Petrlic, C. Sorge, in: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:45Z ddc: - '040' doi: 10.1109/WAINA.2012.92 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:36:16Z date_updated: 2018-03-15T08:36:16Z file_id: '1259' file_name: 588-drm0-published_01.pdf file_size: 194323 relation: main_file success: 1 file_date_updated: 2018-03-15T08:36:16Z has_accepted_license: '1' page: 1286-1291 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA) status: public title: Privacy-Preserving DRM for Cloud Computing type: conference user_id: '15504' year: '2012' ... --- _id: '589' abstract: - lang: eng text: We present a privacy-preserving DRM scheme for a (future) cloud computing software market. In such a market, applications are packed into virtual machines (VMs) by software providers and the VMs can be executed at any computing center within the cloud. We propose the introduction of a software TPM as a container for VM-specific keys within the VM that moves around with the VM within the cloud. The software TPM is coupled to a virtual TPM at a computing center to constitute the root of trust for a local DRM enforcement system within the VM that checks the license before each application execution. This allows flexible price models, e.g. execute at most n timeslike models. Users have proof that their personally identifiable information, stored and processed within the VM at a computing center, cannot be obtained by the computing center. A feature of our solution is that neither software provider nor computing center are able to build usage profiles of the software executions. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic citation: ama: 'Petrlic R. Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). ; 2012:958-963. doi:10.1109/TrustCom.2012.225' apa: Petrlic, R. (2012). Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) (pp. 958–963). https://doi.org/10.1109/TrustCom.2012.225 bibtex: '@inproceedings{Petrlic_2012, title={Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment}, DOI={10.1109/TrustCom.2012.225}, booktitle={Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)}, author={Petrlic, Ronald}, year={2012}, pages={958–963} }' chicago: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” In Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 958–63, 2012. https://doi.org/10.1109/TrustCom.2012.225. ieee: R. Petrlic, “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment,” in Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–963. mla: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–63, doi:10.1109/TrustCom.2012.225. short: 'R. Petrlic, in: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–963.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:45Z ddc: - '040' doi: 10.1109/TrustCom.2012.225 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:40:15Z date_updated: 2018-03-15T08:40:15Z file_id: '1264' file_name: 589-published-trustcom.pdf file_size: 179985 relation: main_file success: 1 file_date_updated: 2018-03-15T08:40:15Z has_accepted_license: '1' language: - iso: eng page: 958-963 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) status: public title: Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment type: conference user_id: '477' year: '2012' ... --- _id: '590' abstract: - lang: eng text: 'Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”.' author: - first_name: Daniel full_name: Wonisch, Daniel last_name: Wonisch - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:332-347. doi:10.1007/978-3-642-34281-3_24' apa: Wonisch, D., & Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction Memoization. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 332–347). https://doi.org/10.1007/978-3-642-34281-3_24 bibtex: '@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis with Block-Abstraction Memoization}, DOI={10.1007/978-3-642-34281-3_24}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347}, collection={LNCS} }' chicago: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 332–47. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_24. ieee: D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347. mla: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–47, doi:10.1007/978-3-642-34281-3_24. short: 'D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:46Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-642-34281-3_24 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:33:56Z date_updated: 2018-03-15T08:33:56Z file_id: '1258' file_name: 590-WonischWehrheim2012.pdf file_size: 320901 relation: main_file success: 1 file_date_updated: 2018-03-15T08:33:56Z has_accepted_license: '1' language: - iso: eng page: 332-347 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) series_title: LNCS status: public title: Predicate Analysis with Block-Abstraction Memoization type: conference user_id: '477' year: '2012' ... --- _id: '592' author: - first_name: Aydin full_name: Celik, Aydin last_name: Celik citation: ama: 'Celik A. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn; 2012.' apa: 'Celik, A. (2012). Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn.' bibtex: '@book{Celik_2012, title={Penny Auctions: Design und Strategisches Verhalten}, publisher={Universität Paderborn}, author={Celik, Aydin}, year={2012} }' chicago: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' ieee: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' mla: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' short: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:47Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: 'Penny Auctions: Design und Strategisches Verhalten' type: mastersthesis user_id: '477' year: '2012' ... --- _id: '593' author: - first_name: Tobias full_name: Rojahn, Tobias last_name: Rojahn citation: ama: Rojahn T. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn; 2012. apa: Rojahn, T. (2012). Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn. bibtex: '@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias}, year={2012} }' chicago: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. ieee: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. mla: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. short: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:47Z department: - _id: '75' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '594' author: - first_name: Timo full_name: Klerx, Timo last_name: Klerx citation: ama: Klerx T. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn; 2012. apa: Klerx, T. (2012). Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn. bibtex: '@book{Klerx_2012, title={Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}, publisher={Universität Paderborn}, author={Klerx, Timo}, year={2012} }' chicago: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. ieee: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. mla: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. short: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:48Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen type: mastersthesis user_id: '477' year: '2012' ... --- _id: '595' author: - first_name: Frederik full_name: Mallmann Trenn, Frederik last_name: Mallmann Trenn citation: ama: Mallmann Trenn F. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn; 2012. apa: Mallmann Trenn, F. (2012). On scheduling with multi-core and multi-speed processors using power down. Universität Paderborn. bibtex: '@book{Mallmann Trenn_2012, title={On scheduling with multi-core and multi-speed processors using power down}, publisher={Universität Paderborn}, author={Mallmann Trenn, Frederik}, year={2012} }' chicago: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn, 2012. ieee: F. Mallmann Trenn, On scheduling with multi-core and multi-speed processors using power down. Universität Paderborn, 2012. mla: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn, 2012. short: F. Mallmann Trenn, On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: On scheduling with multi-core and multi-speed processors using power down type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '596' abstract: - lang: eng text: To meet quality-of-service requirements in changing environments, modern software systems adapt themselves. The structure, and correspondingly the behavior, of these systems undergoes continuous change. Model-driven performance engineering, however, assumes static system structures, behavior, and deployment. Hence, self-adaptive systems pose new challenges to model-driven performance engineering. There are a few surveys on self-adaptive systems, performance engineering, and the combination of both in the literature. In contrast to existing work, here we focus on model-driven performance analysis approaches. Based on a systematic literature review, we present a classication, identify open issues, and outline further research. author: - first_name: Matthias full_name: Becker, Matthias last_name: Becker - first_name: Markus full_name: Luckey, Markus last_name: Luckey - first_name: Steffen full_name: Becker, Steffen last_name: Becker citation: ama: 'Becker M, Luckey M, Becker S. Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12). ; 2012:117-122. doi:10.1145/2304696.2304716' apa: 'Becker, M., Luckey, M., & Becker, S. (2012). Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12) (pp. 117–122). https://doi.org/10.1145/2304696.2304716' bibtex: '@inproceedings{Becker_Luckey_Becker_2012, title={Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey}, DOI={10.1145/2304696.2304716}, booktitle={Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)}, author={Becker, Matthias and Luckey, Markus and Becker, Steffen}, year={2012}, pages={117–122} }' chicago: 'Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” In Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 117–22, 2012. https://doi.org/10.1145/2304696.2304716.' ieee: 'M. Becker, M. Luckey, and S. Becker, “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey,” in Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–122.' mla: 'Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–22, doi:10.1145/2304696.2304716.' short: 'M. Becker, M. Luckey, S. Becker, in: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–122.' date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z ddc: - '040' doi: 10.1145/2304696.2304716 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:23:31Z date_updated: 2018-03-15T08:23:31Z file_id: '1256' file_name: 596-qosa25s-becker.pdf file_size: 141651 relation: main_file success: 1 file_date_updated: 2018-03-15T08:23:31Z has_accepted_license: '1' page: 117-122 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12) status: public title: 'Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey' type: conference user_id: '15504' year: '2012' ... --- _id: '597' abstract: - lang: eng text: 'We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer players where mixed equilibria always exist [15, 16], a mixed equilibrium for such games, called a V -equilibrium, may fail to exist, even though pure equilibria (if any) transfer over. What is the impact of such valuations on the existence, structure and complexity of mixed equilibria? We address this fundamental question for a particular concave valuation: expectation plus variance, denoted as RA, which stands for risk-averse; so, variance enters as a measure of risk and it is used as an additive adjustment to expectation. We obtain the following results about RA-equilibria:- A collection of general structural properties of RA-equilibria connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable equilibrium properties.- A second collection of (i) existence, (ii) equivalence and separation (with respect to E-equilibria), and (iii) characterization results for RA-equilibria in the new class of player-specific scheduling games. Using examples, we provide the first demonstration that going from E to RA may as well create new mixed (RA-)equilibria.- A purification technique to transform a player-specific scheduling game on identical links into a player-specific scheduling game so that all non-pure RA-equilibria are eliminated while new pure equilibria cannot be created; so, a particular game on two identical links yields one with no RA-equilibrium. As a by-product, the first-completeness result for the computation of RA-equilibria follows.' author: - first_name: Marios full_name: Mavronicolas, Marios last_name: Mavronicolas - first_name: Burkhard full_name: Monien, Burkhard last_name: Monien citation: ama: 'Mavronicolas M, Monien B. Minimizing Expectation Plus Variance. In: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2012:239-250. doi:10.1007/978-3-642-33996-7_21' apa: Mavronicolas, M., & Monien, B. (2012). Minimizing Expectation Plus Variance. In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) (pp. 239–250). https://doi.org/10.1007/978-3-642-33996-7_21 bibtex: '@inproceedings{Mavronicolas_Monien_2012, series={LNCS}, title={Minimizing Expectation Plus Variance}, DOI={10.1007/978-3-642-33996-7_21}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2012}, pages={239–250}, collection={LNCS} }' chicago: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 239–50. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_21. ieee: M. Mavronicolas and B. Monien, “Minimizing Expectation Plus Variance,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250. mla: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–50, doi:10.1007/978-3-642-33996-7_21. short: 'M. Mavronicolas, B. Monien, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.' date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z ddc: - '040' doi: 10.1007/978-3-642-33996-7_21 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:20:53Z date_updated: 2018-03-15T08:20:53Z file_id: '1254' file_name: 597-newtocs_01.pdf file_size: 345826 relation: main_file success: 1 file_date_updated: 2018-03-15T08:20:53Z has_accepted_license: '1' page: 239-250 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) series_title: LNCS status: public title: Minimizing Expectation Plus Variance type: conference user_id: '15504' year: '2012' ... --- _id: '598' author: - first_name: Fuad full_name: Mammadov, Fuad last_name: Mammadov citation: ama: Mammadov F. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn; 2012. apa: Mammadov, F. (2012). Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn. bibtex: '@book{Mammadov_2012, title={Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen}, publisher={Universität Paderborn}, author={Mammadov, Fuad}, year={2012} }' chicago: Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012. ieee: F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012. mla: Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012. short: F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '599' author: - first_name: Xenia full_name: Löwen, Xenia last_name: Löwen citation: ama: 'Löwen X. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn; 2012.' apa: 'Löwen, X. (2012). Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn.' bibtex: '@book{Löwen_2012, title={Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium}, publisher={Universität Paderborn}, author={Löwen, Xenia}, year={2012} }' chicago: 'Löwen, Xenia. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.' ieee: 'X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.' mla: 'Löwen, Xenia. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.' short: 'X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:49Z project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: 'Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium' type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '600' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord citation: ama: Feldkord B. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn; 2012. apa: Feldkord, B. (2012). Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn. bibtex: '@book{Feldkord_2012, title={Lokale Swaps und überholte Informationen in Basic Network Creation Games}, publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2012} }' chicago: Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012. ieee: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012. mla: Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012. short: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:49Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Lokale Swaps und überholte Informationen in Basic Network Creation Games type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '601' abstract: - lang: eng text: Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren hergeleitet. author: - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes citation: ama: Kempkes B. Local Strategies for Robot Formation Problems. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012. apa: Kempkes, B. (2012). Local strategies for robot formation problems (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local strategies for robot formation problems}, volume={302}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes, Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Kempkes, Barbara. Local Strategies for Robot Formation Problems. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. ieee: B. Kempkes, Local strategies for robot formation problems, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. mla: Kempkes, Barbara. Local Strategies for Robot Formation Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. short: B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:50Z ddc: - '040' department: - _id: '63' - _id: '26' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:16:44Z date_updated: 2018-03-15T08:16:44Z file_id: '1252' file_name: 601-Kempkes-PhD.pdf file_size: 3805310 relation: main_file success: 1 file_date_updated: 2018-03-15T08:16:44Z has_accepted_license: '1' intvolume: ' 302' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication_identifier: isbn: - 978-3-942647-21-2 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local strategies for robot formation problems type: dissertation user_id: '5786' volume: 302 year: '2012' ... --- _id: '602' abstract: - lang: eng text: 'We study the consequences of dropping the perfect competition assumption in a standard infinite horizon model with infinitely-lived traders and real collateralized assets, together with one additional ingredient: information among players is asymmetric and monitoring is incomplete. The key insight is that trading assets is not only a way to hedge oneself against uncertainty and to smooth consumption across time: It also enables learning information. Conversely, defaulting now becomes strategic: Certain players may manipulate prices so as to provoke a default in order to prevent their opponents from learning. We focus on learning equilibria, at the end of which no player has incorrect beliefs — not because those players with heterogeneous beliefs were eliminated from the market (although default is possible at equilibrium) but because they have taken time to update their prior belief. We prove a partial Folk theorem à la Wiseman (2011) of the following form: For any function that maps each state of the world to a sequence of feasible and strongly individually rational allocations, and for any degree of precision, there is a perfect Bayesian equilibrium in which patient players learn the realized state with this degree of precision and achieve a payoff close to the one specified for each state.' author: - first_name: Sonja full_name: Brangewitz, Sonja last_name: Brangewitz citation: ama: Brangewitz S. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn; 2012. apa: Brangewitz, S. (2012). Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn. bibtex: '@book{Brangewitz_2012, title={Learning by Trading in Infinite Horizon Strategic Market Games with Default}, publisher={Universität Paderborn}, author={Brangewitz, Sonja}, year={2012} }' chicago: Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012. ieee: S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012. mla: Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012. short: S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:51Z ddc: - '040' department: - _id: '205' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:16:08Z date_updated: 2018-03-15T08:16:08Z file_id: '1251' file_name: 602-12062_01.pdf file_size: 1284802 relation: main_file success: 1 file_date_updated: 2018-03-15T08:16:08Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Learning by Trading in Infinite Horizon Strategic Market Games with Default type: report user_id: '477' year: '2012' ... --- _id: '603' abstract: - lang: eng text: 'Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths.' author: - first_name: Philip full_name: Wette, Philip last_name: Wette - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: Wette P, Karl H. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn; 2012. apa: Wette, P., & Karl, H. (2012). Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn. bibtex: '@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }' chicago: Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012. ieee: P. Wette and H. Karl, Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn, 2012. mla: Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012. short: P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:51Z ddc: - '000' department: - _id: '75' file: - access_level: closed content_type: application/pdf creator: hkarl date_created: 2018-03-09T09:57:26Z date_updated: 2018-03-09T09:57:26Z file_id: '1205' file_name: underlayMod2.pdf file_size: 717326 relation: main_file success: 1 file_date_updated: 2018-03-09T09:57:26Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios type: report user_id: '126' year: '2012' ... --- _id: '604' author: - first_name: Henrik full_name: Seier, Henrik last_name: Seier citation: ama: Seier H. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn; 2012. apa: Seier, H. (2012). Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn. bibtex: '@book{Seier_2012, title={Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen}, publisher={Universität Paderborn}, author={Seier, Henrik}, year={2012} }' chicago: Seier, Henrik. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn, 2012. ieee: H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn, 2012. mla: Seier, Henrik. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn, 2012. short: H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:51Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen type: mastersthesis user_id: '477' year: '2012' ... --- _id: '605' author: - first_name: Florian full_name: Isenberg, Florian last_name: Isenberg citation: ama: Isenberg F. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn; 2012. apa: Isenberg, F. (2012). Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn. bibtex: '@book{Isenberg_2012, title={Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung}, publisher={Universität Paderborn}, author={Isenberg, Florian}, year={2012} }' chicago: Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012. ieee: F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012. mla: Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012. short: F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:51Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung type: mastersthesis user_id: '477' year: '2012' ... --- _id: '6055' author: - first_name: Alexander full_name: Mehler, Alexander last_name: Mehler - first_name: Andy full_name: Lücking, Andy last_name: Lücking - first_name: Peter full_name: Menke, Peter id: '59649' last_name: Menke citation: ama: Mehler A, Lücking A, Menke P. Assessing cognitive alignment in different types of dialog by means of a network model. Neural Networks. 2012;32:159-164. doi:10.1016/j.neunet.2012.02.013 apa: Mehler, A., Lücking, A., & Menke, P. (2012). Assessing cognitive alignment in different types of dialog by means of a network model. Neural Networks, 32, 159–164. https://doi.org/10.1016/j.neunet.2012.02.013 bibtex: '@article{Mehler_Lücking_Menke_2012, title={Assessing cognitive alignment in different types of dialog by means of a network model}, volume={32}, DOI={10.1016/j.neunet.2012.02.013}, journal={Neural Networks}, publisher={Elsevier BV}, author={Mehler, Alexander and Lücking, Andy and Menke, Peter}, year={2012}, pages={159–164} }' chicago: 'Mehler, Alexander, Andy Lücking, and Peter Menke. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” Neural Networks 32 (2012): 159–64. https://doi.org/10.1016/j.neunet.2012.02.013.' ieee: A. Mehler, A. Lücking, and P. Menke, “Assessing cognitive alignment in different types of dialog by means of a network model,” Neural Networks, vol. 32, pp. 159–164, 2012. mla: Mehler, Alexander, et al. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” Neural Networks, vol. 32, Elsevier BV, 2012, pp. 159–64, doi:10.1016/j.neunet.2012.02.013. short: A. Mehler, A. Lücking, P. Menke, Neural Networks 32 (2012) 159–164. date_created: 2018-12-07T15:17:39Z date_updated: 2022-01-06T07:02:51Z department: - _id: '115' doi: 10.1016/j.neunet.2012.02.013 extern: '1' intvolume: ' 32' language: - iso: eng page: 159-164 publication: Neural Networks publication_identifier: issn: - 0893-6080 publication_status: published publisher: Elsevier BV status: public title: Assessing cognitive alignment in different types of dialog by means of a network model type: journal_article user_id: '59649' volume: 32 year: '2012' ... --- _id: '6057' author: - first_name: Peter full_name: Menke, Peter id: '59649' last_name: Menke citation: ama: 'Menke P. Evaluation of Technical Communication. In: Handbook of Technical Communication. Vol 8. Handbooks of Applied Linguistics. de Gruyter; 2012:285–314.' apa: Menke, P. (2012). Evaluation of Technical Communication. In Handbook of Technical Communication (Vol. 8, pp. 285–314). de Gruyter. bibtex: '@inbook{Menke_2012, series={Handbooks of Applied Linguistics}, title={Evaluation of Technical Communication}, volume={8}, booktitle={Handbook of Technical Communication}, publisher={de Gruyter}, author={Menke, Peter}, year={2012}, pages={285–314}, collection={Handbooks of Applied Linguistics} }' chicago: Menke, Peter. “Evaluation of Technical Communication.” In Handbook of Technical Communication, 8:285–314. Handbooks of Applied Linguistics. de Gruyter, 2012. ieee: P. Menke, “Evaluation of Technical Communication,” in Handbook of Technical Communication, vol. 8, de Gruyter, 2012, pp. 285–314. mla: Menke, Peter. “Evaluation of Technical Communication.” Handbook of Technical Communication, vol. 8, de Gruyter, 2012, pp. 285–314. short: 'P. Menke, in: Handbook of Technical Communication, de Gruyter, 2012, pp. 285–314.' date_created: 2018-12-07T15:22:25Z date_updated: 2022-01-06T07:02:51Z department: - _id: '115' extern: '1' intvolume: ' 8' language: - iso: eng page: 285–314 publication: Handbook of Technical Communication publication_identifier: isbn: - 978-3-11-018834-9 publication_status: published publisher: de Gruyter series_title: Handbooks of Applied Linguistics status: public title: Evaluation of Technical Communication type: book_chapter user_id: '59649' volume: 8 year: '2012' ... --- _id: '606' author: - first_name: Nils full_name: Löken, Nils id: '13703' last_name: Löken citation: ama: Löken N. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn; 2012. apa: Löken, N. (2012). Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn. bibtex: '@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }' chicago: Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012. ieee: N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012. mla: Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012. short: N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:51Z department: - _id: '64' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas type: bachelorsthesis user_id: '13703' year: '2012' ... --- _id: '607' author: - first_name: Thomas full_name: Haarhoff, Thomas last_name: Haarhoff citation: ama: Haarhoff T. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn; 2012. apa: Haarhoff, T. (2012). Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn. bibtex: '@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn}, author={Haarhoff, Thomas}, year={2012} }' chicago: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012. ieee: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012. mla: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012. short: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:51Z department: - _id: '64' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2 type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '608' abstract: - lang: eng text: 'Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement.' author: - first_name: Nils full_name: Timm, Nils last_name: Timm - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: Mike full_name: Czech, Mike last_name: Czech citation: ama: 'Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent Systems. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:348-363. doi:10.1007/978-3-642-34281-3_25' apa: Timm, N., Wehrheim, H., & Czech, M. (2012). Heuristic-Guided Abstraction Refinement for Concurrent Systems. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 348–363). https://doi.org/10.1007/978-3-642-34281-3_25 bibtex: '@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided Abstraction Refinement for Concurrent Systems}, DOI={10.1007/978-3-642-34281-3_25}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012}, pages={348–363}, collection={LNCS} }' chicago: Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 348–63. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_25. ieee: N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement for Concurrent Systems,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363. mla: Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–63, doi:10.1007/978-3-642-34281-3_25. short: 'N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.' date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:52Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-642-34281-3_25 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:15:33Z date_updated: 2018-03-15T08:15:33Z file_id: '1250' file_name: 608-Timm2013-0main.pdf file_size: 396337 relation: main_file success: 1 file_date_updated: 2018-03-15T08:15:33Z has_accepted_license: '1' language: - iso: eng page: 348-363 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) series_title: LNCS status: public title: Heuristic-Guided Abstraction Refinement for Concurrent Systems type: conference user_id: '477' year: '2012' ... --- _id: '610' author: - first_name: Mario full_name: Mohr, Mario last_name: Mohr citation: ama: Mohr M. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn; 2012. apa: Mohr, M. (2012). Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis. Universität Paderborn. bibtex: '@book{Mohr_2012, title={Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis}, publisher={Universität Paderborn}, author={Mohr, Mario}, year={2012} }' chicago: Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn, 2012. ieee: M. Mohr, Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis. Universität Paderborn, 2012. mla: Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn, 2012. short: M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:52Z ddc: - '040' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:13:40Z date_updated: 2018-03-15T08:13:40Z file_id: '1248' file_name: 610-MA_Mohr_2012_final.pdf file_size: 1270467 relation: main_file success: 1 file_date_updated: 2018-03-15T08:13:40Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '6102' author: - first_name: Holger full_name: Steinmetz, Holger id: '43261' last_name: Steinmetz - first_name: C full_name: Schwens, C last_name: Schwens - first_name: M full_name: Wehner, M last_name: Wehner - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Steinmetz H, Schwens C, Wehner M, Kabst R. Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. PERSONALquartely. 2012;64(1):34-39.' apa: 'Steinmetz, H., Schwens, C., Wehner, M., & Kabst, R. (2012). Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. PERSONALquartely, 64(1), 34–39.' bibtex: '@article{Steinmetz_Schwens_Wehner_Kabst_2012, title={Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.}, volume={64}, number={1}, journal={PERSONALquartely}, author={Steinmetz, Holger and Schwens, C and Wehner, M and Kabst, Rüdiger}, year={2012}, pages={34–39} }' chicago: 'Steinmetz, Holger, C Schwens, M Wehner, and Rüdiger Kabst. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” PERSONALquartely 64, no. 1 (2012): 34–39.' ieee: 'H. Steinmetz, C. Schwens, M. Wehner, and R. Kabst, “Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.,” PERSONALquartely, vol. 64, no. 1, pp. 34–39, 2012.' mla: 'Steinmetz, Holger, et al. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” PERSONALquartely, vol. 64, no. 1, 2012, pp. 34–39.' short: H. Steinmetz, C. Schwens, M. Wehner, R. Kabst, PERSONALquartely 64 (2012) 34–39. date_created: 2018-12-10T11:09:13Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' intvolume: ' 64' issue: '1' language: - iso: eng page: 34-39 publication: PERSONALquartely status: public title: 'Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.' type: journal_article user_id: '46632' volume: 64 year: '2012' ... --- _id: '6103' author: - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst - first_name: M full_name: Baum, M last_name: Baum citation: ama: 'Kabst R, Baum M. Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. PERSONALquartely. 2012;64(3):3.' apa: 'Kabst, R., & Baum, M. (2012). Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. PERSONALquartely, 64(3), 3.' bibtex: '@article{Kabst_Baum_2012, title={Editorial: Employer Branding: Strategie, Instrumente, Umsetzung}, volume={64}, number={3}, journal={PERSONALquartely}, author={Kabst, Rüdiger and Baum, M}, year={2012}, pages={3} }' chicago: 'Kabst, Rüdiger, and M Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” PERSONALquartely 64, no. 3 (2012): 3.' ieee: 'R. Kabst and M. Baum, “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung,” PERSONALquartely, vol. 64, no. 3, p. 3, 2012.' mla: 'Kabst, Rüdiger, and M. Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” PERSONALquartely, vol. 64, no. 3, 2012, p. 3.' short: R. Kabst, M. Baum, PERSONALquartely 64 (2012) 3. date_created: 2018-12-10T11:39:27Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' intvolume: ' 64' issue: '3' language: - iso: eng page: '3' publication: PERSONALquartely status: public title: 'Editorial: Employer Branding: Strategie, Instrumente, Umsetzung' type: journal_article user_id: '46632' volume: 64 year: '2012' ... --- _id: '611' author: - first_name: Hendrik full_name: Hangmann, Hendrik last_name: Hangmann citation: ama: Hangmann H. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn; 2012. apa: Hangmann, H. (2012). Generating Adjustable Temperature Gradients on modern FPGAs. Universität Paderborn. bibtex: '@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik}, year={2012} }' chicago: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn, 2012. ieee: H. Hangmann, Generating Adjustable Temperature Gradients on modern FPGAs. Universität Paderborn, 2012. mla: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn, 2012. short: H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:53Z project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Generating Adjustable Temperature Gradients on modern FPGAs type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '613' author: - first_name: Stefan full_name: Wohlfarth, Stefan last_name: Wohlfarth citation: ama: Wohlfarth S. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn; 2012. apa: Wohlfarth, S. (2012). Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn. bibtex: '@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens}, publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }' chicago: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012. ieee: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012. mla: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012. short: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:53Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens type: mastersthesis user_id: '477' year: '2012' ... --- _id: '6138' author: - first_name: W full_name: Weber, W last_name: Weber - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: Weber W, Kabst R. Einführung in Die Betriebswirtschaftslehre. 8th ed. Wiesbaden; 2012. apa: Weber, W., & Kabst, R. (2012). Einführung in die Betriebswirtschaftslehre (8th ed.). Wiesbaden. bibtex: '@book{Weber_Kabst_2012, place={Wiesbaden}, edition={8}, title={Einführung in die Betriebswirtschaftslehre}, author={Weber, W and Kabst, Rüdiger}, year={2012} }' chicago: Weber, W, and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre. 8th ed. Wiesbaden, 2012. ieee: W. Weber and R. Kabst, Einführung in die Betriebswirtschaftslehre, 8th ed. Wiesbaden, 2012. mla: Weber, W., and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre. 8th ed., 2012. short: W. Weber, R. Kabst, Einführung in Die Betriebswirtschaftslehre, 8th ed., Wiesbaden, 2012. date_created: 2018-12-11T10:21:09Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' edition: '8' language: - iso: eng place: Wiesbaden publication_identifier: isbn: - 978-3-8349-1994-6 status: public title: Einführung in die Betriebswirtschaftslehre type: book user_id: '46632' year: '2012' ... --- _id: '614' author: - first_name: Sebastian full_name: Lehrig, Sebastian last_name: Lehrig citation: ama: Lehrig S. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn; 2012. apa: Lehrig, S. (2012). Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn. bibtex: '@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen}, publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }' chicago: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012. ieee: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012. mla: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012. short: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:53Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Empirischer, quantitativer Vergleich von Modelltransformationssprachen type: mastersthesis user_id: '477' year: '2012' ... --- _id: '6148' author: - first_name: M full_name: Baum, M last_name: Baum - first_name: C full_name: Schwens, C last_name: Schwens - first_name: R full_name: Kabst, R last_name: Kabst citation: ama: 'Baum M, Schwens C, Kabst R. Determinants of Different Types of Born Globals. In: Gabrielsson M, Kirpalani M, eds. Handbook of Research on Born Globals. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.; 2012:36-45.' apa: 'Baum, M., Schwens, C., & Kabst, R. (2012). Determinants of Different Types of Born Globals. In M. Gabrielsson & M. Kirpalani (Eds.), Handbook of Research on Born Globals (pp. 36–45). Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.' bibtex: '@inbook{Baum_Schwens_Kabst_2012, place={Cheltenham Glos/Northampton}, title={Determinants of Different Types of Born Globals.}, booktitle={Handbook of Research on Born Globals}, publisher={Edward Elgar Publishing Ltd.}, author={Baum, M and Schwens, C and Kabst, R}, editor={Gabrielsson, M and Kirpalani, MEditors}, year={2012}, pages={36–45} }' chicago: 'Baum, M, C Schwens, and R Kabst. “Determinants of Different Types of Born Globals.” In Handbook of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, 36–45. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012.' ieee: 'M. Baum, C. Schwens, and R. Kabst, “Determinants of Different Types of Born Globals.,” in Handbook of Research on Born Globals, M. Gabrielsson and M. Kirpalani, Eds. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012, pp. 36–45.' mla: Baum, M., et al. “Determinants of Different Types of Born Globals.” Handbook of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, Edward Elgar Publishing Ltd., 2012, pp. 36–45. short: 'M. Baum, C. Schwens, R. Kabst, in: M. Gabrielsson, M. Kirpalani (Eds.), Handbook of Research on Born Globals, Edward Elgar Publishing Ltd., Cheltenham Glos/Northampton, 2012, pp. 36–45.' date_created: 2018-12-11T11:02:56Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' editor: - first_name: M full_name: Gabrielsson, M last_name: Gabrielsson - first_name: M full_name: Kirpalani, M last_name: Kirpalani language: - iso: eng page: 36-45 place: Cheltenham Glos/Northampton publication: Handbook of Research on Born Globals publisher: Edward Elgar Publishing Ltd. status: public title: Determinants of Different Types of Born Globals. type: book_chapter user_id: '46632' year: '2012' ... --- _id: '6149' author: - first_name: R full_name: Isidor, R last_name: Isidor - first_name: C full_name: Schwens, C last_name: Schwens - first_name: R full_name: Kabst, R last_name: Kabst citation: ama: 'Isidor R, Schwens C, Kabst R. Die Messung von Joint-Venture Erfolg. In: Zentes J, ed. Markteintrittsstrategien - Dynamik Und Komplexität. ; 2012:193-205.' apa: Isidor, R., Schwens, C., & Kabst, R. (2012). Die Messung von Joint-Venture Erfolg. In J. Zentes (Ed.), Markteintrittsstrategien - Dynamik und Komplexität (pp. 193–205). bibtex: '@inbook{Isidor_Schwens_Kabst_2012, title={Die Messung von Joint-Venture Erfolg}, booktitle={Markteintrittsstrategien - Dynamik und Komplexität}, author={Isidor, R and Schwens, C and Kabst, R}, editor={Zentes, JEditor}, year={2012}, pages={193–205} }' chicago: Isidor, R, C Schwens, and R Kabst. “Die Messung von Joint-Venture Erfolg.” In Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes, 193–205, 2012. ieee: R. Isidor, C. Schwens, and R. Kabst, “Die Messung von Joint-Venture Erfolg,” in Markteintrittsstrategien - Dynamik und Komplexität, J. Zentes, Ed. 2012, pp. 193–205. mla: Isidor, R., et al. “Die Messung von Joint-Venture Erfolg.” Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes, 2012, pp. 193–205. short: 'R. Isidor, C. Schwens, R. Kabst, in: J. Zentes (Ed.), Markteintrittsstrategien - Dynamik Und Komplexität, 2012, pp. 193–205.' date_created: 2018-12-11T11:06:03Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' editor: - first_name: J full_name: Zentes, J last_name: Zentes language: - iso: eng page: 193-205 publication: Markteintrittsstrategien - Dynamik und Komplexität publication_identifier: isbn: - 978-3-8349-3503-8 status: public title: Die Messung von Joint-Venture Erfolg type: book_chapter user_id: '46632' year: '2012' ... --- _id: '616' author: - first_name: Sven full_name: Kluczniok, Sven last_name: Kluczniok citation: ama: Kluczniok S. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn; 2012. apa: Kluczniok, S. (2012). Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn. bibtex: '@book{Kluczniok_2012, title={Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Kluczniok, Sven}, year={2012} }' chicago: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012. ieee: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012. mla: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012. short: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:54Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '617' abstract: - lang: eng text: In this paper, a color based feature extraction and classification approach for image processing in embedded systems in presented. The algorithms and data structures developed for this approach pay particular attention to reduce memory consumption and computation power of the entire image processing, since embedded systems usually impose strong restrictions regarding those resources. The feature extraction is realized in terms of an image segmentation algorithm. The criteria of homogeneity for merging pixels and regions is provided by the color classification mechanism, which incorporates appropriate methods for defining, representing and accessing subspaces in the working color space. By doing so, pixels and regions with color values that belong to the same color class can be merged. Furthermore, pixels with redundant color values that do not belong to any pre-defined color class can be completely discarded in order to minimize computational effort. Subsequently, the extracted regions are converted to a more convenient feature representation in terms of statistical moments up to and including second order. For evaluation, the whole image processing approach is applied to a mobile representative of embedded systems within the scope of a simple real-world scenario. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Bernd full_name: Kleinjohann, Bernd last_name: Kleinjohann - first_name: Elisabeth full_name: Kleinjohann, Elisabeth id: '15588' last_name: Kleinjohann - first_name: Maarten full_name: Bieshaar, Maarten last_name: Bieshaar citation: ama: 'Jungmann A, Kleinjohann B, Kleinjohann E, Bieshaar M. Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE). ; 2012:22-29.' apa: Jungmann, A., Kleinjohann, B., Kleinjohann, E., & Bieshaar, M. (2012). Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE) (pp. 22–29). bibtex: '@inproceedings{Jungmann_Kleinjohann_Kleinjohann_Bieshaar_2012, title={Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems}, booktitle={Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)}, author={Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten}, year={2012}, pages={22–29} }' chicago: Jungmann, Alexander, Bernd Kleinjohann, Elisabeth Kleinjohann, and Maarten Bieshaar. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” In Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 22–29, 2012. ieee: A. Jungmann, B. Kleinjohann, E. Kleinjohann, and M. Bieshaar, “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems,” in Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29. mla: Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29. short: 'A. Jungmann, B. Kleinjohann, E. Kleinjohann, M. Bieshaar, in: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29.' date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:55Z ddc: - '040' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:47:50Z date_updated: 2018-03-15T06:47:50Z file_id: '1245' file_name: 617-INTENSIVE2012-Jungmann.pdf file_size: 2787964 relation: main_file success: 1 file_date_updated: 2018-03-15T06:47:50Z has_accepted_license: '1' page: 22-29 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE) related_material: link: - relation: confirmation url: http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031 status: public title: Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems type: conference user_id: '477' year: '2012' ... --- _id: '618' author: - first_name: Sven full_name: Kurras, Sven last_name: Kurras citation: ama: Kurras S. Distributed Sampling of Regular Graphs. Universität Paderborn; 2012. apa: Kurras, S. (2012). Distributed Sampling of Regular Graphs. Universität Paderborn. bibtex: '@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität Paderborn}, author={Kurras, Sven}, year={2012} }' chicago: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn, 2012. ieee: S. Kurras, Distributed Sampling of Regular Graphs. Universität Paderborn, 2012. mla: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn, 2012. short: S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:55Z project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Distributed Sampling of Regular Graphs type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '619' abstract: - lang: eng text: 'Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.' author: - first_name: Philipp full_name: Brandes, Philipp last_name: Brandes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic Networks. In: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS). ICPS. ; 2012:9-14. doi:10.1145/2414815.2414818' apa: Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818 bibtex: '@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed Computing in Fault-Prone Dynamic Networks}, DOI={10.1145/2414815.2414818}, booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm}, year={2012}, pages={9–14}, collection={ICPS} }' chicago: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 9–14. ICPS, 2012. https://doi.org/10.1145/2414815.2414818. ieee: P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14. mla: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818. short: 'P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.' date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:56Z ddc: - '040' department: - _id: '63' doi: 10.1145/2414815.2414818 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:47:15Z date_updated: 2018-03-15T06:47:15Z file_id: '1244' file_name: 619-Brandes_MadHTADDS12_01.pdf file_size: 346044 relation: main_file success: 1 file_date_updated: 2018-03-15T06:47:15Z has_accepted_license: '1' page: 9-14 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) series_title: ICPS status: public title: Distributed Computing in Fault-Prone Dynamic Networks type: conference user_id: '15504' year: '2012' ... --- _id: '620' author: - first_name: Robert full_name: Mittendorf, Robert last_name: Mittendorf citation: ama: Mittendorf R. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn; 2012. apa: Mittendorf, R. (2012). Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn. bibtex: '@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }' chicago: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012. ieee: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012. mla: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012. short: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:56Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Datenschutzgerechtes DRM im Cloud Computing type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '621' author: - first_name: Stephan full_name: Sekula, Stephan last_name: Sekula citation: ama: Sekula S. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn; 2012. apa: Sekula, S. (2012). Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn. bibtex: '@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012} }' chicago: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012. ieee: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012. mla: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012. short: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:57Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '622' abstract: - lang: eng text: Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite. author: - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Christian full_name: Soltenborn, Christian id: '1737' last_name: Soltenborn orcid: 0000-0002-0342-8227 citation: ama: 'Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications. In: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST. ; 2012. doi:10.14279/tuj.eceasst.47.718' apa: Arifulina, S., Engels, G., & Soltenborn, C. (2012). Coverage Criteria for Testing DMM Specifications. In Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). https://doi.org/10.14279/tuj.eceasst.47.718 bibtex: '@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={10.14279/tuj.eceasst.47.718}, booktitle={Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications of the EASST} }' chicago: Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage Criteria for Testing DMM Specifications.” In Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST, 2012. https://doi.org/10.14279/tuj.eceasst.47.718. ieee: S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing DMM Specifications,” in Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012. mla: Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.” Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012, doi:10.14279/tuj.eceasst.47.718. short: 'S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:57Z ddc: - '040' department: - _id: '66' doi: 10.14279/tuj.eceasst.47.718 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:46:40Z date_updated: 2018-03-15T06:46:40Z file_id: '1243' file_name: 622-gtvmt2012-Arifulina_01.pdf file_size: 301602 relation: main_file success: 1 file_date_updated: 2018-03-15T06:46:40Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT) series_title: Electronic Communications of the EASST status: public title: Coverage Criteria for Testing DMM Specifications type: conference user_id: '14955' year: '2012' ... --- _id: '623' abstract: - lang: eng text: 'This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.' author: - first_name: Andrea W. full_name: Richa, Andrea W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: 'Jin ' full_name: 'Zhang, Jin ' last_name: Zhang citation: ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC). ; 2012:291-300. doi:10.1145/2332432.2332488' apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488 bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }' chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488. ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300. mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488. short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z ddc: - '040' department: - _id: '79' doi: 10.1145/2332432.2332488 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:45:25Z date_updated: 2018-03-15T06:45:25Z file_id: '1241' file_name: 623-PODC-2012_01.pdf file_size: 210382 relation: main_file success: 1 file_date_updated: 2018-03-15T06:45:25Z has_accepted_license: '1' page: 291-300 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) status: public title: Competitive and fair throughput for co-existing networks under adversarial interference type: conference user_id: '15504' year: '2012' ... --- _id: '624' author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs citation: ama: Jakobs M-C. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn; 2012. apa: Jakobs, M.-C. (2012). Change and Validity Analysis in Deductive Program Verification. Universität Paderborn. bibtex: '@book{Jakobs_2012, title={Change and Validity Analysis in Deductive Program Verification}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2012} }' chicago: Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012. ieee: M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012. mla: Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012. short: M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Change and Validity Analysis in Deductive Program Verification type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '625' abstract: - lang: eng text: 'This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.' author: - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Bernhard full_name: Häupler, Bernhard last_name: Häupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker citation: ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440. doi:10.1007/978-3-642-33651-5_47' apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47' bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={10.1007/978-3-642-33651-5_47}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }' chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.' ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.' mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.' short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33651-5_47 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:44:09Z date_updated: 2018-03-15T06:44:09Z file_id: '1240' file_name: 625-disc12adjBAshort.pdf file_size: 717284 relation: main_file success: 1 file_date_updated: 2018-03-15T06:44:09Z has_accepted_license: '1' page: 439-440 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 26th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures' type: conference user_id: '15504' year: '2012' ... --- _id: '6250' author: - first_name: Volker full_name: Paelke, Volker last_name: Paelke - first_name: Karsten full_name: Nebe, Karsten last_name: Nebe - first_name: Christian full_name: Geiger, Christian last_name: Geiger - first_name: Florian full_name: Klompmaker, Florian last_name: Klompmaker - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer citation: ama: Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences. 2012;XXXIX-B8:55-60. doi:10.5194/isprsarchives-xxxix-b8-55-2012 apa: Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., & Fischer, H. G. (2012). Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, XXXIX-B8, 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012 bibtex: '@article{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications}, volume={XXXIX-B8}, DOI={10.5194/isprsarchives-xxxix-b8-55-2012}, journal={ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences}, publisher={Copernicus GmbH}, author={Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}, year={2012}, pages={55–60} }' chicago: 'Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012): 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012.' ieee: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications,” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XXXIX-B8, pp. 55–60, 2012. mla: Paelke, Volker, et al. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XXXIX-B8, Copernicus GmbH, 2012, pp. 55–60, doi:10.5194/isprsarchives-xxxix-b8-55-2012. short: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012) 55–60. date_created: 2018-12-18T10:18:13Z date_updated: 2022-01-06T07:02:58Z department: - _id: '66' - _id: '534' - _id: '221' doi: 10.5194/isprsarchives-xxxix-b8-55-2012 language: - iso: eng page: 55-60 publication: ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences publication_identifier: issn: - 1682-1777 publication_status: published publisher: Copernicus GmbH status: public title: Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications type: journal_article user_id: '30457' volume: XXXIX-B8 year: '2012' ... --- _id: '626' abstract: - lang: eng text: The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT). author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45' apa: 'Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45' bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }' chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.' ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.' mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.' short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:02:59Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33651-5_45 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:42:40Z date_updated: 2018-03-15T06:42:40Z file_id: '1239' file_name: 626-Predecessor-Kniesburges_Scheideler.pdf file_size: 184095 relation: main_file success: 1 file_date_updated: 2018-03-15T06:42:40Z has_accepted_license: '1' page: 435-436 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 26th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems' type: conference user_id: '15504' year: '2012' ... --- _id: '627' abstract: - lang: eng text: Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs. author: - first_name: Daniel full_name: Wonisch, Daniel last_name: Wonisch citation: ama: 'Wonisch D. Block Abstraction Memoization for CPAchecker. In: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS. ; 2012:531-533. doi:10.1007/978-3-642-28756-5_41' apa: Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (pp. 531–533). https://doi.org/10.1007/978-3-642-28756-5_41 bibtex: '@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization for CPAchecker}, DOI={10.1007/978-3-642-28756-5_41}, booktitle={Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel}, year={2012}, pages={531–533}, collection={LNCS} }' chicago: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 531–33. LNCS, 2012. https://doi.org/10.1007/978-3-642-28756-5_41. ieee: D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533. mla: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–33, doi:10.1007/978-3-642-28756-5_41. short: 'D. Wonisch, in: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:02:59Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-642-28756-5_41 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:46:05Z date_updated: 2018-03-15T06:46:05Z file_id: '1242' file_name: 627-WonischSV-Comp2012_01.pdf file_size: 184000 relation: main_file success: 1 file_date_updated: 2018-03-15T06:46:05Z has_accepted_license: '1' language: - iso: eng page: 531-533 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) series_title: LNCS status: public title: Block Abstraction Memoization for CPAchecker type: conference user_id: '477' year: '2012' ... --- _id: '6275' author: - first_name: M full_name: Schneid, M last_name: Schneid - first_name: Holger full_name: Steinmetz, Holger id: '43261' last_name: Steinmetz - first_name: R full_name: Isidor, R last_name: Isidor - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Schneid M, Steinmetz H, Isidor R, Kabst R. Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell. In: ; 2012.' apa: 'Schneid, M., Steinmetz, H., Isidor, R., & Kabst, R. (2012). Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell.' bibtex: '@inproceedings{Schneid_Steinmetz_Isidor_Kabst_2012, title={Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell}, author={Schneid, M and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}, year={2012} }' chicago: 'Schneid, M, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell,” 2012.' ieee: 'M. Schneid, H. Steinmetz, R. Isidor, and R. Kabst, “Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell,” 2012.' mla: 'Schneid, M., et al. Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell. 2012.' short: 'M. Schneid, H. Steinmetz, R. Isidor, R. Kabst, in: 2012.' date_created: 2018-12-18T12:42:54Z date_updated: 2022-01-06T07:02:59Z department: - _id: '274' language: - iso: eng status: public title: 'Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell' type: conference user_id: '46632' year: '2012' ... --- _id: '6277' author: - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Kabst R. Endogeneity in the behavioral sciences: An illustration with real data. In: Amsterdam; 2012.' apa: 'Kabst, R. (2012). Endogeneity in the behavioral sciences: An illustration with real data. Amsterdam.' bibtex: '@inproceedings{Kabst_2012, place={Amsterdam}, title={Endogeneity in the behavioral sciences: An illustration with real data}, author={Kabst, Rüdiger}, year={2012} }' chicago: 'Kabst, Rüdiger. “Endogeneity in the Behavioral Sciences: An Illustration with Real Data.” Amsterdam, 2012.' ieee: 'R. Kabst, “Endogeneity in the behavioral sciences: An illustration with real data,” 2012.' mla: 'Kabst, Rüdiger. Endogeneity in the Behavioral Sciences: An Illustration with Real Data. 2012.' short: 'R. Kabst, in: Amsterdam, 2012.' date_created: 2018-12-18T12:43:58Z date_updated: 2022-01-06T07:02:59Z department: - _id: '274' language: - iso: eng place: Amsterdam status: public title: 'Endogeneity in the behavioral sciences: An illustration with real data' type: conference user_id: '46632' year: '2012' ... --- _id: '628' abstract: - lang: eng text: Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers. author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Martina full_name: 'Huellmann (married name: Eikel), Martina' last_name: 'Huellmann (married name: Eikel)' - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2012:72--83. doi:10.1007/978-3-642-33996-7_7' apa: 'Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., & Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) (pp. 72--83). https://doi.org/10.1007/978-3-642-33996-7_7' bibtex: '@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={10.1007/978-3-642-33996-7_7}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }' chicago: 'Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 72--83. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_7.' ieee: 'A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.' mla: Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83, doi:10.1007/978-3-642-33996-7_7. short: 'A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:02:59Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1007/978-3-642-33996-7_7 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:42:01Z date_updated: 2018-03-15T06:42:01Z file_id: '1238' file_name: 628-FULL_paper_bncs_with_interests.pdf file_size: 300591 relation: main_file success: 1 file_date_updated: 2018-03-15T06:42:01Z has_accepted_license: '1' language: - iso: eng page: 72--83 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) series_title: LNCS status: public title: Basic Network Creation Games with Communication Interests type: conference user_id: '477' year: '2012' ... --- _id: '6281' author: - first_name: M C full_name: Wehner, M C last_name: Wehner - first_name: A full_name: Giardini, A last_name: Giardini - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Wehner MC, Giardini A, Kabst R. Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? In: University of Limerick, Ireland; 2012.' apa: 'Wehner, M. C., Giardini, A., & Kabst, R. (2012). Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? University of Limerick, Ireland.' bibtex: '@inproceedings{Wehner_Giardini_Kabst_2012, place={University of Limerick, Ireland}, title={Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?}, author={Wehner, M C and Giardini, A and Kabst, Rüdiger}, year={2012} }' chicago: 'Wehner, M C, A Giardini, and Rüdiger Kabst. “Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?” University of Limerick, Ireland, 2012.' ieee: 'M. C. Wehner, A. Giardini, and R. Kabst, “Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?,” 2012.' mla: 'Wehner, M. C., et al. Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? 2012.' short: 'M.C. Wehner, A. Giardini, R. Kabst, in: University of Limerick, Ireland, 2012.' date_created: 2018-12-18T12:47:28Z date_updated: 2022-01-06T07:02:59Z department: - _id: '274' language: - iso: eng place: University of Limerick, Ireland status: public title: 'Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?' type: conference user_id: '46632' year: '2012' ... --- _id: '6285' author: - first_name: Volker full_name: Paelke, Volker last_name: Paelke - first_name: Karsten full_name: Nebe, Karsten last_name: Nebe - first_name: Christian full_name: Geiger, Christian last_name: Geiger - first_name: Florian full_name: Klompmaker, Florian last_name: Klompmaker - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer citation: ama: 'Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Designing Multi-Modal Map-Based Interfaces for Disaster Management. In: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI). IARIA; 2012:95-100.' apa: Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., & Fischer, H. G. (2012). Designing Multi-Modal Map-Based Interfaces for Disaster Management. In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) (pp. 95–100). IARIA. bibtex: '@inproceedings{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Designing Multi-Modal Map-Based Interfaces for Disaster Management}, booktitle={Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)}, publisher={IARIA}, author={Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}, year={2012}, pages={95–100} }' chicago: Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 95–100. IARIA, 2012. ieee: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Designing Multi-Modal Map-Based Interfaces for Disaster Management,” in Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 2012, pp. 95–100. mla: Paelke, Volker, et al. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 95–100. short: 'V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, in: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 95–100.' date_created: 2018-12-18T12:49:38Z date_updated: 2022-01-06T07:02:59Z department: - _id: '66' - _id: '534' - _id: '221' language: - iso: eng page: 95-100 publication: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) publisher: IARIA status: public title: Designing Multi-Modal Map-Based Interfaces for Disaster Management type: conference user_id: '30457' year: '2012' ... --- _id: '6286' author: - first_name: Florian full_name: Klompmaker, Florian last_name: Klompmaker - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer - first_name: Helge full_name: Jung, Helge last_name: Jung citation: ama: 'Klompmaker F, Fischer HG, Jung H. Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI). IARIA; 2012:141-144.' apa: Klompmaker, F., Fischer, H. G., & Jung, H. (2012). Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) (pp. 141–144). IARIA. bibtex: '@inproceedings{Klompmaker_Fischer_Jung_2012, title={Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops}, booktitle={Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)}, publisher={IARIA}, author={Klompmaker, Florian and Fischer, Holger Gerhard and Jung, Helge}, year={2012}, pages={141–144} }' chicago: Klompmaker, Florian, Holger Gerhard Fischer, and Helge Jung. “Authenticated Tangible Interaction Using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops.” In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 141–44. IARIA, 2012. ieee: F. Klompmaker, H. G. Fischer, and H. Jung, “Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops,” in Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 2012, pp. 141–144. mla: Klompmaker, Florian, et al. “Authenticated Tangible Interaction Using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops.” Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 141–44. short: 'F. Klompmaker, H.G. Fischer, H. Jung, in: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 141–144.' date_created: 2018-12-18T12:50:15Z date_updated: 2022-01-06T07:02:59Z department: - _id: '66' - _id: '534' - _id: '221' language: - iso: eng page: 141-144 publication: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) publisher: IARIA status: public title: Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops type: conference user_id: '30457' year: '2012' ... --- _id: '6288' author: - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer citation: ama: 'Fischer HG. Integrating usability engineering in the software development lifecycle based on international standards. In: Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12. ACM Press; 2012. doi:10.1145/2305484.2305541' apa: Fischer, H. G. (2012). Integrating usability engineering in the software development lifecycle based on international standards. In Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12. ACM Press. https://doi.org/10.1145/2305484.2305541 bibtex: '@inproceedings{Fischer_2012, title={Integrating usability engineering in the software development lifecycle based on international standards}, DOI={10.1145/2305484.2305541}, booktitle={Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12}, publisher={ACM Press}, author={Fischer, Holger Gerhard}, year={2012} }' chicago: Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” In Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12. ACM Press, 2012. https://doi.org/10.1145/2305484.2305541. ieee: H. G. Fischer, “Integrating usability engineering in the software development lifecycle based on international standards,” in Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12, 2012. mla: Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12, ACM Press, 2012, doi:10.1145/2305484.2305541. short: 'H.G. Fischer, in: Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12, ACM Press, 2012.' date_created: 2018-12-18T12:52:11Z date_updated: 2022-01-06T07:03:00Z department: - _id: '66' - _id: '534' - _id: '221' doi: 10.1145/2305484.2305541 language: - iso: eng publication: Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12 publication_identifier: isbn: - '9781450311687' publication_status: published publisher: ACM Press status: public title: Integrating usability engineering in the software development lifecycle based on international standards type: conference user_id: '30457' year: '2012' ... --- _id: '629' author: - first_name: Patrick full_name: Schleiter, Patrick last_name: Schleiter citation: ama: Schleiter P. Attribute-basierte Verschlüsselung. Universität Paderborn; 2012. apa: Schleiter, P. (2012). Attribute-basierte Verschlüsselung. Universität Paderborn. bibtex: '@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2012} }' chicago: Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012. ieee: P. Schleiter, Attribute-basierte Verschlüsselung. Universität Paderborn, 2012. mla: Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012. short: P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:03:00Z 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: Attribute-basierte Verschlüsselung type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '6290' author: - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer - first_name: Florian full_name: Klompmaker, Florian last_name: Klompmaker citation: ama: 'Fischer HG, Klompmaker F. Enriching Disaster Control Management based on Human-Computer Design. In: Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM). ISCRAM Digital Library; 2012.' apa: Fischer, H. G., & Klompmaker, F. (2012). Enriching Disaster Control Management based on Human-Computer Design. In Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM). ISCRAM Digital Library. bibtex: '@inproceedings{Fischer_Klompmaker_2012, title={Enriching Disaster Control Management based on Human-Computer Design}, booktitle={Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)}, publisher={ISCRAM Digital Library}, author={Fischer, Holger Gerhard and Klompmaker, Florian}, year={2012} }' chicago: Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” In Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM). ISCRAM Digital Library, 2012. ieee: H. G. Fischer and F. Klompmaker, “Enriching Disaster Control Management based on Human-Computer Design,” in Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM), 2012. mla: Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM), ISCRAM Digital Library, 2012. short: 'H.G. Fischer, F. Klompmaker, in: Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM), ISCRAM Digital Library, 2012.' date_created: 2018-12-18T12:52:45Z date_updated: 2022-01-06T07:03:00Z department: - _id: '66' - _id: '534' - _id: '221' language: - iso: eng publication: Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM) publisher: ISCRAM Digital Library status: public title: Enriching Disaster Control Management based on Human-Computer Design type: conference user_id: '30457' year: '2012' ... --- _id: '6291' author: - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer - first_name: Thomas full_name: Geis, Thomas last_name: Geis - first_name: Oliver full_name: Kluge, Oliver last_name: Kluge - first_name: Christian full_name: Bogner, Christian last_name: Bogner - first_name: Knut full_name: Polkehn, Knut last_name: Polkehn citation: ama: 'Fischer HG, Geis T, Kluge O, Bogner C, Polkehn K. Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In: Jahresband Usability Professionals. German UPA; 2012:160-165.' apa: Fischer, H. G., Geis, T., Kluge, O., Bogner, C., & Polkehn, K. (2012). Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In Jahresband Usability Professionals (pp. 160–165). German UPA. bibtex: '@inproceedings{Fischer_Geis_Kluge_Bogner_Polkehn_2012, title={Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten}, booktitle={Jahresband Usability Professionals}, publisher={German UPA}, author={Fischer, Holger Gerhard and Geis, Thomas and Kluge, Oliver and Bogner, Christian and Polkehn, Knut}, year={2012}, pages={160–165} }' chicago: Fischer, Holger Gerhard, Thomas Geis, Oliver Kluge, Christian Bogner, and Knut Polkehn. “Der Qualitätsstandard Für Usability Engineering Der German UPA – Aktueller Stand Der Arbeiten.” In Jahresband Usability Professionals, 160–65. German UPA, 2012. ieee: H. G. Fischer, T. Geis, O. Kluge, C. Bogner, and K. Polkehn, “Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten,” in Jahresband Usability Professionals, 2012, pp. 160–165. mla: Fischer, Holger Gerhard, et al. “Der Qualitätsstandard Für Usability Engineering Der German UPA – Aktueller Stand Der Arbeiten.” Jahresband Usability Professionals, German UPA, 2012, pp. 160–65. short: 'H.G. Fischer, T. Geis, O. Kluge, C. Bogner, K. Polkehn, in: Jahresband Usability Professionals, German UPA, 2012, pp. 160–165.' date_created: 2018-12-18T12:53:45Z date_updated: 2022-01-06T07:03:00Z department: - _id: '66' - _id: '534' - _id: '221' language: - iso: eng page: 160-165 publication: Jahresband Usability Professionals publisher: German UPA status: public title: Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten type: conference user_id: '30457' year: '2012' ... --- _id: '630' abstract: - lang: eng text: Maintaining software systems requires up-to-date models of these systems to systematically plan, analyse and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist. Thus, a reverse engineering step is needed that recovers the system’s components, subsystems and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system’s code base, e.g., they lead to wrong component structures. Several approaches exist today for the reverse engineering of component-based systems, however, none of them explicitly integrates a systematic design deficiency removal into the process to improve the quality of the reverse engineered architecture. Therefore, in our Archimetrix approach, we propose to regard the most relevant deficiencies with respect to the reverse engineered component-based architecture and support reengineers by presenting the architectural consequences of removing a given deficiency. We validate our approach on the Common Component Modeling Example and show that we are able to identify relevant deficiencies and that their removal leads to an improved reengineered architecture. author: - first_name: Marie Christin full_name: Platenius, Marie Christin 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 citation: ama: 'Platenius MC, von Detten M, Becker S. Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In: Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR). ; 2012:255-264. doi:10.1109/CSMR.2012.33' apa: 'Platenius, M. C., von Detten, M., & Becker, S. (2012). Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR) (pp. 255–264). https://doi.org/10.1109/CSMR.2012.33' bibtex: '@inproceedings{Platenius_von Detten_Becker_2012, title={Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}, DOI={10.1109/CSMR.2012.33}, booktitle={Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)}, author={Platenius, Marie Christin and von Detten, Markus and Becker, Steffen}, year={2012}, pages={255–264} }' chicago: 'Platenius, Marie Christin, Markus von Detten, and Steffen Becker. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” In Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 255–64, 2012. https://doi.org/10.1109/CSMR.2012.33.' ieee: 'M. C. Platenius, M. von Detten, and S. Becker, “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies,” in Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–264.' mla: 'Platenius, Marie Christin, et al. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–64, doi:10.1109/CSMR.2012.33.' short: 'M.C. Platenius, M. von Detten, S. Becker, in: Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–264.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:03:00Z ddc: - '040' department: - _id: '76' doi: 10.1109/CSMR.2012.33 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:37:13Z date_updated: 2018-03-15T06:37:13Z file_id: '1236' file_name: 630-CSMR2012-PlateniusDettenBecker.pdf file_size: 723739 relation: main_file success: 1 file_date_updated: 2018-03-15T06:37:13Z has_accepted_license: '1' language: - iso: eng page: 255-264 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 European Conference on Software Maintenance and Reengineering (CSMR) status: public title: 'Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies' type: conference user_id: '477' year: '2012' ... --- _id: '631' abstract: - lang: eng text: Maintaining software systems requires up-to-date models of these systems to systematically plan, analyze, and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist.Thus, a reverse engineering step is needed that recovers the system's components, subsystems, and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system's code base, e.g., they lead to wrong component structures.Therefore, Archimetrix enables the reengineer to detect the most relevant deficiencies with respect to a reverseengineered component-based architecture and supports him by presenting the architectural consequences of removinga given deficiency. author: - first_name: Markus full_name: von Detten, Markus last_name: von Detten citation: ama: 'von Detten M. Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In: Proceedings of the 19th Working Conference on Reverse Engineering (WCRE). ; 2012:503-504. doi:10.1109/WCRE.2012.61' apa: 'von Detten, M. (2012). Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In Proceedings of the 19th Working Conference on Reverse Engineering (WCRE) (pp. 503–504). https://doi.org/10.1109/WCRE.2012.61' bibtex: '@inproceedings{von Detten_2012, title={Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction}, DOI={10.1109/WCRE.2012.61}, booktitle={Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)}, author={von Detten, Markus}, year={2012}, pages={503–504} }' chicago: 'Detten, Markus von. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” In Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 503–4, 2012. https://doi.org/10.1109/WCRE.2012.61.' ieee: 'M. von Detten, “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction,” in Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–504.' mla: 'von Detten, Markus. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–04, doi:10.1109/WCRE.2012.61.' short: 'M. von Detten, in: Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–504.' date_created: 2017-10-17T12:42:55Z date_updated: 2022-01-06T07:03:01Z ddc: - '040' doi: 10.1109/WCRE.2012.61 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:36:37Z date_updated: 2018-03-15T06:36:37Z file_id: '1235' file_name: 631-WCRE2012-vonDetten.pdf file_size: 258563 relation: main_file success: 1 file_date_updated: 2018-03-15T06:36:37Z has_accepted_license: '1' page: '503 - 504 ' 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 19th Working Conference on Reverse Engineering (WCRE) status: public title: 'Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction' type: conference user_id: '15504' year: '2012' ... --- _id: '6312' author: - first_name: Kay full_name: Behrenbruch, Kay last_name: Behrenbruch - first_name: Christian full_name: Bogner, Christian last_name: Bogner - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer - first_name: Thomas full_name: Geis, Thomas last_name: Geis - first_name: Claudia full_name: Geitner, Claudia last_name: Geitner - first_name: Rüdiger full_name: Heimgärtner, Rüdiger last_name: Heimgärtner - first_name: Britta full_name: Hofmann, Britta last_name: Hofmann - first_name: Peter full_name: Hunkirchen, Peter last_name: Hunkirchen - first_name: Oliver full_name: Kluge, Oliver last_name: Kluge - first_name: Britta full_name: Litzenberg, Britta last_name: Litzenberg - first_name: Rolf full_name: Molich, Rolf last_name: Molich - first_name: Knut full_name: Polkehn, Knut last_name: Polkehn - first_name: Yuliya full_name: Pysarenko, Yuliya last_name: Pysarenko - first_name: Dirk full_name: Zimmermann, Dirk last_name: Zimmermann citation: ama: Behrenbruch K, Bogner C, Fischer HG, et al. German UPA Qualitätsstandard für Usability Engineering.; 2012. apa: Behrenbruch, K., Bogner, C., Fischer, H. G., Geis, T., Geitner, C., Heimgärtner, R., … Zimmermann, D. (2012). German UPA Qualitätsstandard für Usability Engineering. bibtex: '@book{Behrenbruch_Bogner_Fischer_Geis_Geitner_Heimgärtner_Hofmann_Hunkirchen_Kluge_Litzenberg_et al._2012, title={German UPA Qualitätsstandard für Usability Engineering}, author={Behrenbruch, Kay and Bogner, Christian and Fischer, Holger Gerhard and Geis, Thomas and Geitner, Claudia and Heimgärtner, Rüdiger and Hofmann, Britta and Hunkirchen, Peter and Kluge, Oliver and Litzenberg, Britta and et al.}, year={2012} }' chicago: Behrenbruch, Kay, Christian Bogner, Holger Gerhard Fischer, Thomas Geis, Claudia Geitner, Rüdiger Heimgärtner, Britta Hofmann, et al. German UPA Qualitätsstandard für Usability Engineering, 2012. ieee: K. Behrenbruch et al., German UPA Qualitätsstandard für Usability Engineering. 2012. mla: Behrenbruch, Kay, et al. German UPA Qualitätsstandard für Usability Engineering. 2012. short: K. Behrenbruch, C. Bogner, H.G. Fischer, T. Geis, C. Geitner, R. Heimgärtner, B. Hofmann, P. Hunkirchen, O. Kluge, B. Litzenberg, R. Molich, K. Polkehn, Y. Pysarenko, D. Zimmermann, German UPA Qualitätsstandard für Usability Engineering, 2012. date_created: 2018-12-18T13:15:22Z date_updated: 2022-01-06T07:03:01Z department: - _id: '66' - _id: '534' - _id: '221' language: - iso: ger status: public title: German UPA Qualitätsstandard für Usability Engineering type: report user_id: '30457' year: '2012' ... --- _id: '632' abstract: - lang: eng text: 'Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.' author: - first_name: Petr full_name: Kolman, Petr last_name: Kolman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA). ; 2012:800-810. doi:10.1137/1.9781611973099.64' apa: 'Kolman, P., & Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810). https://doi.org/10.1137/1.9781611973099.64' bibtex: '@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={10.1137/1.9781611973099.64}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }' chicago: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 800–810, 2012. https://doi.org/10.1137/1.9781611973099.64.' ieee: 'P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.' mla: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.' short: 'P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.' date_created: 2017-10-17T12:42:55Z date_updated: 2022-01-06T07:03:01Z ddc: - '040' department: - _id: '79' doi: 10.1137/1.9781611973099.64 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:35:58Z date_updated: 2018-03-15T06:35:58Z file_id: '1234' file_name: 632-SODA2012-Scheideler_01.pdf file_size: 220213 relation: main_file success: 1 file_date_updated: 2018-03-15T06:35:58Z has_accepted_license: '1' page: 800-810 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 23th ACM SIAM Symposium on Discrete Algorithms (SODA) status: public title: 'Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case' type: conference user_id: '15504' year: '2012' ... --- _id: '633' author: - first_name: Daniel full_name: Pischel, Daniel last_name: Pischel citation: ama: Pischel D. Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze. Universität Paderborn; 2012. apa: Pischel, D. (2012). Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze. Universität Paderborn. bibtex: '@book{Pischel_2012, title={Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze}, publisher={Universität Paderborn}, author={Pischel, Daniel}, year={2012} }' chicago: Pischel, Daniel. Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze. Universität Paderborn, 2012. ieee: D. Pischel, Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze. Universität Paderborn, 2012. mla: Pischel, Daniel. Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze. Universität Paderborn, 2012. short: D. Pischel, Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:55Z date_updated: 2022-01-06T07:03:01Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze type: mastersthesis user_id: '477' year: '2012' ... --- _id: '634' author: - first_name: Julian full_name: Kratzmann, Julian last_name: Kratzmann citation: ama: Kratzmann J. Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen. Universität Paderborn; 2012. apa: Kratzmann, J. (2012). Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen. Universität Paderborn. bibtex: '@book{Kratzmann_2012, title={Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen}, publisher={Universität Paderborn}, author={Kratzmann, Julian}, year={2012} }' chicago: Kratzmann, Julian. Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen. Universität Paderborn, 2012. ieee: J. Kratzmann, Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen. Universität Paderborn, 2012. mla: Kratzmann, Julian. Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen. Universität Paderborn, 2012. short: J. Kratzmann, Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:55Z date_updated: 2022-01-06T07:03:01Z 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: Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '635' abstract: - lang: eng text: In Germany, the optimization of water supply systems has gained more and more attention due to a growing cost pressure for German municipal utilities. In this work, a model is presented which optimizes the usage of water tanks. On the one hand locations of new tanks are identified, and on the other hand the size of existing tanks is optimized, subject to satisfying the demand of clients and providing the necessary amount of fire water during all time periods. The main difficulty is the consideration of the head loss equation which is required to model the hydraulic properties of a water supply system. As this equation is non-convex and quadratic the optimization model becomes a non-convex Mixed Integer Quadratically Constrained Program (MIQCP). To solve this MIQCP different solution methods are applied. author: - first_name: Corinna full_name: 'Dohle (married name: Hallmann) , Corinna' last_name: 'Dohle (married name: Hallmann) ' - first_name: Leena full_name: Suhl, Leena last_name: Suhl citation: ama: 'Dohle (married name: Hallmann) C, Suhl L. An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems. In: Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD). ; 2012:404-408.' apa: 'Dohle (married name: Hallmann) , C., & Suhl, L. (2012). An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems. In Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD) (pp. 404–408).' bibtex: '@inproceedings{Dohle (married name: Hallmann) _Suhl_2012, title={An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems}, booktitle={Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)}, author={Dohle (married name: Hallmann) , Corinna and Suhl, Leena}, year={2012}, pages={404–408} }' chicago: 'Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization Model for the Optimal Usage of Water Tanks in Water Supply Systems.” In Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD), 404–8, 2012.' ieee: 'C. Dohle (married name: Hallmann) and L. Suhl, “An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems,” in Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD), 2012, pp. 404–408.' mla: 'Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization Model for the Optimal Usage of Water Tanks in Water Supply Systems.” Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD), 2012, pp. 404–08.' short: 'C. Dohle (married name: Hallmann) , L. Suhl, in: Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD), 2012, pp. 404–408.' date_created: 2017-10-17T12:42:55Z date_updated: 2022-01-06T07:03:02Z ddc: - '040' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T14:15:10Z date_updated: 2018-03-14T14:15:10Z file_id: '1233' file_name: 635-Dohle_Apmod_2012.pdf file_size: 164455 relation: main_file success: 1 file_date_updated: 2018-03-14T14:15:10Z has_accepted_license: '1' page: 404-408 project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD) status: public title: An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems type: conference user_id: '15504' year: '2012' ... --- _id: '636' abstract: - lang: eng text: We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax. author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Peter full_name: Pietrzyk, Peter last_name: Pietrzyk - first_name: Peter full_name: Kling, Peter last_name: Kling citation: ama: 'Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing. In: Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO). LNCS. ; 2012:61-72. doi:10.1007/978-3-642-31104-8_6' apa: Meyer auf der Heide, F., Pietrzyk, P., & Kling, P. (2012). An Algorithm for Facility Leasing. In Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO) (pp. 61–72). https://doi.org/10.1007/978-3-642-31104-8_6 bibtex: '@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS}, title={An Algorithm for Facility Leasing}, DOI={10.1007/978-3-642-31104-8_6}, booktitle={Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS} }' chicago: Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm for Facility Leasing.” In Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 61–72. LNCS, 2012. https://doi.org/10.1007/978-3-642-31104-8_6. ieee: F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72. mla: Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72, doi:10.1007/978-3-642-31104-8_6. short: 'F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72.' date_created: 2017-10-17T12:42:56Z date_updated: 2022-01-06T07:03:02Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-642-31104-8_6 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T14:14:21Z date_updated: 2018-03-14T14:14:21Z file_id: '1232' file_name: 636-Online_Facility_Location.pdf file_size: 173049 relation: main_file success: 1 file_date_updated: 2018-03-14T14:14:21Z has_accepted_license: '1' page: 61-72 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 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO) series_title: LNCS status: public title: An Algorithm for Facility Leasing type: conference user_id: '15504' year: '2012' ... --- _id: '637' author: - first_name: Friederike full_name: Dawirs, Friederike last_name: Dawirs citation: ama: 'Dawirs F. Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index. Universität Paderborn; 2012.' apa: 'Dawirs, F. (2012). Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index. Universität Paderborn.' bibtex: '@book{Dawirs_2012, title={Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index}, publisher={Universität Paderborn}, author={Dawirs, Friederike}, year={2012} }' chicago: 'Dawirs, Friederike. Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index. Universität Paderborn, 2012.' ieee: 'F. Dawirs, Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index. Universität Paderborn, 2012.' mla: 'Dawirs, Friederike. Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index. Universität Paderborn, 2012.' short: 'F. Dawirs, Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:56Z date_updated: 2022-01-06T07:03:02Z 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: 'Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index' type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '638' author: - first_name: Fabian full_name: Eidens, Fabian id: '25078' last_name: Eidens citation: ama: Eidens F. Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn; 2012. apa: Eidens, F. (2012). Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn. bibtex: '@book{Eidens_2012, title={Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2012} }' chicago: Eidens, Fabian. Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn, 2012. ieee: F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn, 2012. mla: Eidens, Fabian. Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn, 2012. short: F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:56Z date_updated: 2022-01-06T07:03:03Z department: - _id: '63' 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: Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '639' abstract: - lang: eng text: Service-oriented computing (SOC) emerges as a promising trend solving many issues in distributed software development. Following the essence of SOC, service descriptions are dened by the service partners based on current standards, e.g., WSDL [15]. However, these standards are mostly structural and do not provide any behavioral description, which may lead to inaccurate service discovery results. There is a requirement for a rich service description language for service partners that encompasses the structural as well as behavioral information in the service description. Furthermore, service discovery based on an automatic matching of these comprehensive service descriptions is a complex task, which is further complicated through the heterogeneity of the service partners' domains in terms of dierent underlying ontologies. In this paper, we propose a rich service description language based on UML, which allows the specication of structural and behavioral features of a service. In addition, we also briefly discuss how some existing matching approaches can be extended to dene an automatic matching mechanism for rich service descriptions resolving the underlying heterogeneity. 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. A UML-based Rich Service Description for Automatic Service Discovery. In: Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering. CEUR Workshop Proceedings. ; 2012:90--97.' apa: Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2012). A UML-based Rich Service Description for Automatic Service Discovery. In Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering (pp. 90--97). bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={CEUR Workshop Proceedings}, title={A UML-based Rich Service Description for Automatic Service Discovery}, booktitle={Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={90--97}, collection={CEUR Workshop Proceedings} }' chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “A UML-Based Rich Service Description for Automatic Service Discovery.” In Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering, 90--97. CEUR Workshop Proceedings, 2012. ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “A UML-based Rich Service Description for Automatic Service Discovery,” in Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering, 2012, pp. 90--97. mla: Huma, Zille, et al. “A UML-Based Rich Service Description for Automatic Service Discovery.” Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering, 2012, pp. 90--97. short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering, 2012, pp. 90--97.' date_created: 2017-10-17T12:42:56Z date_updated: 2022-01-06T07:03:03Z ddc: - '040' department: - _id: '66' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T14:13:48Z date_updated: 2018-03-14T14:13:48Z file_id: '1231' file_name: 639-HumaGerthCAiSE12.pdf file_size: 693236 relation: main_file success: 1 file_date_updated: 2018-03-14T14:13:48Z has_accepted_license: '1' language: - iso: eng page: 90--97 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 Forum at the CAiSE'12 Conference on Advanced Information Systems Engineering series_title: CEUR Workshop Proceedings status: public title: A UML-based Rich Service Description for Automatic Service Discovery type: conference user_id: '477' year: '2012' ... --- _id: '640' abstract: - lang: eng text: Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network. 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 Self-Stabilization Process for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115' apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115 bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }' chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115. ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271. mla: Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115. short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.' date_created: 2017-10-17T12:42:56Z date_updated: 2022-01-06T07:03:04Z ddc: - '040' department: - _id: '79' doi: 10.1109/IPDPS.2012.115 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T14:13:13Z date_updated: 2018-03-14T14:13:13Z file_id: '1230' file_name: 640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf file_size: 210176 relation: main_file success: 1 file_date_updated: 2018-03-14T14:13:13Z has_accepted_license: '1' page: 1261--1271 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: A Self-Stabilization Process for Small-World Networks type: conference user_id: '15504' year: '2012' ... --- _id: '641' author: - first_name: Jonathan full_name: Schluessler, Jonathan last_name: Schluessler citation: ama: Schluessler J. A Forensic Framework for Automatic Information Retrieval in Distributed Systems. Universität Paderborn; 2012. apa: Schluessler, J. (2012). A Forensic Framework for Automatic Information Retrieval in Distributed Systems. Universität Paderborn. bibtex: '@book{Schluessler_2012, title={A Forensic Framework for Automatic Information Retrieval in Distributed Systems}, publisher={Universität Paderborn}, author={Schluessler, Jonathan}, year={2012} }' chicago: Schluessler, Jonathan. A Forensic Framework for Automatic Information Retrieval in Distributed Systems. Universität Paderborn, 2012. ieee: J. Schluessler, A Forensic Framework for Automatic Information Retrieval in Distributed Systems. Universität Paderborn, 2012. mla: Schluessler, Jonathan. A Forensic Framework for Automatic Information Retrieval in Distributed Systems. Universität Paderborn, 2012. short: J. Schluessler, A Forensic Framework for Automatic Information Retrieval in Distributed Systems, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:57Z date_updated: 2022-01-06T07:03:04Z 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: A Forensic Framework for Automatic Information Retrieval in Distributed Systems type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '6410' 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: A. full_name: Zoyke, A. last_name: Zoyke citation: ama: 'Kremer H-H, Beutner M, Zoyke A. Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem. In: Kremer H-H, Beutner M, Zoyke A, eds. Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab. Paderborn; 2012.' apa: Kremer, H.-H., Beutner, M., & Zoyke, A. (2012). Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem. In H.-H. Kremer, M. Beutner, & A. Zoyke (Eds.), Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab. Paderborn. bibtex: '@inbook{Kremer_Beutner_Zoyke_2012, place={Paderborn}, title={Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem}, booktitle={Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab}, author={Kremer, H.-Hugo and Beutner, Marc and Zoyke, A.}, editor={Kremer, H.-Hugo and Beutner, Marc and Zoyke, A.Editors}, year={2012} }' chicago: Kremer, H.-Hugo, Marc Beutner, and A. Zoyke. “Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem.” In Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab, edited by H.-Hugo Kremer, Marc Beutner, and A. Zoyke. Paderborn, 2012. ieee: H.-H. Kremer, M. Beutner, and A. Zoyke, “Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem,” in Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab, H.-H. Kremer, M. Beutner, and A. Zoyke, Eds. Paderborn, 2012. mla: Kremer, H. Hugo, et al. “Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem.” Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab, edited by H.-Hugo Kremer et al., 2012. short: 'H.-H. Kremer, M. Beutner, A. Zoyke, in: H.-H. Kremer, M. Beutner, A. Zoyke (Eds.), Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab, Paderborn, 2012.' date_created: 2018-12-20T11:26:17Z date_updated: 2022-01-06T07:03:04Z department: - _id: '211' editor: - first_name: H.-Hugo full_name: Kremer, H.-Hugo last_name: Kremer - first_name: Marc full_name: Beutner, Marc last_name: Beutner - first_name: A. full_name: Zoyke, A. last_name: Zoyke language: - iso: ger place: Paderborn publication: Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab status: public title: Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem type: book_chapter user_id: '44715' year: '2012' ...