[{"type":"conference","department":[{"_id":"9"},{"_id":"321"},{"_id":"149"}],"date_created":"2020-04-22T14:00:17Z","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"popular_science":"1","publication":"26. Sächsische Fachtagung Umformtechnik","citation":{"ama":"Camberg AA, Tröster T. Challenges in fracture modeling under non-isothermal forming conditions using the example of a new forming process for aluminum blanks. In: <i>26. Sächsische Fachtagung Umformtechnik</i>. ; 2019.","bibtex":"@inproceedings{Camberg_Tröster_2019, title={Challenges in fracture modeling under non-isothermal forming conditions using the example of a new forming process for aluminum blanks}, booktitle={26. Sächsische Fachtagung Umformtechnik}, author={Camberg, Alan Adam and Tröster, Thomas}, year={2019} }","mla":"Camberg, Alan Adam, and Thomas Tröster. “Challenges in Fracture Modeling under Non-Isothermal Forming Conditions Using the Example of a New Forming Process for Aluminum Blanks.” <i>26. Sächsische Fachtagung Umformtechnik</i>, 2019.","chicago":"Camberg, Alan Adam, and Thomas Tröster. “Challenges in Fracture Modeling under Non-Isothermal Forming Conditions Using the Example of a New Forming Process for Aluminum Blanks.” In <i>26. Sächsische Fachtagung Umformtechnik</i>, 2019.","short":"A.A. Camberg, T. Tröster, in: 26. Sächsische Fachtagung Umformtechnik, 2019.","apa":"Camberg, A. A., &#38; Tröster, T. (2019). Challenges in fracture modeling under non-isothermal forming conditions using the example of a new forming process for aluminum blanks. In <i>26. Sächsische Fachtagung Umformtechnik</i>. Dresden.","ieee":"A. A. Camberg and T. Tröster, “Challenges in fracture modeling under non-isothermal forming conditions using the example of a new forming process for aluminum blanks,” in <i>26. Sächsische Fachtagung Umformtechnik</i>, Dresden, 2019."},"user_id":"60544","language":[{"iso":"eng"}],"_id":"16827","date_updated":"2022-01-06T06:52:57Z","title":"Challenges in fracture modeling under non-isothermal forming conditions using the example of a new forming process for aluminum blanks","year":"2019","status":"public","author":[{"id":"60544","full_name":"Camberg, Alan Adam","last_name":"Camberg","first_name":"Alan Adam"},{"first_name":"Thomas","last_name":"Tröster","full_name":"Tröster, Thomas","id":"553"}],"conference":{"end_date":"2019-12-12","start_date":"2019-12-11","name":"26. Sächsische Fachtagung Umformtechnik","location":"Dresden"}},{"citation":{"apa":"Tinkloh, S. R., Wu, T., Tröster, T., &#38; Niendorf, T. (2019). A micromechanical based finite element simulation of process induced residual stresses in metal-CFRP-hybrid structures. Presented at the 22nd International Conference on Composite Structures (ICCS22) and 1st Chinese Conference on Composite Structures (CCCS1), Wuhan.","ieee":"S. R. Tinkloh, T. Wu, T. Tröster, and T. Niendorf, “A micromechanical based finite element simulation of process induced residual stresses in metal-CFRP-hybrid structures,” presented at the 22nd International Conference on Composite Structures (ICCS22) and 1st Chinese Conference on Composite Structures (CCCS1), Wuhan, 2019.","chicago":"Tinkloh, Steffen Rainer, Tao Wu, Thomas Tröster, and Thomas Niendorf. “A Micromechanical Based Finite Element Simulation of Process Induced Residual Stresses in Metal-CFRP-Hybrid Structures,” 2019.","short":"S.R. Tinkloh, T. Wu, T. Tröster, T. Niendorf, in: 2019.","mla":"Tinkloh, Steffen Rainer, et al. <i>A Micromechanical Based Finite Element Simulation of Process Induced Residual Stresses in Metal-CFRP-Hybrid Structures</i>. 2019.","ama":"Tinkloh SR, Wu T, Tröster T, Niendorf T. A micromechanical based finite element simulation of process induced residual stresses in metal-CFRP-hybrid structures. In: ; 2019.","bibtex":"@inproceedings{Tinkloh_Wu_Tröster_Niendorf_2019, title={A micromechanical based finite element simulation of process induced residual stresses in metal-CFRP-hybrid structures}, author={Tinkloh, Steffen Rainer and Wu, Tao and Tröster, Thomas and Niendorf, Thomas}, year={2019} }"},"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"date_created":"2020-04-23T08:17:54Z","department":[{"_id":"321"},{"_id":"9"},{"_id":"149"}],"type":"conference","author":[{"full_name":"Tinkloh, Steffen Rainer","last_name":"Tinkloh","first_name":"Steffen Rainer","id":"72722"},{"full_name":"Wu, Tao","last_name":"Wu","first_name":"Tao"},{"last_name":"Tröster","first_name":"Thomas","full_name":"Tröster, Thomas","id":"553"},{"full_name":"Niendorf, Thomas","last_name":"Niendorf","first_name":"Thomas"}],"conference":{"start_date":"2019-10-22","name":"22nd International Conference on Composite Structures (ICCS22) and 1st Chinese Conference on Composite Structures (CCCS1)","location":"Wuhan","end_date":"2019-10-25"},"title":"A micromechanical based finite element simulation of process induced residual stresses in metal-CFRP-hybrid structures","status":"public","year":"2019","date_updated":"2022-01-06T06:52:57Z","_id":"16831","language":[{"iso":"eng"}],"user_id":"72722"},{"_id":"16847","page":"7","volume":2380,"user_id":"84035","status":"public","place":"Lugano, Switzerland","oa":"1","citation":{"bibtex":"@book{Skitalinskaya_Klaff_Spliethöver_2019, place={Lugano, Switzerland}, series={CEUR Workshop Proceedings}, title={CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction}, volume={2380}, author={Skitalinskaya, Gabriella and Klaff, Jonas and Spliethöver, Maximilian}, year={2019}, collection={CEUR Workshop Proceedings} }","ama":"Skitalinskaya G, Klaff J, Spliethöver M. <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>. Vol 2380. Lugano, Switzerland; 2019.","mla":"Skitalinskaya, Gabriella, et al. <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>. Vol. 2380, 2019.","short":"G. Skitalinskaya, J. Klaff, M. Spliethöver, CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction, Lugano, Switzerland, 2019.","chicago":"Skitalinskaya, Gabriella, Jonas Klaff, and Maximilian Spliethöver. <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>. Vol. 2380. CEUR Workshop Proceedings. Lugano, Switzerland, 2019.","ieee":"G. Skitalinskaya, J. Klaff, and M. Spliethöver, <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>, vol. 2380. Lugano, Switzerland, 2019.","apa":"Skitalinskaya, G., Klaff, J., &#38; Spliethöver, M. (2019). <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i> (Vol. 2380). Lugano, Switzerland."},"report_number":"118","language":[{"iso":"eng"}],"series_title":"CEUR Workshop Proceedings","main_file_link":[{"url":"http://ceur-ws.org/Vol-2380/paper_118.pdf","open_access":"1"}],"author":[{"full_name":"Skitalinskaya, Gabriella","first_name":"Gabriella","last_name":"Skitalinskaya"},{"full_name":"Klaff, Jonas","last_name":"Klaff","first_name":"Jonas"},{"orcid":"0000-0003-4364-1409","last_name":"Spliethöver","first_name":"Maximilian","full_name":"Spliethöver, Maximilian","id":"84035"}],"title":"CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction","year":"2019","intvolume":"      2380","date_updated":"2022-01-06T06:52:57Z","date_created":"2020-04-23T15:18:40Z","type":"report","extern":"1","abstract":[{"text":"In this work we describe our results achieved in the ProtestNews Lab at CLEF 2019. To tackle the problems of event sentence detection and event extraction we decided to use contextualized string embeddings. The models were trained on a data corpus collected from Indian news sources, but evaluated on data obtained from news sources from other countries as well, such as China. Our models have obtained competitive results and have scored 3rd in the event sentence detection task and 1st in the event extraction task based on average F1-scores for different test datasets.","lang":"eng"}]},{"has_accepted_license":"1","status":"public","user_id":"49051","ddc":["006"],"_id":"16853","page":"2","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"bibtex":"@article{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner, title={Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}, journal={Fourth Workshop on Approximate Computing (AxC 2019)}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco} }","ama":"Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","short":"L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth Workshop on Approximate Computing (AxC 2019) (n.d.).","chicago":"Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann, and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>, n.d.","ieee":"L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits,” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>. .","mla":"Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","apa":"Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M. (n.d.). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>."},"file_date_updated":"2020-04-25T08:00:35Z","publication_status":"accepted","date_updated":"2022-01-06T06:52:57Z","author":[{"id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias","last_name":"Witschen"},{"id":"61186","first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan"},{"first_name":"Matthias","last_name":"Artmann","full_name":"Artmann, Matthias"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"}],"year":"2019","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing."}],"publication":"Fourth Workshop on Approximate Computing (AxC 2019)","department":[{"_id":"78"}],"keyword":["Approximate computing","parameter selection","search space exploration","verification","circuit synthesis"],"type":"preprint","date_created":"2020-04-25T08:02:07Z","file":[{"date_created":"2020-04-25T08:00:35Z","creator":"witschen","content_type":"application/pdf","success":1,"file_id":"16854","access_level":"closed","file_size":152806,"file_name":"AxC19_paper_3.pdf","date_updated":"2020-04-25T08:00:35Z","relation":"main_file"}]},{"date_created":"2020-04-28T07:04:27Z","department":[{"_id":"203"}],"type":"journal_article","citation":{"mla":"Atkins, Marc, et al. “New Dimensions of Service Offshoring in World Trade.” <i>Intereconomics</i>, vol. 54, no. 2, Springer, 2019, pp. 120–26.","ama":"Atkins M, Gilroy BM, Seiler V. New Dimensions of Service Offshoring in World Trade. <i>Intereconomics</i>. 2019;54(2):120-126.","bibtex":"@article{Atkins_Gilroy_Seiler_2019, title={New Dimensions of Service Offshoring in World Trade}, volume={54}, number={2}, journal={Intereconomics}, publisher={Springer}, author={Atkins, Marc and Gilroy, Bernard Michael and Seiler, Volker}, year={2019}, pages={120–126} }","apa":"Atkins, M., Gilroy, B. M., &#38; Seiler, V. (2019). New Dimensions of Service Offshoring in World Trade. <i>Intereconomics</i>, <i>54</i>(2), 120–126.","ieee":"M. Atkins, B. M. Gilroy, and V. Seiler, “New Dimensions of Service Offshoring in World Trade,” <i>Intereconomics</i>, vol. 54, no. 2, pp. 120–126, 2019.","chicago":"Atkins, Marc, Bernard Michael Gilroy, and Volker Seiler. “New Dimensions of Service Offshoring in World Trade.” <i>Intereconomics</i> 54, no. 2 (2019): 120–26.","short":"M. Atkins, B.M. Gilroy, V. Seiler, Intereconomics 54 (2019) 120–126."},"issue":"2","publication":"Intereconomics","_id":"16882","publisher":"Springer","language":[{"iso":"eng"}],"page":"120-126","volume":54,"user_id":"26589","author":[{"first_name":"Marc","last_name":"Atkins","full_name":"Atkins, Marc"},{"id":"175","first_name":"Bernard Michael","last_name":"Gilroy","full_name":"Gilroy, Bernard Michael"},{"full_name":"Seiler, Volker","first_name":"Volker","last_name":"Seiler"}],"year":"2019","status":"public","title":"New Dimensions of Service Offshoring in World Trade","intvolume":"        54","date_updated":"2022-01-06T06:52:58Z"},{"date_updated":"2022-01-06T06:52:58Z","title":"The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies","year":"2019","status":"public","author":[{"id":"175","full_name":"Gilroy, Bernard Michael","last_name":"Gilroy","first_name":"Bernard Michael"},{"id":"29629","full_name":"Golderbein, Alexander","first_name":"Alexander","last_name":"Golderbein"},{"id":"2980","full_name":"Peitz, Christian","first_name":"Christian","last_name":"Peitz"},{"id":"65503","full_name":"Stöckmann, Nico","last_name":"Stöckmann","first_name":"Nico"}],"user_id":"26589","editor":[{"first_name":"B.","last_name":"Fortz","full_name":"Fortz, B."},{"full_name":"Labbé, M.","last_name":"Labbé","first_name":"M."}],"page":"201-208","publisher":"Springer","_id":"16883","language":[{"iso":"eng"}],"publication":"Operations Research Proceedings 2018","citation":{"chicago":"Gilroy, Bernard Michael, Alexander Golderbein, Christian Peitz, and Nico Stöckmann. “The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies.” In <i>Operations Research Proceedings 2018</i>, edited by B. Fortz and M. Labbé, 201–8. Springer, 2019.","short":"B.M. Gilroy, A. Golderbein, C. Peitz, N. Stöckmann, in: B. Fortz, M. Labbé (Eds.), Operations Research Proceedings 2018, Springer, 2019, pp. 201–208.","ieee":"B. M. Gilroy, A. Golderbein, C. Peitz, and N. Stöckmann, “The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies,” in <i>Operations Research Proceedings 2018</i>, B. Fortz and M. Labbé, Eds. Springer, 2019, pp. 201–208.","apa":"Gilroy, B. M., Golderbein, A., Peitz, C., &#38; Stöckmann, N. (2019). The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies. In B. Fortz &#38; M. Labbé (Eds.), <i>Operations Research Proceedings 2018</i> (pp. 201–208). Springer.","bibtex":"@inbook{Gilroy_Golderbein_Peitz_Stöckmann_2019, title={The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies}, booktitle={Operations Research Proceedings 2018}, publisher={Springer}, author={Gilroy, Bernard Michael and Golderbein, Alexander and Peitz, Christian and Stöckmann, Nico}, editor={Fortz, B. and Labbé, M.Editors}, year={2019}, pages={201–208} }","ama":"Gilroy BM, Golderbein A, Peitz C, Stöckmann N. The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies. In: Fortz B, Labbé M, eds. <i>Operations Research Proceedings 2018</i>. Springer; 2019:201-208.","mla":"Gilroy, Bernard Michael, et al. “The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies.” <i>Operations Research Proceedings 2018</i>, edited by B. Fortz and M. Labbé, Springer, 2019, pp. 201–08."},"type":"book_chapter","department":[{"_id":"203"}],"date_created":"2020-04-28T07:06:24Z"},{"date_created":"2020-04-28T07:09:17Z","department":[{"_id":"203"},{"_id":"215"}],"type":"journal_article","citation":{"ieee":"D. Krimphove and C. Peitz, “Social-Trading und Copy-Trading,” <i>Fintechs: Rechtliche Grundlagen moderner Finanztechnologien</i>, p. 287, 2019.","apa":"Krimphove, D., &#38; Peitz, C. (2019). Social-Trading und Copy-Trading. <i>Fintechs: Rechtliche Grundlagen Moderner Finanztechnologien</i>, 287.","short":"D. Krimphove, C. Peitz, Fintechs: Rechtliche Grundlagen Moderner Finanztechnologien (2019) 287.","chicago":"Krimphove, Dieter, and Christian Peitz. “Social-Trading Und Copy-Trading.” <i>Fintechs: Rechtliche Grundlagen Moderner Finanztechnologien</i>, 2019, 287.","mla":"Krimphove, Dieter, and Christian Peitz. “Social-Trading Und Copy-Trading.” <i>Fintechs: Rechtliche Grundlagen Moderner Finanztechnologien</i>, Sch{\\\"a}ffer-Poeschel, 2019, p. 287.","bibtex":"@article{Krimphove_Peitz_2019, title={Social-Trading und Copy-Trading}, journal={Fintechs: Rechtliche Grundlagen moderner Finanztechnologien}, publisher={Sch{\\\"a}ffer-Poeschel}, author={Krimphove, Dieter and Peitz, Christian}, year={2019}, pages={287} }","ama":"Krimphove D, Peitz C. Social-Trading und Copy-Trading. <i>Fintechs: Rechtliche Grundlagen moderner Finanztechnologien</i>. 2019:287."},"publication":"Fintechs: Rechtliche Grundlagen moderner Finanztechnologien","publisher":"Sch{\\\"a}ffer-Poeschel","_id":"16884","language":[{"iso":"eng"}],"page":"287","user_id":"26589","author":[{"first_name":"Dieter","last_name":"Krimphove","full_name":"Krimphove, Dieter","id":"282"},{"first_name":"Christian","last_name":"Peitz","full_name":"Peitz, Christian","id":"2980"}],"year":"2019","title":"Social-Trading und Copy-Trading","status":"public","date_updated":"2022-01-06T06:52:58Z"},{"type":"journal_article","keyword":["pc2-ressources"],"date_created":"2020-05-15T07:25:04Z","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"ieee":"M. Heinen and J. Vrabec, “Evaporation sampled by stationary molecular dynamics simulation,” <i>The Journal of Chemical Physics</i>, 2019.","apa":"Heinen, M., &#38; Vrabec, J. (2019). Evaporation sampled by stationary molecular dynamics simulation. <i>The Journal of Chemical Physics</i>. <a href=\"https://doi.org/10.1063/1.5111759\">https://doi.org/10.1063/1.5111759</a>","short":"M. Heinen, J. Vrabec, The Journal of Chemical Physics (2019).","chicago":"Heinen, Matthias, and Jadran Vrabec. “Evaporation Sampled by Stationary Molecular Dynamics Simulation.” <i>The Journal of Chemical Physics</i>, 2019. <a href=\"https://doi.org/10.1063/1.5111759\">https://doi.org/10.1063/1.5111759</a>.","mla":"Heinen, Matthias, and Jadran Vrabec. “Evaporation Sampled by Stationary Molecular Dynamics Simulation.” <i>The Journal of Chemical Physics</i>, 044704, 2019, doi:<a href=\"https://doi.org/10.1063/1.5111759\">10.1063/1.5111759</a>.","bibtex":"@article{Heinen_Vrabec_2019, title={Evaporation sampled by stationary molecular dynamics simulation}, DOI={<a href=\"https://doi.org/10.1063/1.5111759\">10.1063/1.5111759</a>}, number={044704}, journal={The Journal of Chemical Physics}, author={Heinen, Matthias and Vrabec, Jadran}, year={2019} }","ama":"Heinen M, Vrabec J. Evaporation sampled by stationary molecular dynamics simulation. <i>The Journal of Chemical Physics</i>. 2019. doi:<a href=\"https://doi.org/10.1063/1.5111759\">10.1063/1.5111759</a>"},"publication":"The Journal of Chemical Physics","doi":"10.1063/1.5111759","user_id":"61189","language":[{"iso":"eng"}],"_id":"16955","article_number":"044704","date_updated":"2022-01-06T06:53:00Z","publication_status":"published","author":[{"last_name":"Heinen","first_name":"Matthias","full_name":"Heinen, Matthias"},{"last_name":"Vrabec","first_name":"Jadran","full_name":"Vrabec, Jadran"}],"publication_identifier":{"issn":["0021-9606","1089-7690"]},"status":"public","title":"Evaporation sampled by stationary molecular dynamics simulation","year":"2019"},{"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publication":"Molecular Physics","citation":{"chicago":"Fingerhut, Robin, Gerhard Herres, and Jadran Vrabec. “Thermodynamic Factor of Quaternary Mixtures from Kirkwood–Buff Integration.” <i>Molecular Physics</i>, 2019. <a href=\"https://doi.org/10.1080/00268976.2019.1643046\">https://doi.org/10.1080/00268976.2019.1643046</a>.","short":"R. Fingerhut, G. Herres, J. Vrabec, Molecular Physics (2019).","ieee":"R. Fingerhut, G. Herres, and J. Vrabec, “Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration,” <i>Molecular Physics</i>, 2019.","apa":"Fingerhut, R., Herres, G., &#38; Vrabec, J. (2019). Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration. <i>Molecular Physics</i>. <a href=\"https://doi.org/10.1080/00268976.2019.1643046\">https://doi.org/10.1080/00268976.2019.1643046</a>","bibtex":"@article{Fingerhut_Herres_Vrabec_2019, title={Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration}, DOI={<a href=\"https://doi.org/10.1080/00268976.2019.1643046\">10.1080/00268976.2019.1643046</a>}, number={e1643046}, journal={Molecular Physics}, author={Fingerhut, Robin and Herres, Gerhard and Vrabec, Jadran}, year={2019} }","ama":"Fingerhut R, Herres G, Vrabec J. Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration. <i>Molecular Physics</i>. 2019. doi:<a href=\"https://doi.org/10.1080/00268976.2019.1643046\">10.1080/00268976.2019.1643046</a>","mla":"Fingerhut, Robin, et al. “Thermodynamic Factor of Quaternary Mixtures from Kirkwood–Buff Integration.” <i>Molecular Physics</i>, e1643046, 2019, doi:<a href=\"https://doi.org/10.1080/00268976.2019.1643046\">10.1080/00268976.2019.1643046</a>."},"type":"journal_article","keyword":["pc2-ressources"],"date_created":"2020-05-15T07:25:34Z","date_updated":"2022-01-06T06:53:00Z","publication_status":"published","title":"Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration","status":"public","year":"2019","author":[{"last_name":"Fingerhut","first_name":"Robin","full_name":"Fingerhut, Robin"},{"first_name":"Gerhard","last_name":"Herres","full_name":"Herres, Gerhard"},{"full_name":"Vrabec, Jadran","last_name":"Vrabec","first_name":"Jadran"}],"publication_identifier":{"issn":["0026-8976","1362-3028"]},"doi":"10.1080/00268976.2019.1643046","user_id":"61189","article_number":"e1643046","_id":"16958","language":[{"iso":"eng"}]},{"citation":{"mla":"Mennicken, Max, et al. “Controlling the Electronic Contact at the Terpyridine/Metal Interface.” <i>The Journal of Physical Chemistry C</i>, 2019, pp. 21367–75, doi:<a href=\"https://doi.org/10.1021/acs.jpcc.9b05865\">10.1021/acs.jpcc.9b05865</a>.","ama":"Mennicken M, Peter SK, Kaulen C, Simon U, Karthäuser S. Controlling the Electronic Contact at the Terpyridine/Metal Interface. <i>The Journal of Physical Chemistry C</i>. 2019:21367-21375. doi:<a href=\"https://doi.org/10.1021/acs.jpcc.9b05865\">10.1021/acs.jpcc.9b05865</a>","bibtex":"@article{Mennicken_Peter_Kaulen_Simon_Karthäuser_2019, title={Controlling the Electronic Contact at the Terpyridine/Metal Interface}, DOI={<a href=\"https://doi.org/10.1021/acs.jpcc.9b05865\">10.1021/acs.jpcc.9b05865</a>}, journal={The Journal of Physical Chemistry C}, author={Mennicken, Max and Peter, Sophia Katharina and Kaulen, Corinna and Simon, Ulrich and Karthäuser, Silvia}, year={2019}, pages={21367–21375} }","apa":"Mennicken, M., Peter, S. K., Kaulen, C., Simon, U., &#38; Karthäuser, S. (2019). Controlling the Electronic Contact at the Terpyridine/Metal Interface. <i>The Journal of Physical Chemistry C</i>, 21367–21375. <a href=\"https://doi.org/10.1021/acs.jpcc.9b05865\">https://doi.org/10.1021/acs.jpcc.9b05865</a>","ieee":"M. Mennicken, S. K. Peter, C. Kaulen, U. Simon, and S. Karthäuser, “Controlling the Electronic Contact at the Terpyridine/Metal Interface,” <i>The Journal of Physical Chemistry C</i>, pp. 21367–21375, 2019.","short":"M. Mennicken, S.K. Peter, C. Kaulen, U. Simon, S. Karthäuser, The Journal of Physical Chemistry C (2019) 21367–21375.","chicago":"Mennicken, Max, Sophia Katharina Peter, Corinna Kaulen, Ulrich Simon, and Silvia Karthäuser. “Controlling the Electronic Contact at the Terpyridine/Metal Interface.” <i>The Journal of Physical Chemistry C</i>, 2019, 21367–75. <a href=\"https://doi.org/10.1021/acs.jpcc.9b05865\">https://doi.org/10.1021/acs.jpcc.9b05865</a>."},"publication":"The Journal of Physical Chemistry C","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2020-05-15T09:38:49Z","keyword":["pc2-ressources"],"type":"journal_article","publication_identifier":{"issn":["1932-7447","1932-7455"]},"author":[{"last_name":"Mennicken","first_name":"Max","full_name":"Mennicken, Max"},{"first_name":"Sophia Katharina","last_name":"Peter","full_name":"Peter, Sophia Katharina"},{"full_name":"Kaulen, Corinna","first_name":"Corinna","last_name":"Kaulen"},{"full_name":"Simon, Ulrich","last_name":"Simon","first_name":"Ulrich"},{"first_name":"Silvia","last_name":"Karthäuser","full_name":"Karthäuser, Silvia"}],"year":"2019","title":"Controlling the Electronic Contact at the Terpyridine/Metal Interface","status":"public","date_updated":"2022-01-06T06:53:00Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16960","page":"21367-21375","doi":"10.1021/acs.jpcc.9b05865","user_id":"61189"},{"publication":"Journal for the Study of British Cultures","issue":"2","citation":{"apa":"Tönnies, M., &#38; Henneböhl, D. (2019). Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith’s Seasonal Quartet as a Counter-Narrative to Brexit. <i>Journal for the Study of British Cultures</i>, <i>26</i>(2), 181–193.","ieee":"M. Tönnies and D. Henneböhl, “Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith’s Seasonal Quartet as a Counter-Narrative to Brexit,” <i>Journal for the Study of British Cultures</i>, vol. 26, no. 2, pp. 181–193, 2019.","short":"M. Tönnies, D. Henneböhl, Journal for the Study of British Cultures 26 (2019) 181–193.","chicago":"Tönnies, Merle, and Dennis Henneböhl. “Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith’s Seasonal Quartet as a Counter-Narrative to Brexit.” <i>Journal for the Study of British Cultures</i> 26, no. 2 (2019): 181–93.","mla":"Tönnies, Merle, and Dennis Henneböhl. “Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith’s Seasonal Quartet as a Counter-Narrative to Brexit.” <i>Journal for the Study of British Cultures</i>, vol. 26, no. 2, 2019, pp. 181–93.","ama":"Tönnies M, Henneböhl D. Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith’s Seasonal Quartet as a Counter-Narrative to Brexit. <i>Journal for the Study of British Cultures</i>. 2019;26(2):181-193.","bibtex":"@article{Tönnies_Henneböhl_2019, title={Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith’s Seasonal Quartet as a Counter-Narrative to Brexit}, volume={26}, number={2}, journal={Journal for the Study of British Cultures}, author={Tönnies, Merle and Henneböhl, Dennis}, year={2019}, pages={181–193} }"},"date_created":"2020-05-25T06:36:17Z","type":"journal_article","year":"2019","status":"public","title":"Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith's Seasonal Quartet as a Counter-Narrative to Brexit","author":[{"full_name":"Tönnies, Merle","last_name":"Tönnies","first_name":"Merle","id":"555"},{"last_name":"Henneböhl","first_name":"Dennis","full_name":"Henneböhl, Dennis"}],"date_updated":"2022-01-06T06:53:03Z","publication_status":"published","intvolume":"        26","page":"181-193","language":[{"iso":"eng"}],"_id":"17057","user_id":"555","volume":26},{"author":[{"last_name":"Wiebeler","first_name":"Christian","full_name":"Wiebeler, Christian"},{"full_name":"Schapiro, Igor","last_name":"Schapiro","first_name":"Igor"}],"publication_identifier":{"issn":["1420-3049"]},"title":"QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra","status":"public","year":"2019","date_updated":"2022-01-06T06:53:04Z","publication_status":"published","_id":"17077","language":[{"iso":"eng"}],"article_number":"1720","doi":"10.3390/molecules24091720","user_id":"61189","citation":{"ieee":"C. Wiebeler and I. Schapiro, “QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra,” <i>Molecules</i>, 2019.","apa":"Wiebeler, C., &#38; Schapiro, I. (2019). QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra. <i>Molecules</i>. <a href=\"https://doi.org/10.3390/molecules24091720\">https://doi.org/10.3390/molecules24091720</a>","chicago":"Wiebeler, Christian, and Igor Schapiro. “QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra.” <i>Molecules</i>, 2019. <a href=\"https://doi.org/10.3390/molecules24091720\">https://doi.org/10.3390/molecules24091720</a>.","short":"C. Wiebeler, I. Schapiro, Molecules (2019).","mla":"Wiebeler, Christian, and Igor Schapiro. “QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra.” <i>Molecules</i>, 1720, 2019, doi:<a href=\"https://doi.org/10.3390/molecules24091720\">10.3390/molecules24091720</a>.","bibtex":"@article{Wiebeler_Schapiro_2019, title={QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra}, DOI={<a href=\"https://doi.org/10.3390/molecules24091720\">10.3390/molecules24091720</a>}, number={1720}, journal={Molecules}, author={Wiebeler, Christian and Schapiro, Igor}, year={2019} }","ama":"Wiebeler C, Schapiro I. QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra. <i>Molecules</i>. 2019. doi:<a href=\"https://doi.org/10.3390/molecules24091720\">10.3390/molecules24091720</a>"},"publication":"Molecules","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"abstract":[{"lang":"eng","text":"<jats:p>Cyanobacteriochromes are compact and spectrally diverse photoreceptor proteins that are promising candidates for biotechnological applications. Computational studies can contribute to an understanding at a molecular level of their wide spectral tuning and diversity. In this contribution, we benchmark methods to model a 110 nm shift in the UV/Vis absorption spectrum from a red- to a green-absorbing form of the cyanobacteriochrome Slr1393g3. Based on an assessment of semiempirical methods to describe the chromophore geometries of both forms in vacuo, we find that DFTB2+D leads to structures that are the closest to the reference method. The benchmark of the excited state calculations is based on snapshots from quantum mechanics/molecular mechanics molecular dynamics simulations. In our case, the methods RI-ADC(2) and sTD-DFT based on CAM-B3LYP ground state calculations perform the best, whereas no functional can be recommended to simulate the absorption spectra of both forms with time-dependent density functional theory. Furthermore, the difference in absorption for the lowest energy absorption maxima of both forms can already be modelled with optimized structures, but sampling is required to improve the shape of the absorption bands of both forms, in particular for the second band. This benchmark study can guide further computational studies, as it assesses essential components of a protocol to model the spectral tuning of both cyanobacteriochromes and the related phytochromes.</jats:p>"}],"date_created":"2020-06-04T07:27:03Z","keyword":["pc2-ressources"],"type":"journal_article"},{"date_updated":"2022-01-06T06:53:05Z","author":[{"id":"14924","full_name":"Oevel, Gudrun","first_name":"Gudrun","last_name":"Oevel","orcid":"https://orcid.org/0000-0002-6396-9535"},{"full_name":"Graf-Schlattmann, Marcel","last_name":"Graf-Schlattmann","first_name":"Marcel"},{"full_name":"Meister, Dorothee M.","last_name":"Meister","first_name":"Dorothee M.","id":"346"},{"full_name":"Wilde, Melanie","first_name":"Melanie","last_name":"Wilde"}],"status":"public","title":"Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung","year":"2019","user_id":"14931","doi":"10.5281/ZENODO.2589943","_id":"17157","language":[{"iso":"ger"}],"related_material":{"link":[{"url":"https://zenodo.org/record/2589943","relation":"confirmation"}]},"citation":{"apa":"Oevel, G., Graf-Schlattmann, M., Meister, D. M., &#38; Wilde, M. (2019). <i>Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung</i>. <a href=\"https://doi.org/10.5281/ZENODO.2589943\">https://doi.org/10.5281/ZENODO.2589943</a>","mla":"Oevel, Gudrun, et al. <i>Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung</i>. 2019, doi:<a href=\"https://doi.org/10.5281/ZENODO.2589943\">10.5281/ZENODO.2589943</a>.","ieee":"G. Oevel, M. Graf-Schlattmann, D. M. Meister, and M. Wilde, <i>Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung</i>. 2019.","short":"G. Oevel, M. Graf-Schlattmann, D.M. Meister, M. Wilde, Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung, 2019.","ama":"Oevel G, Graf-Schlattmann M, Meister DM, Wilde M. <i>Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung</i>.; 2019. doi:<a href=\"https://doi.org/10.5281/ZENODO.2589943\">10.5281/ZENODO.2589943</a>","chicago":"Oevel, Gudrun, Marcel Graf-Schlattmann, Dorothee M. Meister, and Melanie Wilde. <i>Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung</i>, 2019. <a href=\"https://doi.org/10.5281/ZENODO.2589943\">https://doi.org/10.5281/ZENODO.2589943</a>.","bibtex":"@book{Oevel_Graf-Schlattmann_Meister_Wilde_2019, title={Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung}, DOI={<a href=\"https://doi.org/10.5281/ZENODO.2589943\">10.5281/ZENODO.2589943</a>}, author={Oevel, Gudrun and Graf-Schlattmann, Marcel and Meister, Dorothee M. and Wilde, Melanie}, year={2019} }"},"department":[{"_id":"25"},{"_id":"137"}],"type":"misc","date_created":"2020-06-24T10:47:05Z"},{"publication":"Zeitschrift für Bibliothekswesen und Bibliographie","citation":{"ama":"Oevel G, Barlösius E. Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft. <i>Zeitschrift für Bibliothekswesen und Bibliographie</i>. 2019:156-163. doi:<a href=\"https://doi.org/10.3196/186429501966413\">10.3196/186429501966413</a>","bibtex":"@article{Oevel_Barlösius_2019, title={Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft}, DOI={<a href=\"https://doi.org/10.3196/186429501966413\">10.3196/186429501966413</a>}, journal={Zeitschrift für Bibliothekswesen und Bibliographie}, author={Oevel, Gudrun and Barlösius, Eva}, year={2019}, pages={156–163} }","mla":"Oevel, Gudrun, and Eva Barlösius. “Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft.” <i>Zeitschrift für Bibliothekswesen und Bibliographie</i>, 2019, pp. 156–63, doi:<a href=\"https://doi.org/10.3196/186429501966413\">10.3196/186429501966413</a>.","short":"G. Oevel, E. Barlösius, Zeitschrift für Bibliothekswesen und Bibliographie (2019) 156–163.","chicago":"Oevel, Gudrun, and Eva Barlösius. “Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft.” <i>Zeitschrift für Bibliothekswesen und Bibliographie</i>, 2019, 156–63. <a href=\"https://doi.org/10.3196/186429501966413\">https://doi.org/10.3196/186429501966413</a>.","apa":"Oevel, G., &#38; Barlösius, E. (2019). Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft. <i>Zeitschrift für Bibliothekswesen und Bibliographie</i>, 156–163. <a href=\"https://doi.org/10.3196/186429501966413\">https://doi.org/10.3196/186429501966413</a>","ieee":"G. Oevel and E. Barlösius, “Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft,” <i>Zeitschrift für Bibliothekswesen und Bibliographie</i>, pp. 156–163, 2019."},"type":"journal_article","department":[{"_id":"25"}],"date_created":"2020-06-24T11:02:59Z","date_updated":"2022-01-06T06:53:05Z","publication_status":"published","year":"2019","status":"public","title":"Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft","publication_identifier":{"issn":["0044-2380","1864-2950"]},"author":[{"id":"14924","full_name":"Oevel, Gudrun","orcid":"https://orcid.org/0000-0002-6396-9535","first_name":"Gudrun","last_name":"Oevel"},{"last_name":"Barlösius","first_name":"Eva","full_name":"Barlösius, Eva"}],"doi":"10.3196/186429501966413","user_id":"14932","page":"156-163","_id":"17160","language":[{"iso":"ger"}]},{"publication_status":"published","date_updated":"2022-01-06T06:50:45Z","author":[{"id":"49051","last_name":"Witschen","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias"},{"last_name":"Ghasemzadeh Mohammadi","first_name":"Hassan","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186"},{"full_name":"Artmann, Matthias","first_name":"Matthias","last_name":"Artmann"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"publication_identifier":{"isbn":["9781450362528"]},"year":"2019","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","doi":"10.1145/3299874.3317998","language":[{"iso":"eng"}],"abstract":[{"text":"State-of-the-art frameworks for generating approximate circuits automatically explore the search space in an iterative process - often greedily. Synthesis and verification processes are invoked in each iteration to evaluate the found solutions and to guide the search algorithm. As a result, a large number of approximate circuits is subjected to analysis - leading to long runtimes - but only a few approximate circuits might form an acceptable solution.\r\n\r\nIn this paper, we present our Jump Search (JS) method which seeks to reduce the runtime of an approximation process by reducing the number of expensive synthesis and verification steps. To reduce the runtime, JS computes impact factors for each approximation candidate in the circuit to create a selection of approximate circuits without invoking synthesis or verification processes. We denote the selection as path from which JS determines the final solution. In our experimental results, JS achieved speed-ups of up to 57x while area savings remain comparable to the reference search method, Simulated Annealing.","lang":"eng"}],"publication":"Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI '19","department":[{"_id":"78"}],"type":"conference","keyword":["Approximate computing","design automation","parameter selection","circuit synthesis"],"date_created":"2019-07-08T15:13:10Z","conference":{"end_date":"2019-05-11","location":"Tysons Corner, VA, USA","start_date":"2019-05-09","name":"ACM Great Lakes Symposium on VLSI (GLSVLSI)"},"status":"public","user_id":"49051","_id":"10577","publisher":"ACM","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"ieee":"L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits,” in <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>, Tysons Corner, VA, USA, 2019.","apa":"Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M. (2019). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3299874.3317998\">https://doi.org/10.1145/3299874.3317998</a>","short":"L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, in: Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19, ACM, New York, NY, USA, 2019.","chicago":"Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann, and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY, USA: ACM, 2019. <a href=\"https://doi.org/10.1145/3299874.3317998\">https://doi.org/10.1145/3299874.3317998</a>.","mla":"Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3299874.3317998\">10.1145/3299874.3317998</a>.","bibtex":"@inproceedings{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner_2019, place={New York, NY, USA}, title={Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}, DOI={<a href=\"https://doi.org/10.1145/3299874.3317998\">10.1145/3299874.3317998</a>}, booktitle={Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19}, publisher={ACM}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}, year={2019} }","ama":"Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. In: <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY, USA: ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3299874.3317998\">10.1145/3299874.3317998</a>"},"place":"New York, NY, USA"},{"date_created":"2019-07-08T15:34:03Z","type":"journal_article","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"publication":"New Mathematics and Natural Computation","issue":"2","citation":{"short":"V.K. Tagne, S. Fotso, L.A. Fono, E. Hüllermeier, New Mathematics and Natural Computation 15 (2019) 191–213.","chicago":"Tagne, V. K., S. Fotso, L. A.  Fono, and Eyke Hüllermeier. “Choice Functions Generated by Mallows and Plackett–Luce Relations.” <i>New Mathematics and Natural Computation</i> 15, no. 2 (2019): 191–213.","ieee":"V. K. Tagne, S. Fotso, L. A. Fono, and E. Hüllermeier, “Choice Functions Generated by Mallows and Plackett–Luce Relations,” <i>New Mathematics and Natural Computation</i>, vol. 15, no. 2, pp. 191–213, 2019.","apa":"Tagne, V. K., Fotso, S., Fono, L. A., &#38; Hüllermeier, E. (2019). Choice Functions Generated by Mallows and Plackett–Luce Relations. <i>New Mathematics and Natural Computation</i>, <i>15</i>(2), 191–213.","bibtex":"@article{Tagne_Fotso_Fono_Hüllermeier_2019, title={Choice Functions Generated by Mallows and Plackett–Luce Relations}, volume={15}, number={2}, journal={New Mathematics and Natural Computation}, author={Tagne, V. K. and Fotso, S. and Fono, L. A.  and Hüllermeier, Eyke}, year={2019}, pages={191–213} }","ama":"Tagne VK, Fotso S, Fono LA, Hüllermeier E. Choice Functions Generated by Mallows and Plackett–Luce Relations. <i>New Mathematics and Natural Computation</i>. 2019;15(2):191-213.","mla":"Tagne, V. K., et al. “Choice Functions Generated by Mallows and Plackett–Luce Relations.” <i>New Mathematics and Natural Computation</i>, vol. 15, no. 2, 2019, pp. 191–213."},"page":"191-213","_id":"10578","language":[{"iso":"eng"}],"user_id":"315","volume":15,"year":"2019","status":"public","title":"Choice Functions Generated by Mallows and Plackett–Luce Relations","author":[{"full_name":"Tagne, V. K.","first_name":"V. K.","last_name":"Tagne"},{"first_name":"S.","last_name":"Fotso","full_name":"Fotso, S."},{"full_name":"Fono, L. A. ","last_name":"Fono","first_name":"L. A. "},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"date_updated":"2022-01-06T06:50:45Z","intvolume":"        15"},{"publication_status":"published","date_updated":"2022-01-06T06:50:45Z","intvolume":"       132","year":"2019","title":"On the Complexity of Local Graph Transformations","author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"id":"11108","first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander"}],"doi":"10.4230/LIPICS.ICALP.2019.150","language":[{"iso":"eng"}],"series_title":"LIPIcs","abstract":[{"text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.","lang":"eng"}],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"type":"conference","department":[{"_id":"79"}],"file":[{"creator":"ups","date_created":"2019-08-26T09:21:27Z","relation":"main_file","date_updated":"2019-08-26T09:21:27Z","file_name":"LIPIcs-ICALP-2019-150.pdf","access_level":"closed","file_size":537649,"file_id":"12955","success":1,"content_type":"application/pdf"}],"date_created":"2019-07-08T17:19:01Z","has_accepted_license":"1","status":"public","conference":{"location":"Patras, Greece","name":"ICALP 2019","start_date":"2019-07-09","end_date":"2019-07-12"},"user_id":"477","ddc":["004"],"volume":132,"page":"150:1--150:14","_id":"10586","publisher":"Dagstuhl Publishing","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2019-08-26T09:21:27Z","citation":{"apa":"Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>","ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.","chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>.","mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>.","ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>","bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }"}},{"date_created":"2019-07-10T08:08:16Z","department":[{"_id":"101"}],"type":"journal_article","publication":"Automatica","abstract":[{"text":"We present a new framework for optimal and feedback control of PDEs using Koopman operator-based reduced order models (K-ROMs). The Koopman operator is a linear but infinite-dimensional operator which describes the dynamics of observables. A numerical approximation of the Koopman operator therefore yields a linear system for the observation of an autonomous dynamical system. In our approach, by introducing a finite number of constant controls, the dynamic control system is transformed into a set of autonomous systems and the corresponding optimal control problem into a switching time optimization problem. This allows us to replace each of these systems by a K-ROM which can be solved orders of magnitude faster. By this approach, a nonlinear infinite-dimensional control problem is transformed into a low-dimensional linear problem. Using a recent convergence result for the numerical approximation via Extended Dynamic Mode Decomposition (EDMD), we show that the value of the K-ROM based objective function converges in measure to the value of the full objective function. To illustrate the results, we consider the 1D Burgers equation and the 2D Navier–Stokes equations. The numerical experiments show remarkable performance concerning both solution times and accuracy.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.automatica.2019.05.016","publication_identifier":{"issn":["0005-1098"]},"author":[{"full_name":"Peitz, Sebastian","first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz","id":"47427"},{"full_name":"Klus, Stefan","last_name":"Klus","first_name":"Stefan"}],"title":"Koopman operator-based model reduction for switched-system control of PDEs","year":"2019","article_type":"original","intvolume":"       106","publication_status":"published","date_updated":"2022-01-06T06:50:46Z","citation":{"mla":"Peitz, Sebastian, and Stefan Klus. “Koopman Operator-Based Model Reduction for Switched-System Control of PDEs.” <i>Automatica</i>, vol. 106, 2019, pp. 184–91, doi:<a href=\"https://doi.org/10.1016/j.automatica.2019.05.016\">10.1016/j.automatica.2019.05.016</a>.","apa":"Peitz, S., &#38; Klus, S. (2019). Koopman operator-based model reduction for switched-system control of PDEs. <i>Automatica</i>, <i>106</i>, 184–191. <a href=\"https://doi.org/10.1016/j.automatica.2019.05.016\">https://doi.org/10.1016/j.automatica.2019.05.016</a>","ieee":"S. Peitz and S. Klus, “Koopman operator-based model reduction for switched-system control of PDEs,” <i>Automatica</i>, vol. 106, pp. 184–191, 2019.","chicago":"Peitz, Sebastian, and Stefan Klus. “Koopman Operator-Based Model Reduction for Switched-System Control of PDEs.” <i>Automatica</i> 106 (2019): 184–91. <a href=\"https://doi.org/10.1016/j.automatica.2019.05.016\">https://doi.org/10.1016/j.automatica.2019.05.016</a>.","short":"S. Peitz, S. Klus, Automatica 106 (2019) 184–191.","ama":"Peitz S, Klus S. Koopman operator-based model reduction for switched-system control of PDEs. <i>Automatica</i>. 2019;106:184-191. doi:<a href=\"https://doi.org/10.1016/j.automatica.2019.05.016\">10.1016/j.automatica.2019.05.016</a>","bibtex":"@article{Peitz_Klus_2019, title={Koopman operator-based model reduction for switched-system control of PDEs}, volume={106}, DOI={<a href=\"https://doi.org/10.1016/j.automatica.2019.05.016\">10.1016/j.automatica.2019.05.016</a>}, journal={Automatica}, author={Peitz, Sebastian and Klus, Stefan}, year={2019}, pages={184–191} }"},"_id":"10593","page":"184-191","volume":106,"user_id":"47427","status":"public"},{"publication_identifier":{"issn":["0925-5001","1573-2916"]},"author":[{"last_name":"Gebken","first_name":"Bennet","full_name":"Gebken, Bennet","id":"32643"},{"full_name":"Peitz, Sebastian","last_name":"Peitz","first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","id":"47427"},{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"}],"year":"2019","title":"On the hierarchical structure of Pareto critical sets","intvolume":"        73","article_type":"original","date_updated":"2022-01-06T06:50:46Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1007/s10898-019-00737-6","publication":"Journal of Global Optimization","issue":"4","abstract":[{"lang":"eng","text":"In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems where only a subset of the set of objective functions is taken into account. If the Pareto critical set is completely described by its boundary (e.g., if we have more objective functions than dimensions in decision space), then this can be used to efficiently solve the MOP by solving a number of MOPs with fewer objective functions. If this is not the case, the results can still give insight into the structure of the Pareto critical set."}],"date_created":"2019-07-10T08:13:31Z","department":[{"_id":"101"}],"type":"journal_article","status":"public","_id":"10595","page":"891-913","volume":73,"user_id":"47427","citation":{"ama":"Gebken B, Peitz S, Dellnitz M. On the hierarchical structure of Pareto critical sets. <i>Journal of Global Optimization</i>. 2019;73(4):891-913. doi:<a href=\"https://doi.org/10.1007/s10898-019-00737-6\">10.1007/s10898-019-00737-6</a>","bibtex":"@article{Gebken_Peitz_Dellnitz_2019, title={On the hierarchical structure of Pareto critical sets}, volume={73}, DOI={<a href=\"https://doi.org/10.1007/s10898-019-00737-6\">10.1007/s10898-019-00737-6</a>}, number={4}, journal={Journal of Global Optimization}, author={Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}, year={2019}, pages={891–913} }","mla":"Gebken, Bennet, et al. “On the Hierarchical Structure of Pareto Critical Sets.” <i>Journal of Global Optimization</i>, vol. 73, no. 4, 2019, pp. 891–913, doi:<a href=\"https://doi.org/10.1007/s10898-019-00737-6\">10.1007/s10898-019-00737-6</a>.","chicago":"Gebken, Bennet, Sebastian Peitz, and Michael Dellnitz. “On the Hierarchical Structure of Pareto Critical Sets.” <i>Journal of Global Optimization</i> 73, no. 4 (2019): 891–913. <a href=\"https://doi.org/10.1007/s10898-019-00737-6\">https://doi.org/10.1007/s10898-019-00737-6</a>.","short":"B. Gebken, S. Peitz, M. Dellnitz, Journal of Global Optimization 73 (2019) 891–913.","apa":"Gebken, B., Peitz, S., &#38; Dellnitz, M. (2019). On the hierarchical structure of Pareto critical sets. <i>Journal of Global Optimization</i>, <i>73</i>(4), 891–913. <a href=\"https://doi.org/10.1007/s10898-019-00737-6\">https://doi.org/10.1007/s10898-019-00737-6</a>","ieee":"B. Gebken, S. Peitz, and M. Dellnitz, “On the hierarchical structure of Pareto critical sets,” <i>Journal of Global Optimization</i>, vol. 73, no. 4, pp. 891–913, 2019."}},{"_id":"10597","language":[{"iso":"eng"}],"user_id":"47427","doi":"10.1109/precede.2019.8753313","author":[{"full_name":"Hanke, Soren","first_name":"Soren","last_name":"Hanke"},{"id":"47427","full_name":"Peitz, Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","first_name":"Sebastian","last_name":"Peitz"},{"last_name":"Wallscheid","first_name":"Oliver","full_name":"Wallscheid, Oliver"},{"full_name":"Böcker, Joachim","first_name":"Joachim","last_name":"Böcker"},{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"}],"publication_identifier":{"isbn":["9781538694145"]},"year":"2019","title":"Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification","status":"public","publication_status":"published","date_updated":"2022-01-06T06:50:46Z","date_created":"2019-07-10T08:15:23Z","department":[{"_id":"101"}],"type":"conference","citation":{"ieee":"S. Hanke, S. Peitz, O. Wallscheid, J. Böcker, and M. Dellnitz, “Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification,” in <i>2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)</i>, 2019.","apa":"Hanke, S., Peitz, S., Wallscheid, O., Böcker, J., &#38; Dellnitz, M. (2019). Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification. In <i>2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)</i>. <a href=\"https://doi.org/10.1109/precede.2019.8753313\">https://doi.org/10.1109/precede.2019.8753313</a>","chicago":"Hanke, Soren, Sebastian Peitz, Oliver Wallscheid, Joachim Böcker, and Michael Dellnitz. “Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification.” In <i>2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)</i>, 2019. <a href=\"https://doi.org/10.1109/precede.2019.8753313\">https://doi.org/10.1109/precede.2019.8753313</a>.","short":"S. Hanke, S. Peitz, O. Wallscheid, J. Böcker, M. Dellnitz, in: 2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE), 2019.","mla":"Hanke, Soren, et al. “Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification.” <i>2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)</i>, 2019, doi:<a href=\"https://doi.org/10.1109/precede.2019.8753313\">10.1109/precede.2019.8753313</a>.","bibtex":"@inproceedings{Hanke_Peitz_Wallscheid_Böcker_Dellnitz_2019, title={Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification}, DOI={<a href=\"https://doi.org/10.1109/precede.2019.8753313\">10.1109/precede.2019.8753313</a>}, booktitle={2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)}, author={Hanke, Soren and Peitz, Sebastian and Wallscheid, Oliver and Böcker, Joachim and Dellnitz, Michael}, year={2019} }","ama":"Hanke S, Peitz S, Wallscheid O, Böcker J, Dellnitz M. Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification. In: <i>2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1109/precede.2019.8753313\">10.1109/precede.2019.8753313</a>"},"publication":"2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)","abstract":[{"lang":"eng","text":"In comparison to classical control approaches in the field of electrical drives like the field-oriented control (FOC), model predictive control (MPC) approaches are able to provide a higher control performance. This refers to shorter settling times, lower overshoots, and a better decoupling of control variables in case of multi-variable controls. However, this can only be achieved if the used prediction model covers the actual behavior of the plant sufficiently well. In case of model deviations, the performance utilizing MPC remains below its potential. This results in effects like increased current ripple or steady state setpoint deviations. In order to achieve a high control performance, it is therefore necessary to adapt the model to the real plant behavior. When using an online system identification, a less accurate model is sufficient for commissioning of the drive system. In this paper, the combination of a finite-control-set MPC (FCS-MPC) with a system identification is proposed. The method does not require high-frequency signal injection, but uses the measured values already required for the FCS-MPC. An evaluation of the least squares-based identification on a laboratory test bench showed that the model accuracy and thus the control performance could be improved by an online update of the prediction models."}]}]