[{"publication_status":"accepted","status":"public","date_created":"2022-11-15T08:29:26Z","author":[{"full_name":"Stahl, Maja","first_name":"Maja","id":"77647","last_name":"Stahl"},{"last_name":"Spliethöver","id":"84035","first_name":"Maximilian","full_name":"Spliethöver, Maximilian","orcid":"0000-0003-4364-1409"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","id":"3900"}],"quality_controlled":"1","publication":"Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science","title":"To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation","user_id":"77647","extern":"1","place":"Abu Dhabi, United Arab Emirates","abstract":[{"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.","lang":"eng"}],"type":"conference","citation":{"apa":"Stahl, M., Spliethöver, M., & Wachsmuth, H. (n.d.). To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation. Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science. 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: Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science.","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 Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science. Abu Dhabi, United Arab Emirates, n.d.","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} }","mla":"Stahl, Maja, et al. “To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation.” Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science.","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.","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."},"year":"2022","language":[{"iso":"eng"}],"_id":"34082","date_updated":"2022-11-18T08:22:56Z","conference":{"location":"Abu Dhabi, United Arab Emirates","name":"Fifth Workshop on NLP and Computational Social Science (NLP+CSS) At EMNLP 2022"}},{"year":"2022","citation":{"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.” ArXiv:2201.11343, 2022.","ama":"Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the presence of dependent aperiodic communication. arXiv:220111343. Published online 2022.","apa":"Redder, A., Ramaswamy, A., & Karl, H. (2022). Distributed gradient-based optimization in the presence of dependent aperiodic communication. In arXiv:2201.11343.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based Optimization in the Presence of Dependent Aperiodic Communication.” ArXiv:2201.11343, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization in the presence of dependent aperiodic communication,” arXiv:2201.11343. 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022)."},"type":"preprint","language":[{"iso":"eng"}],"date_updated":"2022-11-18T09:33:01Z","_id":"30790","publication":"arXiv:2201.11343","department":[{"_id":"75"}],"author":[{"first_name":"Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","last_name":"Redder","id":"52265"},{"full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan","id":"66937","last_name":"Ramaswamy"},{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2022-04-06T06:53:38Z","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"status":"public","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"}],"external_id":{"arxiv":["2201.11343"]},"title":"Distributed gradient-based optimization in the presence of dependent aperiodic communication","user_id":"477"},{"date_updated":"2022-11-17T18:50:00Z","_id":"34109","page":"99 – 115","year":"2022","type":"journal_article","citation":{"apa":"Hagengruber, R. E. (2022). Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens. La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris, 99 – 115.","ama":"Hagengruber RE. Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens. La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine Moreau, PF & Seguin, MS (Eds) Paris. Published online 2022:99 – 115.","chicago":"Hagengruber, Ruth Edith. “Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens.” La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris, 2022, 99 – 115.","mla":"Hagengruber, Ruth Edith. “Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens.” La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris, 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. & 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. & Seguin, M.S. (Eds.). Paris (2022) 99 – 115.","ieee":"R. E. Hagengruber, “Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens,” La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris, pp. 99 – 115, 2022."},"language":[{"iso":"fre"}],"title":"Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens","user_id":"49063","date_created":"2022-11-17T16:37:52Z","status":"public","publication":"La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris","department":[{"_id":"519"}],"author":[{"full_name":"Hagengruber, Ruth Edith","orcid":"https://orcid.org/0000-0003-3360-6335","first_name":"Ruth Edith","id":"198","last_name":"Hagengruber"}],"publisher":"Classiques Garnier"},{"publication_status":"published","publication_identifier":{"eisbn":["978-1-6654-9747-3"]},"status":"public","date_created":"2022-08-16T09:58:34Z","project":[{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"}],"publisher":"IEEE","author":[{"first_name":"Lennart","full_name":"Clausing, Lennart","orcid":"0000-0003-3789-6034","last_name":"Clausing","id":"74287"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner","id":"398"}],"publication":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","department":[{"_id":"78"}],"title":"ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support","user_id":"477","year":"2022","citation":{"short":"L. Clausing, M. Platzner, in: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–127.","ieee":"L. Clausing and M. Platzner, “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support,” in 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Lyon, France, 2022, pp. 120–127, doi: 10.1109/ipdpsw55747.2022.00029.","apa":"Clausing, L., & Platzner, M. (2022). ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 120–127. https://doi.org/10.1109/ipdpsw55747.2022.00029","ama":"Clausing L, Platzner M. ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. In: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE; 2022:120-127. doi:10.1109/ipdpsw55747.2022.00029","chicago":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” In 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 120–27. IEEE, 2022. https://doi.org/10.1109/ipdpsw55747.2022.00029.","mla":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–27, doi:10.1109/ipdpsw55747.2022.00029.","bibtex":"@inproceedings{Clausing_Platzner_2022, title={ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support}, DOI={10.1109/ipdpsw55747.2022.00029}, booktitle={2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, publisher={IEEE}, author={Clausing, Lennart and Platzner, Marco}, year={2022}, pages={120–127} }"},"type":"conference","page":"120-127","language":[{"iso":"eng"}],"doi":"10.1109/ipdpsw55747.2022.00029","date_updated":"2022-11-18T09:36:00Z","_id":"32855","conference":{"end_date":"2022-06-03","location":" Lyon, France","start_date":"2022-05-30","name":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)"}},{"language":[{"iso":"eng"}],"year":"2022","type":"preprint","citation":{"short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms,” arXiv:2201.00570. 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” ArXiv:2201.00570, 2022.","ama":"Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. arXiv:220100570. Published online 2022.","apa":"Redder, A., Ramaswamy, A., & Karl, H. (2022). Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. In arXiv:2201.00570.","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.” ArXiv:2201.00570, 2022."},"date_updated":"2022-11-18T09:33:42Z","_id":"30791","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"date_created":"2022-04-06T06:53:52Z","status":"public","department":[{"_id":"75"}],"publication":"arXiv:2201.00570","author":[{"id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","first_name":"Adrian"},{"first_name":"Arunselvan","full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","id":"66937"},{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"}],"user_id":"477","title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","external_id":{"arxiv":["2201.00570"]},"abstract":[{"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.","lang":"eng"}]},{"year":"2022","citation":{"chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–73, 2022. https://doi.org/10.1109/ICST53961.2022.00027.","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST). ; 2022:162-173. doi:10.1109/ICST53961.2022.00027","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","apa":"Richter, C., & Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–173. https://doi.org/10.1109/ICST53961.2022.00027","mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–73, doi:10.1109/ICST53961.2022.00027.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={10.1109/ICST53961.2022.00027}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }","ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173, doi: 10.1109/ICST53961.2022.00027."},"type":"conference","page":"162-173","language":[{"iso":"eng"}],"doi":"10.1109/ICST53961.2022.00027","date_updated":"2022-11-18T09:45:40Z","_id":"32590","status":"public","date_created":"2022-08-08T07:40:04Z","project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"author":[{"last_name":"Richter","id":"50003","first_name":"Cedric","full_name":"Richter, Cedric"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"department":[{"_id":"77"}],"publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","user_id":"477"},{"department":[{"_id":"77"}],"publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","author":[{"first_name":"Cedric","full_name":"Richter, Cedric","last_name":"Richter","id":"50003"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2022-08-08T07:42:19Z","project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"status":"public","user_id":"477","title":"TSSB-3M: Mining single statement bugs at massive scale","language":[{"iso":"eng"}],"page":"418-422","type":"conference","year":"2022","citation":{"short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422, doi: 10.1145/3524842.3528505.","apa":"Richter, C., & Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–422. https://doi.org/10.1145/3524842.3528505","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR). ; 2022:418-422. doi:10.1145/3524842.3528505","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–22, 2022. https://doi.org/10.1145/3524842.3528505.","mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–22, doi:10.1145/3524842.3528505.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={10.1145/3524842.3528505}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }"},"_id":"32591","date_updated":"2022-11-18T09:45:05Z","doi":"10.1145/3524842.3528505"},{"author":[{"full_name":"Siek, Hanna","first_name":"Hanna","last_name":"Siek"}],"department":[{"_id":"64"},{"_id":"7"}],"status":"public","date_created":"2022-07-20T09:36:39Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"}],"title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","user_id":"477","type":"bachelorsthesis","citation":{"chicago":"Siek, Hanna. Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","apa":"Siek, H. (2022). Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes.","ama":"Siek H. Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes.; 2022.","mla":"Siek, Hanna. Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes. 2022.","bibtex":"@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek, Hanna}, year={2022} }","short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","ieee":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes. 2022."},"year":"2022","supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"language":[{"iso":"eng"}],"_id":"32398","date_updated":"2022-11-18T09:38:04Z"},{"date_updated":"2022-11-18T09:40:28Z","_id":"31485","type":"mastersthesis","citation":{"chicago":"Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","apa":"Kramer, P. (2022). On Transforming Lattice-Based Cryptography to the Ring Setting.","ama":"Kramer P. On Transforming Lattice-Based Cryptography to the Ring Setting.; 2022.","mla":"Kramer, Paul. 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} }","short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","ieee":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting. 2022."},"year":"2022","language":[{"iso":"eng"}],"extern":"1","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","user_id":"477","author":[{"full_name":"Kramer, Paul","first_name":"Paul","id":"64594","last_name":"Kramer"}],"department":[{"_id":"7"},{"_id":"64"}],"status":"public","date_created":"2022-05-28T08:07:40Z","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"}]},{"doi":"10.1145/3511095.3531287","conference":{"end_date":"2022-07-01","location":"Barcelona (Spain)","start_date":"2022-06-28","name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media"},"_id":"31806","date_updated":"2022-11-18T10:11:38Z","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={10.1145/3511095.3531287}, 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} }","mla":"Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022, doi:10.1145/3511095.3531287.","chicago":"Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” In Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022. https://doi.org/10.1145/3511095.3531287.","ama":"Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. In: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia. ; 2022. doi:10.1145/3511095.3531287","apa":"Dreßler, K., Sherif, M., & Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia. HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain). https://doi.org/10.1145/3511095.3531287","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: 10.1145/3511095.3531287.","short":"K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022."},"type":"conference","year":"2022","user_id":"477","ddc":["000"],"title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning","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"}],"date_created":"2022-06-08T08:47:33Z","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"}],"status":"public","keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"department":[{"_id":"34"}],"publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","author":[{"first_name":"Kevin","full_name":"Dreßler, Kevin","last_name":"Dreßler","id":"78256"},{"full_name":"Sherif, Mohamed","first_name":"Mohamed","id":"67234","last_name":"Sherif"},{"id":"65716","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}]}]