TY - CHAP AU - Tramm, T. AU - Kremer, H.-Hugo AU - Tenberg, R. ED - Kremer, H.-H. ED - Tramm, T. ED - Tenberg, R. ID - 6465 T2 - bwp@ Ausgabe 20, Lernfeldansatz 15 Jahre danach TI - Editorial bwp@ 20 ER - TY - CHAP AU - Beutner, Marc AU - Kremer, H.-Hugo AU - Wirth, W. ED - Beutner, M. ED - Kremer, H.-H. ED - Zoyke, A. ID - 6466 T2 - bwp@ Spezial 5 - Hochschultage Berufliche Bildung 2011, Workshop 16 TI - Bildungsmaßnahmen zur Berufsorientierung im Justizvollzug - Konzept und Erfahrungen ER - TY - CHAP AU - Beutner, Marc AU - Kremer, H.-Hugo AU - Zoyke, A. ED - Beutner, M. ED - Kremer, H.-H. ED - Zoyke, A. ID - 6467 T2 - WS 16 Individuelle Förderung. Konzepte und Erfahrungen zur Berufsorientierung im Übergang. bwp@ Spezial 5 - Hochschultage Berufliche Bildung 2011 TI - Editorial zu Workshop 16: Individuelle Förderung - Konzepte und Erfahrungen zur Berufsorientierung im Übergang ER - TY - CHAP AU - Kremer, H.-Hugo ED - Prieß, W. ID - 6468 T2 - Wirtschaftspädagogik zwischen Erkenntnis und Erfahrung - strukturelle Einsichten zur Gestaltung von Prozessen TI - Praxisphasen und Professionalisierung in der Lehrerbildung - Überlegungen zur Gestaltung des Praxissemesters ER - TY - JOUR AU - Ertl, H. AU - Kremer, H.-Hugo ID - 6469 JF - Wirtschaft und Erziehung TI - Innovationen in berufsbildenden Kontexten - eine explorative Studie an berufsbildenden Schulen ER - TY - JOUR AU - Leuschel, Michael AU - Wehrheim, Heike ID - 647 IS - 10 JF - Science of Computer Programming TI - Selected papers on Integrated Formal Methods (iFM09) ER - TY - CHAP AU - Kremer, H.-Hugo ED - Rützel, J. ED - Zöller, A. ID - 6470 T2 - bwp@ Sepzial 5 - Hochschultage Berufliche Bildung 2011, Workshop 02 TI - Berufsorientierung als Herausforderung für berufsbildende Schulen! ER - TY - CHAP AU - Tramm, T. AU - Kremer, H.-Hugo ED - Bals, T. ED - Hinrichs, H. ED - Ebbinghaus, M. ED - Tenberg, R. ID - 6471 T2 - Übergänge in der Berufsbildung nachhaltig gestalten: Potentiale erkennen - Chancen nutzen TI - Zwischenbilanz des Lernfeldkonzepts - erfolgreiche Neuorientierung oder Irrweg ER - TY - CHAP AU - Kremer, H.-Hugo AU - Tramm, T. ED - Kremer, H.-H. ED - Tramm, T. ID - 6472 T2 - bwp@ Sepzial 5 - Hochschultage Berufliche Bildung 2011, Fachtagung 19 TI - Editorial Fachtagung Wirtschaft und Verwaltung: Zwischenbilanz des Lernfeldkonzepts - erfolgreiche Neuorientierung oder Irrweg ER - TY - CHAP AU - Kremer, H.-Hugo AU - Sandmann, D. ED - Gerholz, K.-H. ED - Sloane, P. F. E. ID - 6473 T2 - bwp@ Spezial 5 - Hochschultage Berufliche Bildung 2011, Workshop 29 TI - Kooperationsvorhaben ‚berufliches Gymnasium‘ und Bachelor Wirtschaftswissenschaften. Ein Paderborner Modellprojekt zur Berufs- und Studienorientierung ER - TY - JOUR AU - Büchter, K. AU - Gramlinger, F. AU - Kremer, H.-Hugo AU - Tenberg , R. AU - Tramm, T. ID - 6474 JF - bwp@ Berufs- und Wirtschaftspädagogik - online, Jubiläumsausgabe TI - bwp@ Berufs- und Wirtschaftspädagogik - online 2011-2011: Verortung, Selbstverständnis und Entwicklung ER - TY - GEN AU - Brandes, Philipp ID - 648 TI - Robust Distributed Computation in Dynamic Networks ER - TY - JOUR AB - Today, the concept of service oriented architectures provides a way of building integrated solutions out of existing services. To this end, services from different providers are composed using advanced orchestration and choreography techniques. However, while this principle allows for greater flexibility at a smaller cost, the use of third party services also includes a risk: Deployed services might not work as claimed by their providers. In this paper, we propose a technique for analyzing the expected reliability of service compositions based on ratings given by (previous) service users. Every service thereby comes with a reputation, and the analysis computes an overall reliability of a service composition from the reputations of its constituent services. The proposed model-driven approach proceeds by translating statechart models of service compositions into input for a probabilistic model checker (PRISM) using state-of-the-art model transformations techniques. The approach has been implemented as an Eclipse plug-in and is fully compliant with UML. AU - Besova, Galina AU - Wehrheim, Heike AU - Wagner, Annika ID - 649 IS - 2 JF - Electronic Notes in Theoretical Computer Science TI - Reputation-based Reliability Prediction of Service Compositions ER - TY - GEN AU - Platenius, Marie Christin ID - 650 TI - Reengineering of Design Deficiencies in Component-Based Software Architectures ER - TY - GEN AU - Stroh-Maraun, Nadja ID - 651 TI - Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme ER - TY - CONF AB - In the development process of service-oriented systems, business process models are used at different levels. Typically, high-level business process models that describe business requirements and needs are stepwise refined to the IT level by different business modelers and software architects. As a result, different process model versions must be compared and merged by means of model version control. An important prerequisite for process model version control is an elaborated matching approach that results in precise mappings between different process model versions. The challenge of such an approach is to deal with syntactically different process models that are semantically equivalent. For that purpose, matching techniques must consider the semantics of process modeling languages.In this paper, we present a matching approach for process models in a versioning scenario. Based on a term formalization of process models, we enable an efficient and effective way to match syntactically different but semantically equivalent process models resulting in precise mappings. AU - Gerth, Christian AU - Luckey, Markus AU - Küster, Jochen AU - Engels, Gregor ID - 652 T2 - Proceedings of the IEEE 8th International Conference on Service Computingt (SCC) TI - Precise Mappings between Business Process Models in Versioning Scenarios ER - TY - CONF AB - Performance prototyping is an often used technique to assess the performance of software architectures early in the development process without relying on models of the system under study. ProtoCom is a prototype generator for the PCM realised as model-2-text transformation for which no experience report in a larger, virtualised setting exists. In this paper, we report on four case studies performed with an improved version of ProtoCom and report on the results gained with respect to analysis accuracy and usability. Our results demonstrate that the new version is much easier to use than previous versions and that results gained in our virtualised execution environment help in early assessments of performance under realistic conditions. AU - Lehrig, Sebastian AU - Zolynski, Thomas ID - 653 T2 - Proceedings of the Palladio Days 2011 TI - Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study ER - TY - CONF AB - Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project “QuaP2P”,which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project “On-the-fly Computing” aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV. AU - Graffi, Kalman ID - 654 T2 - Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP) TI - PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned ER - TY - GEN AU - Meyer, Joachim ID - 655 TI - Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud ER - TY - CONF AB - We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\epsilon} n) communication rounds and yields a \my^4(1+4\my^2(1+\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\epsilon} n) communication rounds and an approximation factor of \my^4(1 + 2(1 + \epsilon)^{1/p})^p. Here, \epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \my the relative measurement error. AU - Abshoff, Sebastan AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Kempkes, Barbara AU - Pietrzyk, Peter ID - 657 T2 - Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS) TI - Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks ER -