[{"place":"Cham","citation":{"bibtex":"@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>}, booktitle={Foundations and Practice of Security}, publisher={Springer International Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils}, year={2017}, pages={3–17} }","short":"J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.","mla":"Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” <i>Foundations and Practice of Security</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>.","apa":"Blömer, J., Günther, P., Krummel, V., &#38; Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In <i>Foundations and Practice of Security</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>","ieee":"J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in <i>Foundations and Practice of Security</i>, 2017, pp. 3–17.","chicago":"Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” In <i>Foundations and Practice of Security</i>, 3–17. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>.","ama":"Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: <i>Foundations and Practice of Security</i>. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>"},"page":"3-17","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319756493","9783319756509"]},"doi":"10.1007/978-3-319-75650-9_1","date_updated":"2022-01-06T06:55:55Z","oa":"1","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"},{"first_name":"Volker","last_name":"Krummel","full_name":"Krummel, Volker"},{"last_name":"Löken","full_name":"Löken, Nils","id":"13703","first_name":"Nils"}],"status":"public","type":"conference","file_date_updated":"2018-11-08T09:53:34Z","project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"2344","user_id":"13703","department":[{"_id":"64"}],"year":"2017","title":"Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations","publisher":"Springer International Publishing","date_created":"2018-04-13T11:40:48Z","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:04:13Z","creator":"ups","date_updated":"2018-11-02T15:04:13Z","file_name":"Attribute-BasedEncryptionAsASe.pdf","file_id":"5292","access_level":"closed","file_size":634736},{"relation":"main_file","content_type":"application/pdf","file_size":522516,"file_id":"5425","file_name":"abe_aas.pdf","access_level":"open_access","date_updated":"2018-11-08T09:53:34Z","creator":"nilo","date_created":"2018-11-08T09:53:34Z"}],"publication":"Foundations and Practice of Security","ddc":["000"],"language":[{"iso":"eng"}]},{"title":"2016 Global MNC Tax Complexity Survey - Executive Summary","date_created":"2018-04-06T07:40:18Z","year":"2017","language":[{"iso":"eng"}],"ddc":["330"],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":4020983,"file_name":"Hoppe Schanz Sturm Sureth-Sloane 2017.pdf","access_level":"open_access","file_id":"2248","date_updated":"2018-04-06T07:40:03Z","date_created":"2018-04-06T07:40:03Z","creator":"hoppet"}],"doi":"10.13140/RG.2.2.23707.46881","main_file_link":[{"open_access":"1","url":"www.taxcomplexity.org"}],"author":[{"first_name":"Thomas","last_name":"Hoppe","id":"22671","full_name":"Hoppe, Thomas"},{"first_name":"Deborah","last_name":"Schanz","full_name":"Schanz, Deborah"},{"last_name":"Sturm","full_name":"Sturm, Susann","first_name":"Susann"},{"full_name":"Sureth-Sloane, Caren","id":"530","last_name":"Sureth-Sloane","first_name":"Caren"}],"date_updated":"2022-01-06T06:55:33Z","oa":"1","page":"27","citation":{"ama":"Hoppe T, Schanz D, Sturm S, Sureth-Sloane C. <i>2016 Global MNC Tax Complexity Survey - Executive Summary</i>.; 2017. doi:<a href=\"https://doi.org/10.13140/RG.2.2.23707.46881\">10.13140/RG.2.2.23707.46881</a>","ieee":"T. Hoppe, D. Schanz, S. Sturm, and C. Sureth-Sloane, <i>2016 Global MNC Tax Complexity Survey - Executive Summary</i>. 2017.","chicago":"Hoppe, Thomas, Deborah Schanz, Susann Sturm, and Caren Sureth-Sloane. <i>2016 Global MNC Tax Complexity Survey - Executive Summary</i>, 2017. <a href=\"https://doi.org/10.13140/RG.2.2.23707.46881\">https://doi.org/10.13140/RG.2.2.23707.46881</a>.","apa":"Hoppe, T., Schanz, D., Sturm, S., &#38; Sureth-Sloane, C. (2017). <i>2016 Global MNC Tax Complexity Survey - Executive Summary</i>. <a href=\"https://doi.org/10.13140/RG.2.2.23707.46881\">https://doi.org/10.13140/RG.2.2.23707.46881</a>","bibtex":"@book{Hoppe_Schanz_Sturm_Sureth-Sloane_2017, title={2016 Global MNC Tax Complexity Survey - Executive Summary}, DOI={<a href=\"https://doi.org/10.13140/RG.2.2.23707.46881\">10.13140/RG.2.2.23707.46881</a>}, author={Hoppe, Thomas and Schanz, Deborah and Sturm, Susann and Sureth-Sloane, Caren}, year={2017} }","short":"T. Hoppe, D. Schanz, S. Sturm, C. Sureth-Sloane, 2016 Global MNC Tax Complexity Survey - Executive Summary, 2017.","mla":"Hoppe, Thomas, et al. <i>2016 Global MNC Tax Complexity Survey - Executive Summary</i>. 2017, doi:<a href=\"https://doi.org/10.13140/RG.2.2.23707.46881\">10.13140/RG.2.2.23707.46881</a>."},"has_accepted_license":"1","file_date_updated":"2018-04-06T07:40:03Z","department":[{"_id":"187"},{"_id":"635"}],"user_id":"68607","_id":"2247","project":[{"name":"Der Einfluss von steuerlicher Regulierung auf multinationale Unternehmen","_id":"37","grant_number":"P01"}],"status":"public","urn":"22477","type":"report"},{"department":[{"_id":"187"},{"_id":"635"}],"user_id":"68607","_id":"2250","project":[{"name":"Der Einfluss von steuerlicher Regulierung auf multinationale Unternehmen","_id":"37","grant_number":"P01"}],"file_date_updated":"2018-04-06T07:48:31Z","type":"working_paper","status":"public","author":[{"first_name":"Thomas","last_name":"Hoppe","id":"22671","full_name":"Hoppe, Thomas"},{"first_name":"Deborah","last_name":"Schanz","full_name":"Schanz, Deborah"},{"last_name":"Sturm","full_name":"Sturm, Susann","first_name":"Susann"},{"last_name":"Sureth-Sloane","full_name":"Sureth-Sloane, Caren","id":"530","first_name":"Caren"}],"oa":"1","date_updated":"2022-01-06T06:55:34Z","doi":"10.2139/ssrn.3046546","main_file_link":[{"url":"https://ssrn.com/abstract=3046546","open_access":"1"}],"has_accepted_license":"1","publication_identifier":{"issn":["1556-5068"]},"page":"28","jel":["H20","H25","C83","O57"],"citation":{"ama":"Hoppe T, Schanz D, Sturm S, Sureth-Sloane C. <i>What Are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries</i>.; 2017. doi:<a href=\"https://doi.org/10.2139/ssrn.3046546\">10.2139/ssrn.3046546</a>","ieee":"T. Hoppe, D. Schanz, S. Sturm, and C. Sureth-Sloane, <i>What are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries</i>. 2017.","chicago":"Hoppe, Thomas, Deborah Schanz, Susann Sturm, and Caren Sureth-Sloane. <i>What Are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries</i>, 2017. <a href=\"https://doi.org/10.2139/ssrn.3046546\">https://doi.org/10.2139/ssrn.3046546</a>.","apa":"Hoppe, T., Schanz, D., Sturm, S., &#38; Sureth-Sloane, C. (2017). <i>What are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries</i>. <a href=\"https://doi.org/10.2139/ssrn.3046546\">https://doi.org/10.2139/ssrn.3046546</a>","bibtex":"@book{Hoppe_Schanz_Sturm_Sureth-Sloane_2017, title={What are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries}, DOI={<a href=\"https://doi.org/10.2139/ssrn.3046546\">10.2139/ssrn.3046546</a>}, author={Hoppe, Thomas and Schanz, Deborah and Sturm, Susann and Sureth-Sloane, Caren}, year={2017} }","short":"T. Hoppe, D. Schanz, S. Sturm, C. Sureth-Sloane, What Are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries, 2017.","mla":"Hoppe, Thomas, et al. <i>What Are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries</i>. 2017, doi:<a href=\"https://doi.org/10.2139/ssrn.3046546\">10.2139/ssrn.3046546</a>."},"language":[{"iso":"eng"}],"keyword":["Complexity Drivers","International Comparison","Survey","Tax Complexity","Tax Practitioners"],"ddc":["330"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-04-06T07:48:31Z","date_created":"2018-04-06T07:48:31Z","creator":"hoppet","file_size":1077359,"file_name":"Hoppe Schanz Sturm Sureth-Sloane 2017.pdf","file_id":"2253","access_level":"closed"}],"abstract":[{"text":"All over the world, firms and governments are increasingly concerned about the rise in tax complexity. To manage it and develop effective simplification measures, detailed information on the current drivers of complexity is required. However, research on this topic is scarce. This is surprising as the latest developments—for example, triggered by the BEPS project—give rise to the conjecture that complexity drivers may have changed, thus questioning the findings of prior studies. In this paper, we shed light on this issue and provide a global picture of the current drivers of tax complexity that multinational corporations face based on a survey of 221 highly experienced tax practitioners from 108 countries. Our results show that prior complexity drivers of the tax code are still relevant, with details and changes of tax regulations being the two most influential complexity drivers. We also find evidence for new relevant complexity drivers emerging from different areas of the tax framework, such as inconsistent decisions among tax officers (tax audits) or retroactively applied tax law amendments (tax enactment). Based on the responses of the practitioners, we develop a concept of tax complexity that distinguishes two pillars, tax code and tax framework complexity, and illustrates the various aspects that should be considered when assessing the complexity of a country’s tax system.","lang":"eng"}],"date_created":"2018-04-06T07:44:59Z","title":"What are the Drivers of Tax Complexity for Multinational Corporations? Evidence from 108 Countries","year":"2017"},{"status":"public","editor":[{"first_name":"Ulrich","full_name":"Kortenkamp, Ulrich","last_name":"Kortenkamp"},{"full_name":"Kuzle, Ana","last_name":"Kuzle","first_name":"Ana"}],"type":"conference","publication":"Beiträge zum Mathematikunterricht 2017","language":[{"iso":"ger"}],"user_id":"26809","department":[{"_id":"360"}],"_id":"7767","citation":{"apa":"Schumacher, J. (2017). Sinnkonstruktion beim Erkunden von Mustern und Strukturen. In U. Kortenkamp &#38; A. Kuzle (Eds.), <i>Beiträge zum Mathematikunterricht 2017</i>. Münster: WTM-Verlag.","short":"J. Schumacher, in: U. Kortenkamp, A. Kuzle (Eds.), Beiträge zum Mathematikunterricht 2017, WTM-Verlag, Münster, 2017.","bibtex":"@inproceedings{Schumacher_2017, place={Münster}, title={Sinnkonstruktion beim Erkunden von Mustern und Strukturen}, booktitle={Beiträge zum Mathematikunterricht 2017}, publisher={WTM-Verlag}, author={Schumacher, Jan}, editor={Kortenkamp, Ulrich and Kuzle, AnaEditors}, year={2017} }","mla":"Schumacher, Jan. “Sinnkonstruktion beim Erkunden von Mustern und Strukturen.” <i>Beiträge zum Mathematikunterricht 2017</i>, edited by Ulrich Kortenkamp and Ana Kuzle, WTM-Verlag, 2017.","ama":"Schumacher J. Sinnkonstruktion beim Erkunden von Mustern und Strukturen. In: Kortenkamp U, Kuzle A, eds. <i>Beiträge zum Mathematikunterricht 2017</i>. Münster: WTM-Verlag; 2017.","chicago":"Schumacher, Jan. “Sinnkonstruktion beim Erkunden von Mustern und Strukturen.” In <i>Beiträge zum Mathematikunterricht 2017</i>, edited by Ulrich Kortenkamp and Ana Kuzle. Münster: WTM-Verlag, 2017.","ieee":"J. Schumacher, “Sinnkonstruktion beim Erkunden von Mustern und Strukturen,” in <i>Beiträge zum Mathematikunterricht 2017</i>, 2017."},"year":"2017","place":"Münster","publication_status":"published","main_file_link":[{"url":"https://eldorado.tu-dortmund.de/handle/2003/36640","open_access":"1"}],"title":"Sinnkonstruktion beim Erkunden von Mustern und Strukturen","date_created":"2019-02-19T12:43:36Z","author":[{"full_name":"Schumacher, Jan","id":"26809","orcid":"0000-0002-6676-9774","last_name":"Schumacher","first_name":"Jan"}],"oa":"1","date_updated":"2022-01-06T07:03:45Z","publisher":"WTM-Verlag"},{"volume":31,"author":[{"last_name":"Aziz","full_name":"Aziz, Haris","first_name":"Haris"},{"first_name":"Gerhard","last_name":"Rauchecker","full_name":"Rauchecker, Gerhard"},{"id":"72850","full_name":"Schryen, Guido","last_name":"Schryen","first_name":"Guido"},{"first_name":"Toby","full_name":"Walsh, Toby","last_name":"Walsh"}],"oa":"1","date_updated":"2022-01-06T07:02:35Z","conference":{"name":"Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)","location":"San Francisco, CA, USA"},"has_accepted_license":"1","page":"1-7","intvolume":"        31","citation":{"ieee":"H. Aziz, G. Rauchecker, G. Schryen, and T. Walsh, “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores,” in <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>, San Francisco, CA, USA, 2017, vol. 31, no. 1, pp. 1–7.","chicago":"Aziz, Haris, Gerhard Rauchecker, Guido Schryen, and Toby Walsh. “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.” In <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>, 31:1–7, 2017.","ama":"Aziz H, Rauchecker G, Schryen G, Walsh T. Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In: <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>. Vol 31. ; 2017:1-7.","apa":"Aziz, H., Rauchecker, G., Schryen, G., &#38; Walsh, T. (2017). Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i> (Vol. 31, pp. 1–7). San Francisco, CA, USA.","bibtex":"@inproceedings{Aziz_Rauchecker_Schryen_Walsh_2017, title={Algorithms for Max-Min Share Fair Allocation of Indivisible Chores}, volume={31}, number={1}, booktitle={Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)}, author={Aziz, Haris and Rauchecker, Gerhard and Schryen, Guido and Walsh, Toby}, year={2017}, pages={1–7} }","mla":"Aziz, Haris, et al. “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.” <i>Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)</i>, vol. 31, no. 1, 2017, pp. 1–7.","short":"H. Aziz, G. Rauchecker, G. Schryen, T. Walsh, in: Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), 2017, pp. 1–7."},"department":[{"_id":"277"}],"user_id":"61579","_id":"5692","extern":"1","file_date_updated":"2021-08-13T13:55:29Z","type":"conference","status":"public","date_created":"2018-11-14T15:49:54Z","title":"Algorithms for Max-Min Share Fair Allocation of Indivisible Chores","issue":"1","year":"2017","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)","file":[{"content_type":"application/pdf","relation":"main_file","creator":"hsiemes","date_created":"2018-12-07T11:30:25Z","date_updated":"2021-08-13T13:55:29Z","access_level":"closed","file_id":"6024","file_name":"aziz_rauchecker_schryen_walsh.pdf","file_size":732005},{"relation":"main_file","content_type":"application/pdf","file_name":"10582-Article Text-14110-1-2-20201228.pdf","access_level":"open_access","file_id":"23394","file_size":738751,"creator":"hsiemes","date_created":"2021-08-13T13:55:14Z","date_updated":"2021-08-13T13:55:14Z"}],"abstract":[{"lang":"eng","text":"We consider Max-min Share (MmS) fair allocations of indivisible chores (items with negative utilities). We show that allocation of chores and classical allocation of goods (items with positive utilities) have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa. We prove that an MmS allocation does not need to exist for chores and computing an MmS allocation - if it exists - is strongly NP-hard. In view of these non-existence and complexity results, we present a polynomial-time 2-approximation algorithm for MmS fairness for chores. We then introduce a new fairness concept called optimal MmS that represents the best possible allocation in terms of MmS that is guaranteed to exist. We use connections to parallel machine scheduling to give (1) a polynomial-time approximation scheme for computing an optimal MmS allocation when the number of agents is fixed and (2) an effective and efficient heuristic with an ex-post worst-case analysis."}]},{"doi":"10.1002/nem.1963","oa":"1","date_updated":"2022-01-06T07:02:42Z","author":[{"first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"page":"1--16","citation":{"apa":"Dräxler, S., &#38; Karl, H. (2017). Specification, Composition, and Placement of Network Services with Flexible Structures. <i>International Journal of Network Management</i>, (2), 1--16. <a href=\"https://doi.org/10.1002/nem.1963\">https://doi.org/10.1002/nem.1963</a>","short":"S. Dräxler, H. Karl, International Journal of Network Management (2017) 1--16.","mla":"Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement of Network Services with Flexible Structures.” <i>International Journal of Network Management</i>, no. 2, Wiley Online Library, 2017, pp. 1--16, doi:<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>.","bibtex":"@article{Dräxler_Karl_2017, title={Specification, Composition, and Placement of Network Services with Flexible Structures}, DOI={<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>}, number={2}, journal={International Journal of Network Management}, publisher={Wiley Online Library}, author={Dräxler, Sevil and Karl, Holger}, year={2017}, pages={1--16} }","ama":"Dräxler S, Karl H. Specification, Composition, and Placement of Network Services with Flexible Structures. <i>International Journal of Network Management</i>. 2017;(2):1--16. doi:<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>","chicago":"Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement of Network Services with Flexible Structures.” <i>International Journal of Network Management</i>, no. 2 (2017): 1--16. <a href=\"https://doi.org/10.1002/nem.1963\">https://doi.org/10.1002/nem.1963</a>.","ieee":"S. Dräxler and H. Karl, “Specification, Composition, and Placement of Network Services with Flexible Structures,” <i>International Journal of Network Management</i>, no. 2, pp. 1--16, 2017."},"has_accepted_license":"1","file_date_updated":"2018-06-13T09:22:37Z","_id":"58","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"},{"call_identifier":"5G PPP Phase 1","grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks"}],"department":[{"_id":"75"}],"user_id":"477","urn":"582","status":"public","type":"journal_article","title":"Specification, Composition, and Placement of Network Services with Flexible Structures","publisher":"Wiley Online Library","date_created":"2017-10-17T12:41:02Z","year":"2017","issue":"2","ddc":["040"],"abstract":[{"lang":"eng","text":"Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We define the service structure in a flexible way that enables changing the order of functions in case the functionality of the service is not influenced by this, and propose a YANG data model for expressing this flexibility. Flexible structures allow the network orchestration system to choose the optimal composition of service components that for example gives the best results for placement of services in the network. When number of flexible services and number of components in each service increase, combinatorial explosion limits the practical use of this flexibility. In this paper, we describe a selection heuristic that gives a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different optimization objectives. Moreover, we present a heuristic algorithm for placement of a combination of services, which aims at placing service components along shortest paths that have enough capacity for accommodating the services. By applying these solutions, we show that allowing flexibility in the service structure is feasible."}],"file":[{"relation":"hidden","content_type":"application/pdf","file_size":2765738,"file_id":"1579","file_name":"58-preprint-ijnm.pdf","access_level":"open_access","date_updated":"2018-06-13T09:15:42Z","date_created":"2018-03-21T13:18:13Z","creator":"florida"},{"date_updated":"2018-06-13T09:22:37Z","date_created":"2018-06-13T09:22:37Z","creator":"sevilmeh","file_size":2766920,"file_id":"3197","access_level":"open_access","file_name":"58-accepted-ijnm.pdf","content_type":"application/pdf","relation":"main_file"}],"publication":"International Journal of Network Management"},{"_id":"4780","user_id":"4481","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 50th Hawaii International Conference on System Sciences (2017)","abstract":[{"text":"Quantifying and designing the cost pool generated by Business Intelligence and Analytics (BI&A) would improve cost transparency and invoicing processes, allowing a fairer, more exact allocation of costs to service consumers. Yet there is still no method for determining BI&A costs to provide a base for allocation purposes. While literature describes several methods for BI&A cost estimation on an ROI or resource-consumption level, none of these methods considers an overall approach for BI&A. To tackle this problem, we propose a service-oriented cost allocation model which calculates BI&A applications based on defined services, enabling a cost transfer to service consumers. This new approach specifies steps towards deriving a usable pricing scheme for an entire BI&A service portfolio – both for allocation purposes as well as improving cost evaluation of BI&A projects. Moreover, it prevents BI&A departments from being considered as the sole cost driver, increasing customer understanding and cost awareness.","lang":"eng"}],"status":"public","publisher":"Hawaii International Conference on System Sciences","oa":"1","date_updated":"2022-01-06T07:01:22Z","date_created":"2018-10-18T19:16:58Z","author":[{"first_name":"Raphael","last_name":"Grytz","id":"4481","full_name":"Grytz, Raphael"},{"full_name":"Krohn-Grimberghe, Artus","last_name":"Krohn-Grimberghe","first_name":"Artus"}],"title":"Service-oriented Cost Allocation for Business Intelligence and Analytics: Who pays for BI&A?","main_file_link":[{"open_access":"1","url":"https://scholarspace.manoa.hawaii.edu/bitstream/10125/41276/1/paper0127.pdf"}],"doi":"10.24251/hicss.2017.123","publication_status":"published","publication_identifier":{"isbn":["9780998133102"]},"place":"Koloa, HI, USA","year":"2017","citation":{"chicago":"Grytz, Raphael, and Artus Krohn-Grimberghe. “Service-Oriented Cost Allocation for Business Intelligence and Analytics: Who Pays for BI&#38;A?” In <i>Proceedings of the 50th Hawaii International Conference on System Sciences (2017)</i>. Koloa, HI, USA: Hawaii International Conference on System Sciences, 2017. <a href=\"https://doi.org/10.24251/hicss.2017.123\">https://doi.org/10.24251/hicss.2017.123</a>.","ieee":"R. Grytz and A. Krohn-Grimberghe, “Service-oriented Cost Allocation for Business Intelligence and Analytics: Who pays for BI&#38;A?,” in <i>Proceedings of the 50th Hawaii International Conference on System Sciences (2017)</i>, 2017.","ama":"Grytz R, Krohn-Grimberghe A. Service-oriented Cost Allocation for Business Intelligence and Analytics: Who pays for BI&#38;A? In: <i>Proceedings of the 50th Hawaii International Conference on System Sciences (2017)</i>. Koloa, HI, USA: Hawaii International Conference on System Sciences; 2017. doi:<a href=\"https://doi.org/10.24251/hicss.2017.123\">10.24251/hicss.2017.123</a>","mla":"Grytz, Raphael, and Artus Krohn-Grimberghe. “Service-Oriented Cost Allocation for Business Intelligence and Analytics: Who Pays for BI&#38;A?” <i>Proceedings of the 50th Hawaii International Conference on System Sciences (2017)</i>, Hawaii International Conference on System Sciences, 2017, doi:<a href=\"https://doi.org/10.24251/hicss.2017.123\">10.24251/hicss.2017.123</a>.","bibtex":"@inproceedings{Grytz_Krohn-Grimberghe_2017, place={Koloa, HI, USA}, title={Service-oriented Cost Allocation for Business Intelligence and Analytics: Who pays for BI&#38;A?}, DOI={<a href=\"https://doi.org/10.24251/hicss.2017.123\">10.24251/hicss.2017.123</a>}, booktitle={Proceedings of the 50th Hawaii International Conference on System Sciences (2017)}, publisher={Hawaii International Conference on System Sciences}, author={Grytz, Raphael and Krohn-Grimberghe, Artus}, year={2017} }","short":"R. Grytz, A. Krohn-Grimberghe, in: Proceedings of the 50th Hawaii International Conference on System Sciences (2017), Hawaii International Conference on System Sciences, Koloa, HI, USA, 2017.","apa":"Grytz, R., &#38; Krohn-Grimberghe, A. (2017). Service-oriented Cost Allocation for Business Intelligence and Analytics: Who pays for BI&#38;A? In <i>Proceedings of the 50th Hawaii International Conference on System Sciences (2017)</i>. Koloa, HI, USA: Hawaii International Conference on System Sciences. <a href=\"https://doi.org/10.24251/hicss.2017.123\">https://doi.org/10.24251/hicss.2017.123</a>"}},{"status":"public","type":"conference","file_date_updated":"2018-11-02T14:22:10Z","user_id":"31764","department":[{"_id":"75"}],"project":[{"call_identifier":"5G PPP Phase 1","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"717","citation":{"apa":"Dräxler, S., Karl, H., Peuster, M., Razzaghi Kouchaksaraei, H., Bredel, M., Lessmann, J., … Xilouris, G. (2017). SONATA: Service programming and orchestration for virtualized software networks. In <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. Paris, France: IEEE. <a href=\"https://doi.org/10.1109/iccw.2017.7962785\">https://doi.org/10.1109/iccw.2017.7962785</a>","short":"S. Dräxler, H. Karl, M. Peuster, H. Razzaghi Kouchaksaraei, M. Bredel, J. Lessmann, T. Soenen, W. Tavernier, S. Mendel-Brin, G. Xilouris, in: 2017 IEEE International Conference on Communications Workshops (ICC Workshops), IEEE, 2017.","bibtex":"@inproceedings{Dräxler_Karl_Peuster_Razzaghi Kouchaksaraei_Bredel_Lessmann_Soenen_Tavernier_Mendel-Brin_Xilouris_2017, title={SONATA: Service programming and orchestration for virtualized software networks}, DOI={<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>}, booktitle={2017 IEEE International Conference on Communications Workshops (ICC Workshops)}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Peuster, Manuel and Razzaghi Kouchaksaraei, Hadi and Bredel, Michael and Lessmann, Johannes and Soenen, Thomas and Tavernier, Wouter and Mendel-Brin, Sharon and Xilouris, George}, year={2017} }","mla":"Dräxler, Sevil, et al. “SONATA: Service Programming and Orchestration for Virtualized Software Networks.” <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>.","ieee":"S. Dräxler <i>et al.</i>, “SONATA: Service programming and orchestration for virtualized software networks,” in <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>, Paris, France, 2017.","chicago":"Dräxler, Sevil, Holger Karl, Manuel Peuster, Hadi Razzaghi Kouchaksaraei, Michael Bredel, Johannes Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin, and George Xilouris. “SONATA: Service Programming and Orchestration for Virtualized Software Networks.” In <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/iccw.2017.7962785\">https://doi.org/10.1109/iccw.2017.7962785</a>.","ama":"Dräxler S, Karl H, Peuster M, et al. SONATA: Service programming and orchestration for virtualized software networks. In: <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>"},"publication_status":"published","publication_identifier":{"isbn":["9781509015252"]},"has_accepted_license":"1","main_file_link":[{"url":"https://arxiv.org/pdf/1605.05850.pdf","open_access":"1"}],"conference":{"location":"Paris, France","end_date":"2017-05-25","start_date":"2017-05-21","name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)"},"doi":"10.1109/iccw.2017.7962785","author":[{"first_name":"Sevil","id":"31764","full_name":"Dräxler, Sevil","last_name":"Dräxler"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"id":"60845","full_name":"Razzaghi Kouchaksaraei, Hadi","last_name":"Razzaghi Kouchaksaraei","first_name":"Hadi"},{"first_name":"Michael","full_name":"Bredel, Michael","last_name":"Bredel"},{"full_name":"Lessmann, Johannes","last_name":"Lessmann","first_name":"Johannes"},{"first_name":"Thomas","last_name":"Soenen","full_name":"Soenen, Thomas"},{"first_name":"Wouter","full_name":"Tavernier, Wouter","last_name":"Tavernier"},{"full_name":"Mendel-Brin, Sharon","last_name":"Mendel-Brin","first_name":"Sharon"},{"full_name":"Xilouris, George","last_name":"Xilouris","first_name":"George"}],"oa":"1","date_updated":"2022-01-06T07:03:28Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5270","file_name":"07962785.pdf","access_level":"closed","file_size":821211,"creator":"ups","date_created":"2018-11-02T14:22:10Z","date_updated":"2018-11-02T14:22:10Z"}],"abstract":[{"lang":"eng","text":"In conventional large-scale networks, creation and management of network services are costly and complex tasks that often consume a lot of resources, including time and manpower. Network softwarization and network function virtualization have been introduced to tackle these problems, aiming at decreasing costs and complexity of implementing new services, maintaining the implemented services, and managing available resources in service provisioning platforms and underlying infrastructures. To experience the full potential of these approaches, innovative development support tools and service provisioning environments are needed. To answer these needs, we introduce the architecture of the open-source SONATA system, a service programming, orchestration, and management framework. We present a development toolchain for virtualized network services, fully integrated with a service platform and orchestration system. We introduce the modular and flexible architecture of our system and discuss its main components and features, such as function- and service-specific managers that allow fine-grained service management, slicing support to facilitate multi-tenancy, recursiveness for improved scalability, and full-featured DevOps support."}],"publication":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","language":[{"iso":"eng"}],"ddc":["000"],"year":"2017","title":"SONATA: Service programming and orchestration for virtualized software networks","date_created":"2017-11-22T09:42:59Z","publisher":"IEEE"},{"language":[{"iso":"eng"}],"ddc":["000"],"publication":"IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"main_ris.pdf","file_id":"3432","file_size":963155,"creator":"peuster","date_created":"2018-07-05T11:14:37Z","date_updated":"2018-07-05T11:14:37Z"}],"abstract":[{"lang":"eng","text":"Developing a virtualized network service does not only involve the\r\n  implementation and configuration of the network functions it is\r\n  composed of but also its integration and test with management\r\n  solutions that will control the service in its production\r\n  environment. These integration tasks require testbeds that offer the\r\n  needed network function virtualization infrastructure~(NFVI), like OpenStack, introducing a\r\n  lot of management and maintenance overheads. Such testbed setups\r\n  become even more complicated when the multi\r\n  point-of-presence~(PoP) case, with multiple infrastructure\r\n  installations, is considered.\r\n\r\n  In this demo, we showcase an emulation platform that executes\r\n  containerized network services in user-defined multi-PoP\r\n  topologies. The platform does not only allow network service developers to\r\n  locally test their services but also to connect real-world\r\n  management and orchestration solutions to the emulated PoPs. During our\r\n  interactive demonstration we focus on the integration between\r\n  the emulated infrastructure and state-of-the-art orchestration\r\n  solutions like SONATA or OSM."}],"date_created":"2017-11-27T10:22:25Z","title":"A flexible multi-pop infrastructure emulator for carrier-grade MANO systems","year":"2017","user_id":"13271","department":[{"_id":"75"}],"project":[{"name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","_id":"25","grant_number":"671517","call_identifier":"5G PPP Phase 1"}],"_id":"723","file_date_updated":"2018-07-05T11:14:37Z","type":"conference","status":"public","urn":"7236","author":[{"last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271","first_name":"Manuel"},{"id":"31764","full_name":"Dräxler, Sevil","last_name":"Dräxler","first_name":"Sevil"},{"first_name":"Hadi","last_name":"Razzaghi Kouchaksaraei","id":"60845","full_name":"Razzaghi Kouchaksaraei, Hadi"},{"last_name":"van Rossem","full_name":"van Rossem, Steven","first_name":"Steven"},{"full_name":"Tavernier, Wouter","last_name":"Tavernier","first_name":"Wouter"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"oa":"1","date_updated":"2022-01-06T07:03:30Z","conference":{"name":"IEEE Conference on Network Softwarization","location":"Bologna"},"doi":"10.1109/NETSOFT.2017.8004250","publication_status":"published","has_accepted_license":"1","citation":{"chicago":"Peuster, Manuel, Sevil Dräxler, Hadi Razzaghi Kouchaksaraei, Steven van Rossem, Wouter Tavernier, and Holger Karl. “A Flexible Multi-Pop Infrastructure Emulator for Carrier-Grade MANO Systems.” In <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, 1--3, 2017. <a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">https://doi.org/10.1109/NETSOFT.2017.8004250</a>.","ieee":"M. Peuster, S. Dräxler, H. Razzaghi Kouchaksaraei, S. van Rossem, W. Tavernier, and H. Karl, “A flexible multi-pop infrastructure emulator for carrier-grade MANO systems,” in <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, Bologna, 2017, pp. 1--3.","ama":"Peuster M, Dräxler S, Razzaghi Kouchaksaraei H, van Rossem S, Tavernier W, Karl H. A flexible multi-pop infrastructure emulator for carrier-grade MANO systems. In: <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>. ; 2017:1--3. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">10.1109/NETSOFT.2017.8004250</a>","apa":"Peuster, M., Dräxler, S., Razzaghi Kouchaksaraei, H., van Rossem, S., Tavernier, W., &#38; Karl, H. (2017). A flexible multi-pop infrastructure emulator for carrier-grade MANO systems. In <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i> (pp. 1--3). Bologna. <a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">https://doi.org/10.1109/NETSOFT.2017.8004250</a>","mla":"Peuster, Manuel, et al. “A Flexible Multi-Pop Infrastructure Emulator for Carrier-Grade MANO Systems.” <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, 2017, pp. 1--3, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">10.1109/NETSOFT.2017.8004250</a>.","short":"M. Peuster, S. Dräxler, H. Razzaghi Kouchaksaraei, S. van Rossem, W. Tavernier, H. Karl, in: IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017, 2017, pp. 1--3.","bibtex":"@inproceedings{Peuster_Dräxler_Razzaghi Kouchaksaraei_van Rossem_Tavernier_Karl_2017, title={A flexible multi-pop infrastructure emulator for carrier-grade MANO systems}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">10.1109/NETSOFT.2017.8004250</a>}, booktitle={IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017}, author={Peuster, Manuel and Dräxler, Sevil and Razzaghi Kouchaksaraei, Hadi and van Rossem, Steven and Tavernier, Wouter and Karl, Holger}, year={2017}, pages={1--3} }"},"page":"1--3"},{"year":"2017","citation":{"ieee":"S. Dräxler, H. Karl, and Z. A. Mann, “Joint Optimization of Scaling and Placement of Virtual Network Services,” in <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017.","chicago":"Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “Joint Optimization of Scaling and Placement of Virtual Network Services.” In <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017. <a href=\"https://doi.org/10.1109/CCGRID.2017.25\">https://doi.org/10.1109/CCGRID.2017.25</a>.","ama":"Dräxler S, Karl H, Mann ZA. Joint Optimization of Scaling and Placement of Virtual Network Services. In: <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>","apa":"Dräxler, S., Karl, H., &#38; Mann, Z. A. (2017). Joint Optimization of Scaling and Placement of Virtual Network Services. In <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>. <a href=\"https://doi.org/10.1109/CCGRID.2017.25\">https://doi.org/10.1109/CCGRID.2017.25</a>","bibtex":"@inproceedings{Dräxler_Karl_Mann_2017, title={Joint Optimization of Scaling and Placement of Virtual Network Services}, DOI={<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>}, booktitle={Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2017} }","mla":"Dräxler, Sevil, et al. “Joint Optimization of Scaling and Placement of Virtual Network Services.” <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>.","short":"S. Dräxler, H. Karl, Z.A. Mann, in: Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017."},"has_accepted_license":"1","title":"Joint Optimization of Scaling and Placement of Virtual Network Services","doi":"10.1109/CCGRID.2017.25","oa":"1","date_updated":"2022-01-06T07:03:59Z","author":[{"first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"},{"last_name":"Mann","full_name":"Mann, Zoltan Adam","first_name":"Zoltan Adam"}],"date_created":"2017-10-17T12:41:08Z","abstract":[{"lang":"eng","text":"Management of complex network services requires flexible and efficient service provisioning as well as optimized handling of continuous changes in the workload of the service.To adapt to changes in the demand, service components need to be replicated (scaling) and allocated to physical resources (placement) dynamically. In this paper, we propose a fullyautomated approach to the joint optimization problem of scaling and placement, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability andeffectiveness of the proposed approach."}],"urn":"873","file":[{"date_updated":"2018-06-25T08:07:43Z","creator":"sevilmeh","date_created":"2018-06-25T08:07:43Z","file_size":2229109,"access_level":"open_access","file_name":"RIS.pdf","file_id":"3324","content_type":"application/pdf","relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)","ddc":["040"],"file_date_updated":"2018-06-25T08:07:43Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"},{"call_identifier":"5G PPP Phase 1","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517"}],"_id":"87","user_id":"31764","department":[{"_id":"75"}]},{"year":"2017","title":"Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments","date_created":"2017-11-27T10:22:29Z","abstract":[{"lang":"eng","text":"Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge for resource management decisions taken by \r\nmanagement and orchestration systems. \r\nSuch VNFs are usually not executed in isolation but are often deployed as part of a service function chain (SFC) that connects single functions into complex \r\nstructures. To manage such chains, isolated performance\r\nprofiles of single functions have to be combined to get insights into \r\nthe overall behavior of an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments in which profiling\r\nprocesses need to be fully automated and detailed insights about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem that allows to profile entire SFCs at once. This obviates \r\nmanual modeling procedures to combine profiling results from single\r\nVNFs to reflect SFC performance. \r\nWe use a case study with different SFC configurations to show that it\r\nis hard to model the resulting SFC performance based on single-VNF measurements and that\r\nperformance interactions between real, non-trivial functions that are deployed in a\r\nchain exist.  "}],"file":[{"content_type":"application/pdf","relation":"main_file","creator":"peuster","date_created":"2018-07-05T11:14:00Z","date_updated":"2018-07-05T11:14:00Z","access_level":"open_access","file_id":"3431","file_name":"main_ris.pdf","file_size":2642306}],"publication":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)","ddc":["004"],"language":[{"iso":"eng"}],"place":"Berlin","citation":{"mla":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>.","short":"M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN), Berlin, 2017.","bibtex":"@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }","apa":"Peuster, M., &#38; Karl, H. (2017). Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>","ama":"Peuster M, Karl H. Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In: <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin; 2017. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>","ieee":"M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments,” in <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, Berlin, 2017.","chicago":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin, 2017. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>."},"publication_status":"published","has_accepted_license":"1","doi":"10.1109/NFV-SDN.2017.8169826","conference":{"location":"Berlin","name":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)"},"oa":"1","date_updated":"2022-01-06T07:04:22Z","author":[{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"urn":"9810","status":"public","type":"conference","file_date_updated":"2018-07-05T11:14:00Z","project":[{"call_identifier":"5G PPP Phase 1","grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"981","user_id":"13271","department":[{"_id":"75"}]},{"language":[{"iso":"eng"}],"keyword":["fuzzy analysis","α-level optimization","quantities of interest","optimization with simple constraints","large strain elasticity","large strain elastoplasticity"],"department":[{"_id":"154"}],"user_id":"78813","_id":"9862","status":"public","abstract":[{"lang":"eng","text":"In order to improve the credibility of modern simulation tools, uncertainties of different kinds have to be considered. This work is focused on epistemic uncertainties in the framework of continuum mechanics, which are taken into account by fuzzy analysis. The underlying min-max optimization problem of the extension principle is approximated by α-discretization, resulting in a separation of minimum and maximum problems. To become more universal, so-called quantities of interest are employed, which allow a general formulation for the target problem of interest. In this way, the relation to parameter identification problems based on least-squares functions is highlighted. The solutions of the related optimization problems with simple constraints are obtained with a gradient-based scheme, which is derived from a sensitvity analysis for the target problem by means of a variational formulation. Two numerical examples for the fuzzy analysis of material parameters are concerned with a necking problem at large strain elastoplasticity and a perforated strip at large strain hyperelasticity to demonstrate the versatility of the proposed variational formulation. "}],"publication":"Mathematics and Mechanics of complex systems","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://msp.org/memocs/2017/5-3/memocs-v5-n3-p03-s.pdf"}],"title":"\"A variational formulation for fuzzy analysis in continuum mechanics\"","volume":5,"date_created":"2019-05-20T11:36:47Z","author":[{"full_name":"Mahnken, Rolf","last_name":"Mahnken","first_name":"Rolf"}],"oa":"1","date_updated":"2019-05-27T12:54:35Z","intvolume":"         5","citation":{"chicago":"Mahnken, Rolf. “‘A Variational Formulation for Fuzzy Analysis in Continuum Mechanics.’” <i>Mathematics and Mechanics of Complex Systems</i> 5, no. 3–4 (2017).","ieee":"R. Mahnken, “‘A variational formulation for fuzzy analysis in continuum mechanics,’” <i>Mathematics and Mechanics of complex systems</i>, vol. 5, no. 3–4, 2017.","ama":"Mahnken R. “A variational formulation for fuzzy analysis in continuum mechanics.” <i>Mathematics and Mechanics of complex systems</i>. 2017;5(3-4).","bibtex":"@article{Mahnken_2017, title={“A variational formulation for fuzzy analysis in continuum mechanics”}, volume={5}, number={3–4}, journal={Mathematics and Mechanics of complex systems}, author={Mahnken, Rolf}, year={2017} }","mla":"Mahnken, Rolf. “‘A Variational Formulation for Fuzzy Analysis in Continuum Mechanics.’” <i>Mathematics and Mechanics of Complex Systems</i>, vol. 5, no. 3–4, 2017.","short":"R. Mahnken, Mathematics and Mechanics of Complex Systems 5 (2017).","apa":"Mahnken, R. (2017). “A variational formulation for fuzzy analysis in continuum mechanics.” <i>Mathematics and Mechanics of Complex Systems</i>, <i>5</i>(3–4)."},"year":"2017","issue":"3-4","publication_identifier":{"issn":[" 2325-3444"]},"publication_status":"published"},{"publication":"38th International Conference on Information Systems","license":"https://creativecommons.org/licenses/by-sa/4.0/","file":[{"content_type":"application/pdf","relation":"main_file","creator":"hsiemes","date_created":"2018-12-07T11:31:37Z","date_updated":"2018-12-13T15:07:05Z","access_level":"open_access","file_name":"ICIS2017-Revision.pdf","file_id":"6026","file_size":223790}],"abstract":[{"lang":"eng","text":"Design science is a fundamental research stream that contends its position in the information systems discipline. While ongoing debates address the relative importance of design science contributions in the information systems community, insights into the scientific impact of design science research (DSR) are missing and this lack of understanding arguably poses challenges to an informed discourse. To identify the most influential papers and those factors that explain their scientific impact, this paper presents an exploratory study of the scientific impact of DSR papers published in the AIS Senior Scholars' Basket of Journals. We uncover the current DSR landscape by taking stock of influential papers and theories and develop a model to explain the scientific impact of DSR papers. Our findings show that scientific impact is significantly explained by theorization and novelty. We discuss how the implications of our work can be projected on the overarching discourse on DSR."}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2017","date_created":"2018-11-14T11:33:56Z","title":"Exploring the Scientific Impact of Information Systems Design Science Research: A Scientometric Study","type":"conference","status":"public","department":[{"_id":"277"}],"user_id":"61579","_id":"5594","file_date_updated":"2018-12-13T15:07:05Z","extern":"1","has_accepted_license":"1","citation":{"ieee":"G. Wagner, J. Prester, and G. Schryen, “Exploring the Scientific Impact of Information Systems Design Science Research: A Scientometric Study,” in <i>38th International Conference on Information Systems</i>, Seoul, South Korea, 2017.","chicago":"Wagner, Gerit, Julian Prester, and Guido Schryen. “Exploring the Scientific Impact of Information Systems Design Science Research: A Scientometric Study.” In <i>38th International Conference on Information Systems</i>, 2017.","ama":"Wagner G, Prester J, Schryen G. Exploring the Scientific Impact of Information Systems Design Science Research: A Scientometric Study. In: <i>38th International Conference on Information Systems</i>. ; 2017.","short":"G. Wagner, J. Prester, G. Schryen, in: 38th International Conference on Information Systems, 2017.","bibtex":"@inproceedings{Wagner_Prester_Schryen_2017, title={Exploring the Scientific Impact of Information Systems Design Science Research: A Scientometric Study}, booktitle={38th International Conference on Information Systems}, author={Wagner, Gerit and Prester, Julian and Schryen, Guido}, year={2017} }","mla":"Wagner, Gerit, et al. “Exploring the Scientific Impact of Information Systems Design Science Research: A Scientometric Study.” <i>38th International Conference on Information Systems</i>, 2017.","apa":"Wagner, G., Prester, J., &#38; Schryen, G. (2017). Exploring the Scientific Impact of Information Systems Design Science Research: A Scientometric Study. In <i>38th International Conference on Information Systems</i>. Seoul, South Korea."},"author":[{"last_name":"Wagner","full_name":"Wagner, Gerit","first_name":"Gerit"},{"full_name":"Prester, Julian","last_name":"Prester","first_name":"Julian"},{"last_name":"Schryen","full_name":"Schryen, Guido","id":"72850","first_name":"Guido"}],"oa":"1","date_updated":"2022-01-06T07:02:05Z","conference":{"name":"38th International Conference on Information Systems","location":"Seoul, South Korea"}},{"abstract":[{"lang":"eng","text":"Literature reviews (LRs) are recognized for their increasing impact in the information systems literature. Methodologists have drawn attention to the question of how we can leverage the value of LRs to preserve and generate knowledge. The panelists who participated in the discussion of ?Standalone Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields?? at ICIS 2016 in Dublin acknowledged this significant issue and debated a) what the IS field can learn from other fields and where IS-specific challenges occur, b) how the IS field should move forward to foster the genre of LRs, and c) what best practices are to train doctoral IS students in publishing LRs. This article reports the key takeaways of this panel discussion. Guidance for IS scholars is provided on how to conduct LRs that contribute to the cumulative knowledge development within and across the IS field to best prepare the next generation of IS scholars."}],"file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-07T11:33:59Z","creator":"hsiemes","date_updated":"2018-12-13T15:07:15Z","file_id":"6027","access_level":"open_access","file_name":"Schryen et al. (forthcoming), Literature Reviews in IS Research, What Can Be Learnt from the Past and Other Fields, Communications of th.pdf","file_size":361850}],"publication":"Communications of the AIS","keyword":["Literature Review","Review Methodology","Research Methodology","Doctoral Training"],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2017","title":"Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields?","publisher":"Association for Information Systems (AIS)","date_created":"2018-11-14T14:25:40Z","status":"public","type":"journal_article","extern":"1","file_date_updated":"2018-12-13T15:07:15Z","_id":"5633","department":[{"_id":"277"}],"user_id":"61579","intvolume":"        40","page":"557 - 569","citation":{"chicago":"Schryen, Guido, Alexander Benlian, Frantz Rowe, Gregor Shirley, Kai Larsen, Stacie Petter, Guy Par{\\’e}, Gerit Wagner, Steffi Haag, and Emrah Yasasin. “Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields?” <i>Communications of the AIS</i> 40 (2017): 557–69.","ieee":"G. Schryen <i>et al.</i>, “Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields?,” <i>Communications of the AIS</i>, vol. 40, pp. 557–569, 2017.","ama":"Schryen G, Benlian A, Rowe F, et al. Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields? <i>Communications of the AIS</i>. 2017;40:557-569.","apa":"Schryen, G., Benlian, A., Rowe, F., Shirley, G., Larsen, K., Petter, S., … Yasasin, E. (2017). Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields? <i>Communications of the AIS</i>, <i>40</i>, 557–569.","mla":"Schryen, Guido, et al. “Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields?” <i>Communications of the AIS</i>, vol. 40, Association for Information Systems (AIS), 2017, pp. 557–69.","short":"G. Schryen, A. Benlian, F. Rowe, G. Shirley, K. Larsen, S. Petter, G. Par{\\’e}, G. Wagner, S. Haag, E. Yasasin, Communications of the AIS 40 (2017) 557–569.","bibtex":"@article{Schryen_Benlian_Rowe_Shirley_Larsen_Petter_Par{\\’e}_Wagner_Haag_Yasasin_2017, title={Literature Reviews in IS Research: What Can Be Learnt from the Past and Other Fields?}, volume={40}, journal={Communications of the AIS}, publisher={Association for Information Systems (AIS)}, author={Schryen, Guido and Benlian, Alexander and Rowe, Frantz and Shirley, Gregor and Larsen, Kai and Petter, Stacie and Par{\\’e}, Guy and Wagner, Gerit and Haag, Steffi and Yasasin, Emrah}, year={2017}, pages={557–569} }"},"publication_identifier":{"issn":["1529-3181"]},"has_accepted_license":"1","date_updated":"2022-01-06T07:02:14Z","oa":"1","volume":40,"author":[{"last_name":"Schryen","full_name":"Schryen, Guido","id":"72850","first_name":"Guido"},{"full_name":"Benlian, Alexander","last_name":"Benlian","first_name":"Alexander"},{"last_name":"Rowe","full_name":"Rowe, Frantz","first_name":"Frantz"},{"first_name":"Gregor","full_name":"Shirley, Gregor","last_name":"Shirley"},{"last_name":"Larsen","full_name":"Larsen, Kai","first_name":"Kai"},{"first_name":"Stacie","full_name":"Petter, Stacie","last_name":"Petter"},{"first_name":"Guy","last_name":"Par{\\'e}","full_name":"Par{\\'e}, Guy"},{"last_name":"Wagner","full_name":"Wagner, Gerit","first_name":"Gerit"},{"last_name":"Haag","full_name":"Haag, Steffi","first_name":"Steffi"},{"first_name":"Emrah","full_name":"Yasasin, Emrah","last_name":"Yasasin"}]},{"type":"journal_article","status":"public","_id":"5671","department":[{"_id":"277"}],"user_id":"61579","extern":"1","file_date_updated":"2018-12-13T15:06:56Z","has_accepted_license":"1","page":"205 - 215","intvolume":"       259","citation":{"apa":"Scholz, M., Dorner, V., Schryen, G., &#38; Benlian, A. (2017). A configuration-based recommender system for supporting e-commerce decisions. <i>European Journal of Operational Research</i>, <i>259</i>(1), 205–215.","short":"M. Scholz, V. Dorner, G. Schryen, A. Benlian, European Journal of Operational Research 259 (2017) 205–215.","bibtex":"@article{Scholz_Dorner_Schryen_Benlian_2017, title={A configuration-based recommender system for supporting e-commerce decisions}, volume={259}, number={1}, journal={European Journal of Operational Research}, publisher={Elsevier}, author={Scholz, Michael and Dorner, Verena and Schryen, Guido and Benlian, Alexander}, year={2017}, pages={205–215} }","mla":"Scholz, Michael, et al. “A Configuration-Based Recommender System for Supporting e-Commerce Decisions.” <i>European Journal of Operational Research</i>, vol. 259, no. 1, Elsevier, 2017, pp. 205–15.","chicago":"Scholz, Michael, Verena Dorner, Guido Schryen, and Alexander Benlian. “A Configuration-Based Recommender System for Supporting e-Commerce Decisions.” <i>European Journal of Operational Research</i> 259, no. 1 (2017): 205–15.","ieee":"M. Scholz, V. Dorner, G. Schryen, and A. Benlian, “A configuration-based recommender system for supporting e-commerce decisions,” <i>European Journal of Operational Research</i>, vol. 259, no. 1, pp. 205–215, 2017.","ama":"Scholz M, Dorner V, Schryen G, Benlian A. A configuration-based recommender system for supporting e-commerce decisions. <i>European Journal of Operational Research</i>. 2017;259(1):205-215."},"oa":"1","date_updated":"2022-01-06T07:02:27Z","volume":259,"author":[{"full_name":"Scholz, Michael","last_name":"Scholz","first_name":"Michael"},{"last_name":"Dorner","full_name":"Dorner, Verena","first_name":"Verena"},{"first_name":"Guido","full_name":"Schryen, Guido","id":"72850","last_name":"Schryen"},{"full_name":"Benlian, Alexander","last_name":"Benlian","first_name":"Alexander"}],"publication":"European Journal of Operational Research","abstract":[{"text":"Multi-attribute value theory (MAVT)-based recommender systems have been proposed for dealing with issues of existing recommender systems, such as the cold-start problem and changing preferences. However, as we argue in this paper, existing MAVT-based methods for measuring attribute importance weights do not fit the shopping tasks for which recommender systems are typically used. These methods assume well-trained decision makers who are willing to invest time and cognitive effort, and who are familiar with the attributes describing the available alternatives and the ranges of these attribute levels. Yet, recommender systems are most often used by consumers who are usually not familiar with the available attributes and ranges and who wish to save time and effort. Against this background, we develop a new method, based on a product configuration process, which is tailored to the characteristics of these particular decision makers. We empirically compare our method to SWING, ranking-based conjoint analysis and TRADEOFF in a between-subjects laboratory experiment with 153 participants. Results indicate that our proposed method performs better than TRADEOFF and CONJOINT and at least as well as SWING in terms of recommendation accuracy, better than SWING and TRADEOFF and at least as well as CONJOINT in terms of cognitive load, and that participants were faster with our method than with any other method. We conclude that our method is a promising option to help support consumers' decision processes in e-commerce shopping tasks.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"EJOR article.pdf","file_id":"6025","file_size":762889,"creator":"hsiemes","date_created":"2018-12-07T11:30:59Z","date_updated":"2018-12-13T15:06:56Z"}],"keyword":["E-Commerce","Recommender System","Attribute Weights","Configuration System","Decision Support"],"ddc":["000"],"language":[{"iso":"eng"}],"issue":"1","year":"2017","publisher":"Elsevier","date_created":"2018-11-14T15:06:18Z","title":"A configuration-based recommender system for supporting e-commerce decisions"},{"publication":"Nano Letters","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"2017-08 Peter - Nano Letters - Directional Emission from Dielectric Leaky-Wave Antennas.pdf","access_level":"open_access","file_id":"3917","file_size":3398275,"creator":"fossie","date_created":"2018-08-16T08:07:31Z","date_updated":"2018-08-21T10:41:58Z"}],"ddc":["530"],"keyword":["tet_topic_opticalantenna"],"language":[{"iso":"eng"}],"issue":"7","year":"2017","publisher":"American Chemical Society (ACS)","date_created":"2017-11-13T07:36:01Z","title":"Directional Emission from Dielectric Leaky-Wave Nanoantennas","type":"journal_article","urn":"6808","status":"public","project":[{"name":"TRR 142","_id":"53"},{"_id":"56","name":"TRR 142 - Project Area C"},{"name":"TRR 142 - Subproject C4","_id":"74"}],"_id":"680","user_id":"158","department":[{"_id":"61"},{"_id":"289"}],"file_date_updated":"2018-08-21T10:41:58Z","publication_status":"published","publication_identifier":{"issn":["1530-6984","1530-6992"]},"has_accepted_license":"1","citation":{"apa":"Peter, M., Hildebrandt, A., Schlickriede, C., Gharib, K., Zentgraf, T., Förstner, J., &#38; Linden, S. (2017). Directional Emission from Dielectric Leaky-Wave Nanoantennas. <i>Nano Letters</i>, <i>17</i>(7), 4178–4183. <a href=\"https://doi.org/10.1021/acs.nanolett.7b00966\">https://doi.org/10.1021/acs.nanolett.7b00966</a>","mla":"Peter, Manuel, et al. “Directional Emission from Dielectric Leaky-Wave Nanoantennas.” <i>Nano Letters</i>, vol. 17, no. 7, American Chemical Society (ACS), 2017, pp. 4178–83, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.7b00966\">10.1021/acs.nanolett.7b00966</a>.","bibtex":"@article{Peter_Hildebrandt_Schlickriede_Gharib_Zentgraf_Förstner_Linden_2017, title={Directional Emission from Dielectric Leaky-Wave Nanoantennas}, volume={17}, DOI={<a href=\"https://doi.org/10.1021/acs.nanolett.7b00966\">10.1021/acs.nanolett.7b00966</a>}, number={7}, journal={Nano Letters}, publisher={American Chemical Society (ACS)}, author={Peter, Manuel and Hildebrandt, Andre and Schlickriede, Christian and Gharib, Kimia and Zentgraf, Thomas and Förstner, Jens and Linden, Stefan}, year={2017}, pages={4178–4183} }","short":"M. Peter, A. Hildebrandt, C. Schlickriede, K. Gharib, T. Zentgraf, J. Förstner, S. Linden, Nano Letters 17 (2017) 4178–4183.","chicago":"Peter, Manuel, Andre Hildebrandt, Christian Schlickriede, Kimia Gharib, Thomas Zentgraf, Jens Förstner, and Stefan Linden. “Directional Emission from Dielectric Leaky-Wave Nanoantennas.” <i>Nano Letters</i> 17, no. 7 (2017): 4178–83. <a href=\"https://doi.org/10.1021/acs.nanolett.7b00966\">https://doi.org/10.1021/acs.nanolett.7b00966</a>.","ieee":"M. Peter <i>et al.</i>, “Directional Emission from Dielectric Leaky-Wave Nanoantennas,” <i>Nano Letters</i>, vol. 17, no. 7, pp. 4178–4183, 2017.","ama":"Peter M, Hildebrandt A, Schlickriede C, et al. Directional Emission from Dielectric Leaky-Wave Nanoantennas. <i>Nano Letters</i>. 2017;17(7):4178-4183. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.7b00966\">10.1021/acs.nanolett.7b00966</a>"},"page":"4178-4183","intvolume":"        17","date_updated":"2022-01-06T07:03:20Z","oa":"1","author":[{"first_name":"Manuel","full_name":"Peter, Manuel","last_name":"Peter"},{"full_name":"Hildebrandt, Andre","last_name":"Hildebrandt","first_name":"Andre"},{"id":"59792","full_name":"Schlickriede, Christian","last_name":"Schlickriede","first_name":"Christian"},{"first_name":"Kimia","full_name":"Gharib, Kimia","last_name":"Gharib"},{"first_name":"Thomas","orcid":"0000-0002-8662-1101","last_name":"Zentgraf","id":"30525","full_name":"Zentgraf, Thomas"},{"full_name":"Förstner, Jens","id":"158","last_name":"Förstner","orcid":"0000-0001-7059-9862","first_name":"Jens"},{"full_name":"Linden, Stefan","last_name":"Linden","first_name":"Stefan"}],"volume":17,"doi":"10.1021/acs.nanolett.7b00966"},{"date_created":"2019-07-10T08:12:22Z","author":[{"orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz","id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian"}],"date_updated":"2022-01-06T06:50:46Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://d-nb.info/1139356542/34"}],"doi":"10.17619/UNIPB/1-176","title":" \tExploiting structure in multiobjective optimization and optimal control","publication_status":"published","has_accepted_license":"1","citation":{"mla":"Peitz, Sebastian. <i>  Exploiting Structure in Multiobjective Optimization and Optimal Control</i>. 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-176\">10.17619/UNIPB/1-176</a>.","bibtex":"@book{Peitz_2017, title={  Exploiting structure in multiobjective optimization and optimal control}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-176\">10.17619/UNIPB/1-176</a>}, author={Peitz, Sebastian}, year={2017} }","short":"S. Peitz,   Exploiting Structure in Multiobjective Optimization and Optimal Control, 2017.","apa":"Peitz, S. (2017). <i>  Exploiting structure in multiobjective optimization and optimal control</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-176\">https://doi.org/10.17619/UNIPB/1-176</a>","ieee":"S. Peitz, <i>  Exploiting structure in multiobjective optimization and optimal control</i>. 2017.","chicago":"Peitz, Sebastian. <i>  Exploiting Structure in Multiobjective Optimization and Optimal Control</i>, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-176\">https://doi.org/10.17619/UNIPB/1-176</a>.","ama":"Peitz S. <i>  Exploiting Structure in Multiobjective Optimization and Optimal Control</i>.; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-176\">10.17619/UNIPB/1-176</a>"},"year":"2017","user_id":"47427","department":[{"_id":"101"}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"10594","file_date_updated":"2020-03-13T12:52:50Z","language":[{"iso":"eng"}],"ddc":["510"],"type":"dissertation","file":[{"creator":"speitz","date_created":"2020-03-13T12:52:50Z","date_updated":"2020-03-13T12:52:50Z","access_level":"closed","file_name":"Dissertation_Peitz.pdf","file_id":"16298","file_size":16636801,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute\r\nthe set of optimal compromises (the Pareto set) between the conflicting objectives.\r\n\r\nSince – in contrast to the solution of a single objective optimization problem – the\r\nPareto set generally consists of an infinite number of solutions, the computational\r\neffort can quickly become challenging. This is even more the case when many problems have to be solved, when the number of objectives is high, or when the objectives\r\nare costly to evaluate. Consequently, this thesis is devoted to the identification and\r\nexploitation of structure both in the Pareto set and the dynamics of the underlying\r\nmodel as well as to the development of efficient algorithms for solving problems with\r\nadditional parameters, with a high number of objectives or with PDE-constraints.\r\nThese three challenges are addressed in three respective parts.\r\n\r\nIn the first part, predictor-corrector methods are extended to entire Pareto sets.\r\nWhen certain smoothness assumptions are satisfied, then the set of parameter dependent Pareto sets possesses additional structure, i.e. it is a manifold. The tangent\r\nspace can be approximated numerically which yields a direction for the predictor\r\nstep. In the corrector step, the predicted set converges to the Pareto set at a new\r\nparameter value. The resulting algorithm is applied to an example from autonomous\r\ndriving.\r\n\r\nIn the second part, the hierarchical structure of Pareto sets is investigated. When\r\nconsidering a subset of the objectives, the resulting solution is a subset of the Pareto\r\nset of the original problem. Under additional smoothness assumptions, the respective subsets are located on the boundary of the Pareto set of the full problem. This\r\nway, the “skeleton” of a Pareto set can be computed and due to the exponential\r\nincrease in computing time with the number of objectives, the computations of\r\nthese subsets are significantly faster which is demonstrated using an example from\r\nindustrial laundries.\r\n\r\nIn the third part, PDE-constrained multiobjective optimal control problems are\r\naddressed by reduced order modeling methods. Reduced order models exploit the\r\nstructure in the system dynamics, for example by describing the dynamics of only the\r\nmost energetic modes. The model reduction introduces an error in both the function values and their gradients, which has to be taken into account in the development of\r\nalgorithms. Both scalarization and set-oriented approaches are coupled with reduced\r\norder modeling. Convergence results are presented and the numerical benefit is\r\ninvestigated. The algorithms are applied to semi-linear heat flow problems as well\r\nas to the Navier-Stokes equations.\r\n","lang":"eng"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1083","user_id":"42447","series_title":"Working Papers CIE","department":[{"_id":"280"},{"_id":"205"},{"_id":"475"}],"file_date_updated":"2018-08-15T07:33:12Z","type":"working_paper","status":"public","oa":"1","date_updated":"2022-01-06T06:50:51Z","author":[{"first_name":"Britta","id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer"},{"first_name":"Nadja","id":"13264","full_name":"Stroh-Maraun, Nadja","last_name":"Stroh-Maraun"}],"volume":110,"main_file_link":[{"open_access":"1","url":"http://groups.uni-paderborn.de/wp-wiwi/RePEc/pdf/ciepap/WP110.pdf"}],"has_accepted_license":"1","citation":{"apa":"Hoyer, B., &#38; Stroh-Maraun, N. (2017). <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i> (Vol. 110). CIE Working Paper Series, Paderborn University.","bibtex":"@book{Hoyer_Stroh-Maraun_2017, series={Working Papers CIE}, title={Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse}, volume={110}, publisher={CIE Working Paper Series, Paderborn University}, author={Hoyer, Britta and Stroh-Maraun, Nadja}, year={2017}, collection={Working Papers CIE} }","mla":"Hoyer, Britta, and Nadja Stroh-Maraun. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol. 110, CIE Working Paper Series, Paderborn University, 2017.","short":"B. Hoyer, N. Stroh-Maraun, Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse, CIE Working Paper Series, Paderborn University, 2017.","chicago":"Hoyer, Britta, and Nadja Stroh-Maraun. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol. 110. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2017.","ieee":"B. Hoyer and N. Stroh-Maraun, <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>, vol. 110. CIE Working Paper Series, Paderborn University, 2017.","ama":"Hoyer B, Stroh-Maraun N. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol 110. CIE Working Paper Series, Paderborn University; 2017."},"intvolume":"       110","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"In actual school choice applications the theoretical underpinnings of the Boston School Choice Mechanism (BM) (complete information and rationality of the agents) are often not given. We analyze the actual behavior of agents in such a matching mechanism, using data from the matching mechanism currently used in a clearinghouse at a faculty of Business Administration and Economics at a German university, where a variant of the BM is used, and supplement this data with data generated in a survey among students who participated in the clearinghouse. We find that under the current mechanism over 70% of students act strategically. Controlling for students' limited information, we find that they do act rationally in their decision to act strategically. While students thus seem to react to the incentives to act strategically under the BM, they do not seem to be able to use this to their own advantage. However, those students acting in line with their beliefs manage a significantly better personal outcome than those who do not. We also run simulations by using a variant of the deferred acceptance algorithm, adapted to our situation, to show that the use of a different algorithm may be to the students' advantage.","lang":"eng"}],"file":[{"date_created":"2018-08-15T07:33:12Z","creator":"nmaraun","date_updated":"2018-08-15T07:33:12Z","file_name":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse.pdf","file_id":"3911","access_level":"closed","file_size":346752,"content_type":"application/pdf","relation":"main_file","success":1}],"publisher":"CIE Working Paper Series, Paderborn University","date_created":"2017-12-20T16:21:51Z","title":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse","year":"2017"},{"type":"mastersthesis","status":"public","file":[{"file_size":5093611,"title":"Master's Thesis","access_level":"open_access","file_id":"12905","file_name":"fpauck_2017.pdf","date_updated":"2019-08-07T09:03:48Z","date_created":"2019-08-07T08:55:58Z","creator":"fpauck","relation":"main_file","content_type":"application/pdf"}],"department":[{"_id":"77"}],"user_id":"22398","_id":"109","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"file_date_updated":"2019-08-07T09:03:48Z","ddc":["000"],"has_accepted_license":"1","citation":{"ama":"Pauck F. <i>Cooperative Static Analysis of Android Applications</i>. Universität Paderborn; 2017.","chicago":"Pauck, Felix. <i>Cooperative Static Analysis of Android Applications</i>. Universität Paderborn, 2017.","ieee":"F. Pauck, <i>Cooperative static analysis of Android applications</i>. Universität Paderborn, 2017.","apa":"Pauck, F. (2017). <i>Cooperative static analysis of Android applications</i>. Universität Paderborn.","bibtex":"@book{Pauck_2017, title={Cooperative static analysis of Android applications}, publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }","mla":"Pauck, Felix. <i>Cooperative Static Analysis of Android Applications</i>. Universität Paderborn, 2017.","short":"F. Pauck, Cooperative Static Analysis of Android Applications, Universität Paderborn, 2017."},"year":"2017","supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2017-10-17T12:41:12Z","author":[{"first_name":"Felix","id":"22398","full_name":"Pauck, Felix","last_name":"Pauck"}],"oa":"1","date_updated":"2022-01-06T06:50:52Z","publisher":"Universität Paderborn","title":"Cooperative static analysis of Android applications"},{"page":"2970-2979","citation":{"mla":"John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2017, pp. 2970–79.","short":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, M. Langendorf, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","bibtex":"@inproceedings{John_Feldotto_Hemsen_Klingsieck_Kundisch_Langendorf_2017, title={Towards a Lean Approach for Gamifying Education}, booktitle={Proceedings of the 25th European Conference on Information Systems (ECIS)}, author={John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike}, year={2017}, pages={2970–2979} }","apa":"John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., &#38; Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i> (pp. 2970–2979).","ama":"John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>. ; 2017:2970-2979.","chicago":"John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2970–79, 2017.","ieee":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2017, pp. 2970–2979."},"year":"2017","has_accepted_license":"1","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2017_rip/46","open_access":"1"}],"title":"Towards a Lean Approach for Gamifying Education","author":[{"first_name":"Thomas","last_name":"John","full_name":"John, Thomas","id":"3952"},{"id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"last_name":"Hemsen","id":"22546","full_name":"Hemsen, Paul","first_name":"Paul"},{"full_name":"Klingsieck, Katrin","last_name":"Klingsieck","first_name":"Katrin"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"},{"last_name":"Langendorf","full_name":"Langendorf, Mike","first_name":"Mike"}],"date_created":"2018-01-05T08:39:41Z","oa":"1","date_updated":"2022-01-06T06:50:53Z","status":"public","file":[{"file_size":485333,"access_level":"closed","file_id":"5232","file_name":"TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf","date_updated":"2018-10-31T17:02:07Z","creator":"feldi","date_created":"2018-10-31T17:02:07Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. ","lang":"eng"}],"publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","type":"conference","language":[{"iso":"eng"}],"file_date_updated":"2018-10-31T17:02:07Z","ddc":["000"],"department":[{"_id":"63"},{"_id":"541"},{"_id":"178"},{"_id":"185"}],"user_id":"14052","_id":"1095"}]