[{"year":"2022","citation":{"short":"M. Althaus, M. Poniatowski, D. Kundisch, in: 2022.","bibtex":"@inproceedings{Althaus_Poniatowski_Kundisch_2022, title={Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic}, author={Althaus, Maike and Poniatowski, Martin and Kundisch, Dennis}, year={2022} }","mla":"Althaus, Maike, et al. <i>Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic</i>. 2022.","apa":"Althaus, M., Poniatowski, M., &#38; Kundisch, D. (2022). <i>Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic</i>. Symposium on Statistical Challenges in Electronic Commerce Research (SCECR), Madrid, Spain.","ama":"Althaus M, Poniatowski M, Kundisch D. Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic. In: ; 2022.","ieee":"M. Althaus, M. Poniatowski, and D. Kundisch, “Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic,” presented at the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR), Madrid, Spain, 2022.","chicago":"Althaus, Maike, Martin Poniatowski, and Dennis Kundisch. “Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic,” 2022."},"title":"Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic","conference":{"name":"Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)","location":"Madrid, Spain"},"date_updated":"2022-11-17T14:21:50Z","date_created":"2022-04-01T11:58:15Z","author":[{"first_name":"Maike","id":"61896","full_name":"Althaus, Maike","last_name":"Althaus"},{"first_name":"Martin","last_name":"Poniatowski","id":"32441","full_name":"Poniatowski, Martin"},{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"}],"status":"public","type":"conference_abstract","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A4: SFB 901 - Subproject A4","_id":"8"}],"_id":"30734","user_id":"477","department":[{"_id":"276"}]},{"type":"conference_abstract","status":"public","_id":"30212","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"276"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2022","citation":{"ieee":"C. Vorbohle and D. Kundisch, “Key Properties of Sustainable Business Ecosystem Relationships,” presented at the Symplatform (Third Edition), 2022.","chicago":"Vorbohle, Christian, and Dennis Kundisch. “Key Properties of Sustainable Business Ecosystem Relationships,” 2022.","ama":"Vorbohle C, Kundisch D. Key Properties of Sustainable Business Ecosystem Relationships. In: ; 2022.","apa":"Vorbohle, C., &#38; Kundisch, D. (2022). <i>Key Properties of Sustainable Business Ecosystem Relationships</i>. Symplatform (Third Edition).","bibtex":"@inproceedings{Vorbohle_Kundisch_2022, title={Key Properties of Sustainable Business Ecosystem Relationships}, author={Vorbohle, Christian and Kundisch, Dennis}, year={2022} }","mla":"Vorbohle, Christian, and Dennis Kundisch. <i>Key Properties of Sustainable Business Ecosystem Relationships</i>. 2022.","short":"C. Vorbohle, D. Kundisch, in: 2022."},"date_updated":"2022-11-17T14:23:02Z","date_created":"2022-03-08T09:55:06Z","author":[{"last_name":"Vorbohle","full_name":"Vorbohle, Christian","id":"29951","first_name":"Christian"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"title":"Key Properties of Sustainable Business Ecosystem Relationships","conference":{"name":"Symplatform (Third Edition)"}},{"title":"Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law","conference":{"name":"58th Allerton Conference on Communication, Control, and Computing"},"date_updated":"2022-11-18T09:31:19Z","date_created":"2022-08-15T09:59:17Z","author":[{"first_name":"Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","id":"52265","full_name":"Redder, Adrian"},{"first_name":"Arunselvan","full_name":"Ramaswamy, Arunselvan","id":"66937","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"year":"2022","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. In: <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. ; 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” In <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law,” presented at the 58th Allerton Conference on Communication, Control, and Computing, 2022.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}, booktitle={Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference on Communication, Control, and Computing, 2022.","mla":"Redder, Adrian, et al. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. 58th Allerton Conference on Communication, Control, and Computing."},"has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"32811","user_id":"477","department":[{"_id":"75"}],"abstract":[{"text":"The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\\Delta(n)$ is reset to one; otherwise, $\\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\\Delta(n)$ is itself $\\alpha$-mixing from which we conclude a strong law of large numbers for $\\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times.","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of the 58th Allerton Conference on Communication, Control, and Computing"},{"publication_status":"published","has_accepted_license":"1","year":"2022","citation":{"bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}, DOI={<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>}, booktitle={Proceedings of the 14th International Conference on Agents and Artificial Intelligence}, publisher={SCITEPRESS - Science and Technology Publications}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>, SCITEPRESS - Science and Technology Publications, 2022, doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology Publications, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication,” 2022, doi: <a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” In <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications, 2022. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>.","ama":"Redder A, Ramaswamy A, Karl H. Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. In: <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications; 2022. doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>"},"date_updated":"2022-11-18T09:32:14Z","publisher":"SCITEPRESS - Science and Technology Publications","date_created":"2022-04-06T07:18:36Z","author":[{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian","first_name":"Adrian"},{"first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"title":"Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication","doi":"10.5220/0010845400003116","type":"conference","publication":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2022-08-31T07:10:13Z","date_created":"2022-08-31T07:10:13Z","creator":"aredder","file_size":298926,"file_name":"ICCART2022.pdf","file_id":"33237","access_level":"closed"}],"status":"public","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze","_id":"24"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"30793","user_id":"477","department":[{"_id":"75"}],"ddc":["006"],"language":[{"iso":"eng"}],"file_date_updated":"2022-08-31T07:10:13Z"},{"citation":{"chicago":"Stahl, Maja, Maximilian Spliethöver, and Henning Wachsmuth. “To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation.” In <i>Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science</i>. Abu Dhabi, United Arab Emirates, n.d.","ieee":"M. Stahl, M. Spliethöver, and H. Wachsmuth, “To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation,” presented at the Fifth Workshop on NLP and Computational Social Science (NLP+CSS)  At EMNLP 2022, Abu Dhabi, United Arab Emirates.","ama":"Stahl M, Spliethöver M, Wachsmuth H. To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation. In: <i>Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science</i>.","short":"M. Stahl, M. Spliethöver, H. Wachsmuth, in: Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science, Abu Dhabi, United Arab Emirates, n.d.","mla":"Stahl, Maja, et al. “To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation.” <i>Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science</i>.","bibtex":"@inproceedings{Stahl_Spliethöver_Wachsmuth, place={Abu Dhabi, United Arab Emirates}, title={To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation}, booktitle={Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science}, author={Stahl, Maja and Spliethöver, Maximilian and Wachsmuth, Henning} }","apa":"Stahl, M., Spliethöver, M., &#38; Wachsmuth, H. (n.d.). To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation. <i>Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science</i>. Fifth Workshop on NLP and Computational Social Science (NLP+CSS)  At EMNLP 2022, Abu Dhabi, United Arab Emirates."},"year":"2022","place":"Abu Dhabi, United Arab Emirates","publication_status":"accepted","quality_controlled":"1","conference":{"location":"Abu Dhabi, United Arab Emirates","name":"Fifth Workshop on NLP and Computational Social Science (NLP+CSS)  At EMNLP 2022"},"title":"To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation","author":[{"last_name":"Stahl","full_name":"Stahl, Maja","id":"77647","first_name":"Maja"},{"first_name":"Maximilian","full_name":"Spliethöver, Maximilian","id":"84035","last_name":"Spliethöver","orcid":"0000-0003-4364-1409"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"}],"date_created":"2022-11-15T08:29:26Z","date_updated":"2022-11-18T08:22:56Z","status":"public","abstract":[{"lang":"eng","text":"Gender bias may emerge from an unequal representation of agency and power, for example, by portraying women frequently as passive and powerless (\"She accepted her future'') and men as proactive and powerful (\"He chose his future''). When language models learn from respective texts, they may reproduce or even amplify the bias. An effective way to mitigate bias is to generate counterfactual sentences with opposite agency and power to the training. Recent work targeted agency-specific verbs from a lexicon to this end. We argue that this is insufficient, due to the interaction of agency and power and their dependence on context. In this paper, we thus develop a new rewriting model that identifies verbs with the desired agency and power in the context of the given sentence. The verbs' probability is then boosted to encourage the model to rewrite both connotations jointly. According to automatic metrics, our model effectively controls for power while being competitive in agency to the state of the art. In our evaluation, human annotators favored its counterfactuals in terms of both connotations, also deeming its meaning preservation better."}],"type":"conference","publication":"Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science","language":[{"iso":"eng"}],"extern":"1","user_id":"77647","_id":"34082"},{"abstract":[{"text":"Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate with each other, over time, in order to minimize/maximize a global\r\nobjective. In the presence of unreliable communication networks, the\r\nAge-of-Information (AoI), which measures the freshness of data received, may be\r\nlarge and hence hinder algorithmic convergence. In this paper, we study the\r\nconvergence of general distributed gradient-based optimization algorithms in\r\nthe presence of communication that neither happens periodically nor at\r\nstochastically independent points in time. We show that convergence is\r\nguaranteed provided the random variables associated with the AoI processes are\r\nstochastically dominated by a random variable with finite first moment. This\r\nimproves on previous requirements of boundedness of more than the first moment.\r\nWe then introduce stochastically strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically dominated by a\r\nrandom variable with finite $p$-th moment. In combination with our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges in the presence of AoI, if $\\alpha(n)$ is summable.","lang":"eng"}],"status":"public","publication":"arXiv:2201.11343","type":"preprint","language":[{"iso":"eng"}],"external_id":{"arxiv":["2201.11343"]},"_id":"30790","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"75"}],"user_id":"477","year":"2022","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the presence of dependent  aperiodic communication. <i>arXiv:220111343</i>. Published online 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization in the presence of dependent  aperiodic communication,” <i>arXiv:2201.11343</i>. 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Distributed gradient-based optimization in the presence of dependent  aperiodic communication. In <i>arXiv:2201.11343</i>.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based optimization in the presence of dependent  aperiodic communication}, journal={arXiv:2201.11343}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022."},"title":"Distributed gradient-based optimization in the presence of dependent  aperiodic communication","date_updated":"2022-11-18T09:33:01Z","author":[{"full_name":"Redder, Adrian","id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","first_name":"Adrian"},{"full_name":"Ramaswamy, Arunselvan","id":"66937","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2022-04-06T06:53:38Z"},{"author":[{"last_name":"Hagengruber","orcid":"https://orcid.org/0000-0003-3360-6335","id":"198","full_name":"Hagengruber, Ruth Edith","first_name":"Ruth Edith"}],"date_created":"2022-11-17T16:37:52Z","publisher":"Classiques Garnier","date_updated":"2022-11-17T18:50:00Z","title":"Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens","citation":{"ama":"Hagengruber RE. Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens. <i>La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine Moreau, PF &#38; Seguin, MS (Eds) Paris</i>. Published online 2022:99 – 115.","ieee":"R. E. Hagengruber, “Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens,” <i>La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. &#38; Seguin, M.S. (Eds.). Paris</i>, pp. 99 – 115, 2022.","chicago":"Hagengruber, Ruth Edith. “Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens.” <i>La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. &#38; Seguin, M.S. (Eds.). Paris</i>, 2022, 99 – 115.","apa":"Hagengruber, R. E. (2022). Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens. <i>La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. &#38; Seguin, M.S. (Eds.). Paris</i>, 99 – 115.","mla":"Hagengruber, Ruth Edith. “Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens.” <i>La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. &#38; Seguin, M.S. (Eds.). Paris</i>, Classiques Garnier, 2022, pp. 99 – 115.","bibtex":"@article{Hagengruber_2022, title={Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens}, journal={La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. &#38; Seguin, M.S. (Eds.). Paris}, publisher={Classiques Garnier}, author={Hagengruber, Ruth Edith}, year={2022}, pages={99 – 115} }","short":"R.E. Hagengruber, La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. &#38; Seguin, M.S. (Eds.). Paris (2022) 99 – 115."},"page":"99 – 115","year":"2022","user_id":"49063","department":[{"_id":"519"}],"_id":"34109","language":[{"iso":"fre"}],"type":"journal_article","publication":"La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris","status":"public"},{"publication_status":"published","publication_identifier":{"eisbn":["978-1-6654-9747-3"]},"citation":{"ama":"Clausing L, Platzner M. ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. In: <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. IEEE; 2022:120-127. doi:<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>","ieee":"L. Clausing and M. Platzner, “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support,” in <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>,  Lyon, France, 2022, pp. 120–127, doi: <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>.","chicago":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” In <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–27. IEEE, 2022. <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>.","apa":"Clausing, L., &#38; Platzner, M. (2022). ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–127. <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>","mla":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, IEEE, 2022, pp. 120–27, doi:<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>.","bibtex":"@inproceedings{Clausing_Platzner_2022, title={ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support}, DOI={<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>}, booktitle={2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, publisher={IEEE}, author={Clausing, Lennart and Platzner, Marco}, year={2022}, pages={120–127} }","short":"L. Clausing, M. Platzner, in: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–127."},"page":"120-127","year":"2022","date_created":"2022-08-16T09:58:34Z","author":[{"id":"74287","full_name":"Clausing, Lennart","last_name":"Clausing","orcid":"0000-0003-3789-6034","first_name":"Lennart"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"publisher":"IEEE","date_updated":"2022-11-18T09:36:00Z","doi":"10.1109/ipdpsw55747.2022.00029","conference":{"location":" Lyon, France","end_date":"2022-06-03","start_date":"2022-05-30","name":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)"},"title":"ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support","type":"conference","publication":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","status":"public","user_id":"477","department":[{"_id":"78"}],"project":[{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"}],"_id":"32855","language":[{"iso":"eng"}]},{"year":"2022","citation":{"apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. In <i>arXiv:2201.00570</i>.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms,” <i>arXiv:2201.00570</i>. 2022.","ama":"Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. <i>arXiv:220100570</i>. Published online 2022."},"title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","date_updated":"2022-11-18T09:33:42Z","date_created":"2022-04-06T06:53:52Z","author":[{"first_name":"Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian"},{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"abstract":[{"lang":"eng","text":"We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous action spaces: the actor-critic paradigm. In the setting considered\r\nherein, each agent observes a part of the global state space in order to take\r\nlocal actions, for which it receives local rewards. For every agent, DDPG\r\ntrains a local actor (policy) and a local critic (Q-function). The analysis\r\nshows that multi-agent DDPG using neural networks to approximate the local\r\npolicies and critics converge to limits with the following properties: The\r\ncritic limits minimize the average squared Bellman loss; the actor limits\r\nparameterize a policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a\r\nprobability distribution over the global state-action space. It captures the\r\nasymptotics of all local training processes. Finally, we extend the analysis to\r\na fully decentralized setting where agents communicate over a wireless network\r\nprone to delays and losses; a typical scenario in, e.g., robotic applications."}],"status":"public","publication":"arXiv:2201.00570","type":"preprint","language":[{"iso":"eng"}],"_id":"30791","external_id":{"arxiv":["2201.00570"]},"project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"department":[{"_id":"75"}],"user_id":"477"},{"date_updated":"2022-11-18T09:45:40Z","author":[{"first_name":"Cedric","full_name":"Richter, Cedric","id":"50003","last_name":"Richter"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2022-08-08T07:40:04Z","title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","doi":"10.1109/ICST53961.2022.00027","year":"2022","page":"162-173","citation":{"chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–73, 2022. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>.","ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–173, doi: <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>.","apa":"Richter, C., &#38; Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–173. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>. ; 2022:162-173. doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–73, doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }"},"_id":"32590","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"user_id":"477","language":[{"iso":"eng"}],"publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","type":"conference","status":"public"},{"type":"conference","publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","status":"public","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"_id":"32591","user_id":"477","department":[{"_id":"77"}],"language":[{"iso":"eng"}],"year":"2022","citation":{"mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–22, doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","apa":"Richter, C., &#38; Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–422. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–22, 2022. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>.","ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–422, doi: <a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>. ; 2022:418-422. doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>"},"page":"418-422","date_updated":"2022-11-18T09:45:05Z","date_created":"2022-08-08T07:42:19Z","author":[{"first_name":"Cedric","id":"50003","full_name":"Richter, Cedric","last_name":"Richter"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"title":"TSSB-3M: Mining single statement bugs at massive scale","doi":"10.1145/3524842.3528505"},{"year":"2022","citation":{"apa":"Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.","bibtex":"@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek, Hanna}, year={2022} }","mla":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","ieee":"H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","chicago":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.","ama":"Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.; 2022."},"title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","date_updated":"2022-11-18T09:38:04Z","date_created":"2022-07-20T09:36:39Z","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"author":[{"last_name":"Siek","full_name":"Siek, Hanna","first_name":"Hanna"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"}],"_id":"32398","user_id":"477","department":[{"_id":"64"},{"_id":"7"}]},{"extern":"1","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901: SFB 901"}],"_id":"31485","status":"public","type":"mastersthesis","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","author":[{"last_name":"Kramer","full_name":"Kramer, Paul","id":"64594","first_name":"Paul"}],"date_created":"2022-05-28T08:07:40Z","date_updated":"2022-11-18T09:40:28Z","citation":{"apa":"Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.","short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","mla":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","ieee":"P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","chicago":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>, 2022.","ama":"Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.; 2022."},"year":"2022"},{"type":"conference","publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","abstract":[{"lang":"eng","text":"The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds"}],"status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"_id":"31806","user_id":"477","department":[{"_id":"34"}],"ddc":["000"],"keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"language":[{"iso":"eng"}],"year":"2022","citation":{"ama":"Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. In: <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. ; 2022. doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>","chicago":"Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” In <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022. <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>.","ieee":"K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi: <a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","apa":"Dreßler, K., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain). <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>","mla":"Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022, doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","short":"K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022.","bibtex":"@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>}, booktitle={Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }"},"date_updated":"2022-11-18T10:11:38Z","author":[{"first_name":"Kevin","id":"78256","full_name":"Dreßler, Kevin","last_name":"Dreßler"},{"last_name":"Sherif","id":"67234","full_name":"Sherif, Mohamed","first_name":"Mohamed"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"date_created":"2022-06-08T08:47:33Z","title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning","doi":"10.1145/3511095.3531287","conference":{"name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media","start_date":"2022-06-28","end_date":"2022-07-01","location":"Barcelona (Spain)"}},{"has_accepted_license":"1","citation":{"apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>, <i>55</i>(13), 133–138.","mla":"Redder, Adrian, et al. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, Elsevier, 2022, pp. 133–138.","short":"A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine}, publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}, pages={133–138} }","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i> 55, no. 13 (2022): 133–138.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the Convergence of Distributed Optimization,” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, pp. 133–138, 2022.","ama":"Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>. 2022;55(13):133–138."},"page":"133–138","intvolume":"        55","date_updated":"2022-11-18T10:05:14Z","author":[{"first_name":"Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","id":"52265"},{"orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","id":"66937","full_name":"Ramaswamy, Arunselvan","first_name":"Arunselvan"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"volume":55,"conference":{"name":"IFAC Conference on Networked Systems"},"type":"journal_article","status":"public","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"32854","user_id":"477","department":[{"_id":"75"}],"file_date_updated":"2022-08-31T07:06:30Z","issue":"13","year":"2022","publisher":"Elsevier","date_created":"2022-08-16T09:12:55Z","title":"Practical Network Conditions for the Convergence of Distributed Optimization","publication":"IFAC-PapersOnLine","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":298395,"file_name":"NecSys2022____Practical_Conditions_for_Conv.pdf","access_level":"closed","file_id":"33236","date_updated":"2022-08-31T07:06:30Z","creator":"aredder","date_created":"2022-08-31T07:06:30Z"}],"ddc":["006"],"language":[{"iso":"eng"}]},{"citation":{"bibtex":"@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}, DOI={<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>}, booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079} }","mla":"Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2022, pp. 2071–79, doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","short":"T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2022, pp. 2071–2079.","apa":"Hansmeier, T., Brede, M., &#38; Platzner, M. (2022). XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–2079. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>","ieee":"T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion,” in <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Boston, MA, USA, 2022, pp. 2071–2079, doi: <a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","chicago":"Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–79. New York, NY, United States: Association for Computing Machinery (ACM), 2022. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>.","ama":"Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. In: <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. Association for Computing Machinery (ACM); 2022:2071-2079. doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>"},"page":"2071-2079","place":"New York, NY, United States","year":"2022","publication_status":"published","conference":{"start_date":"2022-07-09","name":"International Workshop on Learning Classifier Systems (IWLCS 2022)","location":"Boston, MA, USA","end_date":"2022-07-13"},"doi":"10.1145/3520304.3533977","title":"XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion","author":[{"orcid":"0000-0003-1377-3339","last_name":"Hansmeier","full_name":"Hansmeier, Tim","id":"49992","first_name":"Tim"},{"full_name":"Brede, Mathis","last_name":"Brede","first_name":"Mathis"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"date_created":"2022-09-02T11:47:17Z","publisher":"Association for Computing Machinery (ACM)","date_updated":"2022-11-18T10:13:22Z","status":"public","type":"conference","publication":"GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"33253"},{"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"600"}],"project":[{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"_id":"33274","status":"public","type":"conference","publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)","title":"Analyzing Culture-Specific Argument Structures in Learner Essays","author":[{"first_name":"Wei-Fan","last_name":"Chen","id":"82920","full_name":"Chen, Wei-Fan"},{"first_name":"Mei-Hua","full_name":"Chen, Mei-Hua","last_name":"Chen"},{"first_name":"Garima","full_name":"Mudgal, Garima","last_name":"Mudgal"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"}],"date_created":"2022-09-06T13:51:23Z","date_updated":"2022-11-18T09:56:17Z","citation":{"apa":"Chen, W.-F., Chen, M.-H., Mudgal, G., &#38; Wachsmuth, H. (2022). Analyzing Culture-Specific Argument Structures in Learner Essays. <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61.","short":"W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","mla":"Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner Essays.” <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","bibtex":"@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }","ama":"Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument Structures in Learner Essays. In: <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>. ; 2022:51-61.","ieee":"W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific Argument Structures in Learner Essays,” in <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","chicago":"Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing Culture-Specific Argument Structures in Learner Essays.” In <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61, 2022."},"page":"51 - 61","year":"2022"},{"intvolume":"       244","page":"77:1–77:13","citation":{"apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>."},"year":"2022","doi":"10.4230/LIPIcs.ESA.2022.77","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","volume":244,"author":[{"first_name":"Marten","last_name":"Maack","id":"88252","full_name":"Maack, Marten"},{"first_name":"Simon","id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop"},{"first_name":"Anna Rodriguez","full_name":"Rasmussen, Anna Rodriguez","last_name":"Rasmussen"}],"date_created":"2022-09-27T13:06:05Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-11-18T10:14:14Z","status":"public","editor":[{"first_name":"Shiri","full_name":"Chechik, Shiri","last_name":"Chechik"},{"first_name":"Gonzalo","full_name":"Navarro, Gonzalo","last_name":"Navarro"},{"first_name":"Eva","last_name":"Rotenberg","full_name":"Rotenberg, Eva"},{"full_name":"Herman, Grzegorz","last_name":"Herman","first_name":"Grzegorz"}],"publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"477","series_title":"LIPIcs","_id":"33491","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}]},{"user_id":"20801","series_title":"CIE Working Paper Series","department":[{"_id":"205"},{"_id":"475"},{"_id":"200"}],"project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901: SFB 901","_id":"1"}],"_id":"32106","language":[{"iso":"eng"}],"keyword":["Asymmetric bargaining power","Nash bargaining solution","Kalai-Smorodinsky bargaining solution"],"type":"working_paper","status":"public","abstract":[{"lang":"eng","text":"We study the consequences of modeling asymmetric bargaining power in two-person bargaining problems. Comparing application of an asymmetric version of a bargaining solution to an upfront modification of the disagreement point, the resulting distortion crucially depends on the bargaining solution concept. While for the Kalai-Smorodinsky solution weaker players benefit from modifying the disagreement point, the situation is reversed for the Nash bargaining solution. There, weaker players are better off in the asymmetric bargaining solution. When comparing application of the asymmetric versions of the Nash and the Kalai-Smorodinsky solutions, we demonstrate that there is an upper bound for the weight of a player, so that she is better off with the Nash bargaining solution. This threshold is ultimately determined by the relative utilitarian bargaining solution. From a mechanism design perspective, our results provide valuable information for a social planner, when implementing a bargaining solution for unequally powerful players."}],"author":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"first_name":"Thomas","last_name":"Streck","id":"33041","full_name":"Streck, Thomas"}],"date_created":"2022-06-22T12:12:58Z","volume":148,"date_updated":"2022-11-19T15:42:15Z","title":"Distortion through modeling asymmetric bargaining power","citation":{"apa":"Haake, C.-J., &#38; Streck, T. (2022). <i>Distortion through modeling asymmetric bargaining power</i> (Vol. 148).","short":"C.-J. Haake, T. Streck, Distortion through Modeling Asymmetric Bargaining Power, 2022.","mla":"Haake, Claus-Jochen, and Thomas Streck. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. 2022.","bibtex":"@book{Haake_Streck_2022, series={CIE Working Paper Series}, title={Distortion through modeling asymmetric bargaining power}, volume={148}, author={Haake, Claus-Jochen and Streck, Thomas}, year={2022}, collection={CIE Working Paper Series} }","ieee":"C.-J. Haake and T. Streck, <i>Distortion through modeling asymmetric bargaining power</i>, vol. 148. 2022.","chicago":"Haake, Claus-Jochen, and Thomas Streck. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. Vol. 148. CIE Working Paper Series, 2022.","ama":"Haake C-J, Streck T. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. Vol 148.; 2022."},"jel":["C78","D63"],"intvolume":"       148","page":"17","year":"2022"},{"keyword":["Open Science","Knowledge Equity","Qualitative Methods"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:p>How can Knowledge In/Equity be addressed in qualitative research by taking the idea of Open Science into account? Two projects from the Open Science Fellows Programme by Wikimedia Deutschland will be used to illustrate how Open Science practices can succeed in qualitative research, thereby reducing In/Equity. In this context, In/Equity is considered as a fair and equal representation of people, their knowledge and insights and comprehends questions about how epistemic, structural, institutional and personal biases generate and shape knowledge as guidance. Three questions guide this approach: firstly, what do we understand by In/Equity in the context of knowledge production in these projects? Secondly, who will be involved in knowledge generation and to what extent will they be valued or unvalued? Thirdly, how can data be made accessible for re-use to enable true participation and sharing?</jats:p>"}],"publication":"Research Ideas and Outcomes","title":"Knowledge Equity and Open Science in qualitative research – Practical research considerations","publisher":"Pensoft Publishers","date_created":"2022-11-22T15:55:11Z","year":"2022","quality_controlled":"1","article_type":"original","_id":"34132","department":[{"_id":"477"}],"user_id":"90339","status":"public","type":"journal_article","doi":"10.3897/rio.8.e86387","main_file_link":[{"open_access":"1"}],"oa":"1","date_updated":"2022-11-22T16:05:00Z","volume":8,"author":[{"full_name":"Steinhardt, Isabel","last_name":"Steinhardt","first_name":"Isabel"},{"last_name":"Kruschick","full_name":"Kruschick, Felicitas","first_name":"Felicitas"}],"intvolume":"         8","citation":{"ama":"Steinhardt I, Kruschick F. Knowledge Equity and Open Science in qualitative research – Practical research considerations. <i>Research Ideas and Outcomes</i>. 2022;8. doi:<a href=\"https://doi.org/10.3897/rio.8.e86387\">10.3897/rio.8.e86387</a>","ieee":"I. Steinhardt and F. Kruschick, “Knowledge Equity and Open Science in qualitative research – Practical research considerations,” <i>Research Ideas and Outcomes</i>, vol. 8, 2022, doi: <a href=\"https://doi.org/10.3897/rio.8.e86387\">10.3897/rio.8.e86387</a>.","chicago":"Steinhardt, Isabel, and Felicitas Kruschick. “Knowledge Equity and Open Science in Qualitative Research – Practical Research Considerations.” <i>Research Ideas and Outcomes</i> 8 (2022). <a href=\"https://doi.org/10.3897/rio.8.e86387\">https://doi.org/10.3897/rio.8.e86387</a>.","short":"I. Steinhardt, F. Kruschick, Research Ideas and Outcomes 8 (2022).","mla":"Steinhardt, Isabel, and Felicitas Kruschick. “Knowledge Equity and Open Science in Qualitative Research – Practical Research Considerations.” <i>Research Ideas and Outcomes</i>, vol. 8, Pensoft Publishers, 2022, doi:<a href=\"https://doi.org/10.3897/rio.8.e86387\">10.3897/rio.8.e86387</a>.","bibtex":"@article{Steinhardt_Kruschick_2022, title={Knowledge Equity and Open Science in qualitative research – Practical research considerations}, volume={8}, DOI={<a href=\"https://doi.org/10.3897/rio.8.e86387\">10.3897/rio.8.e86387</a>}, journal={Research Ideas and Outcomes}, publisher={Pensoft Publishers}, author={Steinhardt, Isabel and Kruschick, Felicitas}, year={2022} }","apa":"Steinhardt, I., &#38; Kruschick, F. (2022). Knowledge Equity and Open Science in qualitative research – Practical research considerations. <i>Research Ideas and Outcomes</i>, <i>8</i>. <a href=\"https://doi.org/10.3897/rio.8.e86387\">https://doi.org/10.3897/rio.8.e86387</a>"},"publication_identifier":{"issn":["2367-7163"]},"publication_status":"published"}]