[{"language":[{"iso":"eng"}],"ddc":["040"],"keyword":["Transfer Pricing","Negotiation","Generalized Nash Bargaining Solution","Incomplete Information"],"file":[{"file_size":430826,"file_id":"5148","access_level":"closed","file_name":"WP - Cooperative Transfer Price Negotiations under Incomplete Information.pdf","date_updated":"2018-10-31T09:22:19Z","creator":"stela","date_created":"2018-10-31T09:22:19Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"In this paper, we analyze a model in which two divisions negotiate over an intrafirm transfer price for an intermediate product. Formally, we consider bargaining problems under incomplete information, since the upstream division’s (seller's) costs and downstream division's (buyer's) revenues are supposed to be private information. Assuming two possible types for buyer and seller each, we first establish that the bargaining problem is regular, regardless whether incentive and/or efficiency constraints are imposed. This allows us to apply the generalized Nash bargaining solution to determine transfer payments and transfer probabilities. Furthermore, we derive general properties of this solution for the transfer pricing problem and compare the model developed here with the existing literature for negotiated transfer pricing under incomplete information. In particular, we focus on the models presented in Wagenhofer (1994).","lang":"eng"}],"title":"Cooperative Transfer Price Negotiations under Incomplete Information","date_created":"2018-10-31T09:20:15Z","publisher":"CIE Working Paper Series, Paderborn University","year":"2013","file_date_updated":"2018-10-31T09:22:19Z","series_title":"Working Papers CIE","user_id":"477","department":[{"_id":"205"},{"_id":"475"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5146","status":"public","type":"working_paper","author":[{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"volume":64,"date_updated":"2022-01-06T07:01:39Z","citation":{"ieee":"S. Brangewitz and C.-J. Haake, <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>, vol. 64. CIE Working Paper Series, Paderborn University, 2013.","chicago":"Brangewitz, Sonja, and Claus-Jochen Haake. <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>. Vol. 64. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2013.","ama":"Brangewitz S, Haake C-J. <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>. Vol 64. CIE Working Paper Series, Paderborn University; 2013.","bibtex":"@book{Brangewitz_Haake_2013, series={Working Papers CIE}, title={Cooperative Transfer Price Negotiations under Incomplete Information}, volume={64}, publisher={CIE Working Paper Series, Paderborn University}, author={Brangewitz, Sonja and Haake, Claus-Jochen}, year={2013}, collection={Working Papers CIE} }","short":"S. Brangewitz, C.-J. Haake, Cooperative Transfer Price Negotiations under Incomplete Information, CIE Working Paper Series, Paderborn University, 2013.","mla":"Brangewitz, Sonja, and Claus-Jochen Haake. <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>. Vol. 64, CIE Working Paper Series, Paderborn University, 2013.","apa":"Brangewitz, S., &#38; Haake, C.-J. (2013). <i>Cooperative Transfer Price Negotiations under Incomplete Information</i> (Vol. 64). CIE Working Paper Series, Paderborn University."},"intvolume":"        64","has_accepted_license":"1"},{"has_accepted_license":"1","page":"284-297","citation":{"chicago":"Jungmann, Alexander, Bernd Kleinjohann, and Elisabeth Kleinjohann. “Learning Service Recommendations.” <i>International Journal of Business Process Integration and Management</i>, no. 4 (2013): 284–97. <a href=\"https://doi.org/10.1504/IJBPIM.2013.059135\">https://doi.org/10.1504/IJBPIM.2013.059135</a>.","ieee":"A. Jungmann, B. Kleinjohann, and E. Kleinjohann, “Learning Service Recommendations,” <i>International Journal of Business Process Integration and Management</i>, no. 4, pp. 284–297, 2013.","ama":"Jungmann A, Kleinjohann B, Kleinjohann E. Learning Service Recommendations. <i>International Journal of Business Process Integration and Management</i>. 2013;(4):284-297. doi:<a href=\"https://doi.org/10.1504/IJBPIM.2013.059135\">10.1504/IJBPIM.2013.059135</a>","apa":"Jungmann, A., Kleinjohann, B., &#38; Kleinjohann, E. (2013). Learning Service Recommendations. <i>International Journal of Business Process Integration and Management</i>, (4), 284–297. <a href=\"https://doi.org/10.1504/IJBPIM.2013.059135\">https://doi.org/10.1504/IJBPIM.2013.059135</a>","bibtex":"@article{Jungmann_Kleinjohann_Kleinjohann_2013, title={Learning Service Recommendations}, DOI={<a href=\"https://doi.org/10.1504/IJBPIM.2013.059135\">10.1504/IJBPIM.2013.059135</a>}, number={4}, journal={International Journal of Business Process Integration and Management}, publisher={InderScience}, author={Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth}, year={2013}, pages={284–297} }","short":"A. Jungmann, B. Kleinjohann, E. Kleinjohann, International Journal of Business Process Integration and Management (2013) 284–297.","mla":"Jungmann, Alexander, et al. “Learning Service Recommendations.” <i>International Journal of Business Process Integration and Management</i>, no. 4, InderScience, 2013, pp. 284–97, doi:<a href=\"https://doi.org/10.1504/IJBPIM.2013.059135\">10.1504/IJBPIM.2013.059135</a>."},"author":[{"first_name":"Alexander","full_name":"Jungmann, Alexander","last_name":"Jungmann"},{"last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd","first_name":"Bernd"},{"last_name":"Kleinjohann","full_name":"Kleinjohann, Elisabeth","id":"15588","first_name":"Elisabeth"}],"date_updated":"2022-01-06T07:01:39Z","doi":"10.1504/IJBPIM.2013.059135","main_file_link":[{"url":"http://www.inderscience.com/offer.php?id=59135"}],"type":"journal_article","status":"public","user_id":"477","_id":"515","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T10:43:38Z","issue":"4","year":"2013","date_created":"2017-10-17T12:42:32Z","publisher":"InderScience","title":"Learning Service Recommendations","publication":"International Journal of Business Process Integration and Management","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":5301831,"access_level":"closed","file_id":"1301","file_name":"515-IJBPIM060402_JUNGMANN.pdf","date_updated":"2018-03-15T10:43:38Z","creator":"florida","date_created":"2018-03-15T10:43:38Z"}],"abstract":[{"lang":"eng","text":"The as a service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilised on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our approach of modelling this service composition and recommendation process as Markov decision process and of solving it by means of reinforcement learning. A case study serves as proof of concept."}],"ddc":["040"]},{"page":"97-104","citation":{"chicago":"Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System for Automated Service Composition.” In <i>Proceedings of the 10th IEEE International Conference on Services Computing (SCC)</i>, 97–104, 2013. <a href=\"https://doi.org/10.1109/SCC.2013.66\">https://doi.org/10.1109/SCC.2013.66</a>.","ieee":"A. Jungmann and B. Kleinjohann, “Learning Recommendation System for Automated Service Composition,” in <i>Proceedings of the 10th IEEE International Conference on Services Computing (SCC)</i>, 2013, pp. 97–104.","ama":"Jungmann A, Kleinjohann B. Learning Recommendation System for Automated Service Composition. In: <i>Proceedings of the 10th IEEE International Conference on Services Computing (SCC)</i>. ; 2013:97-104. doi:<a href=\"https://doi.org/10.1109/SCC.2013.66\">10.1109/SCC.2013.66</a>","bibtex":"@inproceedings{Jungmann_Kleinjohann_2013, title={Learning Recommendation System for Automated Service Composition}, DOI={<a href=\"https://doi.org/10.1109/SCC.2013.66\">10.1109/SCC.2013.66</a>}, booktitle={Proceedings of the 10th IEEE International Conference on Services Computing (SCC)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2013}, pages={97–104} }","short":"A. Jungmann, B. Kleinjohann, in: Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 2013, pp. 97–104.","mla":"Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System for Automated Service Composition.” <i>Proceedings of the 10th IEEE International Conference on Services Computing (SCC)</i>, 2013, pp. 97–104, doi:<a href=\"https://doi.org/10.1109/SCC.2013.66\">10.1109/SCC.2013.66</a>.","apa":"Jungmann, A., &#38; Kleinjohann, B. (2013). Learning Recommendation System for Automated Service Composition. In <i>Proceedings of the 10th IEEE International Conference on Services Computing (SCC)</i> (pp. 97–104). <a href=\"https://doi.org/10.1109/SCC.2013.66\">https://doi.org/10.1109/SCC.2013.66</a>"},"year":"2013","has_accepted_license":"1","doi":"10.1109/SCC.2013.66","title":"Learning Recommendation System for Automated Service Composition","date_created":"2017-10-17T12:42:33Z","author":[{"last_name":"Jungmann","full_name":"Jungmann, Alexander","first_name":"Alexander"},{"first_name":"Bernd","last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd"}],"date_updated":"2022-01-06T07:01:40Z","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:43:03Z","creator":"florida","date_created":"2018-03-15T10:43:03Z","file_size":1762714,"file_id":"1300","file_name":"516-manuscript.pdf","access_level":"closed"}],"abstract":[{"lang":"eng","text":"The as a Service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilized on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our general idea of modeling this service composition and recommendation process as Markov Decision Process and of solving it by means of Reinforcement Learning. A case study serves as proof of concept. "}],"publication":"Proceedings of the 10th IEEE International Conference on Services Computing (SCC)","type":"conference","file_date_updated":"2018-03-15T10:43:03Z","ddc":["040"],"user_id":"15504","_id":"516","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}]},{"date_created":"2017-10-17T12:42:33Z","author":[{"last_name":"Walther","full_name":"Walther, Sven","first_name":"Sven"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T07:01:41Z","doi":"10.1109/ICECCS.2013.14","title":"Knowledge-Based Verification of Service Compositions - An SMT approach","has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification of Service Compositions - An SMT approach}, DOI={<a href=\"https://doi.org/10.1109/ICECCS.2013.14\">10.1109/ICECCS.2013.14</a>}, booktitle={Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike}, year={2013}, pages={24–32} }","mla":"Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>, 2013, pp. 24–32, doi:<a href=\"https://doi.org/10.1109/ICECCS.2013.14\">10.1109/ICECCS.2013.14</a>.","short":"S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.","apa":"Walther, S., &#38; Wehrheim, H. (2013). Knowledge-Based Verification of Service Compositions - An SMT approach. In <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i> (pp. 24–32). <a href=\"https://doi.org/10.1109/ICECCS.2013.14\">https://doi.org/10.1109/ICECCS.2013.14</a>","ama":"Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions - An SMT approach. In: <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>. ; 2013:24-32. doi:<a href=\"https://doi.org/10.1109/ICECCS.2013.14\">10.1109/ICECCS.2013.14</a>","chicago":"Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” In <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>, 24–32, 2013. <a href=\"https://doi.org/10.1109/ICECCS.2013.14\">https://doi.org/10.1109/ICECCS.2013.14</a>.","ieee":"S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions - An SMT approach,” in <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>, 2013, pp. 24–32."},"page":"24 - 32 ","year":"2013","user_id":"477","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"517","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:26:08Z","ddc":["000"],"type":"conference","publication":"Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-02T13:26:08Z","creator":"ups","date_created":"2018-11-02T13:26:08Z","file_size":217085,"file_id":"5248","access_level":"closed","file_name":"06601801.pdf"}],"status":"public","abstract":[{"lang":"eng","text":"In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts for types used in service signatures, but also predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software."}]},{"title":"Klassifizierung unterschiedlicher Ansätze zum Matching von Services","author":[{"last_name":"Petrausch","full_name":"Petrausch, Vanessa","first_name":"Vanessa"}],"date_created":"2017-10-17T12:42:33Z","date_updated":"2022-01-06T07:01:41Z","publisher":"Universität Paderborn","citation":{"ama":"Petrausch V. <i>Klassifizierung unterschiedlicher Ansätze zum Matching von Services</i>. Universität Paderborn; 2013.","ieee":"V. Petrausch, <i>Klassifizierung unterschiedlicher Ansätze zum Matching von Services</i>. Universität Paderborn, 2013.","chicago":"Petrausch, Vanessa. <i>Klassifizierung unterschiedlicher Ansätze zum Matching von Services</i>. Universität Paderborn, 2013.","apa":"Petrausch, V. (2013). <i>Klassifizierung unterschiedlicher Ansätze zum Matching von Services</i>. Universität Paderborn.","short":"V. Petrausch, Klassifizierung unterschiedlicher Ansätze zum Matching von Services, Universität Paderborn, 2013.","bibtex":"@book{Petrausch_2013, title={Klassifizierung unterschiedlicher Ansätze zum Matching von Services}, publisher={Universität Paderborn}, author={Petrausch, Vanessa}, year={2013} }","mla":"Petrausch, Vanessa. <i>Klassifizierung unterschiedlicher Ansätze zum Matching von Services</i>. Universität Paderborn, 2013."},"year":"2013","language":[{"iso":"ger"}],"user_id":"477","_id":"518","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","type":"bachelorsthesis"},{"abstract":[{"text":"In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \\epsilon-fraction of its serversby a DoS-attack, where \\epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers.","lang":"eng"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":554618,"access_level":"closed","file_id":"1299","file_name":"519-iris-spaa2013_01.pdf","date_updated":"2018-03-15T10:38:34Z","creator":"florida","date_created":"2018-03-15T10:38:34Z"}],"publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-15T10:38:34Z","_id":"519","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"user_id":"15504","year":"2013","page":"119-129","citation":{"ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–129.","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 119–29, 2013. <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>.","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:119-129. doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–29, doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>.","short":"M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.","bibtex":"@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }","apa":"Eikel, M., &#38; Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 119–129). <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>"},"has_accepted_license":"1","title":"IRIS: A Robust Information System Against Insider DoS-Attacks","doi":"10.1145/2486159.2486186","date_updated":"2022-01-06T07:01:42Z","date_created":"2017-10-17T12:42:33Z","author":[{"full_name":"Eikel, Martina","last_name":"Eikel","first_name":"Martina"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"_id":"520","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T10:38:04Z","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","type":"conference","abstract":[{"text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T10:38:04Z","creator":"florida","date_updated":"2018-03-15T10:38:04Z","access_level":"closed","file_name":"520-wetteinfocom2013.pdf","file_id":"1298","file_size":131502}],"date_updated":"2022-01-06T07:01:43Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2017-10-17T12:42:33Z","title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","doi":"10.1109/INFCOMW.2013.6970733","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"has_accepted_license":"1","year":"2013","page":"51-52","citation":{"ieee":"P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52.","chicago":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 51–52, 2013. <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>.","ama":"Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:51-52. doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>","apa":"Wette, P., &#38; Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 51–52). <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>","mla":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52, doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>.","short":"P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","bibtex":"@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }"}},{"citation":{"chicago":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","ieee":"H. Riebler, <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","ama":"Riebler H. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn; 2013.","apa":"Riebler, H. (2013). <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn.","mla":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","short":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013.","bibtex":"@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }"},"year":"2013","date_created":"2017-10-17T12:42:34Z","author":[{"first_name":"Heinrich","id":"8961","full_name":"Riebler, Heinrich","last_name":"Riebler"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:46Z","title":"Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs","type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"27"},{"_id":"518"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"521","language":[{"iso":"ger"}],"keyword":["coldboot"]},{"department":[{"_id":"79"}],"user_id":"14052","_id":"522","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"name":"SFB 901 - Subprojekt A1","_id":"5"}],"status":"public","type":"mastersthesis","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"}],"date_created":"2017-10-17T12:42:34Z","date_updated":"2022-01-06T07:01:47Z","publisher":"Universität Paderborn","citation":{"short":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013.","mla":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","bibtex":"@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }","apa":"Feldotto, M. (2013). <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn.","ama":"Feldotto M. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn; 2013.","ieee":"M. Feldotto, <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","chicago":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013."},"year":"2013"},{"has_accepted_license":"1","intvolume":"       161","page":"2563-2586","citation":{"short":"M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics 161 (2013) 2563–2586.","mla":"Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?” <i>Discrete Applied Mathematics</i>, vol. 161, no. 16–17, Elsevier, 2013, pp. 2563–86, doi:<a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">10.1016/j.dam.2013.05.022</a>.","bibtex":"@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers can selfish defenders catch?}, volume={161}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">10.1016/j.dam.2013.05.022</a>}, number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier}, author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky}, year={2013}, pages={2563–2586} }","apa":"Mavronicolas, M., Monien, B., &#38; Papadopoulou Lesta, V. (2013). How many attackers can selfish defenders catch? <i>Discrete Applied Mathematics</i>, <i>161</i>(16–17), 2563–2586. <a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">https://doi.org/10.1016/j.dam.2013.05.022</a>","chicago":"Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How Many Attackers Can Selfish Defenders Catch?” <i>Discrete Applied Mathematics</i> 161, no. 16–17 (2013): 2563–86. <a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">https://doi.org/10.1016/j.dam.2013.05.022</a>.","ieee":"M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers can selfish defenders catch?,” <i>Discrete Applied Mathematics</i>, vol. 161, no. 16–17, pp. 2563–2586, 2013.","ama":"Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish defenders catch? <i>Discrete Applied Mathematics</i>. 2013;161(16-17):2563-2586. doi:<a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">10.1016/j.dam.2013.05.022</a>"},"volume":161,"author":[{"last_name":"Mavronicolas","full_name":"Mavronicolas, Marios","first_name":"Marios"},{"first_name":"Burkhard","full_name":"Monien, Burkhard","last_name":"Monien"},{"last_name":"Papadopoulou Lesta","full_name":"Papadopoulou Lesta, Vicky","first_name":"Vicky"}],"date_updated":"2022-01-06T07:01:47Z","doi":"10.1016/j.dam.2013.05.022","type":"journal_article","status":"public","user_id":"42447","_id":"523","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T10:37:35Z","issue":"16-17","year":"2013","date_created":"2017-10-17T12:42:34Z","publisher":"Elsevier","title":"How many attackers can selfish defenders catch?","publication":"Discrete Applied Mathematics","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1127543,"file_name":"523-MMP13.pdf","file_id":"1297","access_level":"closed","date_updated":"2018-03-15T10:37:35Z","creator":"florida","date_created":"2018-03-15T10:37:35Z"}],"abstract":[{"text":"In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders; each defender wishes to (locally) maximize her own total fair share to the attackers extinguished due to her involvement (and possibly due to those of others). What is the maximum amount of protection achievable by a number of such defenders against a number of attackers while the system is in a Nash equilibrium? As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et al., 2008)[20], which provides the expected (inverse) proportion of attackers caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio matches a simple lower bound.We discover that the existence of Defense-Optimal Nash equilibria depends in a subtle way on how the number of defenders compares to two natural graph-theoretic thresholds we identify. In this vein, we obtain, through a combinatorial analysis of Nash equilibria, a collection of trade-off results:• When the number of defenders is either sufficiently small or sufficiently large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem is computationally tractable for a large number of defenders; the problem becomes NPNP-complete for a small number of defenders and the intractability is inherited from a previously unconsidered combinatorial problem in Fractional Graph Theory.• Perhaps paradoxically, there is a middle range of values for the number of defenders where Defense-Optimal Nash equilibria do not exist.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["040"]},{"status":"public","type":"preprint","file_date_updated":"2018-03-15T10:37:07Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"524","user_id":"15415","department":[{"_id":"63"}],"citation":{"ieee":"F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013.","chicago":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013.","ama":"Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013.","short":"F. Meyer auf der Heide, K. Swirkot, (2013).","bibtex":"@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }","mla":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. <i>Hierarchies in Local Distributed Decision</i>. arXiv, 2013.","apa":"Meyer auf der Heide, F., &#38; Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv."},"has_accepted_license":"1","date_updated":"2022-01-06T07:01:48Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Kamil","last_name":"Swirkot","full_name":"Swirkot, Kamil"}],"abstract":[{"text":"We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-15T10:37:07Z","date_updated":"2018-03-15T10:37:07Z","file_name":"524-paper_01.pdf","access_level":"closed","file_id":"1296","file_size":534906}],"ddc":["040"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1311.7229"]},"year":"2013","title":"Hierarchies in Local Distributed Decision","publisher":"arXiv","date_created":"2017-10-17T12:42:34Z"},{"date_created":"2017-10-17T12:42:34Z","author":[{"full_name":"Niklas Vinkemeier, Tim","last_name":"Niklas Vinkemeier","first_name":"Tim"}],"date_updated":"2022-01-06T07:01:48Z","publisher":"Universität Paderborn","title":"Haptics - Hadoop performance testing in concurrent job scenarios","citation":{"apa":"Niklas Vinkemeier, T. (2013). <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn.","bibtex":"@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }","short":"T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013.","mla":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","ieee":"T. Niklas Vinkemeier, <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn, 2013.","chicago":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","ama":"Niklas Vinkemeier T. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn; 2013."},"year":"2013","user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"525","type":"bachelorsthesis","status":"public"},{"title":"Greedy Network Creation With Heavy And Light Edges","date_created":"2017-10-17T12:42:35Z","author":[{"last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536","first_name":"Alexander"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:48Z","citation":{"apa":"Mäcker, A. (2013). <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn.","short":"A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität Paderborn, 2013.","mla":"Mäcker, Alexander. <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn, 2013.","bibtex":"@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013} }","ieee":"A. Mäcker, <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn, 2013.","chicago":"Mäcker, Alexander. <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn, 2013.","ama":"Mäcker A. <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn; 2013."},"year":"2013","user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"526","status":"public","type":"mastersthesis"},{"doi":"10.1145/2491411.2492405","title":"Fuzzy Service Matching in On-The-Fly Computing","author":[{"full_name":"Christin Platenius, Marie","last_name":"Christin Platenius","first_name":"Marie"}],"date_created":"2017-10-17T12:42:35Z","date_updated":"2022-01-06T07:01:48Z","citation":{"apa":"Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing. In <i>Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i> (pp. 715–718). <a href=\"https://doi.org/10.1145/2491411.2492405\">https://doi.org/10.1145/2491411.2492405</a>","bibtex":"@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in On-The-Fly Computing}, DOI={<a href=\"https://doi.org/10.1145/2491411.2492405\">10.1145/2491411.2492405</a>}, booktitle={Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)}, author={Christin Platenius, Marie}, year={2013}, pages={715–718} }","short":"M. Christin Platenius, in: Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–718.","mla":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>, 2013, pp. 715–18, doi:<a href=\"https://doi.org/10.1145/2491411.2492405\">10.1145/2491411.2492405</a>.","chicago":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” In <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>, 715–18, 2013. <a href=\"https://doi.org/10.1145/2491411.2492405\">https://doi.org/10.1145/2491411.2492405</a>.","ieee":"M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” in <i>Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>, 2013, pp. 715–718.","ama":"Christin Platenius M. Fuzzy Service Matching in On-The-Fly Computing. In: <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>. ; 2013:715-718. doi:<a href=\"https://doi.org/10.1145/2491411.2492405\">10.1145/2491411.2492405</a>"},"page":" 715-718 ","year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T10:36:38Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"76"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"527","file":[{"date_updated":"2018-03-15T10:36:38Z","creator":"florida","date_created":"2018-03-15T10:36:38Z","file_size":730490,"file_name":"527-p715-platenius.pdf","access_level":"closed","file_id":"1295","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"In the future vision of software engineering, services from world-wide markets are composed automated in order to build custom-made systems.Supporting such scenarios requires an adequate service matching approach.Many existing approaches do not fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely (1) comprehensiveness, i.e., the consideration of different service aspects that cover not only functional properties, but also non-functional properties and (2) fuzzy matching, i.e., the ability to deliver gradual results in order to cope with a certain extent of uncertainty, incompleteness, and tolerance ranges.In this paper, I present a fuzzy matching process that distinguishes between different fuzziness sources and leverages fuzziness in different matching steps which consider different service aspects, e.g., behavior and quality properties. "}],"type":"conference","publication":"Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)"},{"doi":"10.1145/2465449.2465452","title":"Executing Reconfigurations in Hierarchical Component Architectures","date_created":"2017-10-17T12:42:35Z","author":[{"last_name":"Heinzemann","full_name":"Heinzemann, Christian","first_name":"Christian"},{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"}],"date_updated":"2022-01-06T07:01:49Z","citation":{"ama":"Heinzemann C, Becker S. Executing Reconfigurations in Hierarchical Component Architectures. In: <i>Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)</i>. ; 2013:3-12. doi:<a href=\"https://doi.org/10.1145/2465449.2465452\">10.1145/2465449.2465452</a>","ieee":"C. Heinzemann and S. Becker, “Executing Reconfigurations in Hierarchical Component Architectures,” in <i>Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)</i>, 2013, pp. 3–12.","chicago":"Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” In <i>Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)</i>, 3–12, 2013. <a href=\"https://doi.org/10.1145/2465449.2465452\">https://doi.org/10.1145/2465449.2465452</a>.","short":"C. Heinzemann, S. Becker, in: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.","bibtex":"@inproceedings{Heinzemann_Becker_2013, title={Executing Reconfigurations in Hierarchical Component Architectures}, DOI={<a href=\"https://doi.org/10.1145/2465449.2465452\">10.1145/2465449.2465452</a>}, booktitle={Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)}, author={Heinzemann, Christian and Becker, Steffen}, year={2013}, pages={3–12} }","mla":"Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” <i>Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)</i>, 2013, pp. 3–12, doi:<a href=\"https://doi.org/10.1145/2465449.2465452\">10.1145/2465449.2465452</a>.","apa":"Heinzemann, C., &#38; Becker, S. (2013). Executing Reconfigurations in Hierarchical Component Architectures. In <i>Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)</i> (pp. 3–12). <a href=\"https://doi.org/10.1145/2465449.2465452\">https://doi.org/10.1145/2465449.2465452</a>"},"page":"3-12","year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T10:35:39Z","ddc":["040"],"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"529","file":[{"access_level":"closed","file_id":"1293","file_name":"529-p3-heinzemann.pdf","file_size":541849,"date_created":"2018-03-15T10:35:39Z","creator":"florida","date_updated":"2018-03-15T10:35:39Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Mechatronic systems reconfigure the structure of their software architecture, e.g., to avoid hazardous situations or to optimize operational conditions like minimizing their energy consumption. As software architectures are typically build on components, reconfiguration actions need to respect the component structure. This structure should be hierarchical to enable encapsulated components. While many reconfiguration approaches for embedded real-time systems allow the use of hierarchically embedded components, i.e., horizontal composition, none of them offers a modeling and verification solution to take hierarchical composition, i.e., encapsulation, into account. In this paper, we present an extension to our existing modeling language, MechatronicUML, to enable safe hierarchical reconfigurations. The two main extensions are (a) an adapted variant of the two-phase commit protocol to initiate reconfigurations which maintain component encapsulation and (b) a timed model checking verification approach for instances of our model. We illustrate our approach on a case study in the area of smart railway systems by showing two different use cases of our approach and the verification of their safety properties."}],"type":"conference","publication":"Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)"},{"status":"public","type":"bachelorsthesis","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"530","user_id":"15504","year":"2013","citation":{"ama":"Buse D. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>. Universität Paderborn; 2013.","chicago":"Buse, Dominik. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>. Universität Paderborn, 2013.","ieee":"D. Buse, <i>Entwurf kooperativer Verhaltensweisen heterogener Roboter</i>. Universität Paderborn, 2013.","bibtex":"@book{Buse_2013, title={Entwurf kooperativer Verhaltensweisen heterogener Roboter}, publisher={Universität Paderborn}, author={Buse, Dominik}, year={2013} }","mla":"Buse, Dominik. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>. Universität Paderborn, 2013.","short":"D. Buse, Entwurf Kooperativer Verhaltensweisen Heterogener Roboter, Universität Paderborn, 2013.","apa":"Buse, D. (2013). <i>Entwurf kooperativer Verhaltensweisen heterogener Roboter</i>. Universität Paderborn."},"title":"Entwurf kooperativer Verhaltensweisen heterogener Roboter","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:49Z","author":[{"last_name":"Buse","full_name":"Buse, Dominik","first_name":"Dominik"}],"date_created":"2017-10-17T12:42:35Z"},{"title":"Entwurf eines datenschutzgerechten Reputationssystems","date_created":"2017-10-17T12:42:35Z","author":[{"full_name":"Lutters, Sascha","last_name":"Lutters","first_name":"Sascha"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:49Z","citation":{"bibtex":"@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems}, publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }","mla":"Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013.","short":"S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität Paderborn, 2013.","apa":"Lutters, S. (2013). <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn.","ama":"Lutters S. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn; 2013.","chicago":"Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013.","ieee":"S. Lutters, <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013."},"year":"2013","language":[{"iso":"ger"}],"user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"531","status":"public","type":"mastersthesis"},{"language":[{"iso":"ger"}],"title":"Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme","date_created":"2017-10-17T12:42:36Z","author":[{"first_name":"Hendrik","full_name":"Hilleckes, Hendrik","last_name":"Hilleckes"}],"user_id":"477","date_updated":"2022-01-06T07:01:49Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"publisher":"Universität Paderborn","_id":"532","citation":{"apa":"Hilleckes, H. (2013). <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn.","mla":"Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","bibtex":"@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn}, author={Hilleckes, Hendrik}, year={2013} }","short":"H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme, Universität Paderborn, 2013.","chicago":"Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","ieee":"H. Hilleckes, <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","ama":"Hilleckes H. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn; 2013."},"status":"public","year":"2013","type":"bachelorsthesis"},{"title":"Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung","date_created":"2017-10-17T12:42:36Z","author":[{"first_name":"Richard","full_name":"Borkowski, Richard","last_name":"Borkowski"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:49Z","citation":{"bibtex":"@book{Borkowski_2013, title={Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung}, publisher={Universität Paderborn}, author={Borkowski, Richard}, year={2013} }","mla":"Borkowski, Richard. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn, 2013.","short":"R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung, Universität Paderborn, 2013.","apa":"Borkowski, R. (2013). <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn.","ama":"Borkowski R. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn; 2013.","ieee":"R. Borkowski, <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn, 2013.","chicago":"Borkowski, Richard. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn, 2013."},"year":"2013","language":[{"iso":"ger"}],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"533","status":"public","type":"bachelorsthesis"},{"status":"public","type":"mastersthesis","user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"534","citation":{"mla":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }","short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","apa":"Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn.","ieee":"S. Satya, <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn, 2013.","chicago":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","ama":"Satya S. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn; 2013."},"year":"2013","title":"Emulating Wavelength Division Multiplexing using Openflow","author":[{"first_name":"Suhas","last_name":"Satya","full_name":"Satya, Suhas"}],"date_created":"2017-10-17T12:42:36Z","date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn"}]