{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:13:41Z","timestamp":1742919221442,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031368882"},{"type":"electronic","value":"9783031368899"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36889-9_14","type":"book-chapter","created":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T21:01:50Z","timestamp":1689454910000},"page":"183-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MockSAS: Facilitating the\u00a0Evaluation of\u00a0Bandit Algorithms in\u00a0Self-adaptive\u00a0Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5501-6059","authenticated-orcid":false,"given":"Elvin","family":"Alberts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9333-7101","authenticated-orcid":false,"given":"Ilias","family":"Gerostathopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3622-9918","authenticated-orcid":false,"given":"Tomas","family":"Bures","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,16]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Alberts, E., Gerostathopoulos, I.: Measuring convergence inertia: online learning in self-adaptive systems with context shifts. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. Adaptation and Learning. pp. 231\u2013248. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-19759-8_15","DOI":"10.1007\/978-3-031-19759-8_15"},{"key":"14_CR2","unstructured":"Alberts, E.G.: Adapting with regret: using multi-armed bandits with self-adaptive systems. Master\u2019s thesis, University of Amsterdam (2022). https:\/\/scripties.uba.uva.nl\/search?id=727497"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time Analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002). https:\/\/doi.org\/10.1023\/A:1013689704352","journal-title":"Mach. Learn."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The Nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48\u201377 (2002). https:\/\/doi.org\/10.1137\/S0097539701398375","journal-title":"SIAM J. Comput."},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bubeck, S.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends Mach. Learn. 5(1), 1\u2013122 (2012). https:\/\/doi.org\/10.1561\/2200000024","DOI":"10.1561\/2200000024"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Cabri, G., Capodieci, N.: Applying multi-armed bandit strategies to change of collaboration patterns at runtime. In: 2013 1st International Conference on Artificial Intelligence, Modelling and Simulation, pp. 151\u2013156. IEEE, Kota Kinabalu, Malaysia (December 2013). https:\/\/doi.org\/10.1109\/AIMS.2013.31","DOI":"10.1109\/AIMS.2013.31"},{"key":"14_CR7","unstructured":"Erezsh: Lark parser. https:\/\/github.com\/lark-parser\/lark (2022)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/MC.2003.1160055","volume":"36","author":"J Kephart","year":"2003","unstructured":"Kephart, J., Chess, D.: The vision of autonomic computing. Computer 36(1), 41\u201350 (2003)","journal-title":"Computer"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Kim, D., Park, S.: Reinforcement learning-based dynamic adaptation planning method for architecture-based self-managed software. In: 2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems, pp. 76\u201385 (May 2009). https:\/\/doi.org\/10.1109\/SEAMS.2009.5069076, iSSN: 2157-2321","DOI":"10.1109\/SEAMS.2009.5069076"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Kim, D., Park, S.: Reinforcement learning-based dynamic adaptation planning method for architecture-based self-managed software. In: 2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems, pp. 76\u201385 (2009). https:\/\/doi.org\/10.1109\/SEAMS.2009.5069076","DOI":"10.1109\/SEAMS.2009.5069076"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.): 22nd International Conference on Algorithmic Learning Theory: ALT 2011, Espoo, Finland, 5-7 October 2011. Proceedings, LNCS, vol.\u00a06925. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24412-4","DOI":"10.1007\/978-3-642-24412-4"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.pmcj.2014.09.009","volume":"17","author":"C Krupitzer","year":"2015","unstructured":"Krupitzer, C., Roth, F.M., VanSyckel, S., Schiele, G., Becker, C.: A survey on engineering approaches for self-adaptive systems. Pervasive Mob. Comput. 17, 184\u2013206 (2015). https:\/\/doi.org\/10.1016\/j.pmcj.2014.09.009","journal-title":"Pervasive Mob. Comput."},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press, 1 edn. (July 2020). https:\/\/doi.org\/10.1017\/9781108571401, https:\/\/www.cambridge.org\/core\/product\/identifier\/9781108571401\/type\/book","DOI":"10.1017\/9781108571401"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Lewis, P.R., Esterle, L., Chandra, A., Rinner, B., Yao, X.: Learning to be different: heterogeneity and efficiency in distributed smart camera networks. In: 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems, pp. 209\u2013218. IEEE, Philadelphia, PA, USA (Septebfer 2013). https:\/\/doi.org\/10.1109\/SASO.2013.20, http:\/\/ieeexplore.ieee.org\/document\/6676508\/","DOI":"10.1109\/SASO.2013.20"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Metzger, A., Quinton, C., Mann, Z.A., Baresi, L., Pohl, K.: Feature-model-guided online learning for self-adaptive systems. arXiv:1907.09158 [cs] 12571, 269\u2013286 (2020). https:\/\/doi.org\/10.1007\/978-3-030-65310-1_20, arXiv: 1907.09158","DOI":"10.1007\/978-3-030-65310-1_20"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Moreno, G.A., Schmerl, B., Garlan, D.: SWIM: an exemplar for evaluation and comparison of self-adaptation approaches for web applications. In: Proceedings of the 13th International Conference on Software Engineering for Adaptive and Self-Managing Systems, pp. 137\u2013143. ACM, Gothenburg Sweden (May 2018). https:\/\/doi.org\/10.1145\/3194133.3194163","DOI":"10.1145\/3194133.3194163"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Porter, B., Rodrigues Filho, R.: Distributed emergent software: assembling, perceiving and learning systems at scale. In: 2019 IEEE 13th International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 127\u2013136 (June 2019). https:\/\/doi.org\/10.1109\/SASO.2019.00024, iSSN: 1949-3681","DOI":"10.1109\/SASO.2019.00024"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Slivkins, A.: Introduction to multi-armed bandits. found. Trends Mach. Learn. 12(1\u20132), 1\u2013286 (2019). https:\/\/doi.org\/10.1561\/2200000068, publisher: Now Publishers Inc","DOI":"10.1561\/2200000068"}],"container-title":["Lecture Notes in Computer Science","Software Architecture. ECSA 2022 Tracks and Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36889-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T21:03:04Z","timestamp":1689454984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36889-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031368882","9783031368899"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36889-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Software Architecture","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecsa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/ecsa-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 tutorial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}