[{"project":[{"name":"SFB 901","_id":"1"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"name":"SFB 901 - Project Area T","_id":"82"}],"file_date_updated":"2020-04-09T09:59:03Z","citation":{"chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM, 2020. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>.","short":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, C. Striecks, in: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, New York, NY, USA, 2020.","ieee":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection,” in <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> Taiwan, 2020.","apa":"Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., &#38; Striecks, C. (2020). Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Slamanig_Striecks_2020, place={New York, NY, USA}, title={Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection}, DOI={<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>}, booktitle={Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),}, publisher={ACM}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Slamanig, Daniel and Striecks, Christoph}, year={2020} }","ama":"Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In: <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>","mla":"Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>."},"oa":"1","place":"New York, NY, USA","has_accepted_license":"1","status":"public","conference":{"location":"Taiwan","name":"ASIA CCS'20"},"ddc":["000"],"user_id":"477","publisher":"ACM","_id":"16487","publication":"Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),","type":"conference","department":[{"_id":"64"}],"file":[{"file_id":"16488","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-04-09T09:59:03Z","file_name":"main.pdf","access_level":"closed","file_size":553623,"date_created":"2020-04-09T09:59:03Z","creator":"feidens"}],"date_created":"2020-04-09T10:00:29Z","date_updated":"2022-01-06T06:52:51Z","title":"Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection","year":"2020","author":[{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"},{"id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian","last_name":"Eidens"},{"first_name":"Stephan","last_name":"Krenn","full_name":"Krenn, Stephan"},{"full_name":"Slamanig, Daniel","first_name":"Daniel","last_name":"Slamanig"},{"full_name":"Striecks, Christoph","first_name":"Christoph","last_name":"Striecks"}],"doi":"10.1145/3320269.3384769","main_file_link":[{"url":"https://eprint.iacr.org/2020/382","open_access":"1"}],"language":[{"iso":"eng"}]},{"date_created":"2020-04-15T13:54:26Z","type":"journal_article","department":[{"_id":"66"},{"_id":"534"}],"publication":"Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering & Evolution (WSRE) & 11h Workshop Design for Future (DFF)","citation":{"ama":"Jovanovikj I, Yigitbas E, Sauer S, Engels G. Challenges in Model-Driven Development of Multi-Platform Augmented Reality Applications . <i>Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)</i>. 2020.","bibtex":"@article{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Challenges in Model-Driven Development of Multi-Platform Augmented Reality Applications }, journal={Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)}, author={Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}, year={2020} }","mla":"Jovanovikj, Ivan, et al. “Challenges in Model-Driven Development of Multi-Platform Augmented Reality Applications .” <i>Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)</i>, 2020.","chicago":"Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Challenges in Model-Driven Development of Multi-Platform Augmented Reality Applications .” <i>Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)</i>, 2020.","short":"I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF) (2020).","apa":"Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Challenges in Model-Driven Development of Multi-Platform Augmented Reality Applications . <i>Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)</i>.","ieee":"I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Challenges in Model-Driven Development of Multi-Platform Augmented Reality Applications ,” <i>Softwaretechnik-Trends, Proceedings of the 22st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 11h Workshop Design for Future (DFF)</i>, 2020."},"_id":"16570","language":[{"iso":"eng"}],"user_id":"8447","title":"Challenges in Model-Driven Development of Multi-Platform Augmented Reality Applications ","year":"2020","status":"public","author":[{"id":"39187","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X","first_name":"Ivan","full_name":"Jovanovikj, Ivan"},{"last_name":"Yigitbas","first_name":"Enes","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes","id":"8447"},{"id":"447","last_name":"Sauer","first_name":"Stefan","full_name":"Sauer, Stefan"},{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"}],"date_updated":"2022-01-06T06:52:52Z"},{"date_created":"2020-04-19T14:01:53Z","department":[{"_id":"7"},{"_id":"77"}],"type":"conference","citation":{"ama":"Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In: <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM.","bibtex":"@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM}, author={Sharma, Arnab and Wehrheim, Heike} }","mla":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i>, ACM.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” In <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM, n.d.","short":"A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.","apa":"Sharma, A., &#38; Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM.","ieee":"A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models,” in <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i>"},"publication":"Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"_id":"16724","language":[{"iso":"eng"}],"publisher":"ACM","user_id":"477","author":[{"full_name":"Sharma, Arnab","last_name":"Sharma","first_name":"Arnab","id":"67200"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"title":"Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models","status":"public","year":"2020","date_updated":"2022-01-06T06:52:55Z","publication_status":"accepted"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"publication":"Journal of Automated Software Engineering","citation":{"mla":"Richter, Cedric, et al. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, Springer.","ama":"Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.","bibtex":"@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection for Software Validation Based on Graph Kernels}, journal={Journal of Automated Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }","apa":"Richter, C., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (n.d.). Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.","ieee":"C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection for Software Validation Based on Graph Kernels,” <i>Journal of Automated Software Engineering</i>.","short":"C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated Software Engineering (n.d.).","chicago":"Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, n.d."},"type":"journal_article","department":[{"_id":"7"},{"_id":"77"},{"_id":"355"}],"date_created":"2020-04-19T14:08:06Z","date_updated":"2022-01-06T06:52:55Z","publication_status":"accepted","year":"2020","title":"Algorithm Selection for Software Validation Based on Graph Kernels","status":"public","author":[{"id":"50003","last_name":"Richter","first_name":"Cedric","full_name":"Richter, Cedric"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"user_id":"477","_id":"16725","language":[{"iso":"eng"}],"publisher":"Springer"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"abstract":[{"lang":"eng","text":"The maintenance of efficient and robust overlay networks is one\r\nof the most fundamental and reoccurring themes in networking.\r\nThis paper presents a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto preserve connectivity, review algorithms for the fundamental\r\nproblem of graph linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable topologies. \r\nWe also identify open problems and avenues for future research.\r\n"}],"citation":{"short":"M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).","chicago":"Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, 2020. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>.","ieee":"M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” <i>ACM Computing Surveys</i>, 2020.","apa":"Feldmann, M., Scheideler, C., &#38; Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>","bibtex":"@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }","ama":"Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. 2020. doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>","mla":"Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>."},"publication":"ACM Computing Surveys","department":[{"_id":"79"}],"type":"journal_article","date_created":"2020-04-29T07:09:50Z","date_updated":"2022-01-06T06:52:58Z","author":[{"id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"title":"Survey on Algorithms for Self-Stabilizing Overlay Networks","status":"public","year":"2020","user_id":"23538","doi":"10.1145/3397190","_id":"16902","publisher":"ACM","language":[{"iso":"eng"}]},{"external_id":{"arxiv":["2005.07388"]},"date_created":"2020-04-29T07:16:35Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","citation":{"short":"M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.","chicago":"Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM, 2020. <a href=\"https://doi.org/10.1145/3350755.3400246\">https://doi.org/10.1145/3350755.3400246</a>.","apa":"Feldmann, M., Khazraei, A., &#38; Scheideler, C. (2020). Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM. <a href=\"https://doi.org/10.1145/3350755.3400246\">https://doi.org/10.1145/3350755.3400246</a>","ieee":"M. Feldmann, A. Khazraei, and C. Scheideler, “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2020.","ama":"Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400246\">10.1145/3350755.3400246</a>","bibtex":"@inproceedings{Feldmann_Khazraei_Scheideler_2020, title={Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400246\">10.1145/3350755.3400246</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian}, year={2020} }","mla":"Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400246\">10.1145/3350755.3400246</a>."},"abstract":[{"text":"We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in \\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.\r\nAs is standard in clock synchronization, we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$ bits of memory required for any such protocol.\r\nAfterwards we present a protocol that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements.","lang":"eng"}],"project":[{"name":"Algorithmen für programmierbare Materie in einem physiologischen Medium","_id":"96"}],"_id":"16903","publisher":"ACM","language":[{"iso":"eng"}],"user_id":"23538","doi":"10.1145/3350755.3400246","title":"Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model","status":"public","year":"2020","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann","id":"23538"},{"full_name":"Khazraei, Ardalan","first_name":"Ardalan","last_name":"Khazraei"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:52:58Z"},{"publication":"Proceedings of the 22nd IEEE International Conference on Business Informatics","abstract":[{"text":"The continuous innovation of its business models is an important task for a company to stay competitive. During this process, the company has to validate various hypotheses about its business models by adapting to uncertain and changing customer needs effectively and efficiently. This adaptation, in turn, can be supported by the concept of Software Product Lines (SPLs). SPLs reduce the time to market by deriving products for customers with changing requirements using a common set of features, structured as a feature model. Analogously, we support the process of business model adaptation by applying the engineering process of SPLs to the structure of the Business Model Canvas (BMC). We call this concept a Business Model Decision Line (BMDL). The BMDL matches business domain knowledge in the form of a feature model with customer needs to derive hypotheses about the business model together with experiments for validation. Our approach is effective by providing a comprehensive overview of possible business model adaptations and efficient by reusing experiments for different hypotheses. We implement our approach in a tool and illustrate the usefulness with an example of developing business models for a mobile application.","lang":"eng"}],"file":[{"date_created":"2020-07-14T09:33:00Z","creator":"sego","content_type":"application/pdf","file_id":"17383","access_level":"open_access","file_size":569290,"file_name":"CBI.pdf","date_updated":"2020-07-14T09:33:00Z","relation":"main_file"}],"date_created":"2020-05-04T12:16:54Z","keyword":["Business Model Decision Line","Business Model Adaptation","Hypothesis-driven Adaptation","Software Product Line","Feature Model"],"type":"conference","department":[{"_id":"66"}],"title":"Hypothesis-driven Adaptation of Business Models based on Product Line Engineering","year":"2020","author":[{"id":"47208","first_name":"Sebastian","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian"},{"id":"5281","full_name":"Rittmeier, Florian","last_name":"Rittmeier","first_name":"Florian"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"date_updated":"2022-01-06T06:52:59Z","language":[{"iso":"eng"}],"doi":"10.1109/CBI49978.2020.00022","file_date_updated":"2020-07-14T09:33:00Z","citation":{"apa":"Gottschalk, S., Rittmeier, F., &#38; Engels, G. (2020). Hypothesis-driven Adaptation of Business Models based on Product Line Engineering. In <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>. Antwerp: IEEE. <a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">https://doi.org/10.1109/CBI49978.2020.00022</a>","ieee":"S. Gottschalk, F. Rittmeier, and G. Engels, “Hypothesis-driven Adaptation of Business Models based on Product Line Engineering,” in <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>, Antwerp, 2020.","chicago":"Gottschalk, Sebastian, Florian Rittmeier, and Gregor Engels. “Hypothesis-Driven Adaptation of Business Models Based on Product Line Engineering.” In <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">https://doi.org/10.1109/CBI49978.2020.00022</a>.","short":"S. Gottschalk, F. Rittmeier, G. Engels, in: Proceedings of the 22nd IEEE International Conference on Business Informatics, IEEE, 2020.","mla":"Gottschalk, Sebastian, et al. “Hypothesis-Driven Adaptation of Business Models Based on Product Line Engineering.” <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">10.1109/CBI49978.2020.00022</a>.","ama":"Gottschalk S, Rittmeier F, Engels G. Hypothesis-driven Adaptation of Business Models based on Product Line Engineering. In: <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">10.1109/CBI49978.2020.00022</a>","bibtex":"@inproceedings{Gottschalk_Rittmeier_Engels_2020, title={Hypothesis-driven Adaptation of Business Models based on Product Line Engineering}, DOI={<a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">10.1109/CBI49978.2020.00022</a>}, booktitle={Proceedings of the 22nd IEEE International Conference on Business Informatics}, publisher={IEEE}, author={Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}, year={2020} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"oa":"1","status":"public","conference":{"name":"22nd IEEE International Conference on Business Informatics","start_date":"2020-06-22","location":"Antwerp","end_date":"2020-06-24"},"has_accepted_license":"1","publisher":"IEEE","_id":"16933","ddc":["006"],"user_id":"47208"},{"conference":{"end_date":"2020-07-08","start_date":"2020-07-06","name":"10th International Symposium on Business Modeling and Software Design ","location":"Potsdam"},"status":"public","has_accepted_license":"1","_id":"16934","publisher":"Springer International Publishing","page":"276-286","editor":[{"full_name":"Shishkov, Boris","last_name":"Shishkov","first_name":"Boris"}],"volume":391,"ddc":["006"],"user_id":"47208","citation":{"apa":"Gottschalk, S., Yigitbas, E., &#38; Engels, G. (2020). Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs. In B. Shishkov (Ed.), <i>Business Modeling and Software Design</i> (Vol. 391, pp. 276–286). Potsdam: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">https://doi.org/10.1007/978-3-030-52306-0_18</a>","ieee":"S. Gottschalk, E. Yigitbas, and G. Engels, “Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs,” in <i>Business Modeling and Software Design</i>, Potsdam, 2020, vol. 391, pp. 276–286.","short":"S. Gottschalk, E. Yigitbas, G. Engels, in: B. Shishkov (Ed.), Business Modeling and Software Design, Springer International Publishing, 2020, pp. 276–286.","chicago":"Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs.” In <i>Business Modeling and Software Design</i>, edited by Boris Shishkov, 391:276–86. Lecture Notes in Business Information Processing. Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">https://doi.org/10.1007/978-3-030-52306-0_18</a>.","mla":"Gottschalk, Sebastian, et al. “Model-Based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs.” <i>Business Modeling and Software Design</i>, edited by Boris Shishkov, vol. 391, Springer International Publishing, 2020, pp. 276–86, doi:<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>.","ama":"Gottschalk S, Yigitbas E, Engels G. Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs. In: Shishkov B, ed. <i>Business Modeling and Software Design</i>. Vol 391. Lecture Notes in Business Information Processing. Springer International Publishing; 2020:276-286. doi:<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>","bibtex":"@inproceedings{Gottschalk_Yigitbas_Engels_2020, series={Lecture Notes in Business Information Processing}, title={Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs}, volume={391}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>}, booktitle={Business Modeling and Software Design}, publisher={Springer International Publishing}, author={Gottschalk, Sebastian and Yigitbas, Enes and Engels, Gregor}, editor={Shishkov, BorisEditor}, year={2020}, pages={276–286}, collection={Lecture Notes in Business Information Processing} }"},"file_date_updated":"2020-07-14T09:28:33Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"oa":"1","author":[{"last_name":"Gottschalk","first_name":"Sebastian","full_name":"Gottschalk, Sebastian","id":"47208"},{"id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes","full_name":"Yigitbas, Enes"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"year":"2020","title":"Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs","intvolume":"       391","date_updated":"2022-01-06T06:52:59Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Business Information Processing","doi":"10.1007/978-3-030-52306-0_18","publication":"Business Modeling and Software Design","abstract":[{"text":"To build successful products, the developers have to adapt their product features and business models to uncertain customer needs. This adaptation is part of the research discipline of Hypotheses Engineering (HE) where customer needs can be seen as hypotheses that need to be tested iteratively by conducting experiments together with the customer. So far, modeling support and associated traceability of this iterative process are missing. Both, in turn, are important to document the adaptation to the customer needs and identify experiments that provide most evidence to the customer needs. To target this issue, we introduce a model-based HE approach with a twofold contribution: First, we develop a modeling language that models hypotheses and experiments as interrelated hierarchies together with a mapping between them. While the hypotheses are labeled with a score level of their current evidence, the experiments are labeled with a score level of maximum evidence that can be achieved during conduction. Second, we provide an iterative process to determine experiments that offer the most evidence improvement to the modeled hypotheses. We illustrate the usefulness of the approach with an example of testing the business model of a mobile application.","lang":"eng"}],"date_created":"2020-05-04T12:27:38Z","file":[{"content_type":"application/pdf","file_id":"17380","date_updated":"2020-07-14T09:28:33Z","relation":"main_file","access_level":"open_access","file_size":267658,"file_name":"BMSD20.pdf","date_created":"2020-07-14T09:25:30Z","creator":"sego"}],"department":[{"_id":"66"}],"type":"conference","keyword":["Hypothesis Engineering","Model-based","Customer Need Adaptation","Business Model","Product Features"]},{"citation":{"mla":"Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.” <i>Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)</i>, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-54921-3_4\">10.1007/978-3-030-54921-3_4</a>.","ama":"Braun M, Castenow J, Meyer auf der Heide F. Local Gathering of Mobile Robots in Three Dimensions. In: <i>Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)</i>. Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-54921-3_4\">10.1007/978-3-030-54921-3_4</a>","bibtex":"@inproceedings{Braun_Castenow_Meyer auf der Heide_2020, title={Local Gathering of Mobile Robots in Three Dimensions}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-54921-3_4\">10.1007/978-3-030-54921-3_4</a>}, booktitle={Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)}, publisher={Springer}, author={Braun, Michael and Castenow, Jannik and Meyer auf der Heide, Friedhelm}, year={2020} }","apa":"Braun, M., Castenow, J., &#38; Meyer auf der Heide, F. (2020). Local Gathering of Mobile Robots in Three Dimensions. In <i>Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)</i>. Paderborn: Springer. <a href=\"https://doi.org/10.1007/978-3-030-54921-3_4\">https://doi.org/10.1007/978-3-030-54921-3_4</a>","ieee":"M. Braun, J. Castenow, and F. Meyer auf der Heide, “Local Gathering of Mobile Robots in Three Dimensions,” in <i>Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)</i>, Paderborn, 2020.","short":"M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020.","chicago":"Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local Gathering of Mobile Robots in Three Dimensions.” In <i>Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)</i>. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-54921-3_4\">https://doi.org/10.1007/978-3-030-54921-3_4</a>."},"file_date_updated":"2020-07-31T08:22:16Z","external_id":{"arxiv":["arXiv:2005.07495"]},"has_accepted_license":"1","conference":{"end_date":"2020-07-01","location":"Paderborn","start_date":"2020-06-29","name":"SIROCCO 2020"},"status":"public","user_id":"38705","ddc":["000"],"_id":"16968","publisher":"Springer","abstract":[{"text":"In this work, we initiate the research about the Gathering problem for robots\r\nwith limited viewing range in the three-dimensional Euclidean space. In the\r\nGathering problem, a set of initially scattered robots is required to gather at\r\nthe same position. The robots' capabilities are very restricted -- they do not\r\nagree on any coordinate system or compass, have a limited viewing range, have\r\nno memory of the past and cannot communicate. We study the problem in two\r\ndifferent time models, in FSYNC (fully synchronized discrete rounds) and the\r\ncontinuous time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy\r\nand prove a runtime of $\\Theta(n^2)$ that matches the currently best runtime\r\nbound for the same model in the Euclidean plane [SPAA'11]. Our main result is\r\nthe generalization of contracting strategies (continuous time) from\r\n[Algosensors'17] to three dimensions. In contracting strategies, every robot\r\nthat is located on the global convex hull of all robots' positions moves with\r\nfull speed towards the inside of the convex hull. We prove a runtime bound of\r\n$O(\\Delta \\cdot n^{3/2})$ for any three-dimensional contracting strategy, where\r\n$\\Delta$ denotes the diameter of the initial configuration. This comes up to a\r\nfactor of $\\sqrt{n}$ close to the lower bound of $\\Omega (\\Delta \\cdot n)$\r\nwhich is already true in two dimensions. In general, it might be hard for\r\nrobots with limited viewing range to decide whether they are located on the\r\nglobal convex hull and which movement maintains the connectivity of the swarm,\r\nrendering the design of concrete contracting strategies a challenging task. We\r\nprove that the continuous variant of 3D-Go-To-The-Center is contracting and\r\nkeeps the swarm connected. Moreover, we give a simple design criterion for\r\nthree-dimensional contracting strategies that maintains the connectivity of the\r\nswarm and introduce an exemplary strategy based on this criterion.","lang":"eng"},{"text":"Best Student Paper Award","lang":"eng"}],"publication":"Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-05-18T06:48:35Z","file":[{"date_created":"2020-07-31T08:22:16Z","creator":"janniksu","file_id":"17504","success":1,"content_type":"application/pdf","file_name":"localGathering.pdf","file_size":505712,"access_level":"closed","relation":"main_file","date_updated":"2020-07-31T08:22:16Z"}],"date_updated":"2022-01-06T06:53:00Z","author":[{"first_name":"Michael","last_name":"Braun","full_name":"Braun, Michael"},{"id":"38705","last_name":"Castenow","first_name":"Jannik","full_name":"Castenow, Jannik"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2020","title":"Local Gathering of Mobile Robots in Three Dimensions","doi":"10.1007/978-3-030-54921-3_4","language":[{"iso":"eng"}]},{"place":"New York, NY, United States","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"citation":{"short":"T. Hansmeier, P. Kaufmann, M. Platzner, in: GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2020, pp. 1756–1764.","chicago":"Hansmeier, Tim, Paul Kaufmann, and Marco Platzner. “An Adaption Mechanism for the Error Threshold of XCSF.” In <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1756–64. New York, NY, United States: Association for Computing Machinery (ACM), 2020. <a href=\"https://doi.org/10.1145/3377929.3398106\">https://doi.org/10.1145/3377929.3398106</a>.","apa":"Hansmeier, T., Kaufmann, P., &#38; Platzner, M. (2020). An Adaption Mechanism for the Error Threshold of XCSF. <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1756–1764. <a href=\"https://doi.org/10.1145/3377929.3398106\">https://doi.org/10.1145/3377929.3398106</a>","ieee":"T. Hansmeier, P. Kaufmann, and M. Platzner, “An Adaption Mechanism for the Error Threshold of XCSF,” in <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Cancún, Mexico, 2020, pp. 1756–1764, doi: <a href=\"https://doi.org/10.1145/3377929.3398106\">10.1145/3377929.3398106</a>.","ama":"Hansmeier T, Kaufmann P, Platzner M. An Adaption Mechanism for the Error Threshold of XCSF. In: <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. Association for Computing Machinery (ACM); 2020:1756-1764. doi:<a href=\"https://doi.org/10.1145/3377929.3398106\">10.1145/3377929.3398106</a>","bibtex":"@inproceedings{Hansmeier_Kaufmann_Platzner_2020, place={New York, NY, United States}, title={An Adaption Mechanism for the Error Threshold of XCSF}, DOI={<a href=\"https://doi.org/10.1145/3377929.3398106\">10.1145/3377929.3398106</a>}, booktitle={GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Kaufmann, Paul and Platzner, Marco}, year={2020}, pages={1756–1764} }","mla":"Hansmeier, Tim, et al. “An Adaption Mechanism for the Error Threshold of XCSF.” <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2020, pp. 1756–64, doi:<a href=\"https://doi.org/10.1145/3377929.3398106\">10.1145/3377929.3398106</a>."},"user_id":"477","_id":"17063","publisher":"Association for Computing Machinery (ACM)","page":"1756-1764","conference":{"location":"Cancún, Mexico","name":"International Workshop on Learning Classifier Systems (IWLCS 2020)","start_date":"2020-07-08","end_date":"2020-07-12"},"status":"public","department":[{"_id":"78"}],"type":"conference","date_created":"2020-05-27T14:14:58Z","publication":"GECCO '20: Proceedings of the Genetic and Evolutionary Computation Conference Companion","doi":"10.1145/3377929.3398106","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:03Z","author":[{"id":"49992","full_name":"Hansmeier, Tim","orcid":"0000-0003-1377-3339","first_name":"Tim","last_name":"Hansmeier"},{"first_name":"Paul","last_name":"Kaufmann","full_name":"Kaufmann, Paul"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"}],"publication_identifier":{"isbn":["978-1-4503-7127-8"]},"title":"An Adaption Mechanism for the Error Threshold of XCSF","year":"2020"},{"date_created":"2020-06-06T07:40:45Z","keyword":["Coflow","Scheduling","Deadlines","Data centers"],"type":"conference","department":[{"_id":"75"}],"publication":"2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)","abstract":[{"lang":"eng","text":"Data-parallel applications run on cluster of servers in a datacenter and their communication triggers correlated resource demand on multiple links that can be abstracted as coflow. They often desire predictable network performance, which can be passed to network via coflow abstraction for application-aware network scheduling. In this paper, we propose a heuristic and an optimization algorithm for predictable network performance such that they guarantee coflows completion within their deadlines. The algorithms also ensure high network utilization, i.e., it's work-conserving, and avoids starvation of coflows. We evaluate both algorithms via trace-driven simulation and show that they admit 1.1x more coflows than the Varys scheme while meeting their deadlines."}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/9139642"}],"language":[{"iso":"eng"}],"doi":"https://doi.org/10.1109/CCGrid49817.2020.00010","title":"Coflow Scheduling with Performance Guarantees for Data Center Applications","year":"2020","author":[{"id":"63288","full_name":"Hasnain, Asif","first_name":"Asif","last_name":"Hasnain"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_updated":"2022-01-06T06:53:04Z","publication_status":"published","citation":{"mla":"Hasnain, Asif, and Holger Karl. “Coflow Scheduling with Performance Guarantees for Data Center Applications.” <i>2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)</i>, IEEE Computer Society, 2020, doi:<a href=\"https://doi.org/10.1109/CCGrid49817.2020.00010\">https://doi.org/10.1109/CCGrid49817.2020.00010</a>.","ama":"Hasnain A, Karl H. Coflow Scheduling with Performance Guarantees for Data Center Applications. In: <i>2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)</i>. IEEE Computer Society; 2020. doi:<a href=\"https://doi.org/10.1109/CCGrid49817.2020.00010\">https://doi.org/10.1109/CCGrid49817.2020.00010</a>","bibtex":"@inproceedings{Hasnain_Karl_2020, title={Coflow Scheduling with Performance Guarantees for Data Center Applications}, DOI={<a href=\"https://doi.org/10.1109/CCGrid49817.2020.00010\">https://doi.org/10.1109/CCGrid49817.2020.00010</a>}, booktitle={2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)}, publisher={IEEE Computer Society}, author={Hasnain, Asif and Karl, Holger}, year={2020} }","apa":"Hasnain, A., &#38; Karl, H. (2020). Coflow Scheduling with Performance Guarantees for Data Center Applications. In <i>2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)</i>. Melbourne, Australia: IEEE Computer Society. <a href=\"https://doi.org/10.1109/CCGrid49817.2020.00010\">https://doi.org/10.1109/CCGrid49817.2020.00010</a>","ieee":"A. Hasnain and H. Karl, “Coflow Scheduling with Performance Guarantees for Data Center Applications,” in <i>2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)</i>, Melbourne, Australia, 2020.","short":"A. Hasnain, H. Karl, in: 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID), IEEE Computer Society, 2020.","chicago":"Hasnain, Asif, and Holger Karl. “Coflow Scheduling with Performance Guarantees for Data Center Applications.” In <i>2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)</i>. IEEE Computer Society, 2020. <a href=\"https://doi.org/10.1109/CCGrid49817.2020.00010\">https://doi.org/10.1109/CCGrid49817.2020.00010</a>."},"project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901","_id":"1"}],"_id":"17082","publisher":"IEEE Computer Society","ddc":["000"],"user_id":"63288","status":"public","conference":{"location":"Melbourne, Australia","name":"2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)"}},{"editor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"},{"last_name":"Cabot","first_name":"Jordi","full_name":"Cabot, Jordi"}],"doi":"10.1007/978-3-030-45234-6_16","user_id":"53103","language":[{"iso":"eng"}],"_id":"17084","publisher":"Springer","date_updated":"2022-01-06T06:53:04Z","publication_status":"published","conference":{"location":"Dublin, Ireland","start_date":"2020-04-25","name":"Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020","end_date":"2020-04-30"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030452339","9783030452346"]},"author":[{"full_name":"Weidmann, Nils","first_name":"Nils","last_name":"Weidmann","id":"53103"},{"first_name":"Anthony","last_name":"Anjorin","full_name":"Anjorin, Anthony"}],"status":"public","year":"2020","title":"Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming","department":[{"_id":"28"},{"_id":"66"},{"_id":"534"}],"type":"conference","place":"Cham","date_created":"2020-06-06T09:50:42Z","citation":{"bibtex":"@inproceedings{Weidmann_Anjorin_2020, place={Cham}, title={Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">10.1007/978-3-030-45234-6_16</a>}, booktitle={Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020}, publisher={Springer}, author={Weidmann, Nils and Anjorin, Anthony}, editor={Wehrheim, Heike and Cabot, JordiEditors}, year={2020} }","chicago":"Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” In <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>, edited by Heike Wehrheim and Jordi Cabot. Cham: Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">https://doi.org/10.1007/978-3-030-45234-6_16</a>.","short":"N. Weidmann, A. Anjorin, in: H. Wehrheim, J. Cabot (Eds.), Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, Springer, Cham, 2020.","ama":"Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In: Wehrheim H, Cabot J, eds. <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>. Cham: Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">10.1007/978-3-030-45234-6_16</a>","ieee":"N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming,” in <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>, Dublin, Ireland, 2020.","apa":"Weidmann, N., &#38; Anjorin, A. (2020). Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In H. Wehrheim &#38; J. Cabot (Eds.), <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>. Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">https://doi.org/10.1007/978-3-030-45234-6_16</a>","mla":"Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>, edited by Heike Wehrheim and Jordi Cabot, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">10.1007/978-3-030-45234-6_16</a>."},"publication":"Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020"},{"page":"1-19","language":[{"iso":"eng"}],"_id":"17092","doi":"10.1155/2020/2808710","user_id":"398","title":"Dynamic Reliability Management for FPGA-Based Systems","year":"2020","status":"public","author":[{"full_name":"Anwer, Jahanzeb","last_name":"Anwer","first_name":"Jahanzeb"},{"last_name":"Meisner","first_name":"Sebastian","full_name":"Meisner, Sebastian"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"publication_identifier":{"issn":["1687-7195","1687-7209"]},"date_updated":"2022-01-06T06:53:04Z","publication_status":"published","date_created":"2020-06-15T11:25:07Z","type":"journal_article","department":[{"_id":"78"}],"publication":"International Journal of Reconfigurable Computing","citation":{"chicago":"Anwer, Jahanzeb, Sebastian Meisner, and Marco Platzner. “Dynamic Reliability Management for FPGA-Based Systems.” <i>International Journal of Reconfigurable Computing</i>, 2020, 1–19. <a href=\"https://doi.org/10.1155/2020/2808710\">https://doi.org/10.1155/2020/2808710</a>.","short":"J. Anwer, S. Meisner, M. Platzner, International Journal of Reconfigurable Computing (2020) 1–19.","ieee":"J. Anwer, S. Meisner, and M. Platzner, “Dynamic Reliability Management for FPGA-Based Systems,” <i>International Journal of Reconfigurable Computing</i>, pp. 1–19, 2020.","apa":"Anwer, J., Meisner, S., &#38; Platzner, M. (2020). Dynamic Reliability Management for FPGA-Based Systems. <i>International Journal of Reconfigurable Computing</i>, 1–19. <a href=\"https://doi.org/10.1155/2020/2808710\">https://doi.org/10.1155/2020/2808710</a>","bibtex":"@article{Anwer_Meisner_Platzner_2020, title={Dynamic Reliability Management for FPGA-Based Systems}, DOI={<a href=\"https://doi.org/10.1155/2020/2808710\">10.1155/2020/2808710</a>}, journal={International Journal of Reconfigurable Computing}, author={Anwer, Jahanzeb and Meisner, Sebastian and Platzner, Marco}, year={2020}, pages={1–19} }","ama":"Anwer J, Meisner S, Platzner M. Dynamic Reliability Management for FPGA-Based Systems. <i>International Journal of Reconfigurable Computing</i>. 2020:1-19. doi:<a href=\"https://doi.org/10.1155/2020/2808710\">10.1155/2020/2808710</a>","mla":"Anwer, Jahanzeb, et al. “Dynamic Reliability Management for FPGA-Based Systems.” <i>International Journal of Reconfigurable Computing</i>, 2020, pp. 1–19, doi:<a href=\"https://doi.org/10.1155/2020/2808710\">10.1155/2020/2808710</a>."},"abstract":[{"text":"<jats:p>Radiation tolerance in FPGAs is an important field of research particularly for reliable computation in electronics used in aerospace and satellite missions. The motivation behind this research is the degradation of reliability in FPGA hardware due to single-event effects caused by radiation particles. Redundancy is a commonly used technique to enhance the fault-tolerance capability of radiation-sensitive applications. However, redundancy comes with an overhead in terms of excessive area consumption, latency, and power dissipation. Moreover, the redundant circuit implementations vary in structure and resource usage with the redundancy insertion algorithms as well as number of used redundant stages. The radiation environment varies during the operation time span of the mission depending on the orbit and space weather conditions. Therefore, the overheads due to redundancy should also be optimized at run-time with respect to the current radiation level. In this paper, we propose a technique called Dynamic Reliability Management (DRM) that utilizes the radiation data, interprets it, selects a suitable redundancy level, and performs the run-time reconfiguration, thus varying the reliability levels of the target computation modules. DRM is composed of two parts. The design-time tool flow of DRM generates a library of various redundant implementations of the circuit with different magnitudes of performance factors. The run-time tool flow, while utilizing the radiation/error-rate data, selects a required redundancy level and reconfigures the computation module with the corresponding redundant implementation. Both parts of DRM have been verified by experimentation on various benchmarks. The most significant finding we have from this experimentation is that the performance can be scaled multiple times by using partial reconfiguration feature of DRM, e.g., 7.7 and 3.7 times better performance results obtained for our data sorter and matrix multiplier case studies compared with static reliability management techniques. Therefore, DRM allows for maintaining a suitable trade-off between computation reliability and performance overhead during run-time of an application.</jats:p>","lang":"eng"}]},{"publication":"Advances in Data Analysis and Classification","citation":{"mla":"Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and Classification</i>, vol. 14, 2020, pp. 147–173, doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>.","bibtex":"@article{Blömer_Brauer_Bujna_Kuntze_2020, title={How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models}, volume={14}, DOI={<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>}, journal={Advances in Data Analysis and Classification}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin and Kuntze, Daniel}, year={2020}, pages={147–173} }","ama":"Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data Analysis and Classification</i>. 2020;14:147–173. doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>","ieee":"J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” <i>Advances in Data Analysis and Classification</i>, vol. 14, pp. 147–173, 2020.","apa":"Blömer, J., Brauer, S., Bujna, K., &#38; Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data Analysis and Classification</i>, <i>14</i>, 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>","short":"J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.","chicago":"Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and Classification</i> 14 (2020): 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>."},"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"date_created":"2019-07-11T08:08:25Z","type":"journal_article","department":[{"_id":"64"}],"year":"2020","status":"public","title":"How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models","author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Brauer, Sascha","last_name":"Brauer","first_name":"Sascha","id":"13291"},{"first_name":"Kathrin","last_name":"Bujna","full_name":"Bujna, Kathrin"},{"full_name":"Kuntze, Daniel","last_name":"Kuntze","first_name":"Daniel"}],"publication_identifier":{"issn":["1862-5347","1862-5355"]},"date_updated":"2022-01-06T06:50:50Z","publication_status":"published","intvolume":"        14","page":"147–173","language":[{"iso":"eng"}],"_id":"10790","doi":"10.1007/s11634-019-00366-7","user_id":"13291","volume":14},{"citation":{"mla":"Löken, Nils. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-854\">10.17619/UNIPB/1-854</a>.","bibtex":"@book{Löken_2020, title={Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-854\">10.17619/UNIPB/1-854</a>}, author={Löken, Nils}, year={2020} }","ama":"Löken N. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>.; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-854\">10.17619/UNIPB/1-854</a>","ieee":"N. Löken, <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>. 2020.","apa":"Löken, N. (2020). <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-854\">https://doi.org/10.17619/UNIPB/1-854</a>","chicago":"Löken, Nils. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-854\">https://doi.org/10.17619/UNIPB/1-854</a>.","short":"N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work, 2020."},"supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"date_created":"2020-01-10T08:23:30Z","type":"dissertation","department":[{"_id":"64"},{"_id":"568"}],"title":"Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work","year":"2020","status":"public","author":[{"full_name":"Löken, Nils","first_name":"Nils","last_name":"Löken","id":"13703"}],"date_updated":"2022-01-06T06:52:27Z","_id":"15482","language":[{"iso":"eng"}],"user_id":"13703","doi":"10.17619/UNIPB/1-854"},{"user_id":"57458","doi":"10.5220/0009171404490456","language":[{"iso":"eng"}],"_id":"15604","date_updated":"2022-01-06T06:52:30Z","year":"2020","title":"Concept-based Co-Migration of Test Cases","status":"public","publication_identifier":{"isbn":["978-989-758-400-8"]},"author":[{"full_name":"Jovanovikj, Ivan","first_name":"Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","id":"39187"},{"last_name":"Yigitbas","first_name":"Enes","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes","id":"8447"},{"id":"447","full_name":"Sauer, Stefan","first_name":"Stefan","last_name":"Sauer"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"conference":{"location":"Valletta","name":"8th International Conference on Model-Driven Engineering and Software Development  (MODELSWARD'20)"},"type":"conference","department":[{"_id":"66"},{"_id":"534"}],"date_created":"2020-01-20T09:59:56Z","publication":"Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD","citation":{"ieee":"I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Concept-based Co-Migration of Test Cases,” in <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>, Valletta, 2020.","mla":"Jovanovikj, Ivan, et al. “Concept-Based Co-Migration of Test Cases.” <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>, 2020, doi:<a href=\"https://doi.org/10.5220/0009171404490456\">10.5220/0009171404490456</a>.","apa":"Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Concept-based Co-Migration of Test Cases. In <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>. Valletta. <a href=\"https://doi.org/10.5220/0009171404490456\">https://doi.org/10.5220/0009171404490456</a>","bibtex":"@inproceedings{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Concept-based Co-Migration of Test Cases}, DOI={<a href=\"https://doi.org/10.5220/0009171404490456\">10.5220/0009171404490456</a>}, booktitle={Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD}, author={Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}, year={2020} }","ama":"Jovanovikj I, Yigitbas E, Sauer S, Engels G. Concept-based Co-Migration of Test Cases. In: <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>. ; 2020. doi:<a href=\"https://doi.org/10.5220/0009171404490456\">10.5220/0009171404490456</a>","short":"I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, in: Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD, 2020.","chicago":"Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Concept-Based Co-Migration of Test Cases.” In <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>, 2020. <a href=\"https://doi.org/10.5220/0009171404490456\">https://doi.org/10.5220/0009171404490456</a>."}},{"user_id":"57458","language":[{"iso":"eng"}],"_id":"15605","date_updated":"2022-01-06T06:52:30Z","publication_status":"published","year":"2020","title":"Test Case Co-Migration Method Patterns","status":"public","conference":{"name":"7th Collaborative Workshop on Evolution and Maintenance of Long-Living Software Systems (EMLS'20)","location":"Innscbruck"},"publication_identifier":{"issn":["1613-0073"]},"author":[{"full_name":"Jovanovikj, Ivan","first_name":"Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X","id":"39187"},{"full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes","id":"8447"},{"full_name":"Sauer, Stefan","first_name":"Stefan","last_name":"Sauer","id":"447"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"}],"type":"journal_article","department":[{"_id":"66"},{"_id":"534"}],"date_created":"2020-01-20T10:30:20Z","publication":"Software Engineering 2020 Workshopband","citation":{"apa":"Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Test Case Co-Migration Method Patterns. <i>Software Engineering 2020 Workshopband</i>.","mla":"Jovanovikj, Ivan, et al. “Test Case Co-Migration Method Patterns.” <i>Software Engineering 2020 Workshopband</i>, 2020.","ieee":"I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Test Case Co-Migration Method Patterns,” <i>Software Engineering 2020 Workshopband</i>, 2020.","chicago":"Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Test Case Co-Migration Method Patterns.” <i>Software Engineering 2020 Workshopband</i>, 2020.","ama":"Jovanovikj I, Yigitbas E, Sauer S, Engels G. Test Case Co-Migration Method Patterns. <i>Software Engineering 2020 Workshopband</i>. 2020.","short":"I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, Software Engineering 2020 Workshopband (2020).","bibtex":"@article{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Test Case Co-Migration Method Patterns}, journal={Software Engineering 2020 Workshopband}, author={Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}, year={2020} }"}},{"date_created":"2020-01-23T08:44:08Z","type":"conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"citation":{"apa":"Wever, M. D., Tornede, A., Mohr, F., &#38; Hüllermeier, E. (n.d.). <i>LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification</i>. Symposium on Intelligent Data Analysis, Konstanz, Germany.","ieee":"M. D. Wever, A. Tornede, F. Mohr, and E. Hüllermeier, “LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification,” presented at the Symposium on Intelligent Data Analysis, Konstanz, Germany.","short":"M.D. Wever, A. Tornede, F. Mohr, E. Hüllermeier, in: Springer, n.d.","chicago":"Wever, Marcel Dominik, Alexander Tornede, Felix Mohr, and Eyke Hüllermeier. “LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification.” Springer, n.d.","mla":"Wever, Marcel Dominik, et al. <i>LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification</i>. Springer.","ama":"Wever MD, Tornede A, Mohr F, Hüllermeier E. LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification. In: Springer.","bibtex":"@inproceedings{Wever_Tornede_Mohr_Hüllermeier, title={LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification}, publisher={Springer}, author={Wever, Marcel Dominik and Tornede, Alexander and Mohr, Felix and Hüllermeier, Eyke} }"},"abstract":[{"text":"In multi-label classification (MLC), each instance is associated with a set of class labels, in contrast to standard classification where an instance is assigned a single label. Binary relevance (BR) learning, which reduces a multi-label to a set of binary classification problems, one per label, is arguably the most straight-forward approach to MLC. In spite of its simplicity, BR proved to be competitive to more sophisticated MLC methods, and still achieves state-of-the-art performance for many loss functions. Somewhat surprisingly, the optimal choice of the base learner for tackling the binary classification problems has received very little attention so far. Taking advantage of the label independence assumption inherent to BR, we propose a label-wise base learner selection method optimizing label-wise macro averaged performance measures. In an extensive experimental evaluation, we find that or approach, called LiBRe, can significantly improve generalization performance.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"15629","language":[{"iso":"eng"}],"publisher":"Springer","user_id":"5786","title":"LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification","year":"2020","status":"public","author":[{"id":"33176","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","full_name":"Wever, Marcel Dominik"},{"last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander","id":"38209"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"conference":{"location":"Konstanz, Germany","start_date":"2020-04-24","name":"Symposium on Intelligent Data Analysis","end_date":"2020-04-27"},"publication_status":"accepted","date_updated":"2022-01-06T06:52:30Z"},{"author":[{"id":"22704","last_name":"Feldkord","first_name":"Björn","full_name":"Feldkord, Björn"}],"year":"2020","title":"Mobile Resource Allocation","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:52:31Z","language":[{"iso":"eng"}],"_id":"15631","doi":"10.17619/UNIPB/1-869","ddc":["000"],"user_id":"15415","supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"mla":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>.","apa":"Feldkord, B. (2020). <i>Mobile Resource Allocation</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>","ieee":"B. Feldkord, <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020.","chicago":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>.","short":"B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.","ama":"Feldkord B. <i>Mobile Resource Allocation</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>","bibtex":"@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>}, author={Feldkord, Björn}, year={2020} }"},"file_date_updated":"2020-01-24T08:19:38Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"place":"Universität Paderborn","date_created":"2020-01-23T14:20:25Z","file":[{"creator":"florida","date_created":"2020-01-24T08:19:38Z","file_size":633652,"access_level":"closed","file_name":"DissertationFeldkord.pdf","date_updated":"2020-01-24T08:19:38Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"15634"}],"department":[{"_id":"63"}],"type":"dissertation"},{"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"short":"D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.","chicago":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","ieee":"D. Warner, <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn, 2020.","apa":"Warner, D. (2020). <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn.","bibtex":"@book{Warner_2020, title={On the complexity of local transformations in SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020} }","ama":"Warner D. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn; 2020.","mla":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2020-02-04T13:47:02Z","department":[{"_id":"79"}],"type":"mastersthesis","author":[{"last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel"}],"year":"2020","status":"public","title":"On the complexity of local transformations in SDN overlays","date_updated":"2022-01-06T06:52:32Z","language":[{"iso":"eng"}],"_id":"15770","publisher":"Universität Paderborn","user_id":"477"}]