[{"date_updated":"2024-04-04T13:36:20Z","date_created":"2024-03-07T00:59:42Z","author":[{"id":"56558","full_name":"Intveen, Julie","last_name":"Intveen","first_name":"Julie"}],"title":"Fictions of Identity – A Didactic Approach to Serial Literacy","conference":{"name":"Media Literacy in Language (Teacher) Education (bilinguales Symposium gefördert durch die DGFF)","start_date":"24.11.2023","end_date":"24.11.2023","location":"Universität Erfurt"},"year":"2023","citation":{"ieee":"J. Intveen, “Fictions of Identity – A Didactic Approach to Serial Literacy,” presented at the Media Literacy in Language (Teacher) Education (bilinguales Symposium gefördert durch die DGFF), Universität Erfurt, 2023.","chicago":"Intveen, Julie. “Fictions of Identity – A Didactic Approach to Serial Literacy.” In <i>Media Literacy in Language (Teacher) Education </i>, 2023.","ama":"Intveen J. Fictions of Identity – A Didactic Approach to Serial Literacy. In: <i>Media Literacy in Language (Teacher) Education </i>. ; 2023.","apa":"Intveen, J. (2023). Fictions of Identity – A Didactic Approach to Serial Literacy. <i>Media Literacy in Language (Teacher) Education </i>. Media Literacy in Language (Teacher) Education (bilinguales Symposium gefördert durch die DGFF), Universität Erfurt.","bibtex":"@inproceedings{Intveen_2023, title={Fictions of Identity – A Didactic Approach to Serial Literacy}, booktitle={Media Literacy in Language (Teacher) Education }, author={Intveen, Julie}, year={2023} }","mla":"Intveen, Julie. “Fictions of Identity – A Didactic Approach to Serial Literacy.” <i>Media Literacy in Language (Teacher) Education </i>, 2023.","short":"J. Intveen, in: Media Literacy in Language (Teacher) Education , 2023."},"_id":"52339","user_id":"56558","language":[{"iso":"eng"}],"type":"conference","publication":"Media Literacy in Language (Teacher) Education ","status":"public"},{"publication":"IMA Journal of Mathematical Control and Information,","type":"journal_article","status":"public","_id":"53142","department":[{"_id":"618"}],"user_id":"77457","language":[{"iso":"eng"}],"issue":"4","year":"2023","intvolume":"        40","page":"691-713","citation":{"chicago":"Berger, Thomas, and Lukas Lanza. “Funnel Control of Linear Systems with Arbitrary Relative Degree under Output Measurement Losses.” <i>IMA Journal of Mathematical Control and Information,</i> 40, no. 4 (2023): 691–713. <a href=\"https://doi.org/doi: 10.1093/imamci/dnad029\">https://doi.org/doi: 10.1093/imamci/dnad029</a>.","ieee":"T. Berger and L. Lanza, “Funnel control of linear systems with arbitrary relative degree under output measurement losses,” <i>IMA Journal of Mathematical Control and Information,</i> vol. 40, no. 4, pp. 691–713, 2023, doi: <a href=\"https://doi.org/doi: 10.1093/imamci/dnad029\">doi: 10.1093/imamci/dnad029</a>.","ama":"Berger T, Lanza L. Funnel control of linear systems with arbitrary relative degree under output measurement losses. <i>IMA Journal of Mathematical Control and Information,</i>. 2023;40(4):691-713. doi:<a href=\"https://doi.org/doi: 10.1093/imamci/dnad029\">doi: 10.1093/imamci/dnad029</a>","short":"T. Berger, L. Lanza, IMA Journal of Mathematical Control and Information, 40 (2023) 691–713.","bibtex":"@article{Berger_Lanza_2023, title={Funnel control of linear systems with arbitrary relative degree under output measurement losses}, volume={40}, DOI={<a href=\"https://doi.org/doi: 10.1093/imamci/dnad029\">doi: 10.1093/imamci/dnad029</a>}, number={4}, journal={IMA Journal of Mathematical Control and Information,}, author={Berger, Thomas and Lanza, Lukas}, year={2023}, pages={691–713} }","mla":"Berger, Thomas, and Lukas Lanza. “Funnel Control of Linear Systems with Arbitrary Relative Degree under Output Measurement Losses.” <i>IMA Journal of Mathematical Control and Information,</i> vol. 40, no. 4, 2023, pp. 691–713, doi:<a href=\"https://doi.org/doi: 10.1093/imamci/dnad029\">doi: 10.1093/imamci/dnad029</a>.","apa":"Berger, T., &#38; Lanza, L. (2023). Funnel control of linear systems with arbitrary relative degree under output measurement losses. <i>IMA Journal of Mathematical Control and Information,</i> <i>40</i>(4), 691–713. <a href=\"https://doi.org/doi: 10.1093/imamci/dnad029\">https://doi.org/doi: 10.1093/imamci/dnad029</a>"},"date_updated":"2024-04-05T05:50:29Z","volume":40,"author":[{"last_name":"Berger","id":"77457","full_name":"Berger, Thomas","first_name":"Thomas"},{"first_name":"Lukas","full_name":"Lanza, Lukas","last_name":"Lanza"}],"date_created":"2024-04-03T09:37:59Z","title":"Funnel control of linear systems with arbitrary relative degree under output measurement losses","doi":"doi: 10.1093/imamci/dnad029"},{"citation":{"apa":"Lee, J. G., Berger, T., Trenn, S., &#38; Shim, H. (2023). Edge-wise funnel output synchronization of heterogeneous agents with relative degree one. <i>Automatica</i>, <i>156</i>, Article 111204. <a href=\"https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)\">https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)</a>","short":"J.G. Lee, T. Berger, S. Trenn, H. Shim, Automatica 156 (2023) Article 111204.","bibtex":"@article{Lee_Berger_Trenn_Shim_2023, title={Edge-wise funnel output synchronization of heterogeneous agents with relative degree one}, volume={156}, DOI={<a href=\"https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)\">doi: 10.1016/j.automatica.2023.111204 (open access)</a>}, journal={Automatica}, author={Lee, J. G. and Berger, Thomas and Trenn, S. and Shim, H.}, year={2023}, pages={Article 111204} }","mla":"Lee, J. G., et al. “Edge-Wise Funnel Output Synchronization of Heterogeneous Agents with Relative Degree One.” <i>Automatica</i>, vol. 156, 2023, p. Article 111204, doi:<a href=\"https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)\">doi: 10.1016/j.automatica.2023.111204 (open access)</a>.","ama":"Lee JG, Berger T, Trenn S, Shim H. Edge-wise funnel output synchronization of heterogeneous agents with relative degree one. <i>Automatica</i>. 2023;156:Article 111204. doi:<a href=\"https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)\">doi: 10.1016/j.automatica.2023.111204 (open access)</a>","chicago":"Lee, J. G., Thomas Berger, S. Trenn, and H. Shim. “Edge-Wise Funnel Output Synchronization of Heterogeneous Agents with Relative Degree One.” <i>Automatica</i> 156 (2023): Article 111204. <a href=\"https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)\">https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)</a>.","ieee":"J. G. Lee, T. Berger, S. Trenn, and H. Shim, “Edge-wise funnel output synchronization of heterogeneous agents with relative degree one,” <i>Automatica</i>, vol. 156, p. Article 111204, 2023, doi: <a href=\"https://doi.org/doi: 10.1016/j.automatica.2023.111204 (open access)\">doi: 10.1016/j.automatica.2023.111204 (open access)</a>."},"intvolume":"       156","page":"Article 111204","year":"2023","doi":"doi: 10.1016/j.automatica.2023.111204 (open access)","title":"Edge-wise funnel output synchronization of heterogeneous agents with relative degree one","date_created":"2024-04-03T09:56:35Z","author":[{"full_name":"Lee, J. G.","last_name":"Lee","first_name":"J. G."},{"first_name":"Thomas","id":"77457","full_name":"Berger, Thomas","last_name":"Berger"},{"first_name":"S.","full_name":"Trenn, S.","last_name":"Trenn"},{"last_name":"Shim","full_name":"Shim, H.","first_name":"H."}],"volume":156,"date_updated":"2024-04-05T05:52:28Z","status":"public","type":"journal_article","publication":"Automatica","language":[{"iso":"eng"}],"user_id":"77457","department":[{"_id":"618"}],"_id":"53143"},{"department":[{"_id":"263"}],"user_id":"67076","_id":"53260","language":[{"iso":"eng"}],"publication":"2023 31st European Signal Processing Conference (EUSIPCO)","type":"conference","status":"public","author":[{"first_name":"Mohammad","last_name":"Soleymani","full_name":"Soleymani, Mohammad"},{"first_name":"Ignacio","last_name":"Santamaria","full_name":"Santamaria, Ignacio"},{"first_name":"Eduard","last_name":"Jorswieck","full_name":"Jorswieck, Eduard"}],"date_created":"2024-04-05T09:00:44Z","publisher":"IEEE","date_updated":"2024-04-05T13:19:03Z","doi":"10.23919/eusipco58844.2023.10289964","title":"Energy-Efficient Rate Splitting for MIMO STAR-RIS-Assisted Broadcast Channels with I/Q Imbalance","publication_status":"published","citation":{"ama":"Soleymani M, Santamaria I, Jorswieck E. Energy-Efficient Rate Splitting for MIMO STAR-RIS-Assisted Broadcast Channels with I/Q Imbalance. In: <i>2023 31st European Signal Processing Conference (EUSIPCO)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.23919/eusipco58844.2023.10289964\">10.23919/eusipco58844.2023.10289964</a>","chicago":"Soleymani, Mohammad, Ignacio Santamaria, and Eduard Jorswieck. “Energy-Efficient Rate Splitting for MIMO STAR-RIS-Assisted Broadcast Channels with I/Q Imbalance.” In <i>2023 31st European Signal Processing Conference (EUSIPCO)</i>. IEEE, 2023. <a href=\"https://doi.org/10.23919/eusipco58844.2023.10289964\">https://doi.org/10.23919/eusipco58844.2023.10289964</a>.","ieee":"M. Soleymani, I. Santamaria, and E. Jorswieck, “Energy-Efficient Rate Splitting for MIMO STAR-RIS-Assisted Broadcast Channels with I/Q Imbalance,” 2023, doi: <a href=\"https://doi.org/10.23919/eusipco58844.2023.10289964\">10.23919/eusipco58844.2023.10289964</a>.","apa":"Soleymani, M., Santamaria, I., &#38; Jorswieck, E. (2023). Energy-Efficient Rate Splitting for MIMO STAR-RIS-Assisted Broadcast Channels with I/Q Imbalance. <i>2023 31st European Signal Processing Conference (EUSIPCO)</i>. <a href=\"https://doi.org/10.23919/eusipco58844.2023.10289964\">https://doi.org/10.23919/eusipco58844.2023.10289964</a>","short":"M. Soleymani, I. Santamaria, E. Jorswieck, in: 2023 31st European Signal Processing Conference (EUSIPCO), IEEE, 2023.","mla":"Soleymani, Mohammad, et al. “Energy-Efficient Rate Splitting for MIMO STAR-RIS-Assisted Broadcast Channels with I/Q Imbalance.” <i>2023 31st European Signal Processing Conference (EUSIPCO)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.23919/eusipco58844.2023.10289964\">10.23919/eusipco58844.2023.10289964</a>.","bibtex":"@inproceedings{Soleymani_Santamaria_Jorswieck_2023, title={Energy-Efficient Rate Splitting for MIMO STAR-RIS-Assisted Broadcast Channels with I/Q Imbalance}, DOI={<a href=\"https://doi.org/10.23919/eusipco58844.2023.10289964\">10.23919/eusipco58844.2023.10289964</a>}, booktitle={2023 31st European Signal Processing Conference (EUSIPCO)}, publisher={IEEE}, author={Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard}, year={2023} }"},"year":"2023"},{"doi":"10.1109/lsp.2023.3296902","title":"SNR Maximization in Beyond Diagonal RIS-Assisted Single and Multiple Antenna Links","author":[{"first_name":"Ignacio","full_name":"Santamaria, Ignacio","last_name":"Santamaria"},{"first_name":"Mohammad","last_name":"Soleymani","full_name":"Soleymani, Mohammad"},{"full_name":"Jorswieck, Eduard","last_name":"Jorswieck","first_name":"Eduard"},{"full_name":"Gutiérrez, Jesús","last_name":"Gutiérrez","first_name":"Jesús"}],"date_created":"2024-04-05T09:01:21Z","volume":30,"date_updated":"2024-04-05T13:20:51Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","citation":{"apa":"Santamaria, I., Soleymani, M., Jorswieck, E., &#38; Gutiérrez, J. (2023). SNR Maximization in Beyond Diagonal RIS-Assisted Single and Multiple Antenna Links. <i>IEEE Signal Processing Letters</i>, <i>30</i>, 923–926. <a href=\"https://doi.org/10.1109/lsp.2023.3296902\">https://doi.org/10.1109/lsp.2023.3296902</a>","mla":"Santamaria, Ignacio, et al. “SNR Maximization in Beyond Diagonal RIS-Assisted Single and Multiple Antenna Links.” <i>IEEE Signal Processing Letters</i>, vol. 30, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 923–26, doi:<a href=\"https://doi.org/10.1109/lsp.2023.3296902\">10.1109/lsp.2023.3296902</a>.","short":"I. Santamaria, M. Soleymani, E. Jorswieck, J. Gutiérrez, IEEE Signal Processing Letters 30 (2023) 923–926.","bibtex":"@article{Santamaria_Soleymani_Jorswieck_Gutiérrez_2023, title={SNR Maximization in Beyond Diagonal RIS-Assisted Single and Multiple Antenna Links}, volume={30}, DOI={<a href=\"https://doi.org/10.1109/lsp.2023.3296902\">10.1109/lsp.2023.3296902</a>}, journal={IEEE Signal Processing Letters}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Santamaria, Ignacio and Soleymani, Mohammad and Jorswieck, Eduard and Gutiérrez, Jesús}, year={2023}, pages={923–926} }","ieee":"I. Santamaria, M. Soleymani, E. Jorswieck, and J. Gutiérrez, “SNR Maximization in Beyond Diagonal RIS-Assisted Single and Multiple Antenna Links,” <i>IEEE Signal Processing Letters</i>, vol. 30, pp. 923–926, 2023, doi: <a href=\"https://doi.org/10.1109/lsp.2023.3296902\">10.1109/lsp.2023.3296902</a>.","chicago":"Santamaria, Ignacio, Mohammad Soleymani, Eduard Jorswieck, and Jesús Gutiérrez. “SNR Maximization in Beyond Diagonal RIS-Assisted Single and Multiple Antenna Links.” <i>IEEE Signal Processing Letters</i> 30 (2023): 923–26. <a href=\"https://doi.org/10.1109/lsp.2023.3296902\">https://doi.org/10.1109/lsp.2023.3296902</a>.","ama":"Santamaria I, Soleymani M, Jorswieck E, Gutiérrez J. SNR Maximization in Beyond Diagonal RIS-Assisted Single and Multiple Antenna Links. <i>IEEE Signal Processing Letters</i>. 2023;30:923-926. doi:<a href=\"https://doi.org/10.1109/lsp.2023.3296902\">10.1109/lsp.2023.3296902</a>"},"page":"923-926","intvolume":"        30","year":"2023","publication_status":"published","publication_identifier":{"issn":["1070-9908","1558-2361"]},"language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Electrical and Electronic Engineering","Signal Processing"],"user_id":"67076","department":[{"_id":"263"}],"_id":"53262","status":"public","type":"journal_article","publication":"IEEE Signal Processing Letters"},{"status":"public","publication":"IEEE Transactions on Wireless Communications","type":"journal_article","keyword":["Applied Mathematics","Electrical and Electronic Engineering","Computer Science Applications"],"language":[{"iso":"eng"}],"_id":"53261","department":[{"_id":"263"}],"user_id":"67076","year":"2023","page":"1-1","citation":{"apa":"Soleymani, M., Santamaria, I., Jorswieck, E., &#38; Clerckx, B. (2023). Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-assisted URLLC Systems. <i>IEEE Transactions on Wireless Communications</i>, 1–1. <a href=\"https://doi.org/10.1109/twc.2023.3324190\">https://doi.org/10.1109/twc.2023.3324190</a>","mla":"Soleymani, Mohammad, et al. “Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-Assisted URLLC Systems.” <i>IEEE Transactions on Wireless Communications</i>, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/twc.2023.3324190\">10.1109/twc.2023.3324190</a>.","bibtex":"@article{Soleymani_Santamaria_Jorswieck_Clerckx_2023, title={Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-assisted URLLC Systems}, DOI={<a href=\"https://doi.org/10.1109/twc.2023.3324190\">10.1109/twc.2023.3324190</a>}, journal={IEEE Transactions on Wireless Communications}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard and Clerckx, Bruno}, year={2023}, pages={1–1} }","short":"M. Soleymani, I. Santamaria, E. Jorswieck, B. Clerckx, IEEE Transactions on Wireless Communications (2023) 1–1.","ama":"Soleymani M, Santamaria I, Jorswieck E, Clerckx B. Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-assisted URLLC Systems. <i>IEEE Transactions on Wireless Communications</i>. Published online 2023:1-1. doi:<a href=\"https://doi.org/10.1109/twc.2023.3324190\">10.1109/twc.2023.3324190</a>","ieee":"M. Soleymani, I. Santamaria, E. Jorswieck, and B. Clerckx, “Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-assisted URLLC Systems,” <i>IEEE Transactions on Wireless Communications</i>, pp. 1–1, 2023, doi: <a href=\"https://doi.org/10.1109/twc.2023.3324190\">10.1109/twc.2023.3324190</a>.","chicago":"Soleymani, Mohammad, Ignacio Santamaria, Eduard Jorswieck, and Bruno Clerckx. “Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-Assisted URLLC Systems.” <i>IEEE Transactions on Wireless Communications</i>, 2023, 1–1. <a href=\"https://doi.org/10.1109/twc.2023.3324190\">https://doi.org/10.1109/twc.2023.3324190</a>."},"publication_identifier":{"issn":["1536-1276","1558-2248"]},"publication_status":"published","title":"Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-assisted URLLC Systems","doi":"10.1109/twc.2023.3324190","date_updated":"2024-04-05T13:20:40Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","author":[{"full_name":"Soleymani, Mohammad","last_name":"Soleymani","first_name":"Mohammad"},{"first_name":"Ignacio","last_name":"Santamaria","full_name":"Santamaria, Ignacio"},{"first_name":"Eduard","last_name":"Jorswieck","full_name":"Jorswieck, Eduard"},{"first_name":"Bruno","full_name":"Clerckx, Bruno","last_name":"Clerckx"}],"date_created":"2024-04-05T09:01:04Z"},{"_id":"53265","user_id":"67076","department":[{"_id":"263"}],"keyword":["Electrical and Electronic Engineering","Signal Processing"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"IEEE Transactions on Signal Processing","status":"public","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_updated":"2024-04-05T13:21:50Z","date_created":"2024-04-05T09:03:42Z","author":[{"last_name":"Soleymani","full_name":"Soleymani, Mohammad","first_name":"Mohammad"},{"first_name":"Ignacio","last_name":"Santamaria","full_name":"Santamaria, Ignacio"},{"last_name":"Jorswieck","full_name":"Jorswieck, Eduard","first_name":"Eduard"},{"first_name":"Sepehr","last_name":"Rezvani","full_name":"Rezvani, Sepehr"}],"volume":71,"title":"NOMA-Based Improper Signaling for Multicell MISO RIS-Assisted Broadcast Channels","doi":"10.1109/tsp.2023.3259145","publication_status":"published","publication_identifier":{"issn":["1053-587X","1941-0476"]},"year":"2023","citation":{"ieee":"M. Soleymani, I. Santamaria, E. Jorswieck, and S. Rezvani, “NOMA-Based Improper Signaling for Multicell MISO RIS-Assisted Broadcast Channels,” <i>IEEE Transactions on Signal Processing</i>, vol. 71, pp. 963–978, 2023, doi: <a href=\"https://doi.org/10.1109/tsp.2023.3259145\">10.1109/tsp.2023.3259145</a>.","chicago":"Soleymani, Mohammad, Ignacio Santamaria, Eduard Jorswieck, and Sepehr Rezvani. “NOMA-Based Improper Signaling for Multicell MISO RIS-Assisted Broadcast Channels.” <i>IEEE Transactions on Signal Processing</i> 71 (2023): 963–78. <a href=\"https://doi.org/10.1109/tsp.2023.3259145\">https://doi.org/10.1109/tsp.2023.3259145</a>.","ama":"Soleymani M, Santamaria I, Jorswieck E, Rezvani S. NOMA-Based Improper Signaling for Multicell MISO RIS-Assisted Broadcast Channels. <i>IEEE Transactions on Signal Processing</i>. 2023;71:963-978. doi:<a href=\"https://doi.org/10.1109/tsp.2023.3259145\">10.1109/tsp.2023.3259145</a>","apa":"Soleymani, M., Santamaria, I., Jorswieck, E., &#38; Rezvani, S. (2023). NOMA-Based Improper Signaling for Multicell MISO RIS-Assisted Broadcast Channels. <i>IEEE Transactions on Signal Processing</i>, <i>71</i>, 963–978. <a href=\"https://doi.org/10.1109/tsp.2023.3259145\">https://doi.org/10.1109/tsp.2023.3259145</a>","mla":"Soleymani, Mohammad, et al. “NOMA-Based Improper Signaling for Multicell MISO RIS-Assisted Broadcast Channels.” <i>IEEE Transactions on Signal Processing</i>, vol. 71, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 963–78, doi:<a href=\"https://doi.org/10.1109/tsp.2023.3259145\">10.1109/tsp.2023.3259145</a>.","short":"M. Soleymani, I. Santamaria, E. Jorswieck, S. Rezvani, IEEE Transactions on Signal Processing 71 (2023) 963–978.","bibtex":"@article{Soleymani_Santamaria_Jorswieck_Rezvani_2023, title={NOMA-Based Improper Signaling for Multicell MISO RIS-Assisted Broadcast Channels}, volume={71}, DOI={<a href=\"https://doi.org/10.1109/tsp.2023.3259145\">10.1109/tsp.2023.3259145</a>}, journal={IEEE Transactions on Signal Processing}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard and Rezvani, Sepehr}, year={2023}, pages={963–978} }"},"intvolume":"        71","page":"963-978"},{"_id":"53263","user_id":"67076","department":[{"_id":"263"}],"keyword":["General Engineering","General Materials Science","General Computer Science","Electrical and Electronic Engineering"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"IEEE Access","status":"public","date_updated":"2024-04-05T13:21:01Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","author":[{"full_name":"Soleymani, Mohammad","last_name":"Soleymani","first_name":"Mohammad"},{"full_name":"Santamaria, Ignacio","last_name":"Santamaria","first_name":"Ignacio"},{"last_name":"Jorswieck","full_name":"Jorswieck, Eduard A.","first_name":"Eduard A."}],"date_created":"2024-04-05T09:01:49Z","volume":11,"title":"Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems","doi":"10.1109/access.2023.3294092","publication_status":"published","publication_identifier":{"issn":["2169-3536"]},"year":"2023","citation":{"mla":"Soleymani, Mohammad, et al. “Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems.” <i>IEEE Access</i>, vol. 11, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 70833–52, doi:<a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>.","short":"M. Soleymani, I. Santamaria, E.A. Jorswieck, IEEE Access 11 (2023) 70833–70852.","bibtex":"@article{Soleymani_Santamaria_Jorswieck_2023, title={Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems}, volume={11}, DOI={<a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>}, journal={IEEE Access}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard A.}, year={2023}, pages={70833–70852} }","apa":"Soleymani, M., Santamaria, I., &#38; Jorswieck, E. A. (2023). Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems. <i>IEEE Access</i>, <i>11</i>, 70833–70852. <a href=\"https://doi.org/10.1109/access.2023.3294092\">https://doi.org/10.1109/access.2023.3294092</a>","ama":"Soleymani M, Santamaria I, Jorswieck EA. Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems. <i>IEEE Access</i>. 2023;11:70833-70852. doi:<a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>","chicago":"Soleymani, Mohammad, Ignacio Santamaria, and Eduard A. Jorswieck. “Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems.” <i>IEEE Access</i> 11 (2023): 70833–52. <a href=\"https://doi.org/10.1109/access.2023.3294092\">https://doi.org/10.1109/access.2023.3294092</a>.","ieee":"M. Soleymani, I. Santamaria, and E. A. Jorswieck, “Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems,” <i>IEEE Access</i>, vol. 11, pp. 70833–70852, 2023, doi: <a href=\"https://doi.org/10.1109/access.2023.3294092\">10.1109/access.2023.3294092</a>."},"intvolume":"        11","page":"70833-70852"},{"citation":{"ama":"Santamaria I, Soleymani M, Jorswieck E, Gutiérrez J. Interference Leakage Minimization in RIS-Assisted MIMO Interference Channels. In: <i>ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/icassp49357.2023.10094656\">10.1109/icassp49357.2023.10094656</a>","ieee":"I. Santamaria, M. Soleymani, E. Jorswieck, and J. Gutiérrez, “Interference Leakage Minimization in RIS-Assisted MIMO Interference Channels,” 2023, doi: <a href=\"https://doi.org/10.1109/icassp49357.2023.10094656\">10.1109/icassp49357.2023.10094656</a>.","chicago":"Santamaria, Ignacio, Mohammad Soleymani, Eduard Jorswieck, and Jesús Gutiérrez. “Interference Leakage Minimization in RIS-Assisted MIMO Interference Channels.” In <i>ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/icassp49357.2023.10094656\">https://doi.org/10.1109/icassp49357.2023.10094656</a>.","apa":"Santamaria, I., Soleymani, M., Jorswieck, E., &#38; Gutiérrez, J. (2023). Interference Leakage Minimization in RIS-Assisted MIMO Interference Channels. <i>ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. <a href=\"https://doi.org/10.1109/icassp49357.2023.10094656\">https://doi.org/10.1109/icassp49357.2023.10094656</a>","mla":"Santamaria, Ignacio, et al. “Interference Leakage Minimization in RIS-Assisted MIMO Interference Channels.” <i>ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/icassp49357.2023.10094656\">10.1109/icassp49357.2023.10094656</a>.","short":"I. Santamaria, M. Soleymani, E. Jorswieck, J. Gutiérrez, in: ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2023.","bibtex":"@inproceedings{Santamaria_Soleymani_Jorswieck_Gutiérrez_2023, title={Interference Leakage Minimization in RIS-Assisted MIMO Interference Channels}, DOI={<a href=\"https://doi.org/10.1109/icassp49357.2023.10094656\">10.1109/icassp49357.2023.10094656</a>}, booktitle={ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, publisher={IEEE}, author={Santamaria, Ignacio and Soleymani, Mohammad and Jorswieck, Eduard and Gutiérrez, Jesús}, year={2023} }"},"year":"2023","publication_status":"published","doi":"10.1109/icassp49357.2023.10094656","title":"Interference Leakage Minimization in RIS-Assisted MIMO Interference Channels","date_created":"2024-04-05T09:02:14Z","author":[{"full_name":"Santamaria, Ignacio","last_name":"Santamaria","first_name":"Ignacio"},{"last_name":"Soleymani","full_name":"Soleymani, Mohammad","first_name":"Mohammad"},{"first_name":"Eduard","full_name":"Jorswieck, Eduard","last_name":"Jorswieck"},{"first_name":"Jesús","full_name":"Gutiérrez, Jesús","last_name":"Gutiérrez"}],"publisher":"IEEE","date_updated":"2024-04-05T13:21:11Z","status":"public","publication":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"263"}],"user_id":"67076","_id":"53264"},{"status":"public","publication":"Expert Systems with Applications","type":"journal_article","keyword":["Artificial Intelligence","Computer Science Applications","General Engineering"],"article_number":"120986","language":[{"iso":"eng"}],"_id":"53301","department":[{"_id":"263"}],"user_id":"56070","year":"2023","intvolume":"       234","citation":{"apa":"Vieluf, S., Hasija, T., Kuschel, M., Reinsberger, C., &#38; Loddenkemper, T. (2023). Developing a deep canonical correlation-based technique for seizure prediction. <i>Expert Systems with Applications</i>, <i>234</i>, Article 120986. <a href=\"https://doi.org/10.1016/j.eswa.2023.120986\">https://doi.org/10.1016/j.eswa.2023.120986</a>","bibtex":"@article{Vieluf_Hasija_Kuschel_Reinsberger_Loddenkemper_2023, title={Developing a deep canonical correlation-based technique for seizure prediction}, volume={234}, DOI={<a href=\"https://doi.org/10.1016/j.eswa.2023.120986\">10.1016/j.eswa.2023.120986</a>}, number={120986}, journal={Expert Systems with Applications}, publisher={Elsevier BV}, author={Vieluf, Solveig and Hasija, Tanuj and Kuschel, Maurice and Reinsberger, Claus and Loddenkemper, Tobias}, year={2023} }","short":"S. Vieluf, T. Hasija, M. Kuschel, C. Reinsberger, T. Loddenkemper, Expert Systems with Applications 234 (2023).","mla":"Vieluf, Solveig, et al. “Developing a Deep Canonical Correlation-Based Technique for Seizure Prediction.” <i>Expert Systems with Applications</i>, vol. 234, 120986, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.eswa.2023.120986\">10.1016/j.eswa.2023.120986</a>.","chicago":"Vieluf, Solveig, Tanuj Hasija, Maurice Kuschel, Claus Reinsberger, and Tobias Loddenkemper. “Developing a Deep Canonical Correlation-Based Technique for Seizure Prediction.” <i>Expert Systems with Applications</i> 234 (2023). <a href=\"https://doi.org/10.1016/j.eswa.2023.120986\">https://doi.org/10.1016/j.eswa.2023.120986</a>.","ieee":"S. Vieluf, T. Hasija, M. Kuschel, C. Reinsberger, and T. Loddenkemper, “Developing a deep canonical correlation-based technique for seizure prediction,” <i>Expert Systems with Applications</i>, vol. 234, Art. no. 120986, 2023, doi: <a href=\"https://doi.org/10.1016/j.eswa.2023.120986\">10.1016/j.eswa.2023.120986</a>.","ama":"Vieluf S, Hasija T, Kuschel M, Reinsberger C, Loddenkemper T. Developing a deep canonical correlation-based technique for seizure prediction. <i>Expert Systems with Applications</i>. 2023;234. doi:<a href=\"https://doi.org/10.1016/j.eswa.2023.120986\">10.1016/j.eswa.2023.120986</a>"},"publication_identifier":{"issn":["0957-4174"]},"publication_status":"published","title":"Developing a deep canonical correlation-based technique for seizure prediction","doi":"10.1016/j.eswa.2023.120986","publisher":"Elsevier BV","date_updated":"2024-04-05T14:49:56Z","volume":234,"author":[{"last_name":"Vieluf","full_name":"Vieluf, Solveig","first_name":"Solveig"},{"first_name":"Tanuj","last_name":"Hasija","id":"43497","full_name":"Hasija, Tanuj"},{"last_name":"Kuschel","id":"56070","full_name":"Kuschel, Maurice","first_name":"Maurice"},{"first_name":"Claus","last_name":"Reinsberger","full_name":"Reinsberger, Claus","id":"48978"},{"last_name":"Loddenkemper","full_name":"Loddenkemper, Tobias","first_name":"Tobias"}],"date_created":"2024-04-05T14:37:06Z"},{"author":[{"first_name":"Maurice","last_name":"Kuschel","full_name":"Kuschel, Maurice","id":"56070"},{"full_name":"Marrinan, Timothy","last_name":"Marrinan","first_name":"Timothy"},{"last_name":"Hasija","id":"43497","full_name":"Hasija, Tanuj","first_name":"Tanuj"}],"date_created":"2024-04-05T14:39:36Z","publisher":"IEEE","date_updated":"2024-04-05T14:50:06Z","doi":"10.1109/mlsp55844.2023.10285937","title":"Geodesic-Based Relaxation For Deep Canonical Correlation Analysis","publication_status":"published","citation":{"apa":"Kuschel, M., Marrinan, T., &#38; Hasija, T. (2023). Geodesic-Based Relaxation For Deep Canonical Correlation Analysis. <i>2023 IEEE 33rd International Workshop on Machine Learning for Signal Processing (MLSP)</i>. <a href=\"https://doi.org/10.1109/mlsp55844.2023.10285937\">https://doi.org/10.1109/mlsp55844.2023.10285937</a>","bibtex":"@inproceedings{Kuschel_Marrinan_Hasija_2023, title={Geodesic-Based Relaxation For Deep Canonical Correlation Analysis}, DOI={<a href=\"https://doi.org/10.1109/mlsp55844.2023.10285937\">10.1109/mlsp55844.2023.10285937</a>}, booktitle={2023 IEEE 33rd International Workshop on Machine Learning for Signal Processing (MLSP)}, publisher={IEEE}, author={Kuschel, Maurice and Marrinan, Timothy and Hasija, Tanuj}, year={2023} }","short":"M. Kuschel, T. Marrinan, T. Hasija, in: 2023 IEEE 33rd International Workshop on Machine Learning for Signal Processing (MLSP), IEEE, 2023.","mla":"Kuschel, Maurice, et al. “Geodesic-Based Relaxation For Deep Canonical Correlation Analysis.” <i>2023 IEEE 33rd International Workshop on Machine Learning for Signal Processing (MLSP)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/mlsp55844.2023.10285937\">10.1109/mlsp55844.2023.10285937</a>.","ieee":"M. Kuschel, T. Marrinan, and T. Hasija, “Geodesic-Based Relaxation For Deep Canonical Correlation Analysis,” 2023, doi: <a href=\"https://doi.org/10.1109/mlsp55844.2023.10285937\">10.1109/mlsp55844.2023.10285937</a>.","chicago":"Kuschel, Maurice, Timothy Marrinan, and Tanuj Hasija. “Geodesic-Based Relaxation For Deep Canonical Correlation Analysis.” In <i>2023 IEEE 33rd International Workshop on Machine Learning for Signal Processing (MLSP)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/mlsp55844.2023.10285937\">https://doi.org/10.1109/mlsp55844.2023.10285937</a>.","ama":"Kuschel M, Marrinan T, Hasija T. Geodesic-Based Relaxation For Deep Canonical Correlation Analysis. In: <i>2023 IEEE 33rd International Workshop on Machine Learning for Signal Processing (MLSP)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/mlsp55844.2023.10285937\">10.1109/mlsp55844.2023.10285937</a>"},"year":"2023","department":[{"_id":"263"}],"user_id":"56070","_id":"53303","language":[{"iso":"eng"}],"publication":"2023 IEEE 33rd International Workshop on Machine Learning for Signal Processing (MLSP)","type":"conference","status":"public"},{"language":[{"iso":"eng"}],"_id":"53310","department":[{"_id":"52"}],"user_id":"66","status":"public","publication":"2023 IEEE 14th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED)","type":"conference","title":"Online system identification and excitation for thermal monitoring of electric machines using machine learning and model predictive control","doi":"10.1109/sdemped54949.2023.10271427","publisher":"IEEE","date_updated":"2024-04-06T14:00:07Z","author":[{"first_name":"Emebet Gebeyehu","last_name":"Gedlu","id":"77572","full_name":"Gedlu, Emebet Gebeyehu"},{"first_name":"Oliver","last_name":"Wallscheid","orcid":"https://orcid.org/0000-0001-9362-8777","id":"11291","full_name":"Wallscheid, Oliver"},{"id":"66","full_name":"Böcker, Joachim","last_name":"Böcker","orcid":"0000-0002-8480-7295","first_name":"Joachim"},{"last_name":"Nelles","full_name":"Nelles, Oliver","first_name":"Oliver"}],"date_created":"2024-04-06T13:55:29Z","year":"2023","citation":{"short":"E.G. Gedlu, O. Wallscheid, J. Böcker, O. Nelles, in: 2023 IEEE 14th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED), IEEE, 2023.","mla":"Gedlu, Emebet Gebeyehu, et al. “Online System Identification and Excitation for Thermal Monitoring of Electric Machines Using Machine Learning and Model Predictive Control.” <i>2023 IEEE 14th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/sdemped54949.2023.10271427\">10.1109/sdemped54949.2023.10271427</a>.","bibtex":"@inproceedings{Gedlu_Wallscheid_Böcker_Nelles_2023, title={Online system identification and excitation for thermal monitoring of electric machines using machine learning and model predictive control}, DOI={<a href=\"https://doi.org/10.1109/sdemped54949.2023.10271427\">10.1109/sdemped54949.2023.10271427</a>}, booktitle={2023 IEEE 14th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED)}, publisher={IEEE}, author={Gedlu, Emebet Gebeyehu and Wallscheid, Oliver and Böcker, Joachim and Nelles, Oliver}, year={2023} }","apa":"Gedlu, E. G., Wallscheid, O., Böcker, J., &#38; Nelles, O. (2023). Online system identification and excitation for thermal monitoring of electric machines using machine learning and model predictive control. <i>2023 IEEE 14th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED)</i>. <a href=\"https://doi.org/10.1109/sdemped54949.2023.10271427\">https://doi.org/10.1109/sdemped54949.2023.10271427</a>","ama":"Gedlu EG, Wallscheid O, Böcker J, Nelles O. Online system identification and excitation for thermal monitoring of electric machines using machine learning and model predictive control. In: <i>2023 IEEE 14th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/sdemped54949.2023.10271427\">10.1109/sdemped54949.2023.10271427</a>","chicago":"Gedlu, Emebet Gebeyehu, Oliver Wallscheid, Joachim Böcker, and Oliver Nelles. “Online System Identification and Excitation for Thermal Monitoring of Electric Machines Using Machine Learning and Model Predictive Control.” In <i>2023 IEEE 14th International Symposium on Diagnostics for Electrical Machines, Power Electronics and Drives (SDEMPED)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/sdemped54949.2023.10271427\">https://doi.org/10.1109/sdemped54949.2023.10271427</a>.","ieee":"E. G. Gedlu, O. Wallscheid, J. Böcker, and O. Nelles, “Online system identification and excitation for thermal monitoring of electric machines using machine learning and model predictive control,” 2023, doi: <a href=\"https://doi.org/10.1109/sdemped54949.2023.10271427\">10.1109/sdemped54949.2023.10271427</a>."},"publication_status":"published"},{"type":"journal_article","publication":"Evolution Equations and Control Theory","status":"public","user_id":"31496","_id":"53317","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Control and Optimization","Modeling and Simulation"],"issue":"6","publication_status":"published","publication_identifier":{"issn":["2163-2480"]},"citation":{"ieee":"Y. Tao and M. Winkler, “Global smooth solutions in a three-dimensional cross-diffusive SIS epidemic model with saturated taxis at large densities,” <i>Evolution Equations and Control Theory</i>, vol. 12, no. 6, pp. 1676–1687, 2023, doi: <a href=\"https://doi.org/10.3934/eect.2023031\">10.3934/eect.2023031</a>.","chicago":"Tao, Youshan, and Michael Winkler. “Global Smooth Solutions in a Three-Dimensional Cross-Diffusive SIS Epidemic Model with Saturated Taxis at Large Densities.” <i>Evolution Equations and Control Theory</i> 12, no. 6 (2023): 1676–87. <a href=\"https://doi.org/10.3934/eect.2023031\">https://doi.org/10.3934/eect.2023031</a>.","ama":"Tao Y, Winkler M. Global smooth solutions in a three-dimensional cross-diffusive SIS epidemic model with saturated taxis at large densities. <i>Evolution Equations and Control Theory</i>. 2023;12(6):1676-1687. doi:<a href=\"https://doi.org/10.3934/eect.2023031\">10.3934/eect.2023031</a>","apa":"Tao, Y., &#38; Winkler, M. (2023). Global smooth solutions in a three-dimensional cross-diffusive SIS epidemic model with saturated taxis at large densities. <i>Evolution Equations and Control Theory</i>, <i>12</i>(6), 1676–1687. <a href=\"https://doi.org/10.3934/eect.2023031\">https://doi.org/10.3934/eect.2023031</a>","bibtex":"@article{Tao_Winkler_2023, title={Global smooth solutions in a three-dimensional cross-diffusive SIS epidemic model with saturated taxis at large densities}, volume={12}, DOI={<a href=\"https://doi.org/10.3934/eect.2023031\">10.3934/eect.2023031</a>}, number={6}, journal={Evolution Equations and Control Theory}, publisher={American Institute of Mathematical Sciences (AIMS)}, author={Tao, Youshan and Winkler, Michael}, year={2023}, pages={1676–1687} }","mla":"Tao, Youshan, and Michael Winkler. “Global Smooth Solutions in a Three-Dimensional Cross-Diffusive SIS Epidemic Model with Saturated Taxis at Large Densities.” <i>Evolution Equations and Control Theory</i>, vol. 12, no. 6, American Institute of Mathematical Sciences (AIMS), 2023, pp. 1676–87, doi:<a href=\"https://doi.org/10.3934/eect.2023031\">10.3934/eect.2023031</a>.","short":"Y. Tao, M. Winkler, Evolution Equations and Control Theory 12 (2023) 1676–1687."},"intvolume":"        12","page":"1676-1687","year":"2023","date_created":"2024-04-07T12:30:25Z","author":[{"first_name":"Youshan","full_name":"Tao, Youshan","last_name":"Tao"},{"last_name":"Winkler","full_name":"Winkler, Michael","first_name":"Michael"}],"volume":12,"date_updated":"2024-04-07T12:36:17Z","publisher":"American Institute of Mathematical Sciences (AIMS)","doi":"10.3934/eect.2023031","title":"Global smooth solutions in a three-dimensional cross-diffusive SIS epidemic model with saturated taxis at large densities"},{"type":"journal_article","publication":"Annales de l'Institut Henri Poincaré C, Analyse non linéaire","status":"public","user_id":"31496","_id":"53320","language":[{"iso":"eng"}],"keyword":["Mathematical Physics","Analysis","Applied Mathematics"],"publication_status":"published","publication_identifier":{"issn":["0294-1449","1873-1430"]},"citation":{"apa":"Winkler, M. (2023). A quantitative strong parabolic maximum principle and application to a taxis-type migration–consumption model involving signal-dependent degenerate diffusion. <i>Annales de l’Institut Henri Poincaré C, Analyse Non Linéaire</i>. <a href=\"https://doi.org/10.4171/aihpc/73\">https://doi.org/10.4171/aihpc/73</a>","short":"M. Winkler, Annales de l’Institut Henri Poincaré C, Analyse Non Linéaire (2023).","mla":"Winkler, Michael. “A Quantitative Strong Parabolic Maximum Principle and Application to a Taxis-Type Migration–Consumption Model Involving Signal-Dependent Degenerate Diffusion.” <i>Annales de l’Institut Henri Poincaré C, Analyse Non Linéaire</i>, European Mathematical Society - EMS - Publishing House GmbH, 2023, doi:<a href=\"https://doi.org/10.4171/aihpc/73\">10.4171/aihpc/73</a>.","bibtex":"@article{Winkler_2023, title={A quantitative strong parabolic maximum principle and application to a taxis-type migration–consumption model involving signal-dependent degenerate diffusion}, DOI={<a href=\"https://doi.org/10.4171/aihpc/73\">10.4171/aihpc/73</a>}, journal={Annales de l’Institut Henri Poincaré C, Analyse non linéaire}, publisher={European Mathematical Society - EMS - Publishing House GmbH}, author={Winkler, Michael}, year={2023} }","ieee":"M. Winkler, “A quantitative strong parabolic maximum principle and application to a taxis-type migration–consumption model involving signal-dependent degenerate diffusion,” <i>Annales de l’Institut Henri Poincaré C, Analyse non linéaire</i>, 2023, doi: <a href=\"https://doi.org/10.4171/aihpc/73\">10.4171/aihpc/73</a>.","chicago":"Winkler, Michael. “A Quantitative Strong Parabolic Maximum Principle and Application to a Taxis-Type Migration–Consumption Model Involving Signal-Dependent Degenerate Diffusion.” <i>Annales de l’Institut Henri Poincaré C, Analyse Non Linéaire</i>, 2023. <a href=\"https://doi.org/10.4171/aihpc/73\">https://doi.org/10.4171/aihpc/73</a>.","ama":"Winkler M. A quantitative strong parabolic maximum principle and application to a taxis-type migration–consumption model involving signal-dependent degenerate diffusion. <i>Annales de l’Institut Henri Poincaré C, Analyse non linéaire</i>. Published online 2023. doi:<a href=\"https://doi.org/10.4171/aihpc/73\">10.4171/aihpc/73</a>"},"year":"2023","author":[{"full_name":"Winkler, Michael","last_name":"Winkler","first_name":"Michael"}],"date_created":"2024-04-07T12:34:35Z","publisher":"European Mathematical Society - EMS - Publishing House GmbH","date_updated":"2024-04-07T12:36:00Z","doi":"10.4171/aihpc/73","title":"A quantitative strong parabolic maximum principle and application to a taxis-type migration–consumption model involving signal-dependent degenerate diffusion"},{"doi":"10.1080/00036811.2023.2173183","title":"Refined regularity analysis for a Keller-Segel-consumption system involving signal-dependent motilities","volume":103,"author":[{"first_name":"Genglin","full_name":"Li, Genglin","last_name":"Li"},{"last_name":"Winkler","full_name":"Winkler, Michael","first_name":"Michael"}],"date_created":"2024-04-07T12:32:55Z","publisher":"Informa UK Limited","date_updated":"2024-04-07T12:36:11Z","page":"45-64","intvolume":"       103","citation":{"ama":"Li G, Winkler M. Refined regularity analysis for a Keller-Segel-consumption system involving signal-dependent motilities. <i>Applicable Analysis</i>. 2023;103(1):45-64. doi:<a href=\"https://doi.org/10.1080/00036811.2023.2173183\">10.1080/00036811.2023.2173183</a>","chicago":"Li, Genglin, and Michael Winkler. “Refined Regularity Analysis for a Keller-Segel-Consumption System Involving Signal-Dependent Motilities.” <i>Applicable Analysis</i> 103, no. 1 (2023): 45–64. <a href=\"https://doi.org/10.1080/00036811.2023.2173183\">https://doi.org/10.1080/00036811.2023.2173183</a>.","ieee":"G. Li and M. Winkler, “Refined regularity analysis for a Keller-Segel-consumption system involving signal-dependent motilities,” <i>Applicable Analysis</i>, vol. 103, no. 1, pp. 45–64, 2023, doi: <a href=\"https://doi.org/10.1080/00036811.2023.2173183\">10.1080/00036811.2023.2173183</a>.","apa":"Li, G., &#38; Winkler, M. (2023). Refined regularity analysis for a Keller-Segel-consumption system involving signal-dependent motilities. <i>Applicable Analysis</i>, <i>103</i>(1), 45–64. <a href=\"https://doi.org/10.1080/00036811.2023.2173183\">https://doi.org/10.1080/00036811.2023.2173183</a>","short":"G. Li, M. Winkler, Applicable Analysis 103 (2023) 45–64.","bibtex":"@article{Li_Winkler_2023, title={Refined regularity analysis for a Keller-Segel-consumption system involving signal-dependent motilities}, volume={103}, DOI={<a href=\"https://doi.org/10.1080/00036811.2023.2173183\">10.1080/00036811.2023.2173183</a>}, number={1}, journal={Applicable Analysis}, publisher={Informa UK Limited}, author={Li, Genglin and Winkler, Michael}, year={2023}, pages={45–64} }","mla":"Li, Genglin, and Michael Winkler. “Refined Regularity Analysis for a Keller-Segel-Consumption System Involving Signal-Dependent Motilities.” <i>Applicable Analysis</i>, vol. 103, no. 1, Informa UK Limited, 2023, pp. 45–64, doi:<a href=\"https://doi.org/10.1080/00036811.2023.2173183\">10.1080/00036811.2023.2173183</a>."},"year":"2023","issue":"1","publication_identifier":{"issn":["0003-6811","1563-504X"]},"publication_status":"published","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Analysis"],"user_id":"31496","_id":"53318","status":"public","publication":"Applicable Analysis","type":"journal_article"},{"status":"public","type":"journal_article","_id":"53328","user_id":"31496","page":"103-138","intvolume":"        33","citation":{"chicago":"Tao, Youshan, and Michael Winkler. “Small-Signal Solutions to a Nonlocal Cross-Diffusion Model for Interaction of Scroungers with Rapidly Diffusing Foragers.” <i>Mathematical Models and Methods in Applied Sciences</i> 33, no. 01 (2023): 103–38. <a href=\"https://doi.org/10.1142/s0218202523500045\">https://doi.org/10.1142/s0218202523500045</a>.","ieee":"Y. Tao and M. Winkler, “Small-signal solutions to a nonlocal cross-diffusion model for interaction of scroungers with rapidly diffusing foragers,” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 33, no. 01, pp. 103–138, 2023, doi: <a href=\"https://doi.org/10.1142/s0218202523500045\">10.1142/s0218202523500045</a>.","ama":"Tao Y, Winkler M. Small-signal solutions to a nonlocal cross-diffusion model for interaction of scroungers with rapidly diffusing foragers. <i>Mathematical Models and Methods in Applied Sciences</i>. 2023;33(01):103-138. doi:<a href=\"https://doi.org/10.1142/s0218202523500045\">10.1142/s0218202523500045</a>","apa":"Tao, Y., &#38; Winkler, M. (2023). Small-signal solutions to a nonlocal cross-diffusion model for interaction of scroungers with rapidly diffusing foragers. <i>Mathematical Models and Methods in Applied Sciences</i>, <i>33</i>(01), 103–138. <a href=\"https://doi.org/10.1142/s0218202523500045\">https://doi.org/10.1142/s0218202523500045</a>","short":"Y. Tao, M. Winkler, Mathematical Models and Methods in Applied Sciences 33 (2023) 103–138.","bibtex":"@article{Tao_Winkler_2023, title={Small-signal solutions to a nonlocal cross-diffusion model for interaction of scroungers with rapidly diffusing foragers}, volume={33}, DOI={<a href=\"https://doi.org/10.1142/s0218202523500045\">10.1142/s0218202523500045</a>}, number={01}, journal={Mathematical Models and Methods in Applied Sciences}, publisher={World Scientific Pub Co Pte Ltd}, author={Tao, Youshan and Winkler, Michael}, year={2023}, pages={103–138} }","mla":"Tao, Youshan, and Michael Winkler. “Small-Signal Solutions to a Nonlocal Cross-Diffusion Model for Interaction of Scroungers with Rapidly Diffusing Foragers.” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 33, no. 01, World Scientific Pub Co Pte Ltd, 2023, pp. 103–38, doi:<a href=\"https://doi.org/10.1142/s0218202523500045\">10.1142/s0218202523500045</a>."},"publication_identifier":{"issn":["0218-2025","1793-6314"]},"publication_status":"published","doi":"10.1142/s0218202523500045","date_updated":"2024-04-07T12:43:17Z","volume":33,"author":[{"first_name":"Youshan","full_name":"Tao, Youshan","last_name":"Tao"},{"first_name":"Michael","full_name":"Winkler, Michael","last_name":"Winkler"}],"abstract":[{"text":"<jats:p> As a simplified version of a three-component taxis cascade model accounting for different migration strategies of two population groups in search of food, a two-component nonlocal nutrient taxis system is considered in a two-dimensional bounded convex domain with smooth boundary. For any given conveniently regular and biologically meaningful initial data, smallness conditions on the prescribed resource growth and on the initial nutrient signal concentration are identified which ensure the global existence of a global classical solution to the corresponding no-flux initial-boundary value problem. Moreover, under additional assumptions on the food production source these solutions are shown to be bounded, and to stabilize toward semi-trivial equilibria in the large time limit, respectively. </jats:p>","lang":"eng"}],"publication":"Mathematical Models and Methods in Applied Sciences","keyword":["Applied Mathematics","Modeling and Simulation"],"language":[{"iso":"eng"}],"year":"2023","issue":"01","title":"Small-signal solutions to a nonlocal cross-diffusion model for interaction of scroungers with rapidly diffusing foragers","publisher":"World Scientific Pub Co Pte Ltd","date_created":"2024-04-07T12:43:13Z"},{"status":"public","publication":"Calculus of Variations and Partial Differential Equations","type":"journal_article","keyword":["Applied Mathematics","Analysis"],"article_number":"180","language":[{"iso":"eng"}],"_id":"53324","user_id":"31496","year":"2023","intvolume":"        62","citation":{"mla":"Ahn, Jaewook, and Michael Winkler. “A Critical Exponent for Blow-up in a Two-Dimensional Chemotaxis-Consumption System.” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 62, no. 6, 180, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00526-023-02523-5\">10.1007/s00526-023-02523-5</a>.","bibtex":"@article{Ahn_Winkler_2023, title={A critical exponent for blow-up in a two-dimensional chemotaxis-consumption system}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s00526-023-02523-5\">10.1007/s00526-023-02523-5</a>}, number={6180}, journal={Calculus of Variations and Partial Differential Equations}, publisher={Springer Science and Business Media LLC}, author={Ahn, Jaewook and Winkler, Michael}, year={2023} }","short":"J. Ahn, M. Winkler, Calculus of Variations and Partial Differential Equations 62 (2023).","apa":"Ahn, J., &#38; Winkler, M. (2023). A critical exponent for blow-up in a two-dimensional chemotaxis-consumption system. <i>Calculus of Variations and Partial Differential Equations</i>, <i>62</i>(6), Article 180. <a href=\"https://doi.org/10.1007/s00526-023-02523-5\">https://doi.org/10.1007/s00526-023-02523-5</a>","chicago":"Ahn, Jaewook, and Michael Winkler. “A Critical Exponent for Blow-up in a Two-Dimensional Chemotaxis-Consumption System.” <i>Calculus of Variations and Partial Differential Equations</i> 62, no. 6 (2023). <a href=\"https://doi.org/10.1007/s00526-023-02523-5\">https://doi.org/10.1007/s00526-023-02523-5</a>.","ieee":"J. Ahn and M. Winkler, “A critical exponent for blow-up in a two-dimensional chemotaxis-consumption system,” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 62, no. 6, Art. no. 180, 2023, doi: <a href=\"https://doi.org/10.1007/s00526-023-02523-5\">10.1007/s00526-023-02523-5</a>.","ama":"Ahn J, Winkler M. A critical exponent for blow-up in a two-dimensional chemotaxis-consumption system. <i>Calculus of Variations and Partial Differential Equations</i>. 2023;62(6). doi:<a href=\"https://doi.org/10.1007/s00526-023-02523-5\">10.1007/s00526-023-02523-5</a>"},"publication_identifier":{"issn":["0944-2669","1432-0835"]},"publication_status":"published","issue":"6","title":"A critical exponent for blow-up in a two-dimensional chemotaxis-consumption system","doi":"10.1007/s00526-023-02523-5","publisher":"Springer Science and Business Media LLC","date_updated":"2024-04-07T12:40:06Z","volume":62,"date_created":"2024-04-07T12:40:02Z","author":[{"first_name":"Jaewook","last_name":"Ahn","full_name":"Ahn, Jaewook"},{"full_name":"Winkler, Michael","last_name":"Winkler","first_name":"Michael"}]},{"publication":"Nonlinear Analysis: Real World Applications","type":"journal_article","status":"public","user_id":"31496","_id":"53329","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics","General Economics","Econometrics and Finance","General Engineering","General Medicine","Analysis"],"article_number":"103820","publication_identifier":{"issn":["1468-1218"]},"publication_status":"published","intvolume":"        71","citation":{"ama":"Tao Y, Winkler M. Analysis of a chemotaxis-SIS epidemic model with unbounded infection force. <i>Nonlinear Analysis: Real World Applications</i>. 2023;71. doi:<a href=\"https://doi.org/10.1016/j.nonrwa.2022.103820\">10.1016/j.nonrwa.2022.103820</a>","chicago":"Tao, Youshan, and Michael Winkler. “Analysis of a Chemotaxis-SIS Epidemic Model with Unbounded Infection Force.” <i>Nonlinear Analysis: Real World Applications</i> 71 (2023). <a href=\"https://doi.org/10.1016/j.nonrwa.2022.103820\">https://doi.org/10.1016/j.nonrwa.2022.103820</a>.","ieee":"Y. Tao and M. Winkler, “Analysis of a chemotaxis-SIS epidemic model with unbounded infection force,” <i>Nonlinear Analysis: Real World Applications</i>, vol. 71, Art. no. 103820, 2023, doi: <a href=\"https://doi.org/10.1016/j.nonrwa.2022.103820\">10.1016/j.nonrwa.2022.103820</a>.","mla":"Tao, Youshan, and Michael Winkler. “Analysis of a Chemotaxis-SIS Epidemic Model with Unbounded Infection Force.” <i>Nonlinear Analysis: Real World Applications</i>, vol. 71, 103820, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.nonrwa.2022.103820\">10.1016/j.nonrwa.2022.103820</a>.","short":"Y. Tao, M. Winkler, Nonlinear Analysis: Real World Applications 71 (2023).","bibtex":"@article{Tao_Winkler_2023, title={Analysis of a chemotaxis-SIS epidemic model with unbounded infection force}, volume={71}, DOI={<a href=\"https://doi.org/10.1016/j.nonrwa.2022.103820\">10.1016/j.nonrwa.2022.103820</a>}, number={103820}, journal={Nonlinear Analysis: Real World Applications}, publisher={Elsevier BV}, author={Tao, Youshan and Winkler, Michael}, year={2023} }","apa":"Tao, Y., &#38; Winkler, M. (2023). Analysis of a chemotaxis-SIS epidemic model with unbounded infection force. <i>Nonlinear Analysis: Real World Applications</i>, <i>71</i>, Article 103820. <a href=\"https://doi.org/10.1016/j.nonrwa.2022.103820\">https://doi.org/10.1016/j.nonrwa.2022.103820</a>"},"year":"2023","volume":71,"date_created":"2024-04-07T12:43:49Z","author":[{"last_name":"Tao","full_name":"Tao, Youshan","first_name":"Youshan"},{"first_name":"Michael","full_name":"Winkler, Michael","last_name":"Winkler"}],"date_updated":"2024-04-07T12:43:53Z","publisher":"Elsevier BV","doi":"10.1016/j.nonrwa.2022.103820","title":"Analysis of a chemotaxis-SIS epidemic model with unbounded infection force"},{"_id":"53326","user_id":"31496","keyword":["Applied Mathematics","General Mathematics"],"language":[{"iso":"eng"}],"publication":"Communications in Mathematical Sciences","type":"journal_article","status":"public","publisher":"International Press of Boston","date_updated":"2024-04-07T12:41:54Z","volume":21,"author":[{"first_name":"Genglin","full_name":"Li, Genglin","last_name":"Li"},{"first_name":"Michael","last_name":"Winkler","full_name":"Winkler, Michael"}],"date_created":"2024-04-07T12:41:49Z","title":"Relaxation in a Keller-Segel-consumption system involving signal-dependent motilities","doi":"10.4310/cms.2023.v21.n2.a1","publication_identifier":{"issn":["1539-6746","1945-0796"]},"publication_status":"published","issue":"2","year":"2023","intvolume":"        21","page":"299-322","citation":{"short":"G. Li, M. Winkler, Communications in Mathematical Sciences 21 (2023) 299–322.","mla":"Li, Genglin, and Michael Winkler. “Relaxation in a Keller-Segel-Consumption System Involving Signal-Dependent Motilities.” <i>Communications in Mathematical Sciences</i>, vol. 21, no. 2, International Press of Boston, 2023, pp. 299–322, doi:<a href=\"https://doi.org/10.4310/cms.2023.v21.n2.a1\">10.4310/cms.2023.v21.n2.a1</a>.","bibtex":"@article{Li_Winkler_2023, title={Relaxation in a Keller-Segel-consumption system involving signal-dependent motilities}, volume={21}, DOI={<a href=\"https://doi.org/10.4310/cms.2023.v21.n2.a1\">10.4310/cms.2023.v21.n2.a1</a>}, number={2}, journal={Communications in Mathematical Sciences}, publisher={International Press of Boston}, author={Li, Genglin and Winkler, Michael}, year={2023}, pages={299–322} }","apa":"Li, G., &#38; Winkler, M. (2023). Relaxation in a Keller-Segel-consumption system involving signal-dependent motilities. <i>Communications in Mathematical Sciences</i>, <i>21</i>(2), 299–322. <a href=\"https://doi.org/10.4310/cms.2023.v21.n2.a1\">https://doi.org/10.4310/cms.2023.v21.n2.a1</a>","ama":"Li G, Winkler M. Relaxation in a Keller-Segel-consumption system involving signal-dependent motilities. <i>Communications in Mathematical Sciences</i>. 2023;21(2):299-322. doi:<a href=\"https://doi.org/10.4310/cms.2023.v21.n2.a1\">10.4310/cms.2023.v21.n2.a1</a>","chicago":"Li, Genglin, and Michael Winkler. “Relaxation in a Keller-Segel-Consumption System Involving Signal-Dependent Motilities.” <i>Communications in Mathematical Sciences</i> 21, no. 2 (2023): 299–322. <a href=\"https://doi.org/10.4310/cms.2023.v21.n2.a1\">https://doi.org/10.4310/cms.2023.v21.n2.a1</a>.","ieee":"G. Li and M. Winkler, “Relaxation in a Keller-Segel-consumption system involving signal-dependent motilities,” <i>Communications in Mathematical Sciences</i>, vol. 21, no. 2, pp. 299–322, 2023, doi: <a href=\"https://doi.org/10.4310/cms.2023.v21.n2.a1\">10.4310/cms.2023.v21.n2.a1</a>."}},{"citation":{"chicago":"Winkler, Michael. “Classical Solutions to Cauchy Problems for Parabolic–Elliptic Systems of Keller-Segel Type.” <i>Open Mathematics</i> 21, no. 1 (2023). <a href=\"https://doi.org/10.1515/math-2022-0578\">https://doi.org/10.1515/math-2022-0578</a>.","ieee":"M. Winkler, “Classical solutions to Cauchy problems for parabolic–elliptic systems of Keller-Segel type,” <i>Open Mathematics</i>, vol. 21, no. 1, 2023, doi: <a href=\"https://doi.org/10.1515/math-2022-0578\">10.1515/math-2022-0578</a>.","ama":"Winkler M. Classical solutions to Cauchy problems for parabolic–elliptic systems of Keller-Segel type. <i>Open Mathematics</i>. 2023;21(1). doi:<a href=\"https://doi.org/10.1515/math-2022-0578\">10.1515/math-2022-0578</a>","short":"M. Winkler, Open Mathematics 21 (2023).","mla":"Winkler, Michael. “Classical Solutions to Cauchy Problems for Parabolic–Elliptic Systems of Keller-Segel Type.” <i>Open Mathematics</i>, vol. 21, no. 1, Walter de Gruyter GmbH, 2023, doi:<a href=\"https://doi.org/10.1515/math-2022-0578\">10.1515/math-2022-0578</a>.","bibtex":"@article{Winkler_2023, title={Classical solutions to Cauchy problems for parabolic–elliptic systems of Keller-Segel type}, volume={21}, DOI={<a href=\"https://doi.org/10.1515/math-2022-0578\">10.1515/math-2022-0578</a>}, number={1}, journal={Open Mathematics}, publisher={Walter de Gruyter GmbH}, author={Winkler, Michael}, year={2023} }","apa":"Winkler, M. (2023). Classical solutions to Cauchy problems for parabolic–elliptic systems of Keller-Segel type. <i>Open Mathematics</i>, <i>21</i>(1). <a href=\"https://doi.org/10.1515/math-2022-0578\">https://doi.org/10.1515/math-2022-0578</a>"},"intvolume":"        21","year":"2023","issue":"1","publication_status":"published","publication_identifier":{"issn":["2391-5455"]},"doi":"10.1515/math-2022-0578","title":"Classical solutions to Cauchy problems for parabolic–elliptic systems of Keller-Segel type","author":[{"first_name":"Michael","full_name":"Winkler, Michael","last_name":"Winkler"}],"date_created":"2024-04-07T12:54:31Z","volume":21,"publisher":"Walter de Gruyter GmbH","date_updated":"2024-04-07T12:54:34Z","status":"public","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>The Cauchy problem in <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_001.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>n</m:mi>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                        </m:math>\r\n                        <jats:tex-math>{{\\mathbb{R}}}^{n}</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>, <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_002.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mi>n</m:mi>\r\n                           <m:mo>≥</m:mo>\r\n                           <m:mn>2</m:mn>\r\n                        </m:math>\r\n                        <jats:tex-math>n\\ge 2</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>, for <jats:disp-formula id=\"j_math-2022-0578_eq_001\">\r\n                     <jats:alternatives>\r\n                        <jats:graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_003.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\" display=\"block\">\r\n                           <m:mtable displaystyle=\"true\">\r\n                              <m:mtr>\r\n                                 <m:mtd columnalign=\"right\">\r\n                                    <m:mfenced open=\"{\" close=\"\">\r\n                                       <m:mrow>\r\n                                          <m:mspace depth=\"1.25em\" />\r\n                                          <m:mtable displaystyle=\"true\">\r\n                                             <m:mtr>\r\n                                                <m:mtd columnalign=\"left\">\r\n                                                   <m:msub>\r\n                                                      <m:mrow>\r\n                                                         <m:mi>u</m:mi>\r\n                                                      </m:mrow>\r\n                                                      <m:mrow>\r\n                                                         <m:mi>t</m:mi>\r\n                                                      </m:mrow>\r\n                                                   </m:msub>\r\n                                                   <m:mo>=</m:mo>\r\n                                                   <m:mi mathvariant=\"normal\">Δ</m:mi>\r\n                                                   <m:mi>u</m:mi>\r\n                                                   <m:mo>−</m:mo>\r\n                                                   <m:mrow>\r\n                                                      <m:mo>∇</m:mo>\r\n                                                   </m:mrow>\r\n                                                   <m:mo>⋅</m:mo>\r\n                                                   <m:mrow>\r\n                                                      <m:mo>(</m:mo>\r\n                                                      <m:mrow>\r\n                                                         <m:mi>u</m:mi>\r\n                                                         <m:mi>S</m:mi>\r\n                                                         <m:mo>⋅</m:mo>\r\n                                                         <m:mrow>\r\n                                                            <m:mo>∇</m:mo>\r\n                                                         </m:mrow>\r\n                                                         <m:mi>v</m:mi>\r\n                                                      </m:mrow>\r\n                                                      <m:mo>)</m:mo>\r\n                                                   </m:mrow>\r\n                                                   <m:mo>,</m:mo>\r\n                                                </m:mtd>\r\n                                             </m:mtr>\r\n                                             <m:mtr>\r\n                                                <m:mtd columnalign=\"left\">\r\n                                                   <m:mn>0</m:mn>\r\n                                                   <m:mo>=</m:mo>\r\n                                                   <m:mi mathvariant=\"normal\">Δ</m:mi>\r\n                                                   <m:mi>v</m:mi>\r\n                                                   <m:mo>+</m:mo>\r\n                                                   <m:mi>u</m:mi>\r\n                                                   <m:mo>,</m:mo>\r\n                                                </m:mtd>\r\n                                             </m:mtr>\r\n                                          </m:mtable>\r\n                                       </m:mrow>\r\n                                    </m:mfenced>\r\n                                    <m:mspace width=\"2.0em\" />\r\n                                    <m:mspace width=\"2.0em\" />\r\n                                    <m:mspace width=\"2.0em\" />\r\n                                    <m:mrow>\r\n                                       <m:mo>(</m:mo>\r\n                                       <m:mrow>\r\n                                          <m:mo>⋆</m:mo>\r\n                                       </m:mrow>\r\n                                       <m:mo>)</m:mo>\r\n                                    </m:mrow>\r\n                                 </m:mtd>\r\n                              </m:mtr>\r\n                           </m:mtable>\r\n                        </m:math>\r\n                        <jats:tex-math>\\begin{array}{r}\\left\\{\\phantom{\\rule[-1.25em]{}{0ex}}\\begin{array}{l}{u}_{t}=\\Delta u-\\nabla \\cdot \\left(uS\\cdot \\nabla v),\\\\ 0=\\Delta v+u,\\end{array}\\right.\\hspace{2.0em}\\hspace{2.0em}\\hspace{2.0em}\\left(\\star )\\end{array}</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:disp-formula> is considered for general matrices <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_004.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mi>S</m:mi>\r\n                           <m:mo>∈</m:mo>\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>n</m:mi>\r\n                                 <m:mo>×</m:mo>\r\n                                 <m:mi>n</m:mi>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                        </m:math>\r\n                        <jats:tex-math>S\\in {{\\mathbb{R}}}^{n\\times n}</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>. A theory of local-in-time classical existence and extensibility is developed in a framework that differs from those considered in large parts of the literature by involving bounded classical solutions. Specifically, it is shown that for all non-negative initial data belonging to <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_005.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mi mathvariant=\"normal\">BUC</m:mi>\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:msup>\r\n                                    <m:mrow>\r\n                                       <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>n</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msup>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                           <m:mo>∩</m:mo>\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi>L</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>p</m:mi>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:msup>\r\n                                    <m:mrow>\r\n                                       <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>n</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msup>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                        </m:math>\r\n                        <jats:tex-math>{\\rm{BUC}}\\left({{\\mathbb{R}}}^{n})\\cap {L}^{p}\\left({{\\mathbb{R}}}^{n})</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula> with some <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_006.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mi>p</m:mi>\r\n                           <m:mo>∈</m:mo>\r\n                           <m:mrow>\r\n                              <m:mo>[</m:mo>\r\n                              <m:mrow>\r\n                                 <m:mn>1</m:mn>\r\n                                 <m:mo>,</m:mo>\r\n                                 <m:mi>n</m:mi>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                        </m:math>\r\n                        <jats:tex-math>p\\in \\left[1,n)</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>, there exist <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_007.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:msub>\r\n                              <m:mrow>\r\n                                 <m:mi>T</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>max</m:mi>\r\n                              </m:mrow>\r\n                           </m:msub>\r\n                           <m:mo>∈</m:mo>\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:mn>0</m:mn>\r\n                                 <m:mo>,</m:mo>\r\n                                 <m:mi>∞</m:mi>\r\n                              </m:mrow>\r\n                              <m:mo>]</m:mo>\r\n                           </m:mrow>\r\n                        </m:math>\r\n                        <jats:tex-math>{T}_{\\max }\\in \\left(0,\\infty ]</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula> and a uniquely determined <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_008.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mi>u</m:mi>\r\n                           <m:mo>∈</m:mo>\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi>C</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mn>0</m:mn>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:mrow>\r\n                                    <m:mo>[</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:mn>0</m:mn>\r\n                                       <m:mo>,</m:mo>\r\n                                       <m:msub>\r\n                                          <m:mrow>\r\n                                             <m:mi>T</m:mi>\r\n                                          </m:mrow>\r\n                                          <m:mrow>\r\n                                             <m:mi>max</m:mi>\r\n                                          </m:mrow>\r\n                                       </m:msub>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                                 <m:mo>;</m:mo>\r\n                                 <m:mspace width=\"0.33em\" />\r\n                                 <m:mi mathvariant=\"normal\">BUC</m:mi>\r\n                                 <m:mrow>\r\n                                    <m:mo>(</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:msup>\r\n                                          <m:mrow>\r\n                                             <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                                          </m:mrow>\r\n                                          <m:mrow>\r\n                                             <m:mi>n</m:mi>\r\n                                          </m:mrow>\r\n                                       </m:msup>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                           <m:mo>∩</m:mo>\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi>C</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mn>0</m:mn>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:mrow>\r\n                                    <m:mo>[</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:mn>0</m:mn>\r\n                                       <m:mo>,</m:mo>\r\n                                       <m:msub>\r\n                                          <m:mrow>\r\n                                             <m:mi>T</m:mi>\r\n                                          </m:mrow>\r\n                                          <m:mrow>\r\n                                             <m:mi>max</m:mi>\r\n                                          </m:mrow>\r\n                                       </m:msub>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                                 <m:mo>;</m:mo>\r\n                                 <m:mspace width=\"0.33em\" />\r\n                                 <m:msup>\r\n                                    <m:mrow>\r\n                                       <m:mi>L</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>p</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msup>\r\n                                 <m:mrow>\r\n                                    <m:mo>(</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:msup>\r\n                                          <m:mrow>\r\n                                             <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                                          </m:mrow>\r\n                                          <m:mrow>\r\n                                             <m:mi>n</m:mi>\r\n                                          </m:mrow>\r\n                                       </m:msup>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                           <m:mo>∩</m:mo>\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi>C</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>∞</m:mi>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:msup>\r\n                                    <m:mrow>\r\n                                       <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>n</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msup>\r\n                                 <m:mo>×</m:mo>\r\n                                 <m:mrow>\r\n                                    <m:mo>(</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:mn>0</m:mn>\r\n                                       <m:mo>,</m:mo>\r\n                                       <m:msub>\r\n                                          <m:mrow>\r\n                                             <m:mi>T</m:mi>\r\n                                          </m:mrow>\r\n                                          <m:mrow>\r\n                                             <m:mi>max</m:mi>\r\n                                          </m:mrow>\r\n                                       </m:msub>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                        </m:math>\r\n                        <jats:tex-math>u\\in {C}^{0}\\left(\\left[0,{T}_{\\max });\\hspace{0.33em}{\\rm{BUC}}\\left({{\\mathbb{R}}}^{n}))\\cap {C}^{0}\\left(\\left[0,{T}_{\\max });\\hspace{0.33em}{L}^{p}\\left({{\\mathbb{R}}}^{n}))\\cap {C}^{\\infty }\\left({{\\mathbb{R}}}^{n}\\times \\left(0,{T}_{\\max }))</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula> such that with <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_009.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mi>v</m:mi>\r\n                           <m:mo>≔</m:mo>\r\n                           <m:mi mathvariant=\"normal\">Γ</m:mi>\r\n                           <m:mo>⋆</m:mo>\r\n                           <m:mi>u</m:mi>\r\n                        </m:math>\r\n                        <jats:tex-math>v:= \\Gamma \\star u</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>, and with <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_010.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mi mathvariant=\"normal\">Γ</m:mi>\r\n                        </m:math>\r\n                        <jats:tex-math>\\Gamma </jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula> denoting the Newtonian kernel on <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_011.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>n</m:mi>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                        </m:math>\r\n                        <jats:tex-math>{{\\mathbb{R}}}^{n}</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>, the pair <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_012.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:mi>u</m:mi>\r\n                                 <m:mo>,</m:mo>\r\n                                 <m:mi>v</m:mi>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                        </m:math>\r\n                        <jats:tex-math>\\left(u,v)</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula> forms a classical solution of (<jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_013.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mo>⋆</m:mo>\r\n                        </m:math>\r\n                        <jats:tex-math>\\star </jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>) in <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_014.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:msup>\r\n                              <m:mrow>\r\n                                 <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>n</m:mi>\r\n                              </m:mrow>\r\n                           </m:msup>\r\n                           <m:mo>×</m:mo>\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:mn>0</m:mn>\r\n                                 <m:mo>,</m:mo>\r\n                                 <m:msub>\r\n                                    <m:mrow>\r\n                                       <m:mi>T</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>max</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msub>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                        </m:math>\r\n                        <jats:tex-math>{{\\mathbb{R}}}^{n}\\times \\left(0,{T}_{\\max })</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>, which has the property that <jats:disp-formula id=\"j_math-2022-0578_eq_002\">\r\n                     <jats:alternatives>\r\n                        <jats:graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_015.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\" display=\"block\">\r\n                           <m:mspace width=\"0.1em\" />\r\n                           <m:mtext>if</m:mtext>\r\n                           <m:mspace width=\"0.1em\" />\r\n                           <m:mspace width=\"0.33em\" />\r\n                           <m:msub>\r\n                              <m:mrow>\r\n                                 <m:mi>T</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>max</m:mi>\r\n                              </m:mrow>\r\n                           </m:msub>\r\n                           <m:mo>&lt;</m:mo>\r\n                           <m:mi>∞</m:mi>\r\n                           <m:mo>,</m:mo>\r\n                           <m:mspace width=\"1.0em\" />\r\n                           <m:mstyle>\r\n                              <m:mspace width=\"0.1em\" />\r\n                              <m:mtext>then both</m:mtext>\r\n                              <m:mspace width=\"0.1em\" />\r\n                           </m:mstyle>\r\n                           <m:mspace width=\"0.33em\" />\r\n                           <m:munder>\r\n                              <m:mrow>\r\n                                 <m:mi>limsup</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>t</m:mi>\r\n                                 <m:mo>↗</m:mo>\r\n                                 <m:msub>\r\n                                    <m:mrow>\r\n                                       <m:mi>T</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>max</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msub>\r\n                              </m:mrow>\r\n                           </m:munder>\r\n                           <m:msub>\r\n                              <m:mrow>\r\n                                 <m:mo>‖</m:mo>\r\n                                 <m:mi>u</m:mi>\r\n                                 <m:mrow>\r\n                                    <m:mo>(</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:mo>⋅</m:mo>\r\n                                       <m:mo>,</m:mo>\r\n                                       <m:mi>t</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                                 <m:mo>‖</m:mo>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:msup>\r\n                                    <m:mrow>\r\n                                       <m:mi>L</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>∞</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msup>\r\n                                 <m:mrow>\r\n                                    <m:mo>(</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:msup>\r\n                                          <m:mrow>\r\n                                             <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                                          </m:mrow>\r\n                                          <m:mrow>\r\n                                             <m:mi>n</m:mi>\r\n                                          </m:mrow>\r\n                                       </m:msup>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                              </m:mrow>\r\n                           </m:msub>\r\n                           <m:mo>=</m:mo>\r\n                           <m:mi>∞</m:mi>\r\n                           <m:mspace width=\"1.0em\" />\r\n                           <m:mspace width=\"0.1em\" />\r\n                           <m:mtext>and</m:mtext>\r\n                           <m:mspace width=\"0.1em\" />\r\n                           <m:mspace width=\"1.0em\" />\r\n                           <m:munder>\r\n                              <m:mrow>\r\n                                 <m:mi>limsup</m:mi>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:mi>t</m:mi>\r\n                                 <m:mo>↗</m:mo>\r\n                                 <m:msub>\r\n                                    <m:mrow>\r\n                                       <m:mi>T</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>max</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msub>\r\n                              </m:mrow>\r\n                           </m:munder>\r\n                           <m:msub>\r\n                              <m:mrow>\r\n                                 <m:mo>‖</m:mo>\r\n                                 <m:mrow>\r\n                                    <m:mo>∇</m:mo>\r\n                                 </m:mrow>\r\n                                 <m:mi>v</m:mi>\r\n                                 <m:mrow>\r\n                                    <m:mo>(</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:mo>⋅</m:mo>\r\n                                       <m:mo>,</m:mo>\r\n                                       <m:mi>t</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                                 <m:mo>‖</m:mo>\r\n                              </m:mrow>\r\n                              <m:mrow>\r\n                                 <m:msup>\r\n                                    <m:mrow>\r\n                                       <m:mi>L</m:mi>\r\n                                    </m:mrow>\r\n                                    <m:mrow>\r\n                                       <m:mi>∞</m:mi>\r\n                                    </m:mrow>\r\n                                 </m:msup>\r\n                                 <m:mrow>\r\n                                    <m:mo>(</m:mo>\r\n                                    <m:mrow>\r\n                                       <m:msup>\r\n                                          <m:mrow>\r\n                                             <m:mi mathvariant=\"double-struck\">R</m:mi>\r\n                                          </m:mrow>\r\n                                          <m:mrow>\r\n                                             <m:mi>n</m:mi>\r\n                                          </m:mrow>\r\n                                       </m:msup>\r\n                                    </m:mrow>\r\n                                    <m:mo>)</m:mo>\r\n                                 </m:mrow>\r\n                              </m:mrow>\r\n                           </m:msub>\r\n                           <m:mo>=</m:mo>\r\n                           <m:mi>∞</m:mi>\r\n                           <m:mo>.</m:mo>\r\n                        </m:math>\r\n                        <jats:tex-math>\\hspace{0.1em}\\text{if}\\hspace{0.1em}\\hspace{0.33em}{T}_{\\max }\\lt \\infty ,\\hspace{1.0em}\\hspace{0.1em}\\text{then both}\\hspace{0.1em}\\hspace{0.33em}\\mathop{\\mathrm{limsup}}\\limits_{t\\nearrow {T}_{\\max }}\\Vert u\\left(\\cdot ,t){\\Vert }_{{L}^{\\infty }\\left({{\\mathbb{R}}}^{n})}=\\infty \\hspace{1.0em}\\hspace{0.1em}\\text{and}\\hspace{0.1em}\\hspace{1.0em}\\mathop{\\mathrm{limsup}}\\limits_{t\\nearrow {T}_{\\max }}\\Vert \\nabla v\\left(\\cdot ,t){\\Vert }_{{L}^{\\infty }\\left({{\\mathbb{R}}}^{n})}=\\infty .</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:disp-formula> An exemplary application of this provides a result on global classical solvability in cases when <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_016.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mo>∣</m:mo>\r\n                           <m:mi>S</m:mi>\r\n                           <m:mo>+</m:mo>\r\n                           <m:mn mathvariant=\"bold\">1</m:mn>\r\n                           <m:mo>∣</m:mo>\r\n                        </m:math>\r\n                        <jats:tex-math>| S+{\\bf{1}}| </jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula> is sufficiently small, where <jats:inline-formula>\r\n                     <jats:alternatives>\r\n                        <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2022-0578_eq_017.png\" />\r\n                        <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\">\r\n                           <m:mn mathvariant=\"bold\">1</m:mn>\r\n                           <m:mo>=</m:mo>\r\n                           <m:mi mathvariant=\"normal\">diag</m:mi>\r\n                           <m:mspace width=\"0.33em\" />\r\n                           <m:mrow>\r\n                              <m:mo>(</m:mo>\r\n                              <m:mrow>\r\n                                 <m:mn>1</m:mn>\r\n                                 <m:mo>,</m:mo>\r\n                                 <m:mrow>\r\n                                    <m:mo>…</m:mo>\r\n                                 </m:mrow>\r\n                                 <m:mo>,</m:mo>\r\n                                 <m:mn>1</m:mn>\r\n                              </m:mrow>\r\n                              <m:mo>)</m:mo>\r\n                           </m:mrow>\r\n                        </m:math>\r\n                        <jats:tex-math>{\\bf{1}}={\\rm{diag}}\\hspace{0.33em}\\left(1,\\ldots ,1)</jats:tex-math>\r\n                     </jats:alternatives>\r\n                  </jats:inline-formula>.</jats:p>"}],"type":"journal_article","publication":"Open Mathematics","language":[{"iso":"eng"}],"keyword":["General Mathematics"],"user_id":"31496","_id":"53343"}]
