[{"external_id":{"arxiv":["2201.11343"]},"_id":"30790","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"75"}],"user_id":"477","language":[{"iso":"eng"}],"publication":"arXiv:2201.11343","type":"preprint","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","date_updated":"2022-11-18T09:33:01Z","date_created":"2022-04-06T06:53:38Z","author":[{"first_name":"Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","id":"52265"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","first_name":"Arunselvan"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"title":"Distributed gradient-based optimization in the presence of dependent  aperiodic communication","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.” <i>ArXiv:2201.11343</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (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>.","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."}},{"date_created":"2022-11-17T16:37:52Z","author":[{"full_name":"Hagengruber, Ruth Edith","id":"198","last_name":"Hagengruber","orcid":"https://orcid.org/0000-0003-3360-6335","first_name":"Ruth Edith"}],"date_updated":"2022-11-17T18:50:00Z","publisher":"Classiques Garnier","title":"Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens","citation":{"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.","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.","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.","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.","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.","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."},"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"},{"doi":"10.1109/ipdpsw55747.2022.00029","conference":{"end_date":"2022-06-03","location":" Lyon, France","name":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","start_date":"2022-05-30"},"title":"ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support","author":[{"id":"74287","full_name":"Clausing, Lennart","orcid":"0000-0003-3789-6034","last_name":"Clausing","first_name":"Lennart"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2022-08-16T09:58:34Z","publisher":"IEEE","date_updated":"2022-11-18T09:36:00Z","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>","short":"L. Clausing, M. Platzner, in: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–127.","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} }","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>."},"page":"120-127","year":"2022","publication_status":"published","publication_identifier":{"eisbn":["978-1-6654-9747-3"]},"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"}],"_id":"32855","status":"public","type":"conference","publication":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)"},{"language":[{"iso":"eng"}],"department":[{"_id":"75"}],"user_id":"477","_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"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"status":"public","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"}],"publication":"arXiv:2201.00570","type":"preprint","title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","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"},{"orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","id":"66937","first_name":"Arunselvan"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_updated":"2022-11-18T09:33:42Z","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>.","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} }","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (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."},"year":"2022"},{"language":[{"iso":"eng"}],"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"}],"_id":"32590","user_id":"477","department":[{"_id":"77"}],"status":"public","type":"conference","publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","doi":"10.1109/ICST53961.2022.00027","date_updated":"2022-11-18T09:45:40Z","date_created":"2022-08-08T07:40:04Z","author":[{"first_name":"Cedric","full_name":"Richter, Cedric","id":"50003","last_name":"Richter"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"year":"2022","citation":{"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>","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>.","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","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} }","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>."},"page":"162-173"},{"department":[{"_id":"77"}],"user_id":"477","_id":"32591","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"}],"language":[{"iso":"eng"}],"publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","type":"conference","status":"public","date_created":"2022-08-08T07:42:19Z","author":[{"first_name":"Cedric","last_name":"Richter","id":"50003","full_name":"Richter, Cedric"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_updated":"2022-11-18T09:45:05Z","doi":"10.1145/3524842.3528505","title":"TSSB-3M: Mining single statement bugs at massive scale","page":"418-422","citation":{"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>.","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>.","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>","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>","short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","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>.","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} }"},"year":"2022"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"64"},{"_id":"7"}],"user_id":"477","_id":"32398","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"}],"language":[{"iso":"eng"}],"citation":{"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.","apa":"Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.","ama":"Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.; 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."},"year":"2022","author":[{"first_name":"Hanna","last_name":"Siek","full_name":"Siek, Hanna"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2022-07-20T09:36:39Z","date_updated":"2022-11-18T09:38:04Z","title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes"},{"citation":{"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.","apa":"Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.","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","author":[{"id":"64594","full_name":"Kramer, Paul","last_name":"Kramer","first_name":"Paul"}],"date_created":"2022-05-28T08:07:40Z","date_updated":"2022-11-18T09:40:28Z","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","type":"mastersthesis","status":"public","department":[{"_id":"7"},{"_id":"64"}],"user_id":"477","_id":"31485","project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901: SFB 901"}],"extern":"1","language":[{"iso":"eng"}]},{"date_updated":"2022-11-18T10:11:38Z","author":[{"last_name":"Dreßler","full_name":"Dreßler, Kevin","id":"78256","first_name":"Kevin"},{"full_name":"Sherif, Mohamed","id":"67234","last_name":"Sherif","first_name":"Mohamed"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_created":"2022-06-08T08:47:33Z","title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning","conference":{"start_date":"2022-06-28","name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media","location":"Barcelona (Spain)","end_date":"2022-07-01"},"doi":"10.1145/3511095.3531287","year":"2022","citation":{"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>","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} }","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.","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>.","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>"},"_id":"31806","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"34"}],"user_id":"477","keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","type":"conference","abstract":[{"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","lang":"eng"}],"status":"public"},{"conference":{"name":"IFAC Conference on Networked Systems"},"volume":55,"author":[{"first_name":"Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian"},{"full_name":"Ramaswamy, Arunselvan","id":"66937","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","first_name":"Arunselvan"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_updated":"2022-11-18T10:05:14Z","intvolume":"        55","page":"133–138","citation":{"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.","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.","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.","short":"A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 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.","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} }","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."},"has_accepted_license":"1","file_date_updated":"2022-08-31T07:06:30Z","department":[{"_id":"75"}],"user_id":"477","_id":"32854","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"}],"status":"public","type":"journal_article","title":"Practical Network Conditions for the Convergence of Distributed Optimization","date_created":"2022-08-16T09:12:55Z","publisher":"Elsevier","year":"2022","issue":"13","language":[{"iso":"eng"}],"ddc":["006"],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file":[{"creator":"aredder","date_created":"2022-08-31T07:06:30Z","date_updated":"2022-08-31T07:06:30Z","file_name":"NecSys2022____Practical_Conditions_for_Conv.pdf","access_level":"closed","file_id":"33236","file_size":298395,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"IFAC-PapersOnLine"},{"publisher":"Association for Computing Machinery (ACM)","date_updated":"2022-11-18T10:13:22Z","author":[{"first_name":"Tim","last_name":"Hansmeier","orcid":"0000-0003-1377-3339","full_name":"Hansmeier, Tim","id":"49992"},{"first_name":"Mathis","full_name":"Brede, Mathis","last_name":"Brede"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_created":"2022-09-02T11:47:17Z","title":"XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion","doi":"10.1145/3520304.3533977","conference":{"start_date":"2022-07-09","name":"International Workshop on Learning Classifier Systems (IWLCS 2022)","location":"Boston, MA, USA","end_date":"2022-07-13"},"publication_status":"published","year":"2022","place":"New York, NY, United States","citation":{"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>","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.","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>.","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>","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>.","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>."},"page":"2071-2079","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"33253","user_id":"477","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"type":"conference","publication":"GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion","status":"public"},{"department":[{"_id":"600"}],"user_id":"477","_id":"33274","project":[{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)","type":"conference","status":"public","author":[{"last_name":"Chen","id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan"},{"first_name":"Mei-Hua","last_name":"Chen","full_name":"Chen, Mei-Hua"},{"first_name":"Garima","last_name":"Mudgal","full_name":"Mudgal, Garima"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"}],"date_created":"2022-09-06T13:51:23Z","date_updated":"2022-11-18T09:56:17Z","title":"Analyzing Culture-Specific Argument Structures in Learner Essays","page":"51 - 61","citation":{"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.","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.","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} }","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."},"year":"2022"},{"language":[{"iso":"eng"}],"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"}],"_id":"33491","series_title":"LIPIcs","user_id":"477","department":[{"_id":"63"}],"editor":[{"first_name":"Shiri","last_name":"Chechik","full_name":"Chechik, Shiri"},{"last_name":"Navarro","full_name":"Navarro, Gonzalo","first_name":"Gonzalo"},{"first_name":"Eva","full_name":"Rotenberg, Eva","last_name":"Rotenberg"},{"first_name":"Grzegorz","full_name":"Herman, Grzegorz","last_name":"Herman"}],"status":"public","type":"conference","publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","doi":"10.4230/LIPIcs.ESA.2022.77","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-11-18T10:14:14Z","author":[{"first_name":"Marten","full_name":"Maack, Marten","id":"88252","last_name":"Maack"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"},{"first_name":"Anna Rodriguez","full_name":"Rasmussen, Anna Rodriguez","last_name":"Rasmussen"}],"date_created":"2022-09-27T13:06:05Z","volume":244,"year":"2022","citation":{"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.","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>.","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>","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>.","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>"},"intvolume":"       244","page":"77:1–77:13"},{"language":[{"iso":"eng"}],"keyword":["Asymmetric bargaining power","Nash bargaining solution","Kalai-Smorodinsky bargaining solution"],"department":[{"_id":"205"},{"_id":"475"},{"_id":"200"}],"series_title":"CIE Working Paper Series","user_id":"20801","_id":"32106","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"}],"status":"public","abstract":[{"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.","lang":"eng"}],"type":"working_paper","title":"Distortion through modeling asymmetric bargaining power","volume":148,"date_created":"2022-06-22T12:12:58Z","author":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"},{"id":"33041","full_name":"Streck, Thomas","last_name":"Streck","first_name":"Thomas"}],"date_updated":"2022-11-19T15:42:15Z","page":"17","intvolume":"       148","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} }","chicago":"Haake, Claus-Jochen, and Thomas Streck. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. Vol. 148. CIE Working Paper Series, 2022.","ieee":"C.-J. Haake and T. Streck, <i>Distortion through modeling asymmetric bargaining power</i>, vol. 148. 2022.","ama":"Haake C-J, Streck T. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. Vol 148.; 2022."},"jel":["C78","D63"],"year":"2022"},{"type":"journal_article","status":"public","user_id":"90339","department":[{"_id":"477"}],"_id":"34132","article_type":"original","publication_status":"published","publication_identifier":{"issn":["2367-7163"]},"citation":{"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>.","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>.","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>","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} }","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>.","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>"},"intvolume":"         8","author":[{"first_name":"Isabel","last_name":"Steinhardt","full_name":"Steinhardt, Isabel"},{"first_name":"Felicitas","last_name":"Kruschick","full_name":"Kruschick, Felicitas"}],"volume":8,"oa":"1","date_updated":"2022-11-22T16:05:00Z","main_file_link":[{"open_access":"1"}],"doi":"10.3897/rio.8.e86387","publication":"Research Ideas and Outcomes","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>"}],"language":[{"iso":"eng"}],"keyword":["Open Science","Knowledge Equity","Qualitative Methods"],"quality_controlled":"1","year":"2022","date_created":"2022-11-22T15:55:11Z","publisher":"Pensoft Publishers","title":"Knowledge Equity and Open Science in qualitative research – Practical research considerations"},{"year":"2022","place":"Miltenberg, Germany","citation":{"short":"J. Maalouly, D. Hemker, C. Hedayat, C. Rückert, I. Kaufmann, M. Olbrich, S. Lange, H. Mathis, in: 2022 Kleinheubach Conference, IEEE, Miltenberg, Germany, 2022.","mla":"Maalouly, Jad, et al. “AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development.” <i>2022 Kleinheubach Conference</i>, IEEE, 2022.","bibtex":"@inproceedings{Maalouly_Hemker_Hedayat_Rückert_Kaufmann_Olbrich_Lange_Mathis_2022, place={Miltenberg, Germany}, title={AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development}, booktitle={2022 Kleinheubach Conference}, publisher={IEEE}, author={Maalouly, Jad and Hemker, Dennis and Hedayat, Christian and Rückert, Christian and Kaufmann, Ivan and Olbrich, Marcel and Lange, Sven and Mathis, Harald}, year={2022} }","apa":"Maalouly, J., Hemker, D., Hedayat, C., Rückert, C., Kaufmann, I., Olbrich, M., Lange, S., &#38; Mathis, H. (2022). AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development. <i>2022 Kleinheubach Conference</i>. 2022 Kleinheubach Conference, Miltenberg, Germany.","ama":"Maalouly J, Hemker D, Hedayat C, et al. AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development. In: <i>2022 Kleinheubach Conference</i>. IEEE; 2022.","ieee":"J. Maalouly <i>et al.</i>, “AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development,” presented at the 2022 Kleinheubach Conference, Miltenberg, Germany, 2022.","chicago":"Maalouly, Jad, Dennis Hemker, Christian Hedayat, Christian Rückert, Ivan Kaufmann, Marcel Olbrich, Sven Lange, and Harald Mathis. “AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development.” In <i>2022 Kleinheubach Conference</i>. Miltenberg, Germany: IEEE, 2022."},"publication_status":"published","publication_identifier":{"eisbn":["978-3-948571-07-8"]},"title":"AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9954484"}],"conference":{"start_date":"2022-09-27","name":"2022 Kleinheubach Conference","location":"Miltenberg, Germany","end_date":"2022-09-29"},"publisher":"IEEE","date_updated":"2022-11-24T14:21:34Z","date_created":"2022-11-24T14:21:17Z","author":[{"first_name":"Jad","last_name":"Maalouly","full_name":"Maalouly, Jad"},{"first_name":"Dennis","last_name":"Hemker","full_name":"Hemker, Dennis"},{"first_name":"Christian","last_name":"Hedayat","full_name":"Hedayat, Christian"},{"last_name":"Rückert","full_name":"Rückert, Christian","first_name":"Christian"},{"last_name":"Kaufmann","full_name":"Kaufmann, Ivan","first_name":"Ivan"},{"last_name":"Olbrich","full_name":"Olbrich, Marcel","first_name":"Marcel"},{"first_name":"Sven","last_name":"Lange","full_name":"Lange, Sven","id":"38240"},{"first_name":"Harald","last_name":"Mathis","full_name":"Mathis, Harald"}],"abstract":[{"text":"In this paper, machine learning techniques will be used to classify different PCB layouts given their electromagnetic frequency spectra. These spectra result from a simulated near-field measurement of electric field strengths at different locations. Measured values consist of real and imaginary parts (amplitude and phase) in X, Y and Z directions. Training data was obtained in the time domain by varying transmission line geometries (size, distance and signaling). It was then transformed into the frequency domain and used as deep neural network input. Principal component analysis was applied to reduce the sample dimension. The results show that classifying different designs is possible with high accuracy based on synthetic data. Future work comprises measurements of real, custom-made PCB with varying parameters to adapt the simulation model and also test the neural network. Finally, the trained model could be used to give hints about the error’s cause when overshooting EMC limits.","lang":"eng"}],"status":"public","type":"conference","publication":"2022 Kleinheubach Conference","keyword":["emc","pcb","electronic system development","machine learning","neural network"],"language":[{"iso":"eng"}],"project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"34140","user_id":"38240","department":[{"_id":"59"},{"_id":"485"}]},{"title":"Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt","date_updated":"2022-11-25T20:32:46Z","date_created":"2022-11-17T15:57:16Z","author":[{"last_name":"Hagengruber","orcid":"https://orcid.org/0000-0003-3360-6335","full_name":"Hagengruber, Ruth Edith","id":"198","first_name":"Ruth Edith"}],"place":"Berlin","year":"2022","citation":{"ama":"Hagengruber RE. Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt. In: Banse G, Fuchs-Kittowski K, eds. <i>Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“</i>. ; 2022:253–256.","ieee":"R. E. Hagengruber, “Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt,” in <i>Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“</i>, G. Banse and K. Fuchs-Kittowski, Eds. Berlin, 2022, pp. 253–256.","chicago":"Hagengruber, Ruth Edith. “Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt.” In <i>Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“</i>, edited by Gerhard Banse and Klaus Fuchs-Kittowski, 253–256. Berlin, 2022.","apa":"Hagengruber, R. E. (2022). Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt. In G. Banse &#38; K. Fuchs-Kittowski (Eds.), <i>Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“</i> (pp. 253–256).","short":"R.E. Hagengruber, in: G. Banse, K. Fuchs-Kittowski (Eds.), Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“, Berlin, 2022, pp. 253–256.","bibtex":"@inbook{Hagengruber_2022, place={Berlin}, title={Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt}, booktitle={Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“}, author={Hagengruber, Ruth Edith}, editor={Banse, Gerhard and Fuchs-Kittowski, Klaus}, year={2022}, pages={253–256} }","mla":"Hagengruber, Ruth Edith. “Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt.” <i>Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“</i>, edited by Gerhard Banse and Klaus Fuchs-Kittowski, 2022, pp. 253–256."},"page":"253–256","language":[{"iso":"ger"}],"_id":"34108","user_id":"49063","department":[{"_id":"519"}],"editor":[{"full_name":"Banse, Gerhard","last_name":"Banse","first_name":"Gerhard"},{"first_name":"Klaus","full_name":"Fuchs-Kittowski, Klaus","last_name":"Fuchs-Kittowski"}],"status":"public","type":"book_chapter","publication":"Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“"},{"publication":"HCI International 2022 Posters","abstract":[{"lang":"eng","text":"This work addresses the automatic resolution of software requirements. In the vision of On-The-Fly Computing, software services should be composed on demand, based solely on natural language input from human users. To enable this, we build a chatbot solution that works with human-in-the-loop support to receive, analyze, correct, and complete their software requirements. The chatbot is equipped with a natural language processing pipeline and a large knowledge base, as well as sophisticated dialogue management skills to enhance the user experience. Previous solutions have focused on analyzing software requirements to point out errors such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate with users to efficiently produce correct requirements. We developed and compared three different chatbot apps that can work with built-in knowledge. We rely on ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own knowledge base, Rasa is the best system to combine the text mining and knowledge solutions at our disposal. The evaluation shows that users accept 73% of the suggested answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"34150","file_name":"Kersting et al. (2022), Kersting2022.pdf","access_level":"closed","file_size":1153017,"creator":"jkers","date_created":"2022-11-28T13:21:32Z","date_updated":"2022-11-28T13:21:32Z"}],"ddc":["004"],"keyword":["On-The-Fly Computing","Chatbot","Knowledge Base"],"language":[{"iso":"eng"}],"year":"2022","publisher":"Springer International Publishing","date_created":"2022-06-27T09:27:06Z","title":"Chatbot-Enhanced Requirements Resolution for Automated Service Compositions","type":"book_chapter","editor":[{"full_name":"Stephanidis, Constantine","last_name":"Stephanidis","first_name":"Constantine"},{"last_name":"Antona","full_name":"Antona, Margherita","first_name":"Margherita"},{"full_name":"Ntoa, Stavroula","last_name":"Ntoa","first_name":"Stavroula"}],"status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}],"_id":"32179","series_title":"Communications in Computer and Information Science (CCIS)","user_id":"58701","department":[{"_id":"579"}],"file_date_updated":"2022-11-28T13:21:32Z","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["1865-0929","1865-0937"],"isbn":["9783031064166","9783031064173"]},"related_material":{"link":[{"relation":"confirmation","url":"https://link.springer.com/chapter/10.1007/978-3-031-06417-3_56"}]},"place":"Cham, Switzerland","citation":{"chicago":"Kersting, Joschka, Mobeen Ahmed, and Michaela Geierhos. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” In <i>HCI International 2022 Posters</i>, edited by Constantine Stephanidis, Margherita Antona, and Stavroula Ntoa, 1580:419--426. Communications in Computer and Information Science (CCIS). Cham, Switzerland: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">https://doi.org/10.1007/978-3-031-06417-3_56</a>.","ieee":"J. Kersting, M. Ahmed, and M. Geierhos, “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions,” in <i>HCI International 2022 Posters</i>, vol. 1580, C. Stephanidis, M. Antona, and S. Ntoa, Eds. Cham, Switzerland: Springer International Publishing, 2022, pp. 419--426.","ama":"Kersting J, Ahmed M, Geierhos M. Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In: Stephanidis C, Antona M, Ntoa S, eds. <i>HCI International 2022 Posters</i>. Vol 1580. Communications in Computer and Information Science (CCIS). Springer International Publishing; 2022:419--426. doi:<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>","apa":"Kersting, J., Ahmed, M., &#38; Geierhos, M. (2022). Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In C. Stephanidis, M. Antona, &#38; S. Ntoa (Eds.), <i>HCI International 2022 Posters</i> (Vol. 1580, pp. 419--426). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">https://doi.org/10.1007/978-3-031-06417-3_56</a>","short":"J. Kersting, M. Ahmed, M. Geierhos, in: C. Stephanidis, M. Antona, S. Ntoa (Eds.), HCI International 2022 Posters, Springer International Publishing, Cham, Switzerland, 2022, pp. 419--426.","mla":"Kersting, Joschka, et al. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” <i>HCI International 2022 Posters</i>, edited by Constantine Stephanidis et al., vol. 1580, Springer International Publishing, 2022, pp. 419--426, doi:<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>.","bibtex":"@inbook{Kersting_Ahmed_Geierhos_2022, place={Cham, Switzerland}, series={Communications in Computer and Information Science (CCIS)}, title={Chatbot-Enhanced Requirements Resolution for Automated Service Compositions}, volume={1580}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>}, booktitle={HCI International 2022 Posters}, publisher={Springer International Publishing}, author={Kersting, Joschka and Ahmed, Mobeen and Geierhos, Michaela}, editor={Stephanidis, Constantine and Antona, Margherita and Ntoa, Stavroula}, year={2022}, pages={419--426}, collection={Communications in Computer and Information Science (CCIS)} }"},"page":"419--426","intvolume":"      1580","date_updated":"2022-11-28T13:22:16Z","author":[{"id":"58701","full_name":"Kersting, Joschka","last_name":"Kersting","first_name":"Joschka"},{"full_name":"Ahmed, Mobeen","last_name":"Ahmed","first_name":"Mobeen"},{"first_name":"Michaela","full_name":"Geierhos, Michaela","id":"42496","last_name":"Geierhos","orcid":"0000-0002-8180-5606"}],"volume":1580,"conference":{"location":"Virtual","end_date":"2022-07-01","start_date":"2022-06-26","name":"24th International Conference on Human-Computer Interaction (HCII 2022)"},"doi":"10.1007/978-3-031-06417-3_56"},{"author":[{"first_name":"Mortaza","last_name":"Otroshi","orcid":"0000-0002-8652-9209","id":"71269","full_name":"Otroshi, Mortaza"},{"id":"32056","full_name":"Meschut, Gerson","orcid":"0000-0002-2763-1246","last_name":"Meschut","first_name":"Gerson"}],"date_created":"2022-11-28T14:27:50Z","date_updated":"2022-11-28T14:32:07Z","publisher":"Europäische Forschungsgesellschaft für Blechverarbeitung e.V. ","conference":{"start_date":"2022-11-23","name":"12. Kolloquium Gemeinsame Forschung zur Mechanischen Fügetechnik","location":"Rostock","end_date":"2022-11-24"},"title":"Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung","publication_status":"published","citation":{"ieee":"M. Otroshi and G. Meschut, “Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung,” presented at the 12. Kolloquium Gemeinsame Forschung zur Mechanischen Fügetechnik, Rostock, 2022.","chicago":"Otroshi, Mortaza, and Gerson Meschut. “Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung.” Europäische Forschungsgesellschaft für Blechverarbeitung e.V. , 2022.","ama":"Otroshi M, Meschut G. Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung. In: Europäische Forschungsgesellschaft für Blechverarbeitung e.V. ; 2022.","bibtex":"@inproceedings{Otroshi_Meschut_2022, title={Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung}, publisher={Europäische Forschungsgesellschaft für Blechverarbeitung e.V. }, author={Otroshi, Mortaza and Meschut, Gerson}, year={2022} }","mla":"Otroshi, Mortaza, and Gerson Meschut. <i>Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung</i>. Europäische Forschungsgesellschaft für Blechverarbeitung e.V. , 2022.","short":"M. Otroshi, G. Meschut, in: Europäische Forschungsgesellschaft für Blechverarbeitung e.V. , 2022.","apa":"Otroshi, M., &#38; Meschut, G. (2022). <i>Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung</i>. 12. Kolloquium Gemeinsame Forschung zur Mechanischen Fügetechnik, Rostock."},"year":"2022","department":[{"_id":"157"}],"user_id":"71269","_id":"34152","language":[{"iso":"ger"}],"type":"conference","status":"public"},{"citation":{"apa":"Krauter, S., &#38; Bendfeld, J. (2022). Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types. <i>Proceedings of the 8th World Conference on Photovoltaik Energy Conversion</i>. 8th World Conference on Photovoltaik Energy Conversion, Milano / Italy.","bibtex":"@inproceedings{Krauter_Bendfeld_2022, title={Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types}, booktitle={Proceedings of the 8th World Conference on Photovoltaik Energy Conversion}, author={Krauter, Stefan and Bendfeld, Jörg}, year={2022} }","short":"S. Krauter, J. Bendfeld, in: Proceedings of the 8th World Conference on Photovoltaik Energy Conversion, 2022.","mla":"Krauter, Stefan, and Jörg Bendfeld. “Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for Any PV Panel Size at Different Microinverter Types.” <i>Proceedings of the 8th World Conference on Photovoltaik Energy Conversion</i>, 2022.","ama":"Krauter S, Bendfeld J. Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types. In: <i>Proceedings of the 8th World Conference on Photovoltaik Energy Conversion</i>. ; 2022.","ieee":"S. Krauter and J. Bendfeld, “Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types,” presented at the 8th World Conference on Photovoltaik Energy Conversion, Milano / Italy, 2022.","chicago":"Krauter, Stefan, and Jörg Bendfeld. “Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for Any PV Panel Size at Different Microinverter Types.” In <i>Proceedings of the 8th World Conference on Photovoltaik Energy Conversion</i>, 2022."},"year":"2022","date_created":"2022-11-29T09:55:14Z","author":[{"first_name":"Stefan","full_name":"Krauter, Stefan","id":"28836","last_name":"Krauter","orcid":"0000-0002-3594-260X"},{"last_name":"Bendfeld","full_name":"Bendfeld, Jörg","id":"16148","first_name":"Jörg"}],"date_updated":"2022-11-29T10:00:44Z","conference":{"location":"Milano / Italy","end_date":"2022-09-30","start_date":"2022-09-26","name":"8th World Conference on Photovoltaik Energy Conversion"},"title":"Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types","type":"conference","publication":"Proceedings of the 8th World Conference on Photovoltaik Energy Conversion","status":"public","user_id":"16148","department":[{"_id":"53"}],"_id":"34155","language":[{"iso":"eng"}]}]