[{"external_id":{"arxiv":["2205.11102"]},"language":[{"iso":"eng"}],"keyword":["K-Server Problem","Heterogeneity","Online Caching"],"publication":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","abstract":[{"lang":"eng","text":"The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).\r\n\r\nIn our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n    \r\nThe two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously."}],"date_created":"2022-06-10T09:06:42Z","publisher":"Association for Computing Machinery","title":"The k-Server with Preferences Problem","year":"2022","department":[{"_id":"63"}],"user_id":"39241","_id":"31847","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"type":"conference","status":"public","author":[{"id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik"},{"first_name":"Björn","last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn"},{"last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","id":"41265","last_name":"Malatyali"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-08-02T08:07:30Z","doi":"10.1145/3490148.3538595","publication_identifier":{"isbn":["9781450391467"]},"page":"345-356","citation":{"short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.","mla":"Castenow, Jannik, et al. “The K-Server with Preferences Problem.” <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2022, pp. 345–56, doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022, title={The k-Server with Preferences Problem}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>}, booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={Association for Computing Machinery}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2022}, pages={345–356} }","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–356. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2022:345-356. doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,” in <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2022, pp. 345–356, doi: <a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>."}},{"year":"2021","citation":{"ieee":"R. Bernijazov <i>et al.</i>, “A Meta-Review on Artificial Intelligence in Product Creation,” presented at the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada, 2021.","chicago":"Bernijazov, Ruslan, Alexander Dicks, Roman Dumitrescu, Marc Foullois, Jonas Manuel Hanselle, Eyke Hüllermeier, Gökce Karakaya, et al. “A Meta-Review on Artificial Intelligence in Product Creation.” In <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>, 2021.","ama":"Bernijazov R, Dicks A, Dumitrescu R, et al. A Meta-Review on Artificial Intelligence in Product Creation. In: <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>. ; 2021.","bibtex":"@inproceedings{Bernijazov_Dicks_Dumitrescu_Foullois_Hanselle_Hüllermeier_Karakaya_Ködding_Lohweg_Malatyali_et al._2021, title={A Meta-Review on Artificial Intelligence in Product Creation}, booktitle={Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)}, author={Bernijazov, Ruslan and Dicks, Alexander and Dumitrescu, Roman and Foullois, Marc and Hanselle, Jonas Manuel and Hüllermeier, Eyke and Karakaya, Gökce and Ködding, Patrick and Lohweg, Volker and Malatyali, Manuel and et al.}, year={2021} }","mla":"Bernijazov, Ruslan, et al. “A Meta-Review on Artificial Intelligence in Product Creation.” <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>, 2021.","short":"R. Bernijazov, A. Dicks, R. Dumitrescu, M. Foullois, J.M. Hanselle, E. Hüllermeier, G. Karakaya, P. Ködding, V. Lohweg, M. Malatyali, F. Meyer auf der Heide, M. Panzner, C. Soltenborn, in: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.","apa":"Bernijazov, R., Dicks, A., Dumitrescu, R., Foullois, M., Hanselle, J. M., Hüllermeier, E., Karakaya, G., Ködding, P., Lohweg, V., Malatyali, M., Meyer auf der Heide, F., Panzner, M., &#38; Soltenborn, C. (2021). A Meta-Review on Artificial Intelligence in Product Creation. <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>. 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada."},"publication_status":"epub_ahead","quality_controlled":"1","title":"A Meta-Review on Artificial Intelligence in Product Creation","main_file_link":[{"url":"https://www.hsu-hh.de/imb/wp-content/uploads/sites/677/2021/08/A-Meta-Review-on-Artificial-Intelligence-in-Product-Creation.pdf"}],"conference":{"name":"30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop \"AI and Product Design\"","start_date":"2021-08-19","end_date":"2021-08-26","location":"Montreal, Kanada"},"date_updated":"2022-01-06T06:55:59Z","date_created":"2021-09-06T08:23:45Z","author":[{"full_name":"Bernijazov, Ruslan","last_name":"Bernijazov","first_name":"Ruslan"},{"first_name":"Alexander","last_name":"Dicks","full_name":"Dicks, Alexander"},{"last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190","first_name":"Roman"},{"first_name":"Marc","last_name":"Foullois","full_name":"Foullois, Marc"},{"first_name":"Jonas Manuel","id":"43980","full_name":"Hanselle, Jonas Manuel","last_name":"Hanselle","orcid":"0000-0002-1231-4985"},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Karakaya","full_name":"Karakaya, Gökce","first_name":"Gökce"},{"first_name":"Patrick","last_name":"Ködding","id":"45402","full_name":"Ködding, Patrick"},{"first_name":"Volker","full_name":"Lohweg, Volker","last_name":"Lohweg"},{"first_name":"Manuel","last_name":"Malatyali","id":"41265","full_name":"Malatyali, Manuel"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Melina","last_name":"Panzner","full_name":"Panzner, Melina"},{"last_name":"Soltenborn","orcid":"0000-0002-0342-8227","full_name":"Soltenborn, Christian","id":"1737","first_name":"Christian"}],"abstract":[{"lang":"ger","text":"Produktentstehung (PE) bezieht sich auf den Prozess der Planung und Entwicklung eines Produkts sowie der damit verbundenen Dienstleistungen von der ersten Idee bis zur Herstellung und zum Vertrieb. Während dieses Prozesses gibt es zahlreiche Aufgaben, die von menschlichem Fachwissen abhängen und typischerweise von erfahrenen Experten übernommen werden. Da sich das Feld der Künstlichen Intelligenz (KI) immer weiterentwickelt und seinen Weg in den Fertigungssektor findet, gibt es viele Möglichkeiten für eine Anwendung von KI, um bei der Lösung der oben genannten Aufgaben zu helfen. In diesem Paper geben wir einen umfassenden Überblick über den aktuellen Stand der Technik des Einsatzes von KI in der PE. \r\nIm Detail analysieren wir 40 bestehende Surveys zu KI in der PE und 94 Case Studies, um herauszufinden, welche Bereiche der PE von der aktuellen Forschung in diesem Bereich vorrangig adressiert werden, wie ausgereift die diskutierten KI-Methoden sind und inwieweit datenzentrierte Ansätze in der aktuellen Forschung genutzt werden."},{"text":"Product Creation (PC) refers to the process of planning and developing a product as well as related services from the initial idea until manufacturing and distribution. Throughout this process, there are numerous tasks that depend on human expertise and are typically undertaken by experienced practitioners. As the field of Artificial Intelligence (AI) continues to evolve and finds its way into the manufacturing sector, there exist many possibilities for an application of AI in order to assist in solving aforementioned tasks. In this work, we provide a comprehensive overview of the current state of the art of the use of AI in PC. \r\nIn detail, we analyze 40 existing surveys on AI in PC and 94 case studies in order to find out which areas of PC are primarily addressed by current research in this field, how mature the discussed AI methods are, and to which extent data-centric approaches are utilized in current research.","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)","keyword":["Artificial Intelligence Product Creation Literature Review"],"language":[{"iso":"eng"}],"_id":"23779","user_id":"15415","department":[{"_id":"63"},{"_id":"563"},{"_id":"355"},{"_id":"241"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"20683","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","publication":"Theory of Computing Systems","type":"journal_article","doi":"10.1007/s00224-020-10023-8","title":"Managing Multiple Mobile Resources","volume":65,"author":[{"first_name":"Björn","id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"id":"41265","full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-12-08T08:40:10Z","date_updated":"2022-01-06T06:54:31Z","page":"943–984","intvolume":"        65","citation":{"chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i> 65 (2021): 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>.","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” <i>Theory of Computing Systems</i>, vol. 65, pp. 943–984, 2021, doi: <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>. 2021;65:943–984. doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>, <i>65</i>, 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i>, vol. 65, 2021, pp. 943–984, doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","bibtex":"@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>}, journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984} }"},"year":"2021","publication_status":"published"},{"language":[{"iso":"eng"}],"_id":"16461","external_id":{"arxiv":["arXiv:1706.03568 "]},"department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Structural Information and Communication Complexity","type":"book_chapter","title":"Monitoring of Domain-Related Problems in Distributed Data Streams","doi":"10.1007/978-3-319-72050-0_13","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-08T07:20:20Z","author":[{"full_name":"Bemmann, Pascal","last_name":"Bemmann","first_name":"Pascal"},{"full_name":"Biermeier, Felix","last_name":"Biermeier","first_name":"Felix"},{"first_name":"Jan","last_name":"Bürmann","full_name":"Bürmann, Jan"},{"full_name":"Kemper, Arne","last_name":"Kemper","first_name":"Arne"},{"full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"},{"full_name":"Knorr, Steffen","last_name":"Knorr","first_name":"Steffen"},{"first_name":"Nils","last_name":"Kothe","full_name":"Kothe, Nils"},{"first_name":"Alexander","last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander"},{"id":"41265","full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian","id":"30291","last_name":"Schaefer"},{"first_name":"Jannik","last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik"}],"year":"2017","place":"Cham","citation":{"short":"P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.","mla":"Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” <i>Structural Information and Communication Complexity</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>.","bibtex":"@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems in Distributed Data Streams}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>}, booktitle={Structural Information and Communication Complexity}, author={Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }","apa":"Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., &#38; Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In <i>Structural Information and Communication Complexity</i>. <a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">https://doi.org/10.1007/978-3-319-72050-0_13</a>","ama":"Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: <i>Structural Information and Communication Complexity</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>","ieee":"P. Bemmann <i>et al.</i>, “Monitoring of Domain-Related Problems in Distributed Data Streams,” in <i>Structural Information and Communication Complexity</i>, Cham, 2017.","chicago":"Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” In <i>Structural Information and Communication Complexity</i>. Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">https://doi.org/10.1007/978-3-319-72050-0_13</a>."},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319720494","9783319720500"]},"publication_status":"published"}]