[{"date_updated":"2022-01-06T06:59:30Z","publisher":"Springer","date_created":"2018-07-23T13:36:48Z","author":[{"first_name":"Michael","last_name":"Goller","orcid":"0000-0002-2820-9178","id":"30984","full_name":"Goller, Michael"},{"last_name":"Harteis","orcid":"https://orcid.org/0000-0002-3570-7626","id":"27503","full_name":"Harteis, Christian","first_name":"Christian"}],"title":"Employing agency in academic settings: Doctoral students shaping their own experiences","year":"2014","place":"Dordrecht","page":"189--210","citation":{"ama":"Goller M, Harteis C. Employing agency in academic settings: Doctoral students shaping their own experiences. In: Harteis C, Rausch A, Seifried J, eds. <i>Discourses on Professional Learning</i>. Dordrecht: Springer; 2014:189--210.","ieee":"M. Goller and C. Harteis, “Employing agency in academic settings: Doctoral students shaping their own experiences,” in <i>Discourses on Professional Learning</i>, C. Harteis, A. Rausch, and J. Seifried, Eds. Dordrecht: Springer, 2014, pp. 189--210.","chicago":"Goller, Michael, and Christian Harteis. “Employing Agency in Academic Settings: Doctoral Students Shaping Their Own Experiences.” In <i>Discourses on Professional Learning</i>, edited by Christian Harteis, Andreas Rausch, and Jürgen Seifried, 189--210. Dordrecht: Springer, 2014.","short":"M. Goller, C. Harteis, in: C. Harteis, A. Rausch, J. Seifried (Eds.), Discourses on Professional Learning, Springer, Dordrecht, 2014, pp. 189--210.","mla":"Goller, Michael, and Christian Harteis. “Employing Agency in Academic Settings: Doctoral Students Shaping Their Own Experiences.” <i>Discourses on Professional Learning</i>, edited by Christian Harteis et al., Springer, 2014, pp. 189--210.","bibtex":"@inbook{Goller_Harteis_2014, place={Dordrecht}, title={Employing agency in academic settings: Doctoral students shaping their own experiences}, booktitle={Discourses on Professional Learning}, publisher={Springer}, author={Goller, Michael and Harteis, Christian}, editor={Harteis, Christian and Rausch, Andreas and Seifried, JürgenEditors}, year={2014}, pages={189--210} }","apa":"Goller, M., &#38; Harteis, C. (2014). Employing agency in academic settings: Doctoral students shaping their own experiences. In C. Harteis, A. Rausch, &#38; J. Seifried (Eds.), <i>Discourses on Professional Learning</i> (pp. 189--210). Dordrecht: Springer."},"_id":"3685","department":[{"_id":"452"}],"user_id":"27503","publication":"Discourses on Professional Learning","type":"book_chapter","editor":[{"first_name":"Christian","full_name":"Harteis, Christian","last_name":"Harteis"},{"first_name":"Andreas","full_name":"Rausch, Andreas","last_name":"Rausch"},{"first_name":"Jürgen","full_name":"Seifried, Jürgen","last_name":"Seifried"}],"status":"public"},{"user_id":"27503","department":[{"_id":"452"}],"_id":"3686","status":"public","editor":[{"last_name":"Halttunen","full_name":"Halttunen, Timo","first_name":"Timo"},{"last_name":"Koivisto","full_name":"Koivisto, Mari","first_name":"Mari"},{"first_name":"Stephen","last_name":"Billett","full_name":"Billett, Stephen"}],"type":"book_chapter","publication":"Promoting, assessing, recognizing and certifying lifelong learning","title":"New skills for new jobs: Work agency as a necessary condition for successful lifelong learning","author":[{"orcid":"https://orcid.org/0000-0002-3570-7626","last_name":"Harteis","full_name":"Harteis, Christian","id":"27503","first_name":"Christian"},{"first_name":"Michael","last_name":"Goller","orcid":"0000-0002-2820-9178","full_name":"Goller, Michael","id":"30984"}],"date_created":"2018-07-23T13:38:10Z","date_updated":"2022-01-06T06:59:30Z","publisher":"Springer","citation":{"chicago":"Harteis, Christian, and Michael Goller. “New Skills for New Jobs: Work Agency as a Necessary Condition for Successful Lifelong Learning.” In <i>Promoting, Assessing, Recognizing and Certifying Lifelong Learning</i>, edited by Timo Halttunen, Mari Koivisto, and Stephen Billett, 37--56. Dordrecht: Springer, 2014.","ieee":"C. Harteis and M. Goller, “New skills for new jobs: Work agency as a necessary condition for successful lifelong learning,” in <i>Promoting, assessing, recognizing and certifying lifelong learning</i>, T. Halttunen, M. Koivisto, and S. Billett, Eds. Dordrecht: Springer, 2014, pp. 37--56.","ama":"Harteis C, Goller M. New skills for new jobs: Work agency as a necessary condition for successful lifelong learning. In: Halttunen T, Koivisto M, Billett S, eds. <i>Promoting, Assessing, Recognizing and Certifying Lifelong Learning</i>. Dordrecht: Springer; 2014:37--56.","apa":"Harteis, C., &#38; Goller, M. (2014). New skills for new jobs: Work agency as a necessary condition for successful lifelong learning. In T. Halttunen, M. Koivisto, &#38; S. Billett (Eds.), <i>Promoting, assessing, recognizing and certifying lifelong learning</i> (pp. 37--56). Dordrecht: Springer.","mla":"Harteis, Christian, and Michael Goller. “New Skills for New Jobs: Work Agency as a Necessary Condition for Successful Lifelong Learning.” <i>Promoting, Assessing, Recognizing and Certifying Lifelong Learning</i>, edited by Timo Halttunen et al., Springer, 2014, pp. 37--56.","bibtex":"@inbook{Harteis_Goller_2014, place={Dordrecht}, title={New skills for new jobs: Work agency as a necessary condition for successful lifelong learning}, booktitle={Promoting, assessing, recognizing and certifying lifelong learning}, publisher={Springer}, author={Harteis, Christian and Goller, Michael}, editor={Halttunen, Timo and Koivisto, Mari and Billett, StephenEditors}, year={2014}, pages={37--56} }","short":"C. Harteis, M. Goller, in: T. Halttunen, M. Koivisto, S. Billett (Eds.), Promoting, Assessing, Recognizing and Certifying Lifelong Learning, Springer, Dordrecht, 2014, pp. 37--56."},"page":"37--56","place":"Dordrecht","year":"2014"},{"title":"RSA-Full Domain Hash Revisited","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:30Z","date_created":"2017-10-17T12:42:04Z","author":[{"first_name":"Timo","last_name":"Rath","full_name":"Rath, Timo"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"year":"2014","citation":{"ama":"Rath T. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn; 2014.","chicago":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","ieee":"T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","apa":"Rath, T. (2014). <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn.","mla":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","short":"T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.","bibtex":"@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität Paderborn}, author={Rath, Timo}, year={2014} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"369","user_id":"477","department":[{"_id":"64"}],"abstract":[{"lang":"eng","text":"RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren (existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis wird unter anderem in der Vorlesung Einf{\\\"u}hrung in die Kryptographie vorgestellt. Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \\nicefrac{1}{q_{s}}(wobei q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\\\"u}r die Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der Ver{\\\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \\nicefrac{1}{q_{s}}optimal ist. Erst zehn Jahre sp{\\\"a}ter offenbarten die Autoren von [3] einen Fehler in [2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\\\"a}rkeren Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\\\"u}bertragen und sind somit von großer Bedeutung f{\\\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete Techniken n{\\\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen Auswirkungen f{\\\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S. Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT 2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553, 2012."}],"status":"public","type":"bachelorsthesis"},{"title":"The challenge of assessing the market value of private companies using a standardised combination method for tax purposes--Lessons to be learnt from past experience","date_updated":"2022-01-06T06:59:30Z","date_created":"2018-07-25T07:53:11Z","author":[{"last_name":"Müller","id":"1245","full_name":"Müller, Jens","first_name":"Jens"}],"year":"2014","page":"117--141","jel":["H2","M41"],"citation":{"short":"J. Müller, European Accounting Review (2014) 117--141.","mla":"Müller, Jens. “The Challenge of Assessing the Market Value of Private Companies Using a Standardised Combination Method for Tax Purposes--Lessons to Be Learnt from Past Experience.” <i>European Accounting Review</i>, no. 1, 2014, pp. 117--141.","bibtex":"@article{Müller_2014, title={The challenge of assessing the market value of private companies using a standardised combination method for tax purposes--Lessons to be learnt from past experience}, number={1}, journal={European Accounting Review}, author={Müller, Jens}, year={2014}, pages={117--141} }","apa":"Müller, J. (2014). The challenge of assessing the market value of private companies using a standardised combination method for tax purposes--Lessons to be learnt from past experience. <i>European Accounting Review</i>, (1), 117--141.","chicago":"Müller, Jens. “The Challenge of Assessing the Market Value of Private Companies Using a Standardised Combination Method for Tax Purposes--Lessons to Be Learnt from Past Experience.” <i>European Accounting Review</i>, no. 1 (2014): 117--141.","ieee":"J. Müller, “The challenge of assessing the market value of private companies using a standardised combination method for tax purposes--Lessons to be learnt from past experience,” <i>European Accounting Review</i>, no. 1, pp. 117--141, 2014.","ama":"Müller J. The challenge of assessing the market value of private companies using a standardised combination method for tax purposes--Lessons to be learnt from past experience. <i>European Accounting Review</i>. 2014;(1):117--141."},"issue":"1","keyword":["Challenge of Assessing","Tax Purposes"],"article_type":"original","language":[{"iso":"eng"}],"_id":"3699","department":[{"_id":"189"}],"user_id":"48187","abstract":[{"text":"When taxes on capital or wealth are levied, in most countries companies have to be assessed in terms of their market value (MV). Estimating the MV of private companies for tax purposes is a challenging task for tax authorities as MVs are not available. In this study, I empirically analyse to what extent an accounting-based tax valuation method for private companies, a simplified residual income model, succeeds in matching the MV. I refer to the mandatory Standardised Combination Model that is a special case of methods commonly used in several countries. In the absence of market prices for private companies, I use a sample of small German public companies as a proxy. I validate this approach using a sensitivity analysis that involves matching the sample of public companies with that of private companies. The results imply that the mandatory Standardised Combination Model leads to a severe unequal treatment not only between public and private companies but also among private companies across and within industries. Furthermore, I simulate the effects of variation in the key parameters and highlight their impact on the approximation quality of the Standardised Combination Method. The findings are relevant to tax reform discussions as well as to tax policy-makers and practitioners in many countries.","lang":"eng"}],"status":"public","publication":"European Accounting Review","type":"journal_article"},{"has_accepted_license":"1","citation":{"ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling. In: <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>. ; 2014:352-360. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–360.","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.” In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 352–60, 2014. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","mla":"Harks, Tobias, et al. “Routing Games with Progressive Filling.” <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–60, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","bibtex":"@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games with Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.","apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2014). Routing Games with Progressive Filling. In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i> (pp. 352–360). <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>"},"page":"352-360","year":"2014","author":[{"last_name":"Harks","full_name":"Harks, Tobias","first_name":"Tobias"},{"first_name":"Martin","last_name":"Höfer","full_name":"Höfer, Martin"},{"first_name":"Kevin","full_name":"Schewior, Kevin","last_name":"Schewior"},{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:30Z","doi":"10.1109/TNET.2015.2468571","title":"Routing Games with Progressive Filling","type":"conference","publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:17:04Z","creator":"florida","date_updated":"2018-03-20T07:17:04Z","file_name":"370-HHSS14.pdf","access_level":"closed","file_id":"1402","file_size":179583}],"status":"public","abstract":[{"text":"Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived. ","lang":"eng"}],"user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"370","file_date_updated":"2018-03-20T07:17:04Z","language":[{"iso":"eng"}],"ddc":["040"]},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":269941,"access_level":"closed","file_name":"371-RoBuSt-OPODIS.pdf","file_id":"1401","date_updated":"2018-03-20T07:16:32Z","date_created":"2018-03-20T07:16:32Z","creator":"florida"}],"status":"public","abstract":[{"text":"In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \\gamma n^{1/\\log\\log n} crashed servers, with \\gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)","file_date_updated":"2018-03-20T07:16:32Z","ddc":["040"],"series_title":"LNCS","user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"371","citation":{"apa":"Scheideler, C., Setzer, A., &#38; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 107--122). <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>","bibtex":"@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt: A Crash-Failure-Resistant Distributed Storage System}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>}, booktitle={Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel, Martina}, year={2014}, pages={107--122}, collection={LNCS} }","mla":"Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122, doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>.","short":"C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.","ama":"Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In: <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2014:107--122. doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>","ieee":"C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant Distributed Storage System,” in <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122.","chicago":"Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 107--122. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>."},"page":"107--122","year":"2014","has_accepted_license":"1","doi":"10.1007/978-3-319-14472-6_8","title":"RoBuSt: A Crash-Failure-Resistant Distributed Storage System","date_created":"2017-10-17T12:42:04Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"},{"first_name":"Martina","full_name":"Eikel, Martina","last_name":"Eikel"}],"date_updated":"2022-01-06T06:59:31Z"},{"type":"book_chapter","publication":"Herausforderung kompetenzorientierte Hochschule","editor":[{"full_name":"Arnold, Rolf","last_name":"Arnold","first_name":"Rolf"},{"first_name":"K","full_name":"Wolf, K","last_name":"Wolf"}],"status":"public","_id":"3718","user_id":"27503","department":[{"_id":"452"}],"year":"2014","place":"Hohengeheren","citation":{"ama":"Harteis C. Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik. In: Arnold R, Wolf K, eds. <i>Herausforderung Kompetenzorientierte Hochschule</i>. Hohengeheren: Schneider; 2014:189-211.","chicago":"Harteis, Christian. “Auswirkungen Des Bologna-Prozesses: Eine Expertise Der Hochschuldidaktik.” In <i>Herausforderung Kompetenzorientierte Hochschule</i>, edited by Rolf Arnold and K Wolf, 189–211. Hohengeheren: Schneider, 2014.","ieee":"C. Harteis, “Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik,” in <i>Herausforderung kompetenzorientierte Hochschule</i>, R. Arnold and K. Wolf, Eds. Hohengeheren: Schneider, 2014, pp. 189–211.","apa":"Harteis, C. (2014). Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik. In R. Arnold &#38; K. Wolf (Eds.), <i>Herausforderung kompetenzorientierte Hochschule</i> (pp. 189–211). Hohengeheren: Schneider.","mla":"Harteis, Christian. “Auswirkungen Des Bologna-Prozesses: Eine Expertise Der Hochschuldidaktik.” <i>Herausforderung Kompetenzorientierte Hochschule</i>, edited by Rolf Arnold and K Wolf, Schneider, 2014, pp. 189–211.","short":"C. Harteis, in: R. Arnold, K. Wolf (Eds.), Herausforderung Kompetenzorientierte Hochschule, Schneider, Hohengeheren, 2014, pp. 189–211.","bibtex":"@inbook{Harteis_2014, place={Hohengeheren}, title={Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik}, booktitle={Herausforderung kompetenzorientierte Hochschule}, publisher={Schneider}, author={Harteis, Christian}, editor={Arnold, Rolf and Wolf, KEditors}, year={2014}, pages={189–211} }"},"page":"189-211","publisher":"Schneider","date_updated":"2022-01-06T06:59:31Z","date_created":"2018-07-26T10:26:26Z","author":[{"first_name":"Christian","full_name":"Harteis, Christian","id":"27503","orcid":"https://orcid.org/0000-0002-3570-7626","last_name":"Harteis"}],"title":"Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik"},{"publication":"Handbook of intuition research methodology","type":"book_chapter","status":"public","editor":[{"first_name":"Martha","full_name":"Sinclair, Martha","last_name":"Sinclair"}],"department":[{"_id":"452"}],"user_id":"27503","_id":"3719","page":"116-129","citation":{"apa":"Harteis, C. (2014). Investigating intuition under the perpective of expertise: Experiences from two experimental studies. In M. Sinclair (Ed.), <i>Handbook of intuition research methodology</i> (pp. 116–129). Cheltenham: Edward Elgar.","mla":"Harteis, Christian. “Investigating Intuition under the Perpective of Expertise: Experiences from Two Experimental Studies.” <i>Handbook of Intuition Research Methodology</i>, edited by Martha Sinclair, Edward Elgar, 2014, pp. 116–29.","bibtex":"@inbook{Harteis_2014, place={Cheltenham}, title={Investigating intuition under the perpective of expertise: Experiences from two experimental studies}, booktitle={Handbook of intuition research methodology}, publisher={Edward Elgar}, author={Harteis, Christian}, editor={Sinclair, MarthaEditor}, year={2014}, pages={116–129} }","short":"C. Harteis, in: M. Sinclair (Ed.), Handbook of Intuition Research Methodology, Edward Elgar, Cheltenham, 2014, pp. 116–129.","ama":"Harteis C. Investigating intuition under the perpective of expertise: Experiences from two experimental studies. In: Sinclair M, ed. <i>Handbook of Intuition Research Methodology</i>. Cheltenham: Edward Elgar; 2014:116-129.","chicago":"Harteis, Christian. “Investigating Intuition under the Perpective of Expertise: Experiences from Two Experimental Studies.” In <i>Handbook of Intuition Research Methodology</i>, edited by Martha Sinclair, 116–29. Cheltenham: Edward Elgar, 2014.","ieee":"C. Harteis, “Investigating intuition under the perpective of expertise: Experiences from two experimental studies,” in <i>Handbook of intuition research methodology</i>, M. Sinclair, Ed. Cheltenham: Edward Elgar, 2014, pp. 116–129."},"year":"2014","place":"Cheltenham","author":[{"first_name":"Christian","id":"27503","full_name":"Harteis, Christian","orcid":"https://orcid.org/0000-0002-3570-7626","last_name":"Harteis"}],"date_created":"2018-07-26T10:28:02Z","publisher":"Edward Elgar","date_updated":"2022-01-06T06:59:31Z","title":"Investigating intuition under the perpective of expertise: Experiences from two experimental studies"},{"page":"47--52","citation":{"short":"M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing, 2014, pp. 47--52.","mla":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 2014, pp. 47--52, doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>.","bibtex":"@inproceedings{Keller_Karl_2014, title={Response Time-Optimized Distributed Cloud Resource Allocation}, DOI={<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>}, booktitle={Proceedings of the SIGCOMM workshop on Distributed cloud computing}, author={Keller, Matthias and Karl, Holger}, year={2014}, pages={47--52} }","apa":"Keller, M., &#38; Karl, H. (2014). Response Time-Optimized Distributed Cloud Resource Allocation. In <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i> (pp. 47--52). <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>","chicago":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” In <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 47--52, 2014. <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>.","ieee":"M. Keller and H. Karl, “Response Time-Optimized Distributed Cloud Resource Allocation,” in <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i>, 2014, pp. 47--52.","ama":"Keller M, Karl H. Response Time-Optimized Distributed Cloud Resource Allocation. In: <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>. ; 2014:47--52. doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>"},"year":"2014","has_accepted_license":"1","doi":"10.1145/2627566.2627570","title":"Response Time-Optimized Distributed Cloud Resource Allocation","author":[{"full_name":"Keller, Matthias","last_name":"Keller","first_name":"Matthias"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:31Z","status":"public","file":[{"file_size":804240,"file_id":"5259","file_name":"p47-keller.pdf","access_level":"closed","date_updated":"2018-11-02T14:00:54Z","date_created":"2018-11-02T14:00:54Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"In the near future many more compute resources will be available at different geographical locations. To minimize the response time of requests, application servers closer to the user can hence be used to shorten network round trip times. However, this advantage is neutralized if the used data centre is highly loaded as the processing time of re- quests is important as well. We model the request response time as the network round trip time plus the processing time at a data centre.We present a capacitated facility location problem formal- ization where the processing time is modelled as the sojourn time of a queueing model. We discuss the Pareto trade-off between the number of used data centres and the resulting response time. For example, using fewer data centres could cut expenses but results in high utilization, high response time, and smaller revenues.Previous work presented a non-linear cost function. We prove its convexity and exploit this property in two ways: First, we transform the convex model into a linear model while controlling the maximum approximation error. Sec- ond, we used a convex solver instead of a slower non-linear solver. Numerical results on network topologies exemplify our work."}],"publication":"Proceedings of the SIGCOMM workshop on Distributed cloud computing","type":"conference","file_date_updated":"2018-11-02T14:00:54Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"75"}],"user_id":"477","_id":"372","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"citation":{"short":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014.","bibtex":"@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }","mla":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","apa":"Pahl, D. (2014). <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn.","ieee":"D. Pahl, <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","chicago":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","ama":"Pahl D. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn; 2014."},"year":"2014","title":"Reputationssysteme für zusammengesetzte Dienstleistungen","author":[{"full_name":"Pahl, David","last_name":"Pahl","first_name":"David"}],"supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:42:04Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:31Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"373","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"374","user_id":"15504","series_title":"LNCS","ddc":["040"],"file_date_updated":"2018-03-20T07:15:59Z","type":"conference","publication":"Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications","abstract":[{"text":"Run-time reconfiguration provides an opportunity to increase performance, reduce cost and improve energy efficiency in FPGA-based systems. However, run-time reconfigurable systems are more complex to implement than static only systems. This increases time to market, and introduces run-time overhead into the system. Our research aims to raise the abstraction level to develop run-time reconfigurable systems. We present operating system extensions which enable seamless integration of run-time reconfigurable hardware threads into applications. To improve resource utilization, the hardware threads are placed on a fine granularity tile grid. We take advantage of a relocatable module placer targeting modern FPGA to manage the reconfigurable area. The module placer accurately models the FPGA resources to compute feasible placement locations for the hardware threads at run-time. Finally, we evaluate our work by means of a case study that consists of a synthetic application to validate the functionality and performance of the implementation. The results show a reduction in reconfiguration time of up to 42% and more than double resource utilization.","lang":"eng"}],"editor":[{"first_name":"Diana","full_name":"Goehringer, Diana","last_name":"Goehringer"},{"first_name":"MarcoDomenico","full_name":"Santambrogio, MarcoDomenico","last_name":"Santambrogio"},{"first_name":"JoãoM.P.","full_name":"Cardoso, JoãoM.P.","last_name":"Cardoso"},{"full_name":"Bertels, Koen","last_name":"Bertels","first_name":"Koen"}],"file":[{"creator":"florida","date_created":"2018-03-20T07:15:59Z","date_updated":"2018-03-20T07:15:59Z","file_name":"374-2014_wold_arc.pdf","file_id":"1400","access_level":"closed","file_size":818625,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","date_updated":"2022-01-06T06:59:32Z","date_created":"2017-10-17T12:42:05Z","author":[{"first_name":"Alexander","full_name":"Wold, Alexander","last_name":"Wold"},{"first_name":"Andreas","full_name":"Agne, Andreas","last_name":"Agne"},{"first_name":"Jim","full_name":"Torresen, Jim","last_name":"Torresen"}],"title":"Relocatable Hardware Threads in Run-Time Reconfigurable Systems","doi":"10.1007/978-3-319-05960-0_6","has_accepted_license":"1","year":"2014","citation":{"ama":"Wold A, Agne A, Torresen J. Relocatable Hardware Threads in Run-Time Reconfigurable Systems. In: Goehringer D, Santambrogio M, Cardoso JP, Bertels K, eds. <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>. LNCS. ; 2014:61-72. doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>","chicago":"Wold, Alexander, Andreas Agne, and Jim Torresen. “Relocatable Hardware Threads in Run-Time Reconfigurable Systems.” In <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, edited by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and Koen Bertels, 61–72. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">https://doi.org/10.1007/978-3-319-05960-0_6</a>.","ieee":"A. Wold, A. Agne, and J. Torresen, “Relocatable Hardware Threads in Run-Time Reconfigurable Systems,” in <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, 2014, pp. 61–72.","apa":"Wold, A., Agne, A., &#38; Torresen, J. (2014). Relocatable Hardware Threads in Run-Time Reconfigurable Systems. In D. Goehringer, M. Santambrogio, J. P. Cardoso, &#38; K. Bertels (Eds.), <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i> (pp. 61–72). <a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">https://doi.org/10.1007/978-3-319-05960-0_6</a>","short":"A. Wold, A. Agne, J. Torresen, in: D. Goehringer, M. Santambrogio, J.P. Cardoso, K. Bertels (Eds.), Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications, 2014, pp. 61–72.","mla":"Wold, Alexander, et al. “Relocatable Hardware Threads in Run-Time Reconfigurable Systems.” <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, edited by Diana Goehringer et al., 2014, pp. 61–72, doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>.","bibtex":"@inproceedings{Wold_Agne_Torresen_2014, series={LNCS}, title={Relocatable Hardware Threads in Run-Time Reconfigurable Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>}, booktitle={Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications}, author={Wold, Alexander and Agne, Andreas and Torresen, Jim}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso, JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={61–72}, collection={LNCS} }"},"page":"61-72"},{"citation":{"bibtex":"@article{von Detten_Platenius_Becker_2014, title={Reengineering Component-Based Software Systems with Archimetrix}, DOI={<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>}, number={4}, journal={Journal of Software and Systems Modeling}, publisher={Springer}, author={von Detten, Markus and Platenius, Marie Christin and Becker, Steffen}, year={2014}, pages={1239--1268} }","short":"M. von Detten, M.C. Platenius, S. Becker, Journal of Software and Systems Modeling (2014) 1239--1268.","mla":"von Detten, Markus, et al. “Reengineering Component-Based Software Systems with Archimetrix.” <i>Journal of Software and Systems Modeling</i>, no. 4, Springer, 2014, pp. 1239--1268, doi:<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>.","apa":"von Detten, M., Platenius, M. C., &#38; Becker, S. (2014). Reengineering Component-Based Software Systems with Archimetrix. <i>Journal of Software and Systems Modeling</i>, (4), 1239--1268. <a href=\"https://doi.org/10.1007/s10270-013-0341-9\">https://doi.org/10.1007/s10270-013-0341-9</a>","ama":"von Detten M, Platenius MC, Becker S. Reengineering Component-Based Software Systems with Archimetrix. <i>Journal of Software and Systems Modeling</i>. 2014;(4):1239--1268. doi:<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>","ieee":"M. von Detten, M. C. Platenius, and S. Becker, “Reengineering Component-Based Software Systems with Archimetrix,” <i>Journal of Software and Systems Modeling</i>, no. 4, pp. 1239--1268, 2014.","chicago":"Detten, Markus von, Marie Christin Platenius, and Steffen Becker. “Reengineering Component-Based Software Systems with Archimetrix.” <i>Journal of Software and Systems Modeling</i>, no. 4 (2014): 1239--1268. <a href=\"https://doi.org/10.1007/s10270-013-0341-9\">https://doi.org/10.1007/s10270-013-0341-9</a>."},"page":"1239--1268","year":"2014","issue":"4","has_accepted_license":"1","doi":"10.1007/s10270-013-0341-9","title":"Reengineering Component-Based Software Systems with Archimetrix","author":[{"first_name":"Markus","last_name":"von Detten","full_name":"von Detten, Markus"},{"first_name":"Marie Christin","full_name":"Platenius, Marie Christin","last_name":"Platenius"},{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"}],"date_created":"2017-10-17T12:42:05Z","publisher":"Springer","date_updated":"2022-01-06T06:59:34Z","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":3356333,"access_level":"closed","file_id":"1399","file_name":"375-sosym.pdf","date_updated":"2018-03-20T07:15:26Z","date_created":"2018-03-20T07:15:26Z","creator":"florida"}],"status":"public","abstract":[{"lang":"eng","text":"Many software development, planning, or analysis tasks require an up-to-date software architecture documentation. However, this documentation is often outdated, unavailable, or at least not available as a formal model which analysis tools could use. Reverse engineering methods try to fill this gap. However, as they process the system’s source code, they are easily misled by design deficiencies (e.g., violations of component encapsulation) which leaked into the code during the system’s evolution. Despite the high impact of design deficiencies on the quality of the resulting software architecture models, none of the surveyed related works is able to cope with them during the reverse engineering process. Therefore, we have developed the Archimetrix approach which semi-automatically recovers the system’s concrete architecture in a formal model while simultaneously detecting and removing design deficiencies. We have validated Archi metrix on a case-study system and two implementation variants of the CoCoME benchmark system. Results show that the removal of relevant design deficiencies leads to an architecture model which more closely matches the system’s conceptual architecture."}],"type":"journal_article","publication":"Journal of Software and Systems Modeling","file_date_updated":"2018-03-20T07:15:26Z","ddc":["040"],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"375"},{"user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"376","file_date_updated":"2018-03-20T07:14:52Z","ddc":["040"],"type":"dissertation","file":[{"date_updated":"2018-03-20T07:14:52Z","creator":"florida","date_created":"2018-03-20T07:14:52Z","file_size":1476366,"file_id":"1398","file_name":"376-Herlich-Dissertation.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"text":"Radio access networks (RANs) have become one of the largest energy consumers of communication technology [LLH+13] and their energy consumption is predicted to increase [FFMB11]. To reduce the energy consumption of RANs different techniques have been proposed. One of the most promising techniques is the use of a low-power sleep mode. However, a sleep mode can also reduce the performance. In this dissertation, I quantify how much energy can be conserved with a sleep mode and which negative effects it has on the performance of RANs. Additionally, I analyze how a sleep mode can be enabled more often and how the performance can be kept high. First, I quantify the effect of power-cycle durations on energy consumption and latency in an abstract queuing system. This results in a trade-off between energy consumption and latency for a single base station (BS). Second, I show that considering a network as a whole (instead of each BS individually) allows the energy consumption to be reduced even further. After these analyses, which are not specific for RANs, I study RANs for the rest of the dissertation. RANs need to both detect and execute the requests of users. Because detection and execution of requests have different requirements, I analyze them independently. I quantify how the number of active BSs can be reduced if the detection ranges of BSs are increased by cooperative transmissions. Next, I analyze how more BSs can be deactivated if the remaining active BSs cooperate to transmit data to the users. However, in addition to increasing the range, cooperative transmissions also radiate more power. This results in higher interference for other users which slows their transmissions down and, thus, increases energy consumption. Therefore, I describe how the radiated power of cooperative transmissions can be reduced if instantaneous channel knowledge is available. Because the implementation in real hardware is impractical for demonstration purposes, I show the results of a simulation that incorporates all effects I studied analytically earlier. In conclusion, I show that a sleep mode can reduce the energy consumption of RANs if applied correctly. To apply a sleep mode correctly, it is necessary to consider power-cycle durations, power profiles, and the interaction of BSs. When this knowledge is combined the energy consumption of RANs can be reduced with only a slight loss of performance. Because this results in a trade-off between energy consumption and performance, each RAN operator has to decide which trade-off is preferred.","lang":"eng"}],"supervisor":[{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"author":[{"full_name":"Herlich, Matthias","last_name":"Herlich","first_name":"Matthias"}],"date_created":"2017-10-17T12:42:05Z","date_updated":"2022-01-06T06:59:35Z","publisher":"Universität Paderborn","title":"Reducing Energy Consumption of Radio Access Networks","has_accepted_license":"1","citation":{"apa":"Herlich, M. (2014). <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn.","mla":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","bibtex":"@book{Herlich_2014, title={Reducing Energy Consumption of Radio Access Networks}, publisher={Universität Paderborn}, author={Herlich, Matthias}, year={2014} }","short":"M. Herlich, Reducing Energy Consumption of Radio Access Networks, Universität Paderborn, 2014.","chicago":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","ieee":"M. Herlich, <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","ama":"Herlich M. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn; 2014."},"year":"2014"},{"author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:42:05Z","publisher":"Springer","date_updated":"2022-01-06T06:59:35Z","doi":"10.1007/s00224-012-9431-2","title":"Re-Chord: A Self-stabilizing Chord Overlay Network","issue":"3","has_accepted_license":"1","page":"591-612","citation":{"bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612} }","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3, Springer, 2014, pp. 591–612, doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>, (3), 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3 (2014): 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” <i>Theory of Computing Systems</i>, no. 3, pp. 591–612, 2014.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>. 2014;(3):591-612. doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>"},"year":"2014","department":[{"_id":"79"}],"user_id":"477","_id":"378","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-20T07:13:36Z","ddc":["040"],"publication":"Theory of Computing Systems","type":"journal_article","status":"public","file":[{"date_created":"2018-03-20T07:13:36Z","creator":"florida","date_updated":"2018-03-20T07:13:36Z","file_name":"378-re-chord_journal.pdf","access_level":"closed","file_id":"1396","file_size":310961,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again."}]},{"date_updated":"2022-01-06T06:59:36Z","date_created":"2017-10-17T12:42:06Z","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"Randomized Online Algorithms for Set Cover Leasing Problems","doi":"10.1007/978-3-319-12691-3_3","has_accepted_license":"1","year":"2014","page":"25-34","citation":{"chicago":"Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide. “Randomized Online Algorithms for Set Cover Leasing Problems.” In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 25–34. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>.","ieee":"S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34.","ama":"Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms for Set Cover Leasing Problems. In: <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2014:25-34. doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>","bibtex":"@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS}, title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>}, booktitle={Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS} }","mla":"Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>.","short":"S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.","apa":"Abshoff, S., Markarian, C., &#38; Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 25–34). <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>"},"_id":"379","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"series_title":"LNCS","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:12:57Z","publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","type":"conference","abstract":[{"lang":"eng","text":"In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to."}],"status":"public","file":[{"date_updated":"2018-03-20T07:12:57Z","creator":"florida","date_created":"2018-03-20T07:12:57Z","file_size":214299,"file_id":"1395","access_level":"closed","file_name":"379-COCOA14.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"date_updated":"2022-01-06T06:59:36Z","date_created":"2017-10-17T12:42:06Z","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"full_name":"Mäcker, Alexander","id":"13536","last_name":"Mäcker","first_name":"Alexander"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"Quality of Service in Network Creation Games","doi":"10.1007/978-3-319-13129-0_34","has_accepted_license":"1","year":"2014","page":"423-428","citation":{"ama":"Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network Creation Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. ; 2014:423-428. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>","ieee":"A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–428.","chicago":"Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Quality of Service in Network Creation Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 423–28, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>.","apa":"Cord-Landwehr, A., Mäcker, A., &#38; Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 423–428). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>","mla":"Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–28, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>.","short":"A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.","bibtex":"@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality of Service in Network Creation Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2014}, pages={423–428} }"},"_id":"380","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:05:59Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","abstract":[{"lang":"eng","text":"Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"380-WINE2014.pdf","file_id":"1394","file_size":166640,"date_created":"2018-03-20T07:05:59Z","creator":"florida","date_updated":"2018-03-20T07:05:59Z"}]},{"title":"PBlaman: performance blame analysis based on Palladio contracts","date_created":"2018-08-02T13:38:28Z","author":[{"first_name":"Frank","last_name":"Brüseke","full_name":"Brüseke, Frank"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Gregor","full_name":"Engels, Gregor","last_name":"Engels"},{"first_name":"Steffen","last_name":"Becker","full_name":"Becker, Steffen"}],"date_updated":"2022-01-06T06:59:36Z","citation":{"apa":"Brüseke, F., Wachsmuth, H., Engels, G., &#38; Becker, S. (2014). PBlaman: performance blame analysis based on Palladio contracts. In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i> (pp. 1975–2004).","bibtex":"@inproceedings{Brüseke_Wachsmuth_Engels_Becker_2014, title={PBlaman: performance blame analysis based on Palladio contracts}, number={12}, booktitle={Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}, author={Brüseke, Frank and Wachsmuth, Henning and Engels, Gregor and Becker, Steffen}, year={2014}, pages={1975–2004} }","mla":"Brüseke, Frank, et al. “PBlaman: Performance Blame Analysis Based on Palladio Contracts.” <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, no. 12, 2014, pp. 1975–2004.","short":"F. Brüseke, H. Wachsmuth, G. Engels, S. Becker, in: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, 2014, pp. 1975–2004.","ama":"Brüseke F, Wachsmuth H, Engels G, Becker S. PBlaman: performance blame analysis based on Palladio contracts. In: <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>. ; 2014:1975-2004.","ieee":"F. Brüseke, H. Wachsmuth, G. Engels, and S. Becker, “PBlaman: performance blame analysis based on Palladio contracts,” in <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 2014, no. 12, pp. 1975–2004.","chicago":"Brüseke, Frank, Henning Wachsmuth, Gregor Engels, and Steffen Becker. “PBlaman: Performance Blame Analysis Based on Palladio Contracts.” In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 1975–2004, 2014."},"page":"1975-2004","year":"2014","issue":"12","language":[{"iso":"eng"}],"user_id":"82920","department":[{"_id":"600"}],"_id":"3805","status":"public","type":"conference","publication":"Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment"},{"title":"Provider Competition in Infrastructure-as-a-Service","doi":"10.1109/SCC.2014.35","date_updated":"2022-01-06T06:59:37Z","date_created":"2017-10-17T12:42:06Z","author":[{"first_name":"Jörn","last_name":"Künsemöller","full_name":"Künsemöller, Jörn"},{"full_name":"Brangewitz, Sonja","last_name":"Brangewitz","first_name":"Sonja"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"},{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"year":"2014","citation":{"apa":"Künsemöller, J., Brangewitz, S., Karl, H., &#38; Haake, C.-J. (2014). Provider Competition in Infrastructure-as-a-Service. In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i> (pp. 203–210). <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>","bibtex":"@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider Competition in Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>}, booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake, Claus-Jochen}, year={2014}, pages={203–210} }","mla":"Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.” <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–10, doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>.","short":"J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–210.","ama":"Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service. In: <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>. ; 2014:203-210. doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>","ieee":"J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition in Infrastructure-as-a-Service,” in <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–210.","chicago":"Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake. “Provider Competition in Infrastructure-as-a-Service.” In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 203–10, 2014. <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>."},"page":"203-210","has_accepted_license":"1","ddc":["004"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:34:46Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"382","user_id":"477","department":[{"_id":"75"},{"_id":"205"}],"abstract":[{"lang":"eng","text":"This paper explores how cloud provider competition influences instance pricing in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing includes an on-demand price component in addition to a reservation fee (two-part tariffs), different providers might offer different price combinations, where the client’s choice depends on its load profile. We investigate a duopoly of providers and analyze stable market prices in two-part tariffs. Further, we study offers that allow a specified amount of included usage (three-part tariffs). Neither two-part nor three-part tariffs produce an equilibrium market outcome other than a service pricing that equals production cost, i.e., complex price structures do not significantly affect the results from ordinary Bertrand competition."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T13:34:46Z","date_updated":"2018-11-02T13:34:46Z","file_name":"06930535.pdf","file_id":"5250","access_level":"closed","file_size":228172}],"status":"public","type":"conference","publication":"Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)"},{"file_date_updated":"2018-03-20T07:04:52Z","department":[{"_id":"77"}],"series_title":"Lecture Notes in Informatics (LNI)","user_id":"477","_id":"383","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","type":"conference","main_file_link":[{"url":"http://eprints.uni-kiel.de/23752/"}],"author":[{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"},{"last_name":"Schremmer","full_name":"Schremmer, Alexander","first_name":"Alexander"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:59:38Z","page":"67-68","citation":{"apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2014). Programs from Proofs -- Approach and Applications. In <i>Proceedings of the Software Engineering Conference (SE)</i> (pp. 67–68).","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications}, booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68}, collection={Lecture Notes in Informatics (LNI)} }","mla":"Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.” <i>Proceedings of the Software Engineering Conference (SE)</i>, 2014, pp. 67–68.","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications. In: <i>Proceedings of the Software Engineering Conference (SE)</i>. Lecture Notes in Informatics (LNI). ; 2014:67-68.","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach and Applications,” in <i>Proceedings of the Software Engineering Conference (SE)</i>, 2014, pp. 67–68.","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs -- Approach and Applications.” In <i>Proceedings of the Software Engineering Conference (SE)</i>, 67–68. Lecture Notes in Informatics (LNI), 2014."},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"383-programmsFromProofsSE.pdf","file_id":"1392","file_size":66474,"date_created":"2018-03-20T07:04:52Z","creator":"florida","date_updated":"2018-03-20T07:04:52Z"}],"abstract":[{"text":"Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space.","lang":"eng"}],"publication":"Proceedings of the Software Engineering Conference (SE)","title":"Programs from Proofs -- Approach and Applications","date_created":"2017-10-17T12:42:06Z","year":"2014"},{"type":"conference","publication":"Proceedings of the 29th Symposium On Applied Computing (SAC)","abstract":[{"lang":"eng","text":"Reputation systems provide reputation values of rated parties to users. These reputation values, typically aggregations of individual user ratings, shall be reliable, i.e. should enable a realistic assessment of the probability that the rated party behaves as expected in a transaction. In order for the reputation values to stay reliable and, thus, for the reputation system to provide a benefit, the system needs to be resistant against manipulations by users, the rated parties trying to improve their reputation values, and even against competitors trying to worsen a reputation value. At the same time, a reputation system shall provide privacy protection for users: rated parties shall not be able to learn who provided a certain rating. Otherwise users might not take part in the system as they fear bad feedback in revenge for bad ratings, or users do not want to be connected to certain transactions based on their provided ratings. In this paper we come up with a solution that provides both, reliability of reputation values on the one hand, and privacy protection for users on the other hand. In contrast to related work, our solution only makes use of a single reputation provider that needs to be trusted (to a certain extent) and does not require any bulletin boards to be present in the system. We make use of the Paillier cryptosystem to provide an aggregation of individual user ratings in a way that no party can learn which user provided a certain rating."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:04:20Z","date_created":"2018-03-20T07:04:20Z","creator":"florida","file_size":505927,"file_id":"1391","access_level":"closed","file_name":"384-reputationsystem_01.pdf"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"384","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:04:20Z","has_accepted_license":"1","year":"2014","citation":{"ieee":"R. Petrlic, S. Lutters, and C. Sorge, “Privacy-Preserving Reputation Management,” in <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 2014, pp. 1712–1718.","chicago":"Petrlic, Ronald, Sascha Lutters, and Christoph Sorge. “Privacy-Preserving Reputation Management.” In <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 1712–18, 2014. <a href=\"https://doi.org/10.1145/2554850.2554881\">https://doi.org/10.1145/2554850.2554881</a>.","ama":"Petrlic R, Lutters S, Sorge C. Privacy-Preserving Reputation Management. In: <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>. ; 2014:1712-1718. doi:<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>","mla":"Petrlic, Ronald, et al. “Privacy-Preserving Reputation Management.” <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 2014, pp. 1712–18, doi:<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>.","bibtex":"@inproceedings{Petrlic_Lutters_Sorge_2014, title={Privacy-Preserving Reputation Management}, DOI={<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>}, booktitle={Proceedings of the 29th Symposium On Applied Computing (SAC)}, author={Petrlic, Ronald and Lutters, Sascha and Sorge, Christoph}, year={2014}, pages={1712–1718} }","short":"R. Petrlic, S. Lutters, C. Sorge, in: Proceedings of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–1718.","apa":"Petrlic, R., Lutters, S., &#38; Sorge, C. (2014). Privacy-Preserving Reputation Management. In <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i> (pp. 1712–1718). <a href=\"https://doi.org/10.1145/2554850.2554881\">https://doi.org/10.1145/2554850.2554881</a>"},"page":"1712-1718","date_updated":"2022-01-06T06:59:42Z","date_created":"2017-10-17T12:42:06Z","author":[{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"},{"full_name":"Lutters, Sascha","last_name":"Lutters","first_name":"Sascha"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"title":"Privacy-Preserving Reputation Management","doi":"10.1145/2554850.2554881"}]