[{"date_created":"2021-03-13T19:19:27Z","author":[{"full_name":"Weidmann, Nils","id":"53103","last_name":"Weidmann","first_name":"Nils"},{"first_name":"Lars","last_name":"Fritsche","full_name":"Fritsche, Lars"},{"last_name":"Anjorin","full_name":"Anjorin, Anthony","first_name":"Anthony"}],"publisher":"ACM","date_updated":"2022-01-06T06:55:01Z","doi":"10.1145/3426425.3426932","conference":{"name":"13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020","start_date":"2020-11-16","end_date":"2020-11-17","location":"Virtual Event, USA"},"title":"A search-based and fault-tolerant approach to concurrent model synchronisation","publication_status":"published","publication_identifier":{"isbn":["9781450381765"]},"citation":{"ama":"Weidmann N, Fritsche L, Anjorin A. A search-based and fault-tolerant approach to concurrent model synchronisation. In: Lämmel R, Tratt L, de Lara J, eds. <i>Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020</i>. ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3426425.3426932\">10.1145/3426425.3426932</a>","chicago":"Weidmann, Nils, Lars Fritsche, and Anthony Anjorin. “A Search-Based and Fault-Tolerant Approach to Concurrent Model Synchronisation.” In <i>Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020</i>, edited by Ralf Lämmel, Laurcence Tratt, and Juan de Lara. ACM, 2020. <a href=\"https://doi.org/10.1145/3426425.3426932\">https://doi.org/10.1145/3426425.3426932</a>.","ieee":"N. Weidmann, L. Fritsche, and A. Anjorin, “A search-based and fault-tolerant approach to concurrent model synchronisation,” in <i>Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020</i>, Virtual Event, USA, 2020.","apa":"Weidmann, N., Fritsche, L., &#38; Anjorin, A. (2020). A search-based and fault-tolerant approach to concurrent model synchronisation. In R. Lämmel, L. Tratt, &#38; J. de Lara (Eds.), <i>Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020</i>. Virtual Event, USA: ACM. <a href=\"https://doi.org/10.1145/3426425.3426932\">https://doi.org/10.1145/3426425.3426932</a>","bibtex":"@inproceedings{Weidmann_Fritsche_Anjorin_2020, title={A search-based and fault-tolerant approach to concurrent model synchronisation}, DOI={<a href=\"https://doi.org/10.1145/3426425.3426932\">10.1145/3426425.3426932</a>}, booktitle={Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020}, publisher={ACM}, author={Weidmann, Nils and Fritsche, Lars and Anjorin, Anthony}, editor={Lämmel, Ralf and Tratt, Laurcence and de Lara, JuanEditors}, year={2020} }","mla":"Weidmann, Nils, et al. “A Search-Based and Fault-Tolerant Approach to Concurrent Model Synchronisation.” <i>Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020</i>, edited by Ralf Lämmel et al., ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3426425.3426932\">10.1145/3426425.3426932</a>.","short":"N. Weidmann, L. Fritsche, A. Anjorin, in: R. Lämmel, L. Tratt, J. de Lara (Eds.), Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020, ACM, 2020."},"year":"2020","user_id":"53103","department":[{"_id":"28"},{"_id":"66"},{"_id":"534"}],"_id":"21481","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020","status":"public","editor":[{"last_name":"Lämmel","full_name":"Lämmel, Ralf","first_name":"Ralf"},{"first_name":"Laurcence","last_name":"Tratt","full_name":"Tratt, Laurcence"},{"full_name":"de Lara, Juan","last_name":"de Lara","first_name":"Juan"}]},{"publication":"Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020","type":"conference","status":"public","editor":[{"last_name":"Hoffmann","full_name":"Hoffmann, Berthold","first_name":"Berthold"},{"last_name":"Minas","full_name":"Minas, Mark","first_name":"Mark"}],"department":[{"_id":"28"},{"_id":"66"},{"_id":"534"}],"user_id":"53103","_id":"21482","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2075-2180"]},"publication_status":"published","page":"1-12","citation":{"ieee":"N. Weidmann, A. Anjorin, and J. Cheney, “VICToRy: Visual Interactive Consistency Management in Tolerant Rule-based Systems,” in <i>Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020</i>, Online-Workshop, 2020, pp. 1–12.","chicago":"Weidmann, Nils, Anthony Anjorin, and James Cheney. “VICToRy: Visual Interactive Consistency Management in Tolerant Rule-Based Systems.” In <i>Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020</i>, edited by Berthold Hoffmann and Mark Minas, 1–12. EPTCS, 2020. <a href=\"https://doi.org/10.4204/eptcs.330.1\">https://doi.org/10.4204/eptcs.330.1</a>.","ama":"Weidmann N, Anjorin A, Cheney J. VICToRy: Visual Interactive Consistency Management in Tolerant Rule-based Systems. In: Hoffmann B, Minas M, eds. <i>Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020</i>. EPTCS; 2020:1-12. doi:<a href=\"https://doi.org/10.4204/eptcs.330.1\">10.4204/eptcs.330.1</a>","apa":"Weidmann, N., Anjorin, A., &#38; Cheney, J. (2020). VICToRy: Visual Interactive Consistency Management in Tolerant Rule-based Systems. In B. Hoffmann &#38; M. Minas (Eds.), <i>Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020</i> (pp. 1–12). Online-Workshop: EPTCS. <a href=\"https://doi.org/10.4204/eptcs.330.1\">https://doi.org/10.4204/eptcs.330.1</a>","mla":"Weidmann, Nils, et al. “VICToRy: Visual Interactive Consistency Management in Tolerant Rule-Based Systems.” <i>Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020</i>, edited by Berthold Hoffmann and Mark Minas, EPTCS, 2020, pp. 1–12, doi:<a href=\"https://doi.org/10.4204/eptcs.330.1\">10.4204/eptcs.330.1</a>.","short":"N. Weidmann, A. Anjorin, J. Cheney, in: B. Hoffmann, M. Minas (Eds.), Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020, EPTCS, 2020, pp. 1–12.","bibtex":"@inproceedings{Weidmann_Anjorin_Cheney_2020, title={VICToRy: Visual Interactive Consistency Management in Tolerant Rule-based Systems}, DOI={<a href=\"https://doi.org/10.4204/eptcs.330.1\">10.4204/eptcs.330.1</a>}, booktitle={Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020}, publisher={EPTCS}, author={Weidmann, Nils and Anjorin, Anthony and Cheney, James}, editor={Hoffmann, Berthold and Minas, MarkEditors}, year={2020}, pages={1–12} }"},"year":"2020","author":[{"last_name":"Weidmann","id":"53103","full_name":"Weidmann, Nils","first_name":"Nils"},{"last_name":"Anjorin","full_name":"Anjorin, Anthony","first_name":"Anthony"},{"first_name":"James","full_name":"Cheney, James","last_name":"Cheney"}],"date_created":"2021-03-13T19:20:04Z","publisher":"EPTCS","date_updated":"2022-01-06T06:55:01Z","doi":"10.4204/eptcs.330.1","conference":{"end_date":"2020-06-24","location":"Online-Workshop","name":"Eleventh International Workshop on Graph Computation Models","start_date":"2020-06-24"},"title":"VICToRy: Visual Interactive Consistency Management in Tolerant Rule-based Systems"},{"user_id":"53103","department":[{"_id":"28"},{"_id":"66"},{"_id":"534"}],"_id":"21483","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 ","status":"public","editor":[{"first_name":"Önder","last_name":"Babur","full_name":"Babur, Önder"},{"last_name":"Denil","full_name":"Denil, Joachim","first_name":"Joachim"},{"full_name":"Vogel-Heuser, Birgit","last_name":"Vogel-Heuser","first_name":"Birgit"}],"date_created":"2021-03-13T19:20:55Z","author":[{"first_name":"Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X","full_name":"Jovanovikj, Ivan","id":"39187"},{"last_name":"Weidmann","full_name":"Weidmann, Nils","id":"53103","first_name":"Nils"},{"full_name":"Yigitbas, Enes","id":"8447","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"first_name":"Anthony","full_name":"Anjorin, Anthony","last_name":"Anjorin"},{"full_name":"Sauer, Stefan","id":"447","last_name":"Sauer","first_name":"Stefan"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"date_updated":"2022-01-06T06:55:01Z","publisher":"Springer","doi":"10.1007/978-3-030-58167-1_2","conference":{"location":"Bergen, Norway","end_date":"2020-06-26","start_date":"2020-06-25","name":"First International Conference on Systems Modelling and Management, ICSMM 2020"},"title":"A Model-Driven Mutation Framework for Validation of Test Case Migration","publication_status":"published","publication_identifier":{"issn":["1865-0929","1865-0937"],"isbn":["9783030581664","9783030581671"]},"citation":{"ama":"Jovanovikj I, Weidmann N, Yigitbas E, Anjorin A, Sauer S, Engels G. A Model-Driven Mutation Framework for Validation of Test Case Migration. In: Babur Ö, Denil J, Vogel-Heuser B, eds. <i>Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 </i>. Cham: Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-58167-1_2\">10.1007/978-3-030-58167-1_2</a>","chicago":"Jovanovikj, Ivan, Nils Weidmann, Enes Yigitbas, Anthony Anjorin, Stefan Sauer, and Gregor Engels. “A Model-Driven Mutation Framework for Validation of Test Case Migration.” In <i>Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 </i>, edited by Önder Babur, Joachim Denil, and Birgit Vogel-Heuser. Cham: Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58167-1_2\">https://doi.org/10.1007/978-3-030-58167-1_2</a>.","ieee":"I. Jovanovikj, N. Weidmann, E. Yigitbas, A. Anjorin, S. Sauer, and G. Engels, “A Model-Driven Mutation Framework for Validation of Test Case Migration,” in <i>Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 </i>, Bergen, Norway, 2020.","bibtex":"@inproceedings{Jovanovikj_Weidmann_Yigitbas_Anjorin_Sauer_Engels_2020, place={Cham}, title={A Model-Driven Mutation Framework for Validation of Test Case Migration}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58167-1_2\">10.1007/978-3-030-58167-1_2</a>}, booktitle={Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 }, publisher={Springer}, author={Jovanovikj, Ivan and Weidmann, Nils and Yigitbas, Enes and Anjorin, Anthony and Sauer, Stefan and Engels, Gregor}, editor={Babur, Önder and Denil, Joachim and Vogel-Heuser, BirgitEditors}, year={2020} }","short":"I. Jovanovikj, N. Weidmann, E. Yigitbas, A. Anjorin, S. Sauer, G. Engels, in: Ö. Babur, J. Denil, B. Vogel-Heuser (Eds.), Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 , Springer, Cham, 2020.","mla":"Jovanovikj, Ivan, et al. “A Model-Driven Mutation Framework for Validation of Test Case Migration.” <i>Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 </i>, edited by Önder Babur et al., Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-58167-1_2\">10.1007/978-3-030-58167-1_2</a>.","apa":"Jovanovikj, I., Weidmann, N., Yigitbas, E., Anjorin, A., Sauer, S., &#38; Engels, G. (2020). A Model-Driven Mutation Framework for Validation of Test Case Migration. In Ö. Babur, J. Denil, &#38; B. Vogel-Heuser (Eds.), <i>Proceedings of the First International Conference on Systems Modelling and Management, ICSMM 2020 </i>. Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-58167-1_2\">https://doi.org/10.1007/978-3-030-58167-1_2</a>"},"year":"2020","place":"Cham"},{"publication":"ERCIM News","type":"journal_editor","editor":[{"full_name":"Bernijazov, Ruslan","last_name":"Bernijazov","first_name":"Ruslan"},{"id":"45137","full_name":"Özcan, Leon","last_name":"Özcan","first_name":"Leon"},{"first_name":"Roman","full_name":"Dumitrescu, Roman","id":"16190","last_name":"Dumitrescu"}],"status":"public","_id":"21486","department":[{"_id":"563"}],"user_id":"45137","language":[{"iso":"eng"}],"publication_status":"published","issue":"122","year":"2020","page":"36-37","citation":{"ama":"Bernijazov R, Özcan L, Dumitrescu R, eds. <i>AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation </i>.; 2020:36-37.","chicago":"Bernijazov, Ruslan, Leon Özcan, and Roman Dumitrescu, eds. <i>AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation </i>. <i>ERCIM News</i>, 2020.","ieee":"R. Bernijazov, L. Özcan, and R. Dumitrescu, Eds., <i>AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation </i>, no. 122. 2020, pp. 36–37.","short":"R. Bernijazov, L. Özcan, R. Dumitrescu, eds., AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation , 2020.","bibtex":"@book{Bernijazov_Özcan_Dumitrescu_2020, title={AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation }, number={122}, journal={ERCIM News}, year={2020}, pages={36–37} }","mla":"Bernijazov, Ruslan, et al., editors. “AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation .” <i>ERCIM News</i>, no. 122, 2020, pp. 36–37.","apa":"Bernijazov, R., Özcan, L., &#38; Dumitrescu, R. (Eds.). (2020). <i>AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation </i>. <i>ERCIM News</i> (pp. 36–37)."},"date_updated":"2022-01-06T06:55:01Z","date_created":"2021-03-14T19:44:50Z","title":"AI Marketplace – The Ecosystem for Artificial Intelligence in Product Creation "},{"language":[{"iso":"eng"}],"user_id":"76599","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"21534","status":"public","type":"conference","publication":"International Conference on Machine Learning","title":"Preselection Bandits","author":[{"first_name":"Viktor","full_name":"Bengs, Viktor","last_name":"Bengs"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"date_created":"2021-03-18T11:13:12Z","date_updated":"2022-01-06T06:55:03Z","citation":{"ieee":"V. Bengs and E. Hüllermeier, “Preselection Bandits,” in <i>International Conference on Machine Learning</i>, 2020, pp. 778–787.","chicago":"Bengs, Viktor, and Eyke Hüllermeier. “Preselection Bandits.” In <i>International Conference on Machine Learning</i>, 778–87, 2020.","ama":"Bengs V, Hüllermeier E. Preselection Bandits. In: <i>International Conference on Machine Learning</i>. ; 2020:778-787.","short":"V. Bengs, E. Hüllermeier, in: International Conference on Machine Learning, 2020, pp. 778–787.","mla":"Bengs, Viktor, and Eyke Hüllermeier. “Preselection Bandits.” <i>International Conference on Machine Learning</i>, 2020, pp. 778–87.","bibtex":"@inproceedings{Bengs_Hüllermeier_2020, title={Preselection Bandits}, booktitle={International Conference on Machine Learning}, author={Bengs, Viktor and Hüllermeier, Eyke}, year={2020}, pages={778–787} }","apa":"Bengs, V., &#38; Hüllermeier, E. (2020). Preselection Bandits. In <i>International Conference on Machine Learning</i> (pp. 778–787)."},"page":"778-787","year":"2020"},{"publication":"arXiv:2011.00813","type":"preprint","status":"public","abstract":[{"text":"We consider a resource-aware variant of the classical multi-armed bandit\r\nproblem: In each round, the learner selects an arm and determines a resource\r\nlimit. It then observes a corresponding (random) reward, provided the (random)\r\namount of consumed resources remains below the limit. Otherwise, the\r\nobservation is censored, i.e., no reward is obtained. For this problem setting,\r\nwe introduce a measure of regret, which incorporates the actual amount of\r\nallocated resources of each learning round as well as the optimality of\r\nrealizable rewards. Thus, to minimize regret, the learner needs to set a\r\nresource limit and choose an arm in such a way that the chance to realize a\r\nhigh reward within the predefined resource limit is high, while the resource\r\nlimit itself should be kept as low as possible. We derive the theoretical lower\r\nbound on the cumulative regret and propose a learning algorithm having a regret\r\nupper bound that matches the lower bound. In a simulation study, we show that\r\nour learning algorithm outperforms straightforward extensions of standard\r\nmulti-armed bandit algorithms.","lang":"eng"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"76599","_id":"21536","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"citation":{"ama":"Bengs V, Hüllermeier E. Multi-Armed Bandits with Censored Consumption of Resources. <i>arXiv:201100813</i>. 2020.","chicago":"Bengs, Viktor, and Eyke Hüllermeier. “Multi-Armed Bandits with Censored Consumption of Resources.” <i>ArXiv:2011.00813</i>, 2020.","ieee":"V. Bengs and E. Hüllermeier, “Multi-Armed Bandits with Censored Consumption of Resources,” <i>arXiv:2011.00813</i>. 2020.","apa":"Bengs, V., &#38; Hüllermeier, E. (2020). Multi-Armed Bandits with Censored Consumption of Resources. <i>ArXiv:2011.00813</i>.","mla":"Bengs, Viktor, and Eyke Hüllermeier. “Multi-Armed Bandits with Censored Consumption of Resources.” <i>ArXiv:2011.00813</i>, 2020.","bibtex":"@article{Bengs_Hüllermeier_2020, title={Multi-Armed Bandits with Censored Consumption of Resources}, journal={arXiv:2011.00813}, author={Bengs, Viktor and Hüllermeier, Eyke}, year={2020} }","short":"V. Bengs, E. Hüllermeier, ArXiv:2011.00813 (2020)."},"year":"2020","author":[{"first_name":"Viktor","full_name":"Bengs, Viktor","last_name":"Bengs"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"date_created":"2021-03-18T11:27:37Z","date_updated":"2022-01-06T06:55:03Z","title":"Multi-Armed Bandits with Censored Consumption of Resources"},{"date_updated":"2022-01-06T06:55:06Z","date_created":"2021-03-31T08:58:59Z","author":[{"full_name":"Gatica, Carlos Paiz","last_name":"Gatica","first_name":"Carlos Paiz"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"title":"Adaptable Realization of Industrial Analytics Functions on Edge-Devices using Reconfigurable Architectures","doi":"10.1007/978-3-662-59084-3_9","publication_status":"published","publication_identifier":{"issn":["2522-8579","2522-8587"],"isbn":["9783662590836","9783662590843"]},"place":"Berlin, Heidelberg","year":"2020","citation":{"chicago":"Gatica, Carlos Paiz, and Marco Platzner. “Adaptable Realization of Industrial Analytics Functions on Edge-Devices Using Reconfigurable Architectures.” In <i>Machine Learning for Cyber Physical Systems (ML4CPS 2017)</i>. Berlin, Heidelberg, 2020. <a href=\"https://doi.org/10.1007/978-3-662-59084-3_9\">https://doi.org/10.1007/978-3-662-59084-3_9</a>.","ieee":"C. P. Gatica and M. Platzner, “Adaptable Realization of Industrial Analytics Functions on Edge-Devices using Reconfigurable Architectures,” in <i>Machine Learning for Cyber Physical Systems (ML4CPS 2017)</i>, 2020.","ama":"Gatica CP, Platzner M. Adaptable Realization of Industrial Analytics Functions on Edge-Devices using Reconfigurable Architectures. In: <i>Machine Learning for Cyber Physical Systems (ML4CPS 2017)</i>. Berlin, Heidelberg; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-662-59084-3_9\">10.1007/978-3-662-59084-3_9</a>","apa":"Gatica, C. P., &#38; Platzner, M. (2020). Adaptable Realization of Industrial Analytics Functions on Edge-Devices using Reconfigurable Architectures. In <i>Machine Learning for Cyber Physical Systems (ML4CPS 2017)</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-59084-3_9\">https://doi.org/10.1007/978-3-662-59084-3_9</a>","mla":"Gatica, Carlos Paiz, and Marco Platzner. “Adaptable Realization of Industrial Analytics Functions on Edge-Devices Using Reconfigurable Architectures.” <i>Machine Learning for Cyber Physical Systems (ML4CPS 2017)</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-662-59084-3_9\">10.1007/978-3-662-59084-3_9</a>.","bibtex":"@inproceedings{Gatica_Platzner_2020, place={Berlin, Heidelberg}, title={Adaptable Realization of Industrial Analytics Functions on Edge-Devices using Reconfigurable Architectures}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-59084-3_9\">10.1007/978-3-662-59084-3_9</a>}, booktitle={Machine Learning for Cyber Physical Systems (ML4CPS 2017)}, author={Gatica, Carlos Paiz and Platzner, Marco}, year={2020} }","short":"C.P. Gatica, M. Platzner, in: Machine Learning for Cyber Physical Systems (ML4CPS 2017), Berlin, Heidelberg, 2020."},"_id":"21584","user_id":"398","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Machine Learning for Cyber Physical Systems (ML4CPS 2017)","status":"public"},{"status":"public","type":"book_chapter","publication":"Advanced Information Systems Engineering","language":[{"iso":"eng"}],"_id":"17337","user_id":"57458","department":[{"_id":"66"}],"year":"2020","place":"Cham","citation":{"apa":"Jazayeri, B., Schwichtenberg, S., Küster, J., Zimmermann, O., &#38; Engels, G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In <i>Advanced Information Systems Engineering</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">https://doi.org/10.1007/978-3-030-49435-3_3</a>","short":"B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels, in: Advanced Information Systems Engineering, Cham, 2020.","bibtex":"@inbook{Jazayeri_Schwichtenberg_Küster_Zimmermann_Engels_2020, place={Cham}, title={Modeling and Analyzing Architectural Diversity of Open Platforms}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>}, booktitle={Advanced Information Systems Engineering}, author={Jazayeri, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}, year={2020} }","mla":"Jazayeri, Bahar, et al. “Modeling and Analyzing Architectural Diversity of Open Platforms.” <i>Advanced Information Systems Engineering</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>.","ieee":"B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels, “Modeling and Analyzing Architectural Diversity of Open Platforms,” in <i>Advanced Information Systems Engineering</i>, Cham, 2020.","chicago":"Jazayeri, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann, and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.” In <i>Advanced Information Systems Engineering</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">https://doi.org/10.1007/978-3-030-49435-3_3</a>.","ama":"Jazayeri B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling and Analyzing Architectural Diversity of Open Platforms. In: <i>Advanced Information Systems Engineering</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030494346","9783030494353"]},"title":"Modeling and Analyzing Architectural Diversity of Open Platforms","doi":"10.1007/978-3-030-49435-3_3","date_updated":"2022-01-06T06:53:08Z","date_created":"2020-06-26T10:31:49Z","author":[{"last_name":"Jazayeri","full_name":"Jazayeri, Bahar","first_name":"Bahar"},{"first_name":"Simon","full_name":"Schwichtenberg, Simon","last_name":"Schwichtenberg"},{"first_name":"Jochen","full_name":"Küster, Jochen","last_name":"Küster"},{"first_name":"Olaf","full_name":"Zimmermann, Olaf","last_name":"Zimmermann"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}]},{"keyword":["Approximate circuit synthesis","approximate computing","error metrics","formal verification","proof-carrying hardware"],"language":[{"iso":"eng"}],"publication":"IEEE Transactions On Very Large Scale Integration Systems","abstract":[{"text":"Approximate circuits trade-off computational accuracy against improvements in hardware area, delay, or energy consumption. IP core vendors who wish to create such circuits need to convince consumers of the resulting approximation quality. As a solution we propose proof-carrying approximate circuits: The vendor creates an approximate IP core together with a certificate that proves the approximation quality. The proof certificate is bundled with the approximate IP core and sent off to the consumer. The consumer can formally verify the approximation quality of the IP core at a fraction of the typical computational cost for formal verification. In this paper, we first make the case for proof-carrying approximate circuits and then demonstrate the feasibility of the approach by a set of synthesis experiments using an exemplary approximation framework.","lang":"eng"}],"publisher":"IEEE","date_created":"2020-07-06T11:21:30Z","title":"Proof-carrying Approximate Circuits","quality_controlled":"1","issue":"9","year":"2020","_id":"17358","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"78"}],"user_id":"49051","article_type":"original","funded_apc":"1","type":"journal_article","status":"public","date_updated":"2022-01-06T06:53:09Z","volume":28,"author":[{"last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias"},{"last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118","first_name":"Tobias"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"doi":"10.1109/TVLSI.2020.3008061","publication_identifier":{"issn":["1063-8210"],"eissn":["1557-9999"]},"publication_status":"published","page":"2084 - 2088","intvolume":"        28","citation":{"apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2020). Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>, <i>28</i>(9), 2084–2088. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>","bibtex":"@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate Circuits}, volume={28}, DOI={<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>}, number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems}, publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2020}, pages={2084–2088} }","mla":"Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, IEEE, 2020, pp. 2084–88, doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>.","short":"L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large Scale Integration Systems 28 (2020) 2084–2088.","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate Circuits,” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, pp. 2084–2088, 2020.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i> 28, no. 9 (2020): 2084–88. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>.","ama":"Witschen LM, Wiersema T, Platzner M. Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>. 2020;28(9):2084-2088. doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>"}},{"citation":{"ieee":"N. Ho, P. Kaufmann, and M. Platzner, “Evolution of Application-Specific Cache Mappings,” <i>International Journal of Hybrid intelligent Systems</i>, 2020.","chicago":"Ho, Nam, Paul Kaufmann, and Marco Platzner. “Evolution of Application-Specific Cache Mappings.” <i>International Journal of Hybrid Intelligent Systems</i>, 2020.","ama":"Ho N, Kaufmann P, Platzner M. Evolution of Application-Specific Cache Mappings. <i>International Journal of Hybrid intelligent Systems</i>. 2020.","bibtex":"@article{Ho_Kaufmann_Platzner_2020, title={Evolution of Application-Specific Cache Mappings}, journal={International Journal of Hybrid intelligent Systems}, publisher={IOS Press}, author={Ho, Nam and Kaufmann, Paul and Platzner, Marco}, year={2020} }","short":"N. Ho, P. Kaufmann, M. Platzner, International Journal of Hybrid Intelligent Systems (2020).","mla":"Ho, Nam, et al. “Evolution of Application-Specific Cache Mappings.” <i>International Journal of Hybrid Intelligent Systems</i>, IOS Press, 2020.","apa":"Ho, N., Kaufmann, P., &#38; Platzner, M. (2020). Evolution of Application-Specific Cache Mappings. <i>International Journal of Hybrid Intelligent Systems</i>."},"year":"2020","title":"Evolution of Application-Specific Cache Mappings","date_created":"2020-07-10T18:55:30Z","author":[{"first_name":"Nam","full_name":"Ho, Nam","last_name":"Ho"},{"last_name":"Kaufmann","full_name":"Kaufmann, Paul","first_name":"Paul"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"publisher":"IOS Press","date_updated":"2022-01-06T06:53:09Z","status":"public","publication":"International Journal of Hybrid intelligent Systems","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"398","_id":"17369"},{"doi":"10.1145/3350755.3400281","author":[{"first_name":"Jannik","last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik"},{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:53:10Z","citation":{"apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>","mla":"Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020.","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>."},"publication_identifier":{"isbn":["9781450369350"]},"has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-07-14T07:56:52Z","department":[{"_id":"63"}],"user_id":"39241","_id":"17370","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","type":"conference","title":"The Online Multi-Commodity Facility Location Problem","date_created":"2020-07-14T07:53:20Z","year":"2020","language":[{"iso":"eng"}],"keyword":["Online Multi-Commodity Facility Location","Competitive Ratio","Online Optimization","Facility Location Problem"],"ddc":["000"],"external_id":{"arxiv":["2005.08391"]},"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-07-14T07:56:52Z","creator":"tillk","date_created":"2020-07-14T07:56:52Z","file_size":1271416,"file_name":"3350755.3400281.pdf","file_id":"17373","access_level":"closed"}],"abstract":[{"text":" We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \\( S \\) of commodities.\r\n  Ravi and Sinha (SODA 2004) introduced the model as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.\r\n  The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.\r\n  In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.\r\n  A request has to be connected to a set of facilities jointly offering the commodities demanded by it.\r\n  In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.\r\n\r\n  To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.\r\n  We present results regarding the competitive ratio.\r\n  On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \\( \\Omega (  \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n}  ) \\) that already holds for simple line metrics.\r\n  Here, \\( n \\) is the number of requests.\r\n  On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n  Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function.","lang":"eng"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"},{"publication_status":"published","publication_identifier":{"isbn":["9781450369350"]},"has_accepted_license":"1","citation":{"ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020.","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400263\">https://doi.org/10.1145/3350755.3400263</a>.","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400263\">https://doi.org/10.1145/3350755.3400263</a>","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, title={Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>.","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020."},"date_updated":"2022-01-06T06:53:10Z","author":[{"first_name":"Jannik","last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"last_name":"Knollmann","orcid":"0000-0003-2014-4696","id":"39241","full_name":"Knollmann, Till","first_name":"Till"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"doi":"10.1145/3350755.3400263","type":"conference","status":"public","_id":"17371","user_id":"38705","department":[{"_id":"63"}],"file_date_updated":"2020-07-14T07:56:04Z","year":"2020","date_created":"2020-07-14T07:53:47Z","title":"Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-07-14T07:56:04Z","creator":"janniksu","date_created":"2020-07-14T07:56:04Z","file_size":1078544,"file_name":"3350755.3400263.pdf","access_level":"closed","file_id":"17372"}],"external_id":{"arxiv":["2010.02043 "]},"ddc":["000"],"language":[{"iso":"eng"}]},{"year":"2020","citation":{"ieee":"I. Turcanu, T. Engel, and C. Sommer, “Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks,” in <i>2019 IEEE Vehicular Networking Conference (VNC)</i>, 2020.","chicago":"Turcanu, Ion, Thomas Engel, and Christoph Sommer. “Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks.” In <i>2019 IEEE Vehicular Networking Conference (VNC)</i>, 2020. <a href=\"https://doi.org/10.1109/vnc48660.2019.9062816\">https://doi.org/10.1109/vnc48660.2019.9062816</a>.","ama":"Turcanu I, Engel T, Sommer C. Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks. In: <i>2019 IEEE Vehicular Networking Conference (VNC)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1109/vnc48660.2019.9062816\">10.1109/vnc48660.2019.9062816</a>","apa":"Turcanu, I., Engel, T., &#38; Sommer, C. (2020). Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks. In <i>2019 IEEE Vehicular Networking Conference (VNC)</i>. <a href=\"https://doi.org/10.1109/vnc48660.2019.9062816\">https://doi.org/10.1109/vnc48660.2019.9062816</a>","mla":"Turcanu, Ion, et al. “Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks.” <i>2019 IEEE Vehicular Networking Conference (VNC)</i>, 2020, doi:<a href=\"https://doi.org/10.1109/vnc48660.2019.9062816\">10.1109/vnc48660.2019.9062816</a>.","short":"I. Turcanu, T. Engel, C. Sommer, in: 2019 IEEE Vehicular Networking Conference (VNC), 2020.","bibtex":"@inproceedings{Turcanu_Engel_Sommer_2020, title={Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks}, DOI={<a href=\"https://doi.org/10.1109/vnc48660.2019.9062816\">10.1109/vnc48660.2019.9062816</a>}, booktitle={2019 IEEE Vehicular Networking Conference (VNC)}, author={Turcanu, Ion and Engel, Thomas and Sommer, Christoph}, year={2020} }"},"publication_status":"published","publication_identifier":{"isbn":["9781728145716"]},"title":"Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks","doi":"10.1109/vnc48660.2019.9062816","date_updated":"2022-01-06T06:53:10Z","date_created":"2020-07-17T12:22:36Z","author":[{"last_name":"Turcanu","full_name":"Turcanu, Ion","first_name":"Ion"},{"full_name":"Engel, Thomas","last_name":"Engel","first_name":"Thomas"},{"full_name":"Sommer, Christoph","id":"49154","last_name":"Sommer","orcid":"0000-0002-4336-7350","first_name":"Christoph"}],"status":"public","type":"conference","publication":"2019 IEEE Vehicular Networking Conference (VNC)","language":[{"iso":"eng"}],"_id":"17398","user_id":"49154","department":[{"_id":"589"}]},{"status":"public","type":"conference","publication":"Proceedings of the ISPIM connects","language":[{"iso":"eng"}],"user_id":"43136","department":[{"_id":"563"}],"_id":"17405","citation":{"ieee":"M. Frank, J. Gausemeier, N. Hennig-Cardinal von Widdern, C. Koldewey, J. S. Menzefricke, and J. Reinhold, “A reference process for the Smart Service business: development and practical implications,” in <i>Proceedings of the ISPIM connects</i>, 2020.","chicago":"Frank, Maximilian, Juergen Gausemeier, Nils Hennig-Cardinal von Widdern, Christian Koldewey, Joern Steffen Menzefricke, and Jannik Reinhold. “A Reference Process for the Smart Service Business: Development and Practical Implications.” In <i>Proceedings of the ISPIM Connects</i>. International Society for Professional Innovation Management (ISPIM), 2020.","ama":"Frank M, Gausemeier J, Hennig-Cardinal von Widdern N, Koldewey C, Menzefricke JS, Reinhold J. A reference process for the Smart Service business: development and practical implications. In: <i>Proceedings of the ISPIM Connects</i>. International Society for Professional Innovation Management (ISPIM); 2020.","bibtex":"@inproceedings{Frank_Gausemeier_Hennig-Cardinal von Widdern_Koldewey_Menzefricke_Reinhold_2020, title={A reference process for the Smart Service business: development and practical implications}, booktitle={Proceedings of the ISPIM connects}, publisher={International Society for Professional Innovation Management (ISPIM)}, author={Frank, Maximilian and Gausemeier, Juergen and Hennig-Cardinal von Widdern, Nils and Koldewey, Christian and Menzefricke, Joern Steffen and Reinhold, Jannik}, year={2020} }","short":"M. Frank, J. Gausemeier, N. Hennig-Cardinal von Widdern, C. Koldewey, J.S. Menzefricke, J. Reinhold, in: Proceedings of the ISPIM Connects, International Society for Professional Innovation Management (ISPIM), 2020.","mla":"Frank, Maximilian, et al. “A Reference Process for the Smart Service Business: Development and Practical Implications.” <i>Proceedings of the ISPIM Connects</i>, International Society for Professional Innovation Management (ISPIM), 2020.","apa":"Frank, M., Gausemeier, J., Hennig-Cardinal von Widdern, N., Koldewey, C., Menzefricke, J. S., &#38; Reinhold, J. (2020). A reference process for the Smart Service business: development and practical implications. In <i>Proceedings of the ISPIM connects</i>. International Society for Professional Innovation Management (ISPIM)."},"year":"2020","title":"A reference process for the Smart Service business: development and practical implications","date_created":"2020-07-20T07:50:33Z","author":[{"first_name":"Maximilian","last_name":"Frank","full_name":"Frank, Maximilian"},{"full_name":"Gausemeier, Juergen","last_name":"Gausemeier","first_name":"Juergen"},{"full_name":"Hennig-Cardinal von Widdern, Nils","last_name":"Hennig-Cardinal von Widdern","first_name":"Nils"},{"id":"43136","full_name":"Koldewey, Christian","last_name":"Koldewey","orcid":"https://orcid.org/0000-0001-7992-6399","first_name":"Christian"},{"last_name":"Menzefricke","full_name":"Menzefricke, Joern Steffen","first_name":"Joern Steffen"},{"last_name":"Reinhold","full_name":"Reinhold, Jannik","id":"33669","first_name":"Jannik"}],"publisher":"International Society for Professional Innovation Management (ISPIM)","date_updated":"2022-01-06T06:53:10Z"},{"status":"public","publication":"Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event \"Innovating in Times of Crisis\"","type":"conference","language":[{"iso":"eng"}],"_id":"17406","department":[{"_id":"563"}],"user_id":"43136","year":"2020","citation":{"bibtex":"@inproceedings{Becker_Joachim_Koldewey_Reinhold_Dumitrescu_2020, title={Scaling Digital Business Models: A Case from the Automotive Industry}, booktitle={Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event “Innovating in Times of Crisis”}, publisher={ISPIM Innovation Conference}, author={Becker, Julia-Kristin and Joachim, Klemens and Koldewey, Christian and Reinhold, Jannik and Dumitrescu, Roman}, year={2020} }","mla":"Becker, Julia-Kristin, et al. “Scaling Digital Business Models: A Case from the Automotive Industry.” <i>Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event “Innovating in Times of Crisis,”</i> ISPIM Innovation Conference, 2020.","short":"J.-K. Becker, K. Joachim, C. Koldewey, J. Reinhold, R. Dumitrescu, in: Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event “Innovating in Times of Crisis,” ISPIM Innovation Conference, 2020.","apa":"Becker, J.-K., Joachim, K., Koldewey, C., Reinhold, J., &#38; Dumitrescu, R. (2020). Scaling Digital Business Models: A Case from the Automotive Industry. In <i>Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event “Innovating in Times of Crisis.”</i> ISPIM Innovation Conference.","ama":"Becker J-K, Joachim K, Koldewey C, Reinhold J, Dumitrescu R. Scaling Digital Business Models: A Case from the Automotive Industry. In: <i>Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event “Innovating in Times of Crisis.”</i> ISPIM Innovation Conference; 2020.","chicago":"Becker, Julia-Kristin, Klemens Joachim, Christian Koldewey, Jannik Reinhold, and Roman Dumitrescu. “Scaling Digital Business Models: A Case from the Automotive Industry.” In <i>Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event “Innovating in Times of Crisis.”</i> ISPIM Innovation Conference, 2020.","ieee":"J.-K. Becker, K. Joachim, C. Koldewey, J. Reinhold, and R. Dumitrescu, “Scaling Digital Business Models: A Case from the Automotive Industry,” in <i>Proceedings of the 2020 ISPIM Innovation Conference (Virtual) Event “Innovating in Times of Crisis,”</i> 2020."},"title":"Scaling Digital Business Models: A Case from the Automotive Industry","publisher":"ISPIM Innovation Conference","date_updated":"2022-01-06T06:53:10Z","date_created":"2020-07-20T07:50:55Z","author":[{"first_name":"Julia-Kristin","last_name":"Becker","full_name":"Becker, Julia-Kristin"},{"full_name":"Joachim, Klemens","last_name":"Joachim","first_name":"Klemens"},{"last_name":"Koldewey","orcid":"https://orcid.org/0000-0001-7992-6399","full_name":"Koldewey, Christian","id":"43136","first_name":"Christian"},{"first_name":"Jannik","full_name":"Reinhold, Jannik","id":"33669","last_name":"Reinhold"},{"last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190","first_name":"Roman"}]},{"conference":{"name":"Discovery Science 2020"},"title":"Extreme Algorithm Selection with Dyadic Feature Representation","author":[{"last_name":"Tornede","full_name":"Tornede, Alexander","id":"38209","first_name":"Alexander"},{"first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176","full_name":"Wever, Marcel Dominik"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"date_created":"2020-07-21T10:06:51Z","date_updated":"2022-01-06T06:53:10Z","citation":{"ama":"Tornede A, Wever MD, Hüllermeier E. Extreme Algorithm Selection with Dyadic Feature Representation. In: <i>Discovery Science</i>. ; 2020.","chicago":"Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Extreme Algorithm Selection with Dyadic Feature Representation.” In <i>Discovery Science</i>, 2020.","ieee":"A. Tornede, M. D. Wever, and E. Hüllermeier, “Extreme Algorithm Selection with Dyadic Feature Representation,” presented at the Discovery Science 2020, 2020.","short":"A. Tornede, M.D. Wever, E. Hüllermeier, in: Discovery Science, 2020.","mla":"Tornede, Alexander, et al. “Extreme Algorithm Selection with Dyadic Feature Representation.” <i>Discovery Science</i>, 2020.","bibtex":"@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Extreme Algorithm Selection with Dyadic Feature Representation}, booktitle={Discovery Science}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }","apa":"Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2020). Extreme Algorithm Selection with Dyadic Feature Representation. <i>Discovery Science</i>. Discovery Science 2020."},"year":"2020","language":[{"iso":"eng"}],"user_id":"5786","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"17407","status":"public","type":"conference","publication":"Discovery Science"},{"language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"17408","user_id":"5786","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"status":"public","type":"conference","publication":"KI 2020: Advances in Artificial Intelligence","title":"Hybrid Ranking and Regression for Algorithm Selection","conference":{"name":"43rd German Conference on Artificial Intelligence"},"date_updated":"2022-01-06T06:53:10Z","author":[{"first_name":"Jonas Manuel","full_name":"Hanselle, Jonas Manuel","id":"43980","last_name":"Hanselle","orcid":"0000-0002-1231-4985"},{"full_name":"Tornede, Alexander","id":"38209","last_name":"Tornede","first_name":"Alexander"},{"first_name":"Marcel Dominik","id":"33176","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"date_created":"2020-07-21T10:21:09Z","year":"2020","citation":{"mla":"Hanselle, Jonas Manuel, et al. “Hybrid Ranking and Regression for Algorithm Selection.” <i>KI 2020: Advances in Artificial Intelligence</i>, 2020.","short":"J.M. Hanselle, A. Tornede, M.D. Wever, E. Hüllermeier, in: KI 2020: Advances in Artificial Intelligence, 2020.","bibtex":"@inproceedings{Hanselle_Tornede_Wever_Hüllermeier_2020, title={Hybrid Ranking and Regression for Algorithm Selection}, booktitle={KI 2020: Advances in Artificial Intelligence}, author={Hanselle, Jonas Manuel and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }","apa":"Hanselle, J. M., Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2020). Hybrid Ranking and Regression for Algorithm Selection. <i>KI 2020: Advances in Artificial Intelligence</i>. 43rd German Conference on Artificial Intelligence.","ama":"Hanselle JM, Tornede A, Wever MD, Hüllermeier E. Hybrid Ranking and Regression for Algorithm Selection. In: <i>KI 2020: Advances in Artificial Intelligence</i>. ; 2020.","ieee":"J. M. Hanselle, A. Tornede, M. D. Wever, and E. Hüllermeier, “Hybrid Ranking and Regression for Algorithm Selection,” presented at the 43rd German Conference on Artificial Intelligence, 2020.","chicago":"Hanselle, Jonas Manuel, Alexander Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Hybrid Ranking and Regression for Algorithm Selection.” In <i>KI 2020: Advances in Artificial Intelligence</i>, 2020."}},{"conference":{"name":"IOTStream Workshop @ ECMLPKDD 2020"},"doi":"10.1007/978-3-030-66770-2_8","title":"AutoML for Predictive Maintenance: One Tool to RUL Them All","date_created":"2020-07-28T09:17:41Z","author":[{"full_name":"Tornede, Tanja","id":"40795","last_name":"Tornede","first_name":"Tanja"},{"first_name":"Alexander","full_name":"Tornede, Alexander","id":"38209","last_name":"Tornede"},{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_updated":"2022-01-06T06:53:11Z","citation":{"ama":"Tornede T, Tornede A, Wever MD, Mohr F, Hüllermeier E. AutoML for Predictive Maintenance: One Tool to RUL Them All. In: <i>Proceedings of the ECMLPKDD 2020</i>. ; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>","ieee":"T. Tornede, A. Tornede, M. D. Wever, F. Mohr, and E. Hüllermeier, “AutoML for Predictive Maintenance: One Tool to RUL Them All,” presented at the IOTStream Workshop @ ECMLPKDD 2020, 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>.","chicago":"Tornede, Tanja, Alexander Tornede, Marcel Dominik Wever, Felix Mohr, and Eyke Hüllermeier. “AutoML for Predictive Maintenance: One Tool to RUL Them All.” In <i>Proceedings of the ECMLPKDD 2020</i>, 2020. <a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">https://doi.org/10.1007/978-3-030-66770-2_8</a>.","apa":"Tornede, T., Tornede, A., Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2020). AutoML for Predictive Maintenance: One Tool to RUL Them All. <i>Proceedings of the ECMLPKDD 2020</i>. IOTStream Workshop @ ECMLPKDD 2020. <a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">https://doi.org/10.1007/978-3-030-66770-2_8</a>","mla":"Tornede, Tanja, et al. “AutoML for Predictive Maintenance: One Tool to RUL Them All.” <i>Proceedings of the ECMLPKDD 2020</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>.","short":"T. Tornede, A. Tornede, M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the ECMLPKDD 2020, 2020.","bibtex":"@inproceedings{Tornede_Tornede_Wever_Mohr_Hüllermeier_2020, title={AutoML for Predictive Maintenance: One Tool to RUL Them All}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>}, booktitle={Proceedings of the ECMLPKDD 2020}, author={Tornede, Tanja and Tornede, Alexander and Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2020} }"},"year":"2020","language":[{"iso":"eng"}],"user_id":"5786","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901","_id":"1"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"17424","status":"public","type":"conference","publication":"Proceedings of the ECMLPKDD 2020"},{"abstract":[{"lang":"eng","text":"Syntactic annotation of corpora in the form of part-of-speech (POS) tags is a key requirement for both linguistic research and subsequent automated natural language processing (NLP) tasks. This problem is commonly tackled using machine learning methods, i.e., by training a POS tagger on a sufficiently large corpus of labeled data. \r\nWhile the problem of POS tagging can essentially be considered as solved for modern languages, historical corpora turn out to be much more difficult, especially due to the lack of native speakers and sparsity of training data. Moreover, most texts have no sentences as we know them today, nor a common orthography.\r\nThese irregularities render the task of automated POS tagging more difficult and error-prone. Under these circumstances, instead  of forcing the POS tagger to predict and commit to a single tag, it should be enabled to express its uncertainty. In this paper, we consider POS tagging within the framework of set-valued prediction, which allows the POS tagger to express its uncertainty via predicting a set of candidate POS tags instead of guessing a single one. The goal is to guarantee a high confidence that the correct POS tag is included while keeping the number of candidates small.\r\nIn our experimental study, we find that extending state-of-the-art POS taggers to set-valued prediction yields more precise and robust taggings, especially for unknown words, i.e., words not occurring in the training data."}],"status":"public","type":"preprint","publication":"Journal of Data Mining and Digital Humanities","language":[{"iso":"eng"}],"project":[{"name":"InterGramm","_id":"39"}],"_id":"17605","user_id":"5786","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"year":"2020","citation":{"ieee":"S. H. Heid, M. D. Wever, and E. Hüllermeier, “Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction,” <i>Journal of Data Mining and Digital Humanities</i>. episciences.","chicago":"Heid, Stefan Helmut, Marcel Dominik Wever, and Eyke Hüllermeier. “Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction.” <i>Journal of Data Mining and Digital Humanities</i>. episciences, n.d.","ama":"Heid SH, Wever MD, Hüllermeier E. Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction. <i>Journal of Data Mining and Digital Humanities</i>.","apa":"Heid, S. H., Wever, M. D., &#38; Hüllermeier, E. (n.d.). Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction. In <i>Journal of Data Mining and Digital Humanities</i>. episciences.","short":"S.H. Heid, M.D. Wever, E. Hüllermeier, Journal of Data Mining and Digital Humanities (n.d.).","bibtex":"@article{Heid_Wever_Hüllermeier, title={Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction}, journal={Journal of Data Mining and Digital Humanities}, publisher={episciences}, author={Heid, Stefan Helmut and Wever, Marcel Dominik and Hüllermeier, Eyke} }","mla":"Heid, Stefan Helmut, et al. “Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction.” <i>Journal of Data Mining and Digital Humanities</i>, episciences."},"publication_status":"submitted","title":"Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction","main_file_link":[{"url":"https://arxiv.org/abs/2008.01377","open_access":"1"}],"date_updated":"2022-01-06T06:53:15Z","oa":"1","publisher":"episciences","author":[{"last_name":"Heid","orcid":"0000-0002-9461-7372","full_name":"Heid, Stefan Helmut","id":"39640","first_name":"Stefan Helmut"},{"id":"33176","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","first_name":"Marcel Dominik"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2020-08-05T06:52:53Z"},{"publication":"arXiv:2008.04551","type":"preprint","abstract":[{"lang":"eng","text":"Software verification has recently made enormous progress due to the\r\ndevelopment of novel verification methods and the speed-up of supporting\r\ntechnologies like SMT solving. To keep software verification tools up to date\r\nwith these advances, tool developers keep on integrating newly designed methods\r\ninto their tools, almost exclusively by re-implementing the method within their\r\nown framework. While this allows for a conceptual re-use of methods, it\r\nrequires novel implementations for every new technique.\r\n  In this paper, we employ cooperative verification in order to avoid\r\nreimplementation and enable usage of novel tools as black-box components in\r\nverification. Specifically, cooperation is employed for the core ingredient of\r\nsoftware verification which is invariant generation. Finding an adequate loop\r\ninvariant is key to the success of a verification run. Our framework named\r\nCoVerCIG allows a master verification tool to delegate the task of invariant\r\ngeneration to one or several specialized helper invariant generators. Their\r\nresults are then utilized within the verification run of the master verifier,\r\nallowing in particular for crosschecking the validity of the invariant. We\r\nexperimentally evaluate our framework on an instance with two masters and three\r\ndifferent invariant generators using a number of benchmarks from SV-COMP 2020.\r\nThe experiments show that the use of CoVerCIG can increase the number of\r\ncorrectly verified tasks without increasing the used resources"}],"status":"public","_id":"17825","project":[{"name":"Kooperative Softwareverifikation","_id":"85"}],"department":[{"_id":"77"}],"user_id":"44413","language":[{"iso":"eng"}],"year":"2020","citation":{"apa":"Haltermann, J. F., &#38; Wehrheim, H. (2020). Cooperative Verification via Collective Invariant Generation. <i>ArXiv:2008.04551</i>.","short":"J.F. Haltermann, H. Wehrheim, ArXiv:2008.04551 (2020).","bibtex":"@article{Haltermann_Wehrheim_2020, title={Cooperative Verification via Collective Invariant Generation}, journal={arXiv:2008.04551}, author={Haltermann, Jan Frederik and Wehrheim, Heike}, year={2020} }","mla":"Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification via Collective Invariant Generation.” <i>ArXiv:2008.04551</i>, 2020.","ama":"Haltermann JF, Wehrheim H. Cooperative Verification via Collective Invariant Generation. <i>arXiv:200804551</i>. 2020.","chicago":"Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification via Collective Invariant Generation.” <i>ArXiv:2008.04551</i>, 2020.","ieee":"J. F. Haltermann and H. Wehrheim, “Cooperative Verification via Collective Invariant Generation,” <i>arXiv:2008.04551</i>. 2020."},"date_updated":"2022-01-06T06:53:20Z","author":[{"full_name":"Haltermann, Jan Frederik","id":"44413","last_name":"Haltermann","first_name":"Jan Frederik"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2020-08-12T06:49:18Z","title":"Cooperative Verification via Collective Invariant Generation"}]