--- _id: '16960' author: - first_name: Max full_name: Mennicken, Max last_name: Mennicken - first_name: Sophia Katharina full_name: Peter, Sophia Katharina last_name: Peter - first_name: Corinna full_name: Kaulen, Corinna last_name: Kaulen - first_name: Ulrich full_name: Simon, Ulrich last_name: Simon - first_name: Silvia full_name: Karthäuser, Silvia last_name: Karthäuser citation: ama: Mennicken M, Peter SK, Kaulen C, Simon U, Karthäuser S. Controlling the Electronic Contact at the Terpyridine/Metal Interface. The Journal of Physical Chemistry C. 2019:21367-21375. doi:10.1021/acs.jpcc.9b05865 apa: Mennicken, M., Peter, S. K., Kaulen, C., Simon, U., & Karthäuser, S. (2019). Controlling the Electronic Contact at the Terpyridine/Metal Interface. The Journal of Physical Chemistry C, 21367–21375. https://doi.org/10.1021/acs.jpcc.9b05865 bibtex: '@article{Mennicken_Peter_Kaulen_Simon_Karthäuser_2019, title={Controlling the Electronic Contact at the Terpyridine/Metal Interface}, DOI={10.1021/acs.jpcc.9b05865}, 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} }' chicago: Mennicken, Max, Sophia Katharina Peter, Corinna Kaulen, Ulrich Simon, and Silvia Karthäuser. “Controlling the Electronic Contact at the Terpyridine/Metal Interface.” The Journal of Physical Chemistry C, 2019, 21367–75. https://doi.org/10.1021/acs.jpcc.9b05865. ieee: M. Mennicken, S. K. Peter, C. Kaulen, U. Simon, and S. Karthäuser, “Controlling the Electronic Contact at the Terpyridine/Metal Interface,” The Journal of Physical Chemistry C, pp. 21367–21375, 2019. mla: Mennicken, Max, et al. “Controlling the Electronic Contact at the Terpyridine/Metal Interface.” The Journal of Physical Chemistry C, 2019, pp. 21367–75, doi:10.1021/acs.jpcc.9b05865. short: M. Mennicken, S.K. Peter, C. Kaulen, U. Simon, S. Karthäuser, The Journal of Physical Chemistry C (2019) 21367–21375. date_created: 2020-05-15T09:38:49Z date_updated: 2022-01-06T06:53:00Z doi: 10.1021/acs.jpcc.9b05865 keyword: - pc2-ressources language: - iso: eng page: 21367-21375 project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: The Journal of Physical Chemistry C publication_identifier: issn: - 1932-7447 - 1932-7455 publication_status: published status: public title: Controlling the Electronic Contact at the Terpyridine/Metal Interface type: journal_article user_id: '61189' year: '2019' ... --- _id: '17057' author: - first_name: Merle full_name: Tönnies, Merle id: '555' last_name: Tönnies - first_name: Dennis full_name: Henneböhl, Dennis last_name: Henneböhl citation: 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. Journal for the Study of British Cultures. 2019;26(2):181-193.' apa: 'Tönnies, M., & Henneböhl, D. (2019). Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith’s Seasonal Quartet as a Counter-Narrative to Brexit. Journal for the Study of British Cultures, 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} }' 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.” Journal for the Study of British Cultures 26, no. 2 (2019): 181–93.' 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,” Journal for the Study of British Cultures, vol. 26, no. 2, pp. 181–193, 2019.' 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.” Journal for the Study of British Cultures, vol. 26, no. 2, 2019, pp. 181–93.' short: M. Tönnies, D. Henneböhl, Journal for the Study of British Cultures 26 (2019) 181–193. date_created: 2020-05-25T06:36:17Z date_updated: 2022-01-06T06:53:03Z intvolume: ' 26' issue: '2' language: - iso: eng page: 181-193 publication: Journal for the Study of British Cultures publication_status: published status: public title: 'Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith''s Seasonal Quartet as a Counter-Narrative to Brexit' type: journal_article user_id: '555' volume: 26 year: '2019' ... --- _id: '17077' abstract: - lang: eng text: 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. article_number: '1720' author: - first_name: Christian full_name: Wiebeler, Christian last_name: Wiebeler - first_name: Igor full_name: Schapiro, Igor last_name: Schapiro citation: ama: Wiebeler C, Schapiro I. QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra. Molecules. 2019. doi:10.3390/molecules24091720 apa: Wiebeler, C., & Schapiro, I. (2019). QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra. Molecules. https://doi.org/10.3390/molecules24091720 bibtex: '@article{Wiebeler_Schapiro_2019, title={QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra}, DOI={10.3390/molecules24091720}, number={1720}, journal={Molecules}, author={Wiebeler, Christian and Schapiro, Igor}, year={2019} }' chicago: Wiebeler, Christian, and Igor Schapiro. “QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra.” Molecules, 2019. https://doi.org/10.3390/molecules24091720. ieee: C. Wiebeler and I. Schapiro, “QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra,” Molecules, 2019. mla: Wiebeler, Christian, and Igor Schapiro. “QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra.” Molecules, 1720, 2019, doi:10.3390/molecules24091720. short: C. Wiebeler, I. Schapiro, Molecules (2019). date_created: 2020-06-04T07:27:03Z date_updated: 2022-01-06T06:53:04Z doi: 10.3390/molecules24091720 keyword: - pc2-ressources language: - iso: eng project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Molecules publication_identifier: issn: - 1420-3049 publication_status: published status: public title: QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra type: journal_article user_id: '61189' year: '2019' ... --- _id: '17157' author: - first_name: Gudrun full_name: Oevel, Gudrun id: '14924' last_name: Oevel orcid: https://orcid.org/0000-0002-6396-9535 - first_name: Marcel full_name: Graf-Schlattmann, Marcel last_name: Graf-Schlattmann - first_name: Dorothee M. full_name: Meister, Dorothee M. id: '346' last_name: Meister - first_name: Melanie full_name: Wilde, Melanie last_name: Wilde citation: ama: Oevel G, Graf-Schlattmann M, Meister DM, Wilde M. Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung.; 2019. doi:10.5281/ZENODO.2589943 apa: Oevel, G., Graf-Schlattmann, M., Meister, D. M., & Wilde, M. (2019). Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung. https://doi.org/10.5281/ZENODO.2589943 bibtex: '@book{Oevel_Graf-Schlattmann_Meister_Wilde_2019, title={Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung}, DOI={10.5281/ZENODO.2589943}, author={Oevel, Gudrun and Graf-Schlattmann, Marcel and Meister, Dorothee M. and Wilde, Melanie}, year={2019} }' chicago: Oevel, Gudrun, Marcel Graf-Schlattmann, Dorothee M. Meister, and Melanie Wilde. Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung, 2019. https://doi.org/10.5281/ZENODO.2589943. ieee: G. Oevel, M. Graf-Schlattmann, D. M. Meister, and M. Wilde, Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung. 2019. mla: Oevel, Gudrun, et al. Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung. 2019, doi:10.5281/ZENODO.2589943. 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. date_created: 2020-06-24T10:47:05Z date_updated: 2022-01-06T06:53:05Z department: - _id: '25' - _id: '137' doi: 10.5281/ZENODO.2589943 language: - iso: ger related_material: link: - relation: confirmation url: https://zenodo.org/record/2589943 status: public title: Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung type: misc user_id: '14931' year: '2019' ... --- _id: '17160' author: - first_name: Gudrun full_name: Oevel, Gudrun id: '14924' last_name: Oevel orcid: https://orcid.org/0000-0002-6396-9535 - first_name: Eva full_name: Barlösius, Eva last_name: Barlösius 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. Zeitschrift für Bibliothekswesen und Bibliographie. 2019:156-163. doi:10.3196/186429501966413 apa: Oevel, G., & Barlösius, E. (2019). Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft. Zeitschrift für Bibliothekswesen und Bibliographie, 156–163. https://doi.org/10.3196/186429501966413 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={10.3196/186429501966413}, journal={Zeitschrift für Bibliothekswesen und Bibliographie}, author={Oevel, Gudrun and Barlösius, Eva}, year={2019}, pages={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.” Zeitschrift für Bibliothekswesen und Bibliographie, 2019, 156–63. https://doi.org/10.3196/186429501966413. 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,” Zeitschrift für Bibliothekswesen und Bibliographie, pp. 156–163, 2019. 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.” Zeitschrift für Bibliothekswesen und Bibliographie, 2019, pp. 156–63, doi:10.3196/186429501966413. short: G. Oevel, E. Barlösius, Zeitschrift für Bibliothekswesen und Bibliographie (2019) 156–163. date_created: 2020-06-24T11:02:59Z date_updated: 2022-01-06T06:53:05Z department: - _id: '25' doi: 10.3196/186429501966413 language: - iso: ger page: 156-163 publication: Zeitschrift für Bibliothekswesen und Bibliographie publication_identifier: issn: - 0044-2380 - 1864-2950 publication_status: published status: public title: Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft type: journal_article user_id: '14932' year: '2019' ... --- _id: '10577' abstract: - lang: eng 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." author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Hassan full_name: Ghasemzadeh Mohammadi, Hassan id: '61186' last_name: Ghasemzadeh Mohammadi - first_name: Matthias full_name: Artmann, Matthias last_name: Artmann - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. In: Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19. New York, NY, USA: ACM; 2019. doi:10.1145/3299874.3317998' apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., & Platzner, M. (2019). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. In Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19. New York, NY, USA: ACM. https://doi.org/10.1145/3299874.3317998' 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={10.1145/3299874.3317998}, 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} }' chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann, and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” In Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19. New York, NY, USA: ACM, 2019. https://doi.org/10.1145/3299874.3317998.' ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits,” in Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19, Tysons Corner, VA, USA, 2019.' mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19, ACM, 2019, doi:10.1145/3299874.3317998.' 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.' conference: end_date: 2019-05-11 location: Tysons Corner, VA, USA name: ACM Great Lakes Symposium on VLSI (GLSVLSI) start_date: 2019-05-09 date_created: 2019-07-08T15:13:10Z date_updated: 2022-01-06T06:50:45Z department: - _id: '78' doi: 10.1145/3299874.3317998 keyword: - Approximate computing - design automation - parameter selection - circuit synthesis language: - iso: eng place: New York, NY, USA project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI '19 publication_identifier: isbn: - '9781450362528' publication_status: published publisher: ACM status: public title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits' type: conference user_id: '49051' year: '2019' ... --- _id: '10578' author: - first_name: V. K. full_name: Tagne, V. K. last_name: Tagne - first_name: S. full_name: Fotso, S. last_name: Fotso - first_name: 'L. A. ' full_name: 'Fono, L. A. ' last_name: Fono - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: Tagne VK, Fotso S, Fono LA, Hüllermeier E. Choice Functions Generated by Mallows and Plackett–Luce Relations. New Mathematics and Natural Computation. 2019;15(2):191-213. apa: Tagne, V. K., Fotso, S., Fono, L. A., & Hüllermeier, E. (2019). Choice Functions Generated by Mallows and Plackett–Luce Relations. New Mathematics and Natural Computation, 15(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} }' chicago: 'Tagne, V. K., S. Fotso, L. A. Fono, and Eyke Hüllermeier. “Choice Functions Generated by Mallows and Plackett–Luce Relations.” New Mathematics and Natural Computation 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,” New Mathematics and Natural Computation, vol. 15, no. 2, pp. 191–213, 2019. mla: Tagne, V. K., et al. “Choice Functions Generated by Mallows and Plackett–Luce Relations.” New Mathematics and Natural Computation, vol. 15, no. 2, 2019, pp. 191–213. short: V.K. Tagne, S. Fotso, L.A. Fono, E. Hüllermeier, New Mathematics and Natural Computation 15 (2019) 191–213. date_created: 2019-07-08T15:34:03Z date_updated: 2022-01-06T06:50:45Z department: - _id: '34' - _id: '355' - _id: '7' intvolume: ' 15' issue: '2' language: - iso: eng page: 191-213 publication: New Mathematics and Natural Computation status: public title: Choice Functions Generated by Mallows and Plackett–Luce Relations type: journal_article user_id: '315' volume: 15 year: '2019' ... --- _id: '10586' abstract: - lang: eng 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. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:10.4230/LIPICS.ICALP.2019.150' apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150' bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150}, 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} }' chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150. ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14. mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150. 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.' conference: end_date: 2019-07-12 location: Patras, Greece name: ICALP 2019 start_date: 2019-07-09 date_created: 2019-07-08T17:19:01Z date_updated: 2022-01-06T06:50:45Z ddc: - '004' department: - _id: '79' doi: 10.4230/LIPICS.ICALP.2019.150 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T09:21:27Z date_updated: 2019-08-26T09:21:27Z file_id: '12955' file_name: LIPIcs-ICALP-2019-150.pdf file_size: 537649 relation: main_file success: 1 file_date_updated: 2019-08-26T09:21:27Z has_accepted_license: '1' intvolume: ' 132' keyword: - Graphs transformations - NP-hardness - approximation algorithms language: - iso: eng page: 150:1--150:14 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming publication_status: published publisher: Dagstuhl Publishing series_title: LIPIcs status: public title: On the Complexity of Local Graph Transformations type: conference user_id: '477' volume: 132 year: '2019' ... --- _id: '10593' abstract: - lang: eng 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. article_type: original author: - first_name: Sebastian full_name: Peitz, Sebastian id: '47427' last_name: Peitz orcid: https://orcid.org/0000-0002-3389-793X - first_name: Stefan full_name: Klus, Stefan last_name: Klus citation: ama: Peitz S, Klus S. Koopman operator-based model reduction for switched-system control of PDEs. Automatica. 2019;106:184-191. doi:10.1016/j.automatica.2019.05.016 apa: Peitz, S., & Klus, S. (2019). Koopman operator-based model reduction for switched-system control of PDEs. Automatica, 106, 184–191. https://doi.org/10.1016/j.automatica.2019.05.016 bibtex: '@article{Peitz_Klus_2019, title={Koopman operator-based model reduction for switched-system control of PDEs}, volume={106}, DOI={10.1016/j.automatica.2019.05.016}, journal={Automatica}, author={Peitz, Sebastian and Klus, Stefan}, year={2019}, pages={184–191} }' chicago: 'Peitz, Sebastian, and Stefan Klus. “Koopman Operator-Based Model Reduction for Switched-System Control of PDEs.” Automatica 106 (2019): 184–91. https://doi.org/10.1016/j.automatica.2019.05.016.' ieee: S. Peitz and S. Klus, “Koopman operator-based model reduction for switched-system control of PDEs,” Automatica, vol. 106, pp. 184–191, 2019. mla: Peitz, Sebastian, and Stefan Klus. “Koopman Operator-Based Model Reduction for Switched-System Control of PDEs.” Automatica, vol. 106, 2019, pp. 184–91, doi:10.1016/j.automatica.2019.05.016. short: S. Peitz, S. Klus, Automatica 106 (2019) 184–191. date_created: 2019-07-10T08:08:16Z date_updated: 2022-01-06T06:50:46Z department: - _id: '101' doi: 10.1016/j.automatica.2019.05.016 intvolume: ' 106' language: - iso: eng page: 184-191 publication: Automatica publication_identifier: issn: - 0005-1098 publication_status: published status: public title: Koopman operator-based model reduction for switched-system control of PDEs type: journal_article user_id: '47427' volume: 106 year: '2019' ... --- _id: '10595' 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. article_type: original author: - first_name: Bennet full_name: Gebken, Bennet id: '32643' last_name: Gebken - first_name: Sebastian full_name: Peitz, Sebastian id: '47427' last_name: Peitz orcid: https://orcid.org/0000-0002-3389-793X - first_name: Michael full_name: Dellnitz, Michael last_name: Dellnitz citation: ama: Gebken B, Peitz S, Dellnitz M. On the hierarchical structure of Pareto critical sets. Journal of Global Optimization. 2019;73(4):891-913. doi:10.1007/s10898-019-00737-6 apa: Gebken, B., Peitz, S., & Dellnitz, M. (2019). On the hierarchical structure of Pareto critical sets. Journal of Global Optimization, 73(4), 891–913. https://doi.org/10.1007/s10898-019-00737-6 bibtex: '@article{Gebken_Peitz_Dellnitz_2019, title={On the hierarchical structure of Pareto critical sets}, volume={73}, DOI={10.1007/s10898-019-00737-6}, number={4}, journal={Journal of Global Optimization}, author={Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}, year={2019}, pages={891–913} }' chicago: 'Gebken, Bennet, Sebastian Peitz, and Michael Dellnitz. “On the Hierarchical Structure of Pareto Critical Sets.” Journal of Global Optimization 73, no. 4 (2019): 891–913. https://doi.org/10.1007/s10898-019-00737-6.' ieee: B. Gebken, S. Peitz, and M. Dellnitz, “On the hierarchical structure of Pareto critical sets,” Journal of Global Optimization, vol. 73, no. 4, pp. 891–913, 2019. mla: Gebken, Bennet, et al. “On the Hierarchical Structure of Pareto Critical Sets.” Journal of Global Optimization, vol. 73, no. 4, 2019, pp. 891–913, doi:10.1007/s10898-019-00737-6. short: B. Gebken, S. Peitz, M. Dellnitz, Journal of Global Optimization 73 (2019) 891–913. date_created: 2019-07-10T08:13:31Z date_updated: 2022-01-06T06:50:46Z department: - _id: '101' doi: 10.1007/s10898-019-00737-6 intvolume: ' 73' issue: '4' language: - iso: eng page: 891-913 publication: Journal of Global Optimization publication_identifier: issn: - 0925-5001 - 1573-2916 publication_status: published status: public title: On the hierarchical structure of Pareto critical sets type: journal_article user_id: '47427' volume: 73 year: '2019' ...