[{"type":"journal_article","publication":"The Journal of Chemical Physics","status":"public","user_id":"61189","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"16955","language":[{"iso":"eng"}],"article_number":"044704","keyword":["pc2-ressources"],"publication_status":"published","publication_identifier":{"issn":["0021-9606","1089-7690"]},"citation":{"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).","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} }","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>.","ieee":"M. Heinen and J. Vrabec, “Evaporation sampled by stationary molecular dynamics simulation,” <i>The Journal of Chemical Physics</i>, 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>.","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>"},"year":"2019","author":[{"last_name":"Heinen","full_name":"Heinen, Matthias","first_name":"Matthias"},{"full_name":"Vrabec, Jadran","last_name":"Vrabec","first_name":"Jadran"}],"date_created":"2020-05-15T07:25:04Z","date_updated":"2022-01-06T06:53:00Z","doi":"10.1063/1.5111759","title":"Evaporation sampled by stationary molecular dynamics simulation"},{"language":[{"iso":"eng"}],"article_number":"e1643046","keyword":["pc2-ressources"],"user_id":"61189","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"16958","status":"public","type":"journal_article","publication":"Molecular Physics","doi":"10.1080/00268976.2019.1643046","title":"Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration","author":[{"first_name":"Robin","full_name":"Fingerhut, Robin","last_name":"Fingerhut"},{"first_name":"Gerhard","full_name":"Herres, Gerhard","last_name":"Herres"},{"first_name":"Jadran","full_name":"Vrabec, Jadran","last_name":"Vrabec"}],"date_created":"2020-05-15T07:25:34Z","date_updated":"2022-01-06T06:53:00Z","citation":{"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} }","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>.","short":"R. Fingerhut, G. Herres, J. Vrabec, Molecular Physics (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>","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>.","ieee":"R. Fingerhut, G. Herres, and J. Vrabec, “Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration,” <i>Molecular Physics</i>, 2019."},"year":"2019","publication_status":"published","publication_identifier":{"issn":["0026-8976","1362-3028"]}},{"status":"public","type":"journal_article","publication":"The Journal of Physical Chemistry C","language":[{"iso":"eng"}],"keyword":["pc2-ressources"],"user_id":"61189","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"16960","citation":{"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>","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.","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>.","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} }","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>.","short":"M. Mennicken, S.K. Peter, C. Kaulen, U. Simon, S. Karthäuser, The Journal of Physical Chemistry C (2019) 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>"},"page":"21367-21375","year":"2019","publication_status":"published","publication_identifier":{"issn":["1932-7447","1932-7455"]},"doi":"10.1021/acs.jpcc.9b05865","title":"Controlling the Electronic Contact at the Terpyridine/Metal Interface","date_created":"2020-05-15T09:38:49Z","author":[{"last_name":"Mennicken","full_name":"Mennicken, Max","first_name":"Max"},{"last_name":"Peter","full_name":"Peter, Sophia Katharina","first_name":"Sophia Katharina"},{"last_name":"Kaulen","full_name":"Kaulen, Corinna","first_name":"Corinna"},{"full_name":"Simon, Ulrich","last_name":"Simon","first_name":"Ulrich"},{"last_name":"Karthäuser","full_name":"Karthäuser, Silvia","first_name":"Silvia"}],"date_updated":"2022-01-06T06:53:00Z"},{"page":"181-193","intvolume":"        26","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. <i>Journal for the Study of British Cultures</i>. 2019;26(2):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.","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.","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.","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.","short":"M. Tönnies, D. Henneböhl, Journal for the Study of British Cultures 26 (2019) 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} }"},"year":"2019","issue":"2","publication_status":"published","title":"Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith's Seasonal Quartet as a Counter-Narrative to Brexit","volume":26,"date_created":"2020-05-25T06:36:17Z","author":[{"last_name":"Tönnies","full_name":"Tönnies, Merle","id":"555","first_name":"Merle"},{"first_name":"Dennis","full_name":"Henneböhl, Dennis","last_name":"Henneböhl"}],"date_updated":"2022-01-06T06:53:03Z","status":"public","publication":"Journal for the Study of British Cultures","type":"journal_article","language":[{"iso":"eng"}],"user_id":"555","_id":"17057"},{"doi":"10.3390/molecules24091720","title":"QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra","author":[{"first_name":"Christian","full_name":"Wiebeler, Christian","last_name":"Wiebeler"},{"last_name":"Schapiro","full_name":"Schapiro, Igor","first_name":"Igor"}],"date_created":"2020-06-04T07:27:03Z","date_updated":"2022-01-06T06:53:04Z","citation":{"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>.","ieee":"C. Wiebeler and I. Schapiro, “QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra,” <i>Molecules</i>, 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>","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} }","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>.","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>"},"year":"2019","publication_identifier":{"issn":["1420-3049"]},"publication_status":"published","language":[{"iso":"eng"}],"keyword":["pc2-ressources"],"article_number":"1720","user_id":"61189","_id":"17077","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","abstract":[{"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>","lang":"eng"}],"publication":"Molecules","type":"journal_article"},{"related_material":{"link":[{"url":"https://zenodo.org/record/2589943","relation":"confirmation"}]},"year":"2019","citation":{"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>","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.","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>.","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.","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} }","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>.","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>"},"date_updated":"2022-01-06T06:53:05Z","author":[{"first_name":"Gudrun","last_name":"Oevel","orcid":"https://orcid.org/0000-0002-6396-9535","id":"14924","full_name":"Oevel, Gudrun"},{"last_name":"Graf-Schlattmann","full_name":"Graf-Schlattmann, Marcel","first_name":"Marcel"},{"last_name":"Meister","full_name":"Meister, Dorothee M.","id":"346","first_name":"Dorothee M."},{"first_name":"Melanie","full_name":"Wilde, Melanie","last_name":"Wilde"}],"date_created":"2020-06-24T10:47:05Z","title":"Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung","doi":"10.5281/ZENODO.2589943","type":"misc","status":"public","_id":"17157","user_id":"14931","department":[{"_id":"25"},{"_id":"137"}],"language":[{"iso":"ger"}]},{"language":[{"iso":"ger"}],"department":[{"_id":"25"}],"user_id":"14932","_id":"17160","status":"public","publication":"Zeitschrift für Bibliothekswesen und Bibliographie","type":"journal_article","doi":"10.3196/186429501966413","title":"Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft","author":[{"last_name":"Oevel","orcid":"https://orcid.org/0000-0002-6396-9535","full_name":"Oevel, Gudrun","id":"14924","first_name":"Gudrun"},{"first_name":"Eva","last_name":"Barlösius","full_name":"Barlösius, Eva"}],"date_created":"2020-06-24T11:02:59Z","date_updated":"2022-01-06T06:53:05Z","page":"156-163","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>","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>.","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.","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>","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.","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} }"},"year":"2019","publication_identifier":{"issn":["0044-2380","1864-2950"]},"publication_status":"published"},{"department":[{"_id":"78"}],"user_id":"49051","_id":"10577","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"status":"public","type":"conference","doi":"10.1145/3299874.3317998","conference":{"end_date":"2019-05-11","location":"Tysons Corner, VA, USA","name":"ACM Great Lakes Symposium on VLSI (GLSVLSI)","start_date":"2019-05-09"},"author":[{"last_name":"Witschen","full_name":"Witschen, Linus Matthias","id":"49051","first_name":"Linus Matthias"},{"first_name":"Hassan","id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan","last_name":"Ghasemzadeh Mohammadi"},{"first_name":"Matthias","last_name":"Artmann","full_name":"Artmann, Matthias"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_updated":"2022-01-06T06:50:45Z","citation":{"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>.","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.","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>","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>","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} }","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.","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>."},"place":"New York, NY, USA","publication_identifier":{"isbn":["9781450362528"]},"publication_status":"published","language":[{"iso":"eng"}],"keyword":["Approximate computing","design automation","parameter selection","circuit synthesis"],"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."}],"publication":"Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI '19","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","date_created":"2019-07-08T15:13:10Z","publisher":"ACM","year":"2019"},{"citation":{"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.","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.","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.","short":"V.K. Tagne, S. Fotso, L.A. Fono, E. Hüllermeier, New Mathematics and Natural Computation 15 (2019) 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} }","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.","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."},"intvolume":"        15","page":"191-213","year":"2019","issue":"2","title":"Choice Functions Generated by Mallows and Plackett–Luce Relations","author":[{"first_name":"V. K.","full_name":"Tagne, V. K.","last_name":"Tagne"},{"first_name":"S.","full_name":"Fotso, S.","last_name":"Fotso"},{"full_name":"Fono, L. A. ","last_name":"Fono","first_name":"L. A. "},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"date_created":"2019-07-08T15:34:03Z","volume":15,"date_updated":"2022-01-06T06:50:45Z","status":"public","type":"journal_article","publication":"New Mathematics and Natural Computation","language":[{"iso":"eng"}],"user_id":"315","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"_id":"10578"},{"date_created":"2019-07-08T17:19:01Z","publisher":"Dagstuhl Publishing","title":"On the Complexity of Local Graph Transformations","year":"2019","language":[{"iso":"eng"}],"ddc":["004"],"keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","file":[{"date_updated":"2019-08-26T09:21:27Z","creator":"ups","date_created":"2019-08-26T09:21:27Z","file_size":537649,"file_name":"LIPIcs-ICALP-2019-150.pdf","access_level":"closed","file_id":"12955","content_type":"application/pdf","success":1,"relation":"main_file"}],"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"}],"author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"}],"volume":132,"date_updated":"2022-01-06T06:50:45Z","doi":"10.4230/LIPICS.ICALP.2019.150","conference":{"end_date":"2019-07-12","location":"Patras, Greece","name":"ICALP 2019","start_date":"2019-07-09"},"publication_status":"published","has_accepted_license":"1","citation":{"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>","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.","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>.","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.","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} }","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>.","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>"},"page":"150:1--150:14","intvolume":"       132","user_id":"477","series_title":"LIPIcs","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"10586","file_date_updated":"2019-08-26T09:21:27Z","type":"conference","status":"public"},{"publication_status":"published","publication_identifier":{"issn":["0005-1098"]},"citation":{"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>","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>.","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.","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>","short":"S. Peitz, S. Klus, Automatica 106 (2019) 184–191.","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} }","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>."},"intvolume":"       106","page":"184-191","year":"2019","date_created":"2019-07-10T08:08:16Z","author":[{"id":"47427","full_name":"Peitz, Sebastian","last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X","first_name":"Sebastian"},{"full_name":"Klus, Stefan","last_name":"Klus","first_name":"Stefan"}],"volume":106,"date_updated":"2022-01-06T06:50:46Z","doi":"10.1016/j.automatica.2019.05.016","title":"Koopman operator-based model reduction for switched-system control of PDEs","type":"journal_article","publication":"Automatica","status":"public","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."}],"user_id":"47427","department":[{"_id":"101"}],"_id":"10593","language":[{"iso":"eng"}],"article_type":"original"},{"issue":"4","year":"2019","date_created":"2019-07-10T08:13:31Z","title":"On the hierarchical structure of Pareto critical sets","publication":"Journal of Global Optimization","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."}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0925-5001","1573-2916"]},"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>","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.","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>.","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>","short":"B. Gebken, S. Peitz, M. Dellnitz, Journal of Global Optimization 73 (2019) 891–913.","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>."},"intvolume":"        73","page":"891-913","date_updated":"2022-01-06T06:50:46Z","author":[{"first_name":"Bennet","last_name":"Gebken","full_name":"Gebken, Bennet","id":"32643"},{"first_name":"Sebastian","last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X","full_name":"Peitz, Sebastian","id":"47427"},{"first_name":"Michael","full_name":"Dellnitz, Michael","last_name":"Dellnitz"}],"volume":73,"doi":"10.1007/s10898-019-00737-6","type":"journal_article","status":"public","_id":"10595","user_id":"47427","department":[{"_id":"101"}],"article_type":"original"},{"title":"Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification","doi":"10.1109/precede.2019.8753313","date_updated":"2022-01-06T06:50:46Z","date_created":"2019-07-10T08:15:23Z","author":[{"last_name":"Hanke","full_name":"Hanke, Soren","first_name":"Soren"},{"id":"47427","full_name":"Peitz, Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz","first_name":"Sebastian"},{"first_name":"Oliver","last_name":"Wallscheid","full_name":"Wallscheid, Oliver"},{"full_name":"Böcker, Joachim","last_name":"Böcker","first_name":"Joachim"},{"first_name":"Michael","full_name":"Dellnitz, Michael","last_name":"Dellnitz"}],"year":"2019","citation":{"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} }","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.","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>","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>","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>.","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."},"publication_status":"published","publication_identifier":{"isbn":["9781538694145"]},"language":[{"iso":"eng"}],"_id":"10597","user_id":"47427","department":[{"_id":"101"}],"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."}],"status":"public","type":"conference","publication":"2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)"},{"date_updated":"2022-01-06T06:50:50Z","date_created":"2019-07-11T08:25:41Z","author":[{"first_name":"Gohar Feroz","last_name":"Khan","full_name":"Khan, Gohar Feroz"},{"last_name":"Trier","id":"72744","full_name":"Trier, Matthias","first_name":"Matthias"}],"volume":28,"title":"Assessing the long-term fragmentation of information systems research with a longitudinal multi-network analysis","doi":"10.1080/0960085x.2018.1547853","publication_status":"published","publication_identifier":{"issn":["0960-085X","1476-9344"]},"issue":"4","year":"2019","citation":{"ama":"Khan GF, Trier M. Assessing the long-term fragmentation of information systems research with a longitudinal multi-network analysis. <i>European Journal of Information Systems</i>. 2019;28(4):370-393. doi:<a href=\"https://doi.org/10.1080/0960085x.2018.1547853\">10.1080/0960085x.2018.1547853</a>","ieee":"G. F. Khan and M. Trier, “Assessing the long-term fragmentation of information systems research with a longitudinal multi-network analysis,” <i>European Journal of Information Systems</i>, vol. 28, no. 4, pp. 370–393, 2019.","chicago":"Khan, Gohar Feroz, and Matthias Trier. “Assessing the Long-Term Fragmentation of Information Systems Research with a Longitudinal Multi-Network Analysis.” <i>European Journal of Information Systems</i> 28, no. 4 (2019): 370–93. <a href=\"https://doi.org/10.1080/0960085x.2018.1547853\">https://doi.org/10.1080/0960085x.2018.1547853</a>.","short":"G.F. Khan, M. Trier, European Journal of Information Systems 28 (2019) 370–393.","mla":"Khan, Gohar Feroz, and Matthias Trier. “Assessing the Long-Term Fragmentation of Information Systems Research with a Longitudinal Multi-Network Analysis.” <i>European Journal of Information Systems</i>, vol. 28, no. 4, 2019, pp. 370–93, doi:<a href=\"https://doi.org/10.1080/0960085x.2018.1547853\">10.1080/0960085x.2018.1547853</a>.","bibtex":"@article{Khan_Trier_2019, title={Assessing the long-term fragmentation of information systems research with a longitudinal multi-network analysis}, volume={28}, DOI={<a href=\"https://doi.org/10.1080/0960085x.2018.1547853\">10.1080/0960085x.2018.1547853</a>}, number={4}, journal={European Journal of Information Systems}, author={Khan, Gohar Feroz and Trier, Matthias}, year={2019}, pages={370–393} }","apa":"Khan, G. F., &#38; Trier, M. (2019). Assessing the long-term fragmentation of information systems research with a longitudinal multi-network analysis. <i>European Journal of Information Systems</i>, <i>28</i>(4), 370–393. <a href=\"https://doi.org/10.1080/0960085x.2018.1547853\">https://doi.org/10.1080/0960085x.2018.1547853</a>"},"page":"370-393","intvolume":"        28","_id":"10792","user_id":"72744","department":[{"_id":"198"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"European Journal of Information Systems","status":"public"},{"citation":{"ieee":"M. Potthast <i>et al.</i>, “Argument Search: Assessing Argument Relevance,” in <i>42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)</i>, 2019, pp. 1117–1120.","chicago":"Potthast, Martin, Lukas Gienapp, Florian Euchner, Nick Heilenkötter, Nico Weidmann, Henning Wachsmuth, Benno Stein, and Matthias Hagen. “Argument Search: Assessing Argument Relevance.” In <i>42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)</i>, 1117–20. ACM, 2019. <a href=\"https://doi.org/10.1145/3331184.3331327\">https://doi.org/10.1145/3331184.3331327</a>.","ama":"Potthast M, Gienapp L, Euchner F, et al. Argument Search: Assessing Argument Relevance. In: <i>42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)</i>. ACM; 2019:1117-1120. doi:<a href=\"https://doi.org/10.1145/3331184.3331327\">10.1145/3331184.3331327</a>","apa":"Potthast, M., Gienapp, L., Euchner, F., Heilenkötter, N., Weidmann, N., Wachsmuth, H., … Hagen, M. (2019). Argument Search: Assessing Argument Relevance. In <i>42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)</i> (pp. 1117–1120). ACM. <a href=\"https://doi.org/10.1145/3331184.3331327\">https://doi.org/10.1145/3331184.3331327</a>","bibtex":"@inproceedings{Potthast_Gienapp_Euchner_Heilenkötter_Weidmann_Wachsmuth_Stein_Hagen_2019, title={Argument Search: Assessing Argument Relevance}, DOI={<a href=\"https://doi.org/10.1145/3331184.3331327\">10.1145/3331184.3331327</a>}, booktitle={42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)}, publisher={ACM}, author={Potthast, Martin and Gienapp, Lukas and Euchner, Florian and Heilenkötter, Nick and Weidmann, Nico and Wachsmuth, Henning and Stein, Benno and Hagen, Matthias}, year={2019}, pages={1117–1120} }","mla":"Potthast, Martin, et al. “Argument Search: Assessing Argument Relevance.” <i>42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)</i>, ACM, 2019, pp. 1117–20, doi:<a href=\"https://doi.org/10.1145/3331184.3331327\">10.1145/3331184.3331327</a>.","short":"M. Potthast, L. Gienapp, F. Euchner, N. Heilenkötter, N. Weidmann, H. Wachsmuth, B. Stein, M. Hagen, in: 42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019), ACM, 2019, pp. 1117–1120."},"page":"1117 - 1120","year":"2019","main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3331184.3331327"}],"doi":"10.1145/3331184.3331327","title":"Argument Search: Assessing Argument Relevance","date_created":"2019-07-11T13:09:41Z","author":[{"full_name":"Potthast, Martin","last_name":"Potthast","first_name":"Martin"},{"last_name":"Gienapp","full_name":"Gienapp, Lukas","first_name":"Lukas"},{"first_name":"Florian","last_name":"Euchner","full_name":"Euchner, Florian"},{"first_name":"Nick","last_name":"Heilenkötter","full_name":"Heilenkötter, Nick"},{"first_name":"Nico","full_name":"Weidmann, Nico","last_name":"Weidmann"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"},{"first_name":"Matthias","last_name":"Hagen","full_name":"Hagen, Matthias"}],"publisher":"ACM","date_updated":"2022-01-06T06:51:06Z","status":"public","type":"conference","publication":"42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)","language":[{"iso":"eng"}],"user_id":"82920","department":[{"_id":"600"},{"_id":"568"}],"_id":"11709"},{"language":[{"iso":"eng"}],"user_id":"3900","department":[{"_id":"600"}],"_id":"11713","status":"public","type":"review","publication":"Computational Linguistics","title":"Book Review: Argumentation Mining","author":[{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"}],"date_created":"2019-07-11T13:29:48Z","volume":45,"date_updated":"2022-01-06T06:51:07Z","publisher":"ACL","citation":{"ieee":"H. Wachsmuth, “Book Review: Argumentation Mining,” <i>Computational Linguistics</i>, vol. 45, no. 3. ACL, pp. 603–606, 2019.","chicago":"Wachsmuth, Henning. “Book Review: Argumentation Mining.” <i>Computational Linguistics</i>. ACL, 2019.","ama":"Wachsmuth H. Book Review: Argumentation Mining. <i>Computational Linguistics</i>. 2019;45(3):603-606.","bibtex":"@article{Wachsmuth_2019, title={Book Review: Argumentation Mining}, volume={45}, number={3}, journal={Computational Linguistics}, publisher={ACL}, author={Wachsmuth, Henning}, year={2019}, pages={603–606} }","mla":"Wachsmuth, Henning. “Book Review: Argumentation Mining.” <i>Computational Linguistics</i>, vol. 45, no. 3, ACL, 2019, pp. 603–06.","short":"H. Wachsmuth, Computational Linguistics 45 (2019) 603–606.","apa":"Wachsmuth, H. (2019). Book Review: Argumentation Mining. <i>Computational Linguistics</i>. ACL."},"page":"603 - 606","intvolume":"        45","year":"2019","issue":"3"},{"year":"2019","citation":{"chicago":"Ajjour, Yamen, Henning Wachsmuth, Johannes  Kiesel, Martin Potthast, Matthias Hagen, and Benno Stein. “Data Acquisition for Argument Search: The Args.Me Corpus.” In <i>Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence</i>, 48–59, 2019.","ieee":"Y. Ajjour, H. Wachsmuth, J.  Kiesel, M. Potthast, M. Hagen, and B. Stein, “Data Acquisition for Argument Search: The args.me Corpus,” in <i>Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence</i>, 2019, pp. 48–59.","ama":"Ajjour Y, Wachsmuth H,  Kiesel J, Potthast M, Hagen M, Stein B. Data Acquisition for Argument Search: The args.me Corpus. In: <i>Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence</i>. ; 2019:48-59.","apa":"Ajjour, Y., Wachsmuth, H.,  Kiesel, J., Potthast, M., Hagen, M., &#38; Stein, B. (2019). Data Acquisition for Argument Search: The args.me Corpus. In <i>Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence</i> (pp. 48–59).","bibtex":"@inproceedings{Ajjour_Wachsmuth_ Kiesel_Potthast_Hagen_Stein_2019, title={Data Acquisition for Argument Search: The args.me Corpus}, booktitle={Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence}, author={Ajjour, Yamen and Wachsmuth, Henning and  Kiesel, Johannes and Potthast, Martin and Hagen, Matthias and Stein, Benno}, year={2019}, pages={48–59} }","mla":"Ajjour, Yamen, et al. “Data Acquisition for Argument Search: The Args.Me Corpus.” <i>Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence</i>, 2019, pp. 48–59.","short":"Y. Ajjour, H. Wachsmuth, J.  Kiesel, M. Potthast, M. Hagen, B. Stein, in: Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence, 2019, pp. 48–59."},"page":"48-59","title":"Data Acquisition for Argument Search: The args.me Corpus","main_file_link":[{"url":"https://webis.de/downloads/publications/papers/stein_2019p.pdf"}],"date_updated":"2022-01-06T06:51:07Z","author":[{"first_name":"Yamen","full_name":"Ajjour, Yamen","last_name":"Ajjour"},{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"},{"first_name":"Johannes","full_name":" Kiesel, Johannes","last_name":" Kiesel"},{"last_name":"Potthast","full_name":"Potthast, Martin","first_name":"Martin"},{"first_name":"Matthias","last_name":"Hagen","full_name":"Hagen, Matthias"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"}],"date_created":"2019-07-11T13:43:15Z","status":"public","type":"conference","publication":"Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence","language":[{"iso":"eng"}],"_id":"11714","user_id":"82920","department":[{"_id":"600"},{"_id":"568"}]},{"date_created":"2019-07-12T13:13:55Z","author":[{"first_name":"Alexander","full_name":"Boschmann, Alexander","last_name":"Boschmann"},{"first_name":"Andreas","full_name":"Agne, Andreas","last_name":"Agne"},{"first_name":"Georg","full_name":"Thombansen, Georg","last_name":"Thombansen"},{"first_name":"Linus Matthias","last_name":"Witschen","full_name":"Witschen, Linus Matthias","id":"49051"},{"last_name":"Kraus","full_name":"Kraus, Florian","first_name":"Florian"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"volume":123,"date_updated":"2022-01-06T06:51:13Z","publisher":"Elsevier","doi":"10.1016/j.jpdc.2018.07.004","title":"Zynq-based acceleration of robust high density myoelectric signal processing","publication_status":"published","publication_identifier":{"issn":["0743-7315"]},"citation":{"ieee":"A. Boschmann, A. Agne, G. Thombansen, L. M. Witschen, F. Kraus, and M. Platzner, “Zynq-based acceleration of robust high density myoelectric signal processing,” <i>Journal of Parallel and Distributed Computing</i>, vol. 123, pp. 77–89, 2019.","chicago":"Boschmann, Alexander, Andreas Agne, Georg Thombansen, Linus Matthias Witschen, Florian Kraus, and Marco Platzner. “Zynq-Based Acceleration of Robust High Density Myoelectric Signal Processing.” <i>Journal of Parallel and Distributed Computing</i> 123 (2019): 77–89. <a href=\"https://doi.org/10.1016/j.jpdc.2018.07.004\">https://doi.org/10.1016/j.jpdc.2018.07.004</a>.","ama":"Boschmann A, Agne A, Thombansen G, Witschen LM, Kraus F, Platzner M. Zynq-based acceleration of robust high density myoelectric signal processing. <i>Journal of Parallel and Distributed Computing</i>. 2019;123:77-89. doi:<a href=\"https://doi.org/10.1016/j.jpdc.2018.07.004\">10.1016/j.jpdc.2018.07.004</a>","bibtex":"@article{Boschmann_Agne_Thombansen_Witschen_Kraus_Platzner_2019, title={Zynq-based acceleration of robust high density myoelectric signal processing}, volume={123}, DOI={<a href=\"https://doi.org/10.1016/j.jpdc.2018.07.004\">10.1016/j.jpdc.2018.07.004</a>}, journal={Journal of Parallel and Distributed Computing}, publisher={Elsevier}, author={Boschmann, Alexander and Agne, Andreas and Thombansen, Georg and Witschen, Linus Matthias and Kraus, Florian and Platzner, Marco}, year={2019}, pages={77–89} }","short":"A. Boschmann, A. Agne, G. Thombansen, L.M. Witschen, F. Kraus, M. Platzner, Journal of Parallel and Distributed Computing 123 (2019) 77–89.","mla":"Boschmann, Alexander, et al. “Zynq-Based Acceleration of Robust High Density Myoelectric Signal Processing.” <i>Journal of Parallel and Distributed Computing</i>, vol. 123, Elsevier, 2019, pp. 77–89, doi:<a href=\"https://doi.org/10.1016/j.jpdc.2018.07.004\">10.1016/j.jpdc.2018.07.004</a>.","apa":"Boschmann, A., Agne, A., Thombansen, G., Witschen, L. M., Kraus, F., &#38; Platzner, M. (2019). Zynq-based acceleration of robust high density myoelectric signal processing. <i>Journal of Parallel and Distributed Computing</i>, <i>123</i>, 77–89. <a href=\"https://doi.org/10.1016/j.jpdc.2018.07.004\">https://doi.org/10.1016/j.jpdc.2018.07.004</a>"},"page":"77-89","intvolume":"       123","year":"2019","user_id":"398","department":[{"_id":"78"}],"_id":"11950","language":[{"iso":"eng"}],"keyword":["High density electromyography","FPGA acceleration","Medical signal processing","Pattern recognition","Prosthetics"],"type":"journal_article","publication":"Journal of Parallel and Distributed Computing","status":"public","abstract":[{"text":"Advances in electromyographic (EMG) sensor technology and machine learning algorithms have led to an increased research effort into high density EMG-based pattern recognition methods for prosthesis control. With the goal set on an autonomous multi-movement prosthesis capable of performing training and classification of an amputee’s EMG signals, the focus of this paper lies in the acceleration of the embedded signal processing chain. We present two Xilinx Zynq-based architectures for accelerating two inherently different high density EMG-based control algorithms. The first hardware accelerated design achieves speed-ups of up to 4.8 over the software-only solution, allowing for a processing delay lower than the sample period of 1 ms. The second system achieved a speed-up of 5.5 over the software-only version and operates at a still satisfactory low processing delay of up to 15 ms while providing a higher reliability and robustness against electrode shift and noisy channels.","lang":"eng"}]},{"publication":"Design, User Experience, and Usability. Practice and Case Studies","type":"book_chapter","status":"public","department":[{"_id":"66"}],"user_id":"9109","_id":"11952","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783030235345","9783030235352"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ieee":"B. Senft, F. Rittmeier, H. G. Fischer, and S. Oberthür, “A Value-Centered Approach for Unique and Novel Software Applications,” in <i>Design, User Experience, and Usability. Practice and Case Studies</i>, Cham, 2019.","chicago":"Senft, Björn, Florian Rittmeier, Holger Gerhard Fischer, and Simon Oberthür. “A Value-Centered Approach for Unique and Novel Software Applications.” In <i>Design, User Experience, and Usability. Practice and Case Studies</i>. Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-23535-2_27\">https://doi.org/10.1007/978-3-030-23535-2_27</a>.","ama":"Senft B, Rittmeier F, Fischer HG, Oberthür S. A Value-Centered Approach for Unique and Novel Software Applications. In: <i>Design, User Experience, and Usability. Practice and Case Studies</i>. Cham; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-23535-2_27\">10.1007/978-3-030-23535-2_27</a>","apa":"Senft, B., Rittmeier, F., Fischer, H. G., &#38; Oberthür, S. (2019). A Value-Centered Approach for Unique and Novel Software Applications. In <i>Design, User Experience, and Usability. Practice and Case Studies</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-23535-2_27\">https://doi.org/10.1007/978-3-030-23535-2_27</a>","bibtex":"@inbook{Senft_Rittmeier_Fischer_Oberthür_2019, place={Cham}, title={A Value-Centered Approach for Unique and Novel Software Applications}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-23535-2_27\">10.1007/978-3-030-23535-2_27</a>}, booktitle={Design, User Experience, and Usability. Practice and Case Studies}, author={Senft, Björn and Rittmeier, Florian and Fischer, Holger Gerhard and Oberthür, Simon}, year={2019} }","mla":"Senft, Björn, et al. “A Value-Centered Approach for Unique and Novel Software Applications.” <i>Design, User Experience, and Usability. Practice and Case Studies</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-23535-2_27\">10.1007/978-3-030-23535-2_27</a>.","short":"B. Senft, F. Rittmeier, H.G. Fischer, S. Oberthür, in: Design, User Experience, and Usability. Practice and Case Studies, Cham, 2019."},"year":"2019","place":"Cham","date_created":"2019-07-14T07:57:53Z","author":[{"first_name":"Björn","full_name":"Senft, Björn","id":"9109","last_name":"Senft"},{"id":"5281","full_name":"Rittmeier, Florian","last_name":"Rittmeier","first_name":"Florian"},{"first_name":"Holger Gerhard","last_name":"Fischer","id":"30457","full_name":"Fischer, Holger Gerhard"},{"id":"383","full_name":"Oberthür, Simon","last_name":"Oberthür","first_name":"Simon"}],"date_updated":"2022-01-06T06:51:13Z","conference":{"end_date":"2019-07-31","location":"Orlando, FL, USA","name":"21st International Conference on Human-Computer Interaction","start_date":"2019-07-26"},"doi":"10.1007/978-3-030-23535-2_27","title":"A Value-Centered Approach for Unique and Novel Software Applications"},{"status":"public","type":"journal_article","funded_apc":"1","article_type":"original","user_id":"30525","department":[{"_id":"15"},{"_id":"230"},{"_id":"289"},{"_id":"429"}],"project":[{"_id":"54","name":"TRR 142 - Project Area A"},{"name":"TRR 142 - Subproject A8","_id":"65"},{"_id":"53","name":"TRR 142"}],"_id":"11953","citation":{"bibtex":"@article{Frese_Wei_Wang_Huang_Zentgraf_2019, title={Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces}, volume={19}, DOI={<a href=\"https://doi.org/10.1021/acs.nanolett.9b01298\">10.1021/acs.nanolett.9b01298</a>}, number={6}, journal={Nano Letters}, author={Frese, Daniel and Wei, Qunshuo and Wang, Yongtian and Huang, Lingling and Zentgraf, Thomas}, year={2019}, pages={3976–3980} }","mla":"Frese, Daniel, et al. “Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces.” <i>Nano Letters</i>, vol. 19, no. 6, 2019, pp. 3976–80, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.9b01298\">10.1021/acs.nanolett.9b01298</a>.","short":"D. Frese, Q. Wei, Y. Wang, L. Huang, T. Zentgraf, Nano Letters 19 (2019) 3976–3980.","apa":"Frese, D., Wei, Q., Wang, Y., Huang, L., &#38; Zentgraf, T. (2019). Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces. <i>Nano Letters</i>, <i>19</i>(6), 3976–3980. <a href=\"https://doi.org/10.1021/acs.nanolett.9b01298\">https://doi.org/10.1021/acs.nanolett.9b01298</a>","ama":"Frese D, Wei Q, Wang Y, Huang L, Zentgraf T. Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces. <i>Nano Letters</i>. 2019;19(6):3976-3980. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.9b01298\">10.1021/acs.nanolett.9b01298</a>","ieee":"D. Frese, Q. Wei, Y. Wang, L. Huang, and T. Zentgraf, “Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces,” <i>Nano Letters</i>, vol. 19, no. 6, pp. 3976–3980, 2019, doi: <a href=\"https://doi.org/10.1021/acs.nanolett.9b01298\">10.1021/acs.nanolett.9b01298</a>.","chicago":"Frese, Daniel, Qunshuo Wei, Yongtian Wang, Lingling Huang, and Thomas Zentgraf. “Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces.” <i>Nano Letters</i> 19, no. 6 (2019): 3976–80. <a href=\"https://doi.org/10.1021/acs.nanolett.9b01298\">https://doi.org/10.1021/acs.nanolett.9b01298</a>."},"page":"3976-3980","intvolume":"        19","publication_status":"published","publication_identifier":{"issn":["1530-6984","1530-6992"]},"pmid":"1","doi":"10.1021/acs.nanolett.9b01298","author":[{"full_name":"Frese, Daniel","last_name":"Frese","first_name":"Daniel"},{"last_name":"Wei","full_name":"Wei, Qunshuo","first_name":"Qunshuo"},{"last_name":"Wang","full_name":"Wang, Yongtian","first_name":"Yongtian"},{"first_name":"Lingling","full_name":"Huang, Lingling","last_name":"Huang"},{"first_name":"Thomas","last_name":"Zentgraf","orcid":"0000-0002-8662-1101","id":"30525","full_name":"Zentgraf, Thomas"}],"volume":19,"date_updated":"2022-01-06T06:51:13Z","abstract":[{"lang":"eng","text":"As flexible optical devices that can manipulate the phase and amplitude of light, metasurfaces would clearly benefit from directional optical properties. However, single layer metasurface systems consisting of two-dimensional nanoparticle arrays exhibit only a weak spatial asymmetry perpendicular to the surface and therefore have mostly symmetric transmission features. Here, we present a metasurface design principle for nonreciprocal polarization encryption of holographic images. Our approach is based on a two-layer plasmonic metasurface design that introduces a local asymmetry and generates a bidirectional functionality with full phase and amplitude control of the transmitted light. The encoded hologram is designed to appear in a particular linear cross-polarization channel, while it is disappearing in the reverse propagation direction. Hence, layered metasurface systems can feature asymmetric transmission with full phase and amplitude control and therefore expand the design freedom in nanoscale optical devices toward asymmetric information processing and security features for anticounterfeiting applications."}],"publication":"Nano Letters","language":[{"iso":"eng"}],"external_id":{"pmid":["31050899"]},"year":"2019","issue":"6","quality_controlled":"1","title":"Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces","date_created":"2019-07-15T07:55:26Z"}]