[{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"mla":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","bibtex":"@book{Dreimann_2014, title={Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic}, publisher={Universität Paderborn}, author={Dreimann, Philipp}, year={2014} }","ama":"Dreimann P. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn; 2014.","ieee":"P. Dreimann, <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","apa":"Dreimann, P. (2014). <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn.","chicago":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","short":"P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic, Universität Paderborn, 2014."},"type":"mastersthesis","department":[{"_id":"75"}],"date_created":"2017-10-17T12:42:21Z","date_updated":"2022-01-06T07:01:13Z","title":"Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic","year":"2014","status":"public","author":[{"full_name":"Dreimann, Philipp","last_name":"Dreimann","first_name":"Philipp"}],"user_id":"15504","publisher":"Universität Paderborn","_id":"458"},{"series_title":"LNCS","doi":"10.1007/978-3-319-09620-9_1","title":"Algorithmic Aspects of Resource Management in the Cloud","year":"2014","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian","id":"37612"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"date_updated":"2022-01-06T07:01:14Z","file":[{"relation":"main_file","date_updated":"2018-03-16T11:21:54Z","file_name":"459-SIROCCO2014.pdf","access_level":"closed","file_size":274496,"file_id":"1338","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-16T11:21:54Z"}],"date_created":"2017-10-17T12:42:21Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"publication":"Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)","abstract":[{"text":"In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.","lang":"eng"}],"page":"1-13","_id":"459","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-16T11:21:54Z","citation":{"mla":"Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>.","bibtex":"@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>}, booktitle={Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014}, pages={1–13}, collection={LNCS} }","ama":"Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. LNCS. ; 2014:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>","ieee":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13.","apa":"Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &#38; Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 1–13). <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>","chicago":"Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 1–13. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>.","short":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"publication":"Statistical Papers","issue":"2","type":"journal_article","department":[{"_id":"206"}],"date_created":"2018-10-10T09:55:25Z","publication_status":"published","date_updated":"2022-01-06T07:01:14Z","intvolume":"        56","year":"2014","title":"Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models","author":[{"full_name":"Beran, Jan","last_name":"Beran","first_name":"Jan"},{"first_name":"Yuanhua","last_name":"Feng","full_name":"Feng, Yuanhua","id":"20760"},{"last_name":"Ghosh","first_name":"Sucharita","full_name":"Ghosh, Sucharita"}],"publication_identifier":{"issn":["0932-5026","1613-9798"]},"doi":"10.1007/s00362-014-0590-x","language":[{"iso":"eng"}],"citation":{"ieee":"J. Beran, Y. Feng, and S. Ghosh, “Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models,” <i>Statistical Papers</i>, vol. 56, no. 2, pp. 431–451, 2014.","apa":"Beran, J., Feng, Y., &#38; Ghosh, S. (2014). Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models. <i>Statistical Papers</i>, <i>56</i>(2), 431–451. <a href=\"https://doi.org/10.1007/s00362-014-0590-x\">https://doi.org/10.1007/s00362-014-0590-x</a>","mla":"Beran, Jan, et al. “Modelling Long-Range Dependence and Trends in Duration Series: An Approach Based on EFARIMA and ESEMIFAR Models.” <i>Statistical Papers</i>, vol. 56, no. 2, Springer Nature, 2014, pp. 431–51, doi:<a href=\"https://doi.org/10.1007/s00362-014-0590-x\">10.1007/s00362-014-0590-x</a>.","bibtex":"@article{Beran_Feng_Ghosh_2014, title={Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models}, volume={56}, DOI={<a href=\"https://doi.org/10.1007/s00362-014-0590-x\">10.1007/s00362-014-0590-x</a>}, number={2}, journal={Statistical Papers}, publisher={Springer Nature}, author={Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}, year={2014}, pages={431–451} }","chicago":"Beran, Jan, Yuanhua Feng, and Sucharita Ghosh. “Modelling Long-Range Dependence and Trends in Duration Series: An Approach Based on EFARIMA and ESEMIFAR Models.” <i>Statistical Papers</i> 56, no. 2 (2014): 431–51. <a href=\"https://doi.org/10.1007/s00362-014-0590-x\">https://doi.org/10.1007/s00362-014-0590-x</a>.","short":"J. Beran, Y. Feng, S. Ghosh, Statistical Papers 56 (2014) 431–451.","ama":"Beran J, Feng Y, Ghosh S. Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models. <i>Statistical Papers</i>. 2014;56(2):431-451. doi:<a href=\"https://doi.org/10.1007/s00362-014-0590-x\">10.1007/s00362-014-0590-x</a>"},"status":"public","user_id":"10075","volume":56,"page":"431-451","_id":"4599","publisher":"Springer Nature"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"chicago":"Mittendorf, Robert. <i>Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs</i>. Universität Paderborn, 2014.","short":"R. Mittendorf, Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs, Universität Paderborn, 2014.","ieee":"R. Mittendorf, <i>Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs</i>. Universität Paderborn, 2014.","apa":"Mittendorf, R. (2014). <i>Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs</i>. Universität Paderborn.","bibtex":"@book{Mittendorf_2014, title={Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2014} }","ama":"Mittendorf R. <i>Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs</i>. Universität Paderborn; 2014.","mla":"Mittendorf, Robert. <i>Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs</i>. Universität Paderborn, 2014."},"type":"mastersthesis","date_created":"2017-10-17T12:42:21Z","date_updated":"2022-01-06T07:01:14Z","author":[{"full_name":"Mittendorf, Robert","last_name":"Mittendorf","first_name":"Robert"}],"title":"Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs","year":"2014","status":"public","user_id":"15504","_id":"460","publisher":"Universität Paderborn"},{"user_id":"10075","doi":"10.1007/978-3-319-03122-4_15","publisher":"Springer International Publishing","_id":"4602","language":[{"iso":"eng"}],"page":"239-253","publication_status":"published","date_updated":"2022-01-06T07:01:14Z","publication_identifier":{"isbn":["9783319031217","9783319031224"],"issn":["1570-5811","2214-7977"]},"author":[{"full_name":"Beran, Jan","last_name":"Beran","first_name":"Jan"},{"id":"20760","last_name":"Feng","first_name":"Yuanhua","full_name":"Feng, Yuanhua"},{"first_name":"Sucharita","last_name":"Ghosh","full_name":"Ghosh, Sucharita"}],"title":"On EFARIMA and ESEMIFAR Models","year":"2014","status":"public","department":[{"_id":"206"}],"type":"book_chapter","date_created":"2018-10-10T10:27:24Z","place":"Cham","citation":{"ieee":"J. Beran, Y. Feng, and S. Ghosh, “On EFARIMA and ESEMIFAR Models,” in <i>Empirical Economic and Financial Research</i>, Cham: Springer International Publishing, 2014, pp. 239–253.","apa":"Beran, J., Feng, Y., &#38; Ghosh, S. (2014). On EFARIMA and ESEMIFAR Models. In <i>Empirical Economic and Financial Research</i> (pp. 239–253). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">https://doi.org/10.1007/978-3-319-03122-4_15</a>","chicago":"Beran, Jan, Yuanhua Feng, and Sucharita Ghosh. “On EFARIMA and ESEMIFAR Models.” In <i>Empirical Economic and Financial Research</i>, 239–53. Cham: Springer International Publishing, 2014. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">https://doi.org/10.1007/978-3-319-03122-4_15</a>.","short":"J. Beran, Y. Feng, S. Ghosh, in: Empirical Economic and Financial Research, Springer International Publishing, Cham, 2014, pp. 239–253.","mla":"Beran, Jan, et al. “On EFARIMA and ESEMIFAR Models.” <i>Empirical Economic and Financial Research</i>, Springer International Publishing, 2014, pp. 239–53, doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">10.1007/978-3-319-03122-4_15</a>.","bibtex":"@inbook{Beran_Feng_Ghosh_2014, place={Cham}, title={On EFARIMA and ESEMIFAR Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">10.1007/978-3-319-03122-4_15</a>}, booktitle={Empirical Economic and Financial Research}, publisher={Springer International Publishing}, author={Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}, year={2014}, pages={239–253} }","ama":"Beran J, Feng Y, Ghosh S. On EFARIMA and ESEMIFAR Models. In: <i>Empirical Economic and Financial Research</i>. Cham: Springer International Publishing; 2014:239-253. doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">10.1007/978-3-319-03122-4_15</a>"},"publication":"Empirical Economic and Financial Research"},{"page":"341-356","_id":"4603","language":[{"iso":"eng"}],"publisher":"Springer International Publishing","doi":"10.1007/978-3-319-03122-4_21","user_id":"10075","title":"Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model","status":"public","year":"2014","publication_identifier":{"isbn":["9783319031217","9783319031224"],"issn":["1570-5811","2214-7977"]},"author":[{"last_name":"Peitz","first_name":"Christian","full_name":"Peitz, Christian","id":"2980"},{"id":"20760","full_name":"Feng, Yuanhua","last_name":"Feng","first_name":"Yuanhua"}],"date_updated":"2022-01-06T07:01:14Z","publication_status":"published","place":"Cham","date_created":"2018-10-10T10:28:44Z","type":"book_chapter","department":[{"_id":"206"}],"publication":"Empirical Economic and Financial Research","citation":{"ieee":"C. Peitz and Y. Feng, “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model,” in <i>Empirical Economic and Financial Research</i>, Cham: Springer International Publishing, 2014, pp. 341–356.","apa":"Peitz, C., &#38; Feng, Y. (2014). Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model. In <i>Empirical Economic and Financial Research</i> (pp. 341–356). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">https://doi.org/10.1007/978-3-319-03122-4_21</a>","chicago":"Peitz, Christian, and Yuanhua Feng. “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model.” In <i>Empirical Economic and Financial Research</i>, 341–56. Cham: Springer International Publishing, 2014. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">https://doi.org/10.1007/978-3-319-03122-4_21</a>.","short":"C. Peitz, Y. Feng, in: Empirical Economic and Financial Research, Springer International Publishing, Cham, 2014, pp. 341–356.","mla":"Peitz, Christian, and Yuanhua Feng. “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model.” <i>Empirical Economic and Financial Research</i>, Springer International Publishing, 2014, pp. 341–56, doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">10.1007/978-3-319-03122-4_21</a>.","bibtex":"@inbook{Peitz_Feng_2014, place={Cham}, title={Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">10.1007/978-3-319-03122-4_21</a>}, booktitle={Empirical Economic and Financial Research}, publisher={Springer International Publishing}, author={Peitz, Christian and Feng, Yuanhua}, year={2014}, pages={341–356} }","ama":"Peitz C, Feng Y. Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model. In: <i>Empirical Economic and Financial Research</i>. Cham: Springer International Publishing; 2014:341-356. doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">10.1007/978-3-319-03122-4_21</a>"}},{"user_id":"10075","doi":"10.1016/j.spl.2014.05.011","volume":92,"page":"109-113","_id":"4605","language":[{"iso":"eng"}],"publisher":"Elsevier BV","publication_status":"published","date_updated":"2022-01-06T07:01:14Z","intvolume":"        92","title":"Data-driven estimation of diurnal patterns of durations between trades on financial markets","year":"2014","status":"public","publication_identifier":{"issn":["0167-7152"]},"author":[{"id":"20760","last_name":"Feng","first_name":"Yuanhua","full_name":"Feng, Yuanhua"}],"type":"journal_article","department":[{"_id":"206"}],"date_created":"2018-10-10T10:34:03Z","publication":"Statistics & Probability Letters","citation":{"chicago":"Feng, Yuanhua. “Data-Driven Estimation of Diurnal Patterns of Durations between Trades on Financial Markets.” <i>Statistics &#38; Probability Letters</i> 92 (2014): 109–13. <a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">https://doi.org/10.1016/j.spl.2014.05.011</a>.","short":"Y. Feng, Statistics &#38; Probability Letters 92 (2014) 109–113.","apa":"Feng, Y. (2014). Data-driven estimation of diurnal patterns of durations between trades on financial markets. <i>Statistics &#38; Probability Letters</i>, <i>92</i>, 109–113. <a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">https://doi.org/10.1016/j.spl.2014.05.011</a>","ieee":"Y. Feng, “Data-driven estimation of diurnal patterns of durations between trades on financial markets,” <i>Statistics &#38; Probability Letters</i>, vol. 92, pp. 109–113, 2014.","ama":"Feng Y. Data-driven estimation of diurnal patterns of durations between trades on financial markets. <i>Statistics &#38; Probability Letters</i>. 2014;92:109-113. doi:<a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">10.1016/j.spl.2014.05.011</a>","bibtex":"@article{Feng_2014, title={Data-driven estimation of diurnal patterns of durations between trades on financial markets}, volume={92}, DOI={<a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">10.1016/j.spl.2014.05.011</a>}, journal={Statistics &#38; Probability Letters}, publisher={Elsevier BV}, author={Feng, Yuanhua}, year={2014}, pages={109–113} }","mla":"Feng, Yuanhua. “Data-Driven Estimation of Diurnal Patterns of Durations between Trades on Financial Markets.” <i>Statistics &#38; Probability Letters</i>, vol. 92, Elsevier BV, 2014, pp. 109–13, doi:<a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">10.1016/j.spl.2014.05.011</a>."}},{"date_updated":"2022-01-06T07:01:14Z","author":[{"last_name":"Dräxler","first_name":"Sevil","full_name":"Dräxler, Sevil","id":"31764"}],"status":"public","title":"Adaptive Placement of Programmable Virtual Network Function Chains","year":"2014","user_id":"477","publisher":"Universität Paderborn","_id":"461","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"short":"S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains, Universität Paderborn, 2014.","chicago":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","ieee":"S. Dräxler, <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","apa":"Dräxler, S. (2014). <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn.","bibtex":"@book{Dräxler_2014, title={Adaptive Placement of Programmable Virtual Network Function Chains}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2014} }","ama":"Dräxler S. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn; 2014.","mla":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014."},"department":[{"_id":"75"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:21Z"},{"page":"625-630","_id":"462","user_id":"14052","doi":"10.5220/0005110406250630","ddc":["040"],"status":"public","year":"2014","title":"A Simulation Framework for Analyzing Complex Infinitely Repeated Games","author":[{"full_name":"Feldotto, Matthias","first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_updated":"2022-01-06T07:01:15Z","has_accepted_license":"1","file":[{"date_updated":"2018-03-16T11:21:24Z","relation":"main_file","file_size":993721,"access_level":"closed","file_name":"462-FS2014SIMULTECH.pdf","success":1,"content_type":"application/pdf","file_id":"1337","creator":"florida","date_created":"2018-03-16T11:21:24Z"}],"date_created":"2017-10-17T12:42:22Z","type":"conference","department":[{"_id":"63"},{"_id":"541"}],"file_date_updated":"2018-03-16T11:21:24Z","publication":"Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)","citation":{"ama":"Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>. ; 2014:625-630. doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>","bibtex":"@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for Analyzing Complex Infinitely Repeated Games}, DOI={<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>}, booktitle={Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)}, author={Feldotto, Matthias and Skopalik, Alexander}, year={2014}, pages={625–630} }","mla":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–30, doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>.","short":"M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.","chicago":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 625–30, 2014. <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>.","apa":"Feldotto, M., &#38; Skopalik, A. (2014). A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i> (pp. 625–630). <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>","ieee":"M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–630."},"abstract":[{"text":"We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"name":"SFB 901 - Subprojekt A3","_id":"7"}]},{"department":[{"_id":"64"}],"type":"conference","date_created":"2017-10-17T12:42:22Z","file":[{"creator":"florida","date_created":"2018-03-16T11:20:54Z","relation":"main_file","date_updated":"2018-03-16T11:20:54Z","file_name":"463-FDTC14.pdf","access_level":"closed","file_size":437518,"file_id":"1336","content_type":"application/pdf","success":1}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"abstract":[{"text":"Several fault attacks against pairing-based cryptography have been described theoretically in recent years. Interestingly, none of these have been practically evaluated. We accomplished this task and prove that fault attacks against pairing-based cryptography are indeed possible and are even practical — thus posing a serious threat. Moreover, we successfully conducted a second-order fault attack against an open source implementation of the eta pairing on an AVR XMEGA A1. We injected the first fault into the computation of the Miller Algorithm and applied the second fault to skip the final exponentiation completely. We introduce a low-cost setup that allowed us to generate multiple independent faults in one computation. The setup implements these faults by clock glitches which induce instruction skips. With this setup we conducted the first practical fault attack against a complete pairing computation.","lang":"eng"}],"citation":{"ama":"Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>. ; 2014:123--136. doi:<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>","bibtex":"@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A Practical Second-Order Fault Attack against a Real-World Pairing Implementation}, DOI={<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer, Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }","mla":"Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 123--136, doi:<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>.","short":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.","chicago":"Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 123--136, 2014. <a href=\"https://doi.org/10.1109/FDTC.2014.22\">https://doi.org/10.1109/FDTC.2014.22</a>.","apa":"Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., &#38; Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i> (pp. 123--136). <a href=\"https://doi.org/10.1109/FDTC.2014.22\">https://doi.org/10.1109/FDTC.2014.22</a>","ieee":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation,” in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 123--136."},"publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","file_date_updated":"2018-03-16T11:20:54Z","doi":"10.1109/FDTC.2014.22","ddc":["040"],"user_id":"25078","_id":"463","page":"123--136","has_accepted_license":"1","date_updated":"2022-01-06T07:01:16Z","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"first_name":"Ricardo","last_name":"Gomes da Silva","full_name":"Gomes da Silva, Ricardo"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"full_name":"Krämer, Juliane","last_name":"Krämer","first_name":"Juliane"},{"last_name":"Seifert","first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre"}],"year":"2014","title":"A Practical Second-Order Fault Attack against a Real-World Pairing Implementation","status":"public"},{"doi":"10.1007/s00224-013-9504-x","author":[{"full_name":"Gall, Dominik","last_name":"Gall","first_name":"Dominik"},{"full_name":"Jacob, Riko","last_name":"Jacob","first_name":"Riko"},{"full_name":"Richa, Andrea W.","first_name":"Andrea W.","last_name":"Richa"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Täubig, Hanjo ","first_name":"Hanjo ","last_name":"Täubig"}],"year":"2014","title":"A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization","date_updated":"2022-01-06T07:01:16Z","date_created":"2017-10-17T12:42:22Z","file":[{"date_updated":"2018-03-16T11:19:45Z","relation":"main_file","file_size":947484,"access_level":"closed","file_name":"464-GJRSST2014.pdf","success":1,"content_type":"application/pdf","file_id":"1334","creator":"florida","date_created":"2018-03-16T11:19:45Z"}],"department":[{"_id":"79"}],"type":"journal_article","issue":"1","publication":"Theory of Computing Systems","abstract":[{"text":"Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.","lang":"eng"}],"publisher":"Springer","_id":"464","page":"110-135","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1","citation":{"apa":"Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., &#38; Täubig, H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. <i>Theory of Computing Systems</i>, (1), 110–135. <a href=\"https://doi.org/10.1007/s00224-013-9504-x\">https://doi.org/10.1007/s00224-013-9504-x</a>","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” <i>Theory of Computing Systems</i>, no. 1, pp. 110–135, 2014.","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo  Täubig. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” <i>Theory of Computing Systems</i>, no. 1 (2014): 110–35. <a href=\"https://doi.org/10.1007/s00224-013-9504-x\">https://doi.org/10.1007/s00224-013-9504-x</a>.","short":"D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory of Computing Systems (2014) 110–135.","mla":"Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” <i>Theory of Computing Systems</i>, no. 1, Springer, 2014, pp. 110–35, doi:<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>.","ama":"Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. <i>Theory of Computing Systems</i>. 2014;(1):110-135. doi:<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>","bibtex":"@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>}, number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }"},"file_date_updated":"2018-03-16T11:19:45Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"citation":{"chicago":"Stapel, Florian, and Leena Suhl. <i>A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks</i>. Universität Paderborn, 2014.","ama":"Stapel F, Suhl L. <i>A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks</i>. Universität Paderborn; 2014.","short":"F. Stapel, L. Suhl, A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks, Universität Paderborn, 2014.","bibtex":"@book{Stapel_Suhl_2014, title={A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks}, publisher={Universität Paderborn}, author={Stapel, Florian and Suhl, Leena}, year={2014} }","mla":"Stapel, Florian, and Leena Suhl. <i>A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks</i>. Universität Paderborn, 2014.","apa":"Stapel, F., &#38; Suhl, L. (2014). <i>A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks</i>. Universität Paderborn.","ieee":"F. Stapel and L. Suhl, <i>A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks</i>. Universität Paderborn, 2014."},"file_date_updated":"2018-03-16T11:20:22Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"text":"This article presents a novel Mixed Integer Nonlinear Programming (MINLP) approach for finding a renewal plan of pipes in a water distribution system. We formulate a MINLP model for finding the times of renewal and suited measurements of pipe dimensions in a multi-year planning horizon. The model includes a multi-period hydraulic simulation of the distribution systems behaviour thereby respecting the friction caused headloss as a nonlinear constraint. We apply the MINLP solver Bonmin to a test network and present first numerical results. The models embedding into a general solution framework for water network problems consisting of network reduction and simulation steps in an interated way, is beign discussed. This latter discussion corresponds well to the recent results by C. Hallmann for the problem of tank planning within the mentioned solution framework that has been presented there for the first time.","lang":"eng"}],"date_created":"2017-10-17T12:42:22Z","file":[{"date_created":"2018-03-16T11:20:22Z","creator":"florida","file_id":"1335","success":1,"content_type":"application/pdf","file_name":"465-2014_-_Stapel__Suhl_-_TechReport_MINLP_Water.pdf","access_level":"closed","file_size":435976,"relation":"main_file","date_updated":"2018-03-16T11:20:22Z"}],"type":"report","author":[{"last_name":"Stapel","first_name":"Florian","full_name":"Stapel, Florian"},{"full_name":"Suhl, Leena","first_name":"Leena","last_name":"Suhl"}],"title":"A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks","status":"public","year":"2014","has_accepted_license":"1","date_updated":"2022-01-06T07:01:16Z","_id":"465","publisher":"Universität Paderborn","user_id":"15504","ddc":["040"]},{"publisher":"Universität Paderborn","_id":"466","language":[{"iso":"eng"}],"user_id":"477","author":[{"full_name":"Brand, Marcel","last_name":"Brand","first_name":"Marcel"}],"title":"A generalized loop accelerator implemented as a coarse grained array","year":"2014","status":"public","date_updated":"2022-01-06T07:01:17Z","date_created":"2017-10-17T12:42:22Z","type":"mastersthesis","citation":{"short":"M. Brand, A Generalized Loop Accelerator Implemented as a Coarse Grained Array, Universität Paderborn, 2014.","chicago":"Brand, Marcel. <i>A Generalized Loop Accelerator Implemented as a Coarse Grained Array</i>. Universität Paderborn, 2014.","ieee":"M. Brand, <i>A generalized loop accelerator implemented as a coarse grained array</i>. Universität Paderborn, 2014.","apa":"Brand, M. (2014). <i>A generalized loop accelerator implemented as a coarse grained array</i>. Universität Paderborn.","bibtex":"@book{Brand_2014, title={A generalized loop accelerator implemented as a coarse grained array}, publisher={Universität Paderborn}, author={Brand, Marcel}, year={2014} }","ama":"Brand M. <i>A Generalized Loop Accelerator Implemented as a Coarse Grained Array</i>. Universität Paderborn; 2014.","mla":"Brand, Marcel. <i>A Generalized Loop Accelerator Implemented as a Coarse Grained Array</i>. Universität Paderborn, 2014."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"type":"conference","department":[{"_id":"206"}],"date_created":"2018-10-11T12:20:17Z","citation":{"ieee":"C. Zhou and Y. Feng, “Data-driven estimation of realized kernels under dependent microstructure noise and further analysis using the Semi-FI-Log-ACD.” 2014.","apa":"Zhou, C., &#38; Feng, Y. (2014). Data-driven estimation of realized kernels under dependent microstructure noise and further analysis using the Semi-FI-Log-ACD. Presented at the Conference on Computational and Financial Econometrics, University of Pisa, Italy.","chicago":"Zhou, Chen, and Yuanhua Feng. “Data-Driven Estimation of Realized Kernels under Dependent Microstructure Noise and Further Analysis Using the Semi-FI-Log-ACD.” Book of Abstracts, 2014.","short":"C. Zhou, Y. Feng, (2014).","mla":"Zhou, Chen, and Yuanhua Feng. <i>Data-Driven Estimation of Realized Kernels under Dependent Microstructure Noise and Further Analysis Using the Semi-FI-Log-ACD</i>. 2014.","bibtex":"@article{Zhou_Feng_2014, series={Book of Abstracts}, title={Data-driven estimation of realized kernels under dependent microstructure noise and further analysis using the Semi-FI-Log-ACD}, author={Zhou, Chen and Feng, Yuanhua}, year={2014}, collection={Book of Abstracts} }","ama":"Zhou C, Feng Y. Data-driven estimation of realized kernels under dependent microstructure noise and further analysis using the Semi-FI-Log-ACD. 2014."},"user_id":"10075","_id":"4664","language":[{"iso":"eng"}],"series_title":"Book of Abstracts","date_updated":"2022-01-06T07:01:17Z","year":"2014","title":"Data-driven estimation of realized kernels under dependent microstructure noise and further analysis using the Semi-FI-Log-ACD","status":"public","conference":{"name":"Conference on Computational and Financial Econometrics","start_date":"6.12.2014","location":"University of Pisa, Italy","end_date":"8.12.2014"},"author":[{"last_name":"Zhou","first_name":"Chen","full_name":"Zhou, Chen"},{"last_name":"Feng","first_name":"Yuanhua","full_name":"Feng, Yuanhua","id":"20760"}]},{"has_accepted_license":"1","status":"public","user_id":"477","ddc":["000"],"publisher":"Elsevier","_id":"467","page":"44--52","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Künsemöller J, Karl H. A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>. 2014:44--52. doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>","bibtex":"@article{Künsemöller_Karl_2014, title={A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>}, journal={Future Generation Computer Systems}, publisher={Elsevier}, author={Künsemöller, Jörn and Karl, Holger}, year={2014}, pages={44--52} }","mla":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, Elsevier, 2014, pp. 44--52, doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>.","chicago":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, 2014, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>.","short":"J. Künsemöller, H. Karl, Future Generation Computer Systems (2014) 44--52.","apa":"Künsemöller, J., &#38; Karl, H. (2014). A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>","ieee":"J. Künsemöller and H. Karl, “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service,” <i>Future Generation Computer Systems</i>, pp. 44--52, 2014."},"file_date_updated":"2018-11-02T15:46:17Z","date_updated":"2022-01-06T07:01:17Z","author":[{"full_name":"Künsemöller, Jörn","last_name":"Künsemöller","first_name":"Jörn"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"year":"2014","title":"A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service","doi":"10.1016/j.future.2014.03.005","language":[{"iso":"eng"}],"abstract":[{"text":"Financial benefits are an important factor when cloud infrastructure is considered to meet processing demand. The dynamics of on-demand pricing and service usage are investigated in a two-stage game model for a monopoly Infrastructure-as-a-Service (IaaS) market. The possibility of hybrid clouds (public clouds plus own infrastructure) turns out to be essential in order that not only the provider but also the clients have significant benefits from on-demand services. Even if the client meets all demand in the public cloud, the threat of building a hybrid cloud keeps the instance price low. This is not the case when reserved instances are offered as well. Parameters like load profiles and economies of scale have a huge effect on likely future pricing and on a cost-optimal split-up of client demand between either a client’s own data center and a public cloud service or between reserved and on-demand cloud instances.","lang":"eng"}],"publication":"Future Generation Computer Systems","department":[{"_id":"75"}],"type":"journal_article","date_created":"2017-10-17T12:42:23Z","file":[{"file_id":"5312","success":1,"content_type":"application/pdf","file_name":"KünsemöllerKarl.pdf","access_level":"closed","file_size":698992,"relation":"main_file","date_updated":"2018-11-02T15:46:17Z","date_created":"2018-11-02T15:46:17Z","creator":"ups"}]},{"page":"3--6","language":[{"iso":"eng"}],"_id":"4694","user_id":"72849","doi":"10.1108/BPMJ-02-2014-0015","year":"2014","status":"public","title":"New frontiers in business process management","publication_identifier":{"issn":["1463-7154"]},"author":[{"first_name":"T","last_name":"Kohlborn","full_name":"Kohlborn, T"},{"last_name":"Müller","first_name":"Oliver","full_name":"Müller, Oliver","id":"72849"},{"full_name":"Pöppelbuss, J","first_name":"J","last_name":"Pöppelbuss"},{"first_name":"M","last_name":"Röglinger","full_name":"Röglinger, M"}],"date_updated":"2022-01-06T07:01:18Z","date_created":"2018-10-12T08:30:24Z","type":"journal_article","issue":"4","publication":"Business Process Management Journal","citation":{"bibtex":"@article{Kohlborn_Müller_Pöppelbuss_Röglinger_2014, title={New frontiers in business process management}, DOI={<a href=\"https://doi.org/10.1108/BPMJ-02-2014-0015\">10.1108/BPMJ-02-2014-0015</a>}, number={4}, journal={Business Process Management Journal}, author={Kohlborn, T and Müller, Oliver and Pöppelbuss, J and Röglinger, M}, year={2014}, pages={3--6} }","ama":"Kohlborn T, Müller O, Pöppelbuss J, Röglinger M. New frontiers in business process management. <i>Business Process Management Journal</i>. 2014;(4):3--6. doi:<a href=\"https://doi.org/10.1108/BPMJ-02-2014-0015\">10.1108/BPMJ-02-2014-0015</a>","mla":"Kohlborn, T., et al. “New Frontiers in Business Process Management.” <i>Business Process Management Journal</i>, no. 4, 2014, pp. 3--6, doi:<a href=\"https://doi.org/10.1108/BPMJ-02-2014-0015\">10.1108/BPMJ-02-2014-0015</a>.","short":"T. Kohlborn, O. Müller, J. Pöppelbuss, M. Röglinger, Business Process Management Journal (2014) 3--6.","chicago":"Kohlborn, T, Oliver Müller, J Pöppelbuss, and M Röglinger. “New Frontiers in Business Process Management.” <i>Business Process Management Journal</i>, no. 4 (2014): 3--6. <a href=\"https://doi.org/10.1108/BPMJ-02-2014-0015\">https://doi.org/10.1108/BPMJ-02-2014-0015</a>.","ieee":"T. Kohlborn, O. Müller, J. Pöppelbuss, and M. Röglinger, “New frontiers in business process management,” <i>Business Process Management Journal</i>, no. 4, pp. 3--6, 2014.","apa":"Kohlborn, T., Müller, O., Pöppelbuss, J., &#38; Röglinger, M. (2014). New frontiers in business process management. <i>Business Process Management Journal</i>, (4), 3--6. <a href=\"https://doi.org/10.1108/BPMJ-02-2014-0015\">https://doi.org/10.1108/BPMJ-02-2014-0015</a>"},"extern":"1"},{"date_created":"2018-10-12T08:30:31Z","type":"journal_article","keyword":["Big data","Business intelligence","Competencies","Latent semantic analysis","Text mining"],"citation":{"bibtex":"@article{Debortoli_Müller_vom Brocke_2014, title={Comparing business intelligence and big data skills: A text mining study using job advertisements}, DOI={<a href=\"https://doi.org/10.1007/s12599-014-0344-2\">10.1007/s12599-014-0344-2</a>}, number={5}, journal={Business and Information Systems Engineering}, author={Debortoli, Stefan and Müller, Oliver and vom Brocke, Jan}, year={2014}, pages={289--300} }","ama":"Debortoli S, Müller O, vom Brocke J. Comparing business intelligence and big data skills: A text mining study using job advertisements. <i>Business and Information Systems Engineering</i>. 2014;(5):289--300. doi:<a href=\"https://doi.org/10.1007/s12599-014-0344-2\">10.1007/s12599-014-0344-2</a>","mla":"Debortoli, Stefan, et al. “Comparing Business Intelligence and Big Data Skills: A Text Mining Study Using Job Advertisements.” <i>Business and Information Systems Engineering</i>, no. 5, 2014, pp. 289--300, doi:<a href=\"https://doi.org/10.1007/s12599-014-0344-2\">10.1007/s12599-014-0344-2</a>.","chicago":"Debortoli, Stefan, Oliver Müller, and Jan vom Brocke. “Comparing Business Intelligence and Big Data Skills: A Text Mining Study Using Job Advertisements.” <i>Business and Information Systems Engineering</i>, no. 5 (2014): 289--300. <a href=\"https://doi.org/10.1007/s12599-014-0344-2\">https://doi.org/10.1007/s12599-014-0344-2</a>.","short":"S. Debortoli, O. Müller, J. vom Brocke, Business and Information Systems Engineering (2014) 289--300.","ieee":"S. Debortoli, O. Müller, and J. vom Brocke, “Comparing business intelligence and big data skills: A text mining study using job advertisements,” <i>Business and Information Systems Engineering</i>, no. 5, pp. 289--300, 2014.","apa":"Debortoli, S., Müller, O., &#38; vom Brocke, J. (2014). Comparing business intelligence and big data skills: A text mining study using job advertisements. <i>Business and Information Systems Engineering</i>, (5), 289--300. <a href=\"https://doi.org/10.1007/s12599-014-0344-2\">https://doi.org/10.1007/s12599-014-0344-2</a>"},"issue":"5","publication":"Business and Information Systems Engineering","extern":"1","language":[{"iso":"eng"}],"_id":"4695","page":"289--300","doi":"10.1007/s12599-014-0344-2","user_id":"72849","publication_identifier":{"isbn":["0910-8327 (Print)$\\backslash$n0910-8327 (Linking)"],"issn":["18670202"]},"author":[{"full_name":"Debortoli, Stefan","last_name":"Debortoli","first_name":"Stefan"},{"id":"72849","full_name":"Müller, Oliver","last_name":"Müller","first_name":"Oliver"},{"first_name":"Jan","last_name":"vom Brocke","full_name":"vom Brocke, Jan"}],"title":"Comparing business intelligence and big data skills: A text mining study using job advertisements","status":"public","year":"2014","date_updated":"2022-01-06T07:01:18Z"},{"publication_identifier":{"issn":["15293181"]},"author":[{"last_name":"vom Brocke","first_name":"Jan","full_name":"vom Brocke, Jan"},{"first_name":"Stefan","last_name":"Debortoli","full_name":"Debortoli, Stefan"},{"full_name":"Reuter, Nadine","last_name":"Reuter","first_name":"Nadine"},{"full_name":"Müller, Oliver","last_name":"Müller","first_name":"Oliver","id":"72849"}],"title":"How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti","year":"2014","status":"public","date_updated":"2022-01-06T07:01:18Z","_id":"4696","language":[{"iso":"eng"}],"page":"151--167","doi":"10.17705/1CAIS.03407","user_id":"72849","citation":{"ama":"vom Brocke J, Debortoli S, Reuter N, Müller O. How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti. <i>Communications of the Association for Information Systems</i>. 2014:151--167. doi:<a href=\"https://doi.org/10.17705/1CAIS.03407\">10.17705/1CAIS.03407</a>","bibtex":"@article{vom Brocke_Debortoli_Reuter_Müller_2014, title={How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti}, DOI={<a href=\"https://doi.org/10.17705/1CAIS.03407\">10.17705/1CAIS.03407</a>}, journal={Communications of the Association for Information Systems}, author={vom Brocke, Jan and Debortoli, Stefan and Reuter, Nadine and Müller, Oliver}, year={2014}, pages={151--167} }","mla":"vom Brocke, Jan, et al. “How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti.” <i>Communications of the Association for Information Systems</i>, 2014, pp. 151--167, doi:<a href=\"https://doi.org/10.17705/1CAIS.03407\">10.17705/1CAIS.03407</a>.","chicago":"Brocke, Jan vom, Stefan Debortoli, Nadine Reuter, and Oliver Müller. “How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti.” <i>Communications of the Association for Information Systems</i>, 2014, 151--167. <a href=\"https://doi.org/10.17705/1CAIS.03407\">https://doi.org/10.17705/1CAIS.03407</a>.","short":"J. vom Brocke, S. Debortoli, N. Reuter, O. Müller, Communications of the Association for Information Systems (2014) 151--167.","apa":"vom Brocke, J., Debortoli, S., Reuter, N., &#38; Müller, O. (2014). How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti. <i>Communications of the Association for Information Systems</i>, 151--167. <a href=\"https://doi.org/10.17705/1CAIS.03407\">https://doi.org/10.17705/1CAIS.03407</a>","ieee":"J. vom Brocke, S. Debortoli, N. Reuter, and O. Müller, “How In-Memory Technology Can Create Business Value: Lessons Learned from Hilti,” <i>Communications of the Association for Information Systems</i>, pp. 151--167, 2014."},"publication":"Communications of the Association for Information Systems","extern":"1","date_created":"2018-10-12T08:30:38Z","type":"journal_article","keyword":["Advanced business analytics","Big Data","Business intelligence","IT business value","In-memory technology","OLAP","OLTP","Realtime analytics","Sentiment analysis"]},{"page":"59--68","language":[{"iso":"eng"}],"_id":"4697","doi":"10.1016/j.compedu.2014.07.013","user_id":"72849","year":"2014","title":"Augmented reality in informal learning environments: A field experiment in a mathematics exhibition","status":"public","author":[{"full_name":"Sommerauer, Peter","last_name":"Sommerauer","first_name":"Peter"},{"last_name":"Müller","first_name":"Oliver","full_name":"Müller, Oliver"}],"publication_identifier":{"issn":["03601315"],"isbn":["0360-1315"]},"date_updated":"2022-01-06T07:01:18Z","date_created":"2018-10-12T08:30:44Z","type":"journal_article","keyword":["Augmented reality","Cognitive theory of multimedia learning","Field experiment","Informal learning","Museum"],"publication":"Computers and Education","citation":{"apa":"Sommerauer, P., &#38; Müller, O. (2014). Augmented reality in informal learning environments: A field experiment in a mathematics exhibition. <i>Computers and Education</i>, 59--68. <a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">https://doi.org/10.1016/j.compedu.2014.07.013</a>","ieee":"P. Sommerauer and O. Müller, “Augmented reality in informal learning environments: A field experiment in a mathematics exhibition,” <i>Computers and Education</i>, pp. 59--68, 2014.","chicago":"Sommerauer, Peter, and Oliver Müller. “Augmented Reality in Informal Learning Environments: A Field Experiment in a Mathematics Exhibition.” <i>Computers and Education</i>, 2014, 59--68. <a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">https://doi.org/10.1016/j.compedu.2014.07.013</a>.","short":"P. Sommerauer, O. Müller, Computers and Education (2014) 59--68.","mla":"Sommerauer, Peter, and Oliver Müller. “Augmented Reality in Informal Learning Environments: A Field Experiment in a Mathematics Exhibition.” <i>Computers and Education</i>, 2014, pp. 59--68, doi:<a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">10.1016/j.compedu.2014.07.013</a>.","ama":"Sommerauer P, Müller O. Augmented reality in informal learning environments: A field experiment in a mathematics exhibition. <i>Computers and Education</i>. 2014:59--68. doi:<a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">10.1016/j.compedu.2014.07.013</a>","bibtex":"@article{Sommerauer_Müller_2014, title={Augmented reality in informal learning environments: A field experiment in a mathematics exhibition}, DOI={<a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">10.1016/j.compedu.2014.07.013</a>}, journal={Computers and Education}, author={Sommerauer, Peter and Müller, Oliver}, year={2014}, pages={59--68} }"},"extern":"1"},{"department":[{"_id":"590"},{"_id":"187"},{"_id":"635"}],"type":"working_paper","date_created":"2018-10-15T11:07:03Z","citation":{"bibtex":"@book{Ortmann_Sureth-Sloane_2014, series={arqus, Quantitative Research in Taxation}, title={Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?}, volume={165}, author={Ortmann, Regina and Sureth-Sloane, Caren}, year={2014}, collection={arqus, Quantitative Research in Taxation} }","chicago":"Ortmann, Regina, and Caren Sureth-Sloane. <i>Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?</i> Vol. 165. Arqus, Quantitative Research in Taxation, 2014.","short":"R. Ortmann, C. Sureth-Sloane, Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?, 2014.","ama":"Ortmann R, Sureth-Sloane C. <i>Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?</i> Vol 165.; 2014.","ieee":"R. Ortmann and C. Sureth-Sloane, <i>Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?</i>, vol. 165. 2014.","mla":"Ortmann, Regina, and Caren Sureth-Sloane. <i>Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?</i> Vol. 165, 2014.","apa":"Ortmann, R., &#38; Sureth-Sloane, C. (2014). <i>Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?</i> (Vol. 165)."},"volume":165,"user_id":"61801","language":[{"iso":"eng"}],"_id":"4750","series_title":"arqus, Quantitative Research in Taxation","intvolume":"       165","date_updated":"2022-01-06T07:01:21Z","author":[{"id":"10020","last_name":"Ortmann","first_name":"Regina","full_name":"Ortmann, Regina"},{"full_name":"Sureth-Sloane, Caren","last_name":"Sureth-Sloane","first_name":"Caren","id":"530"}],"status":"public","title":"Can the CCCTB Alleviate Tax Discrimination against Loss-Making European Multinational Groups?","year":"2014"}]