[{"year":"2023","quality_controlled":"1","issue":"1","title":"Backward error analysis for conjugate symplectic methods","publisher":"AIMS Press","date_created":"2022-01-11T12:48:39Z","abstract":[{"text":"The numerical solution of an ordinary differential equation can be interpreted as the exact solution of a nearby modified equation. Investigating the behaviour of numerical solutions by analysing the modified equation is known as backward error analysis. If the original and modified equation share structural properties, then the exact and approximate solution share geometric features such as the existence of conserved quantities. Conjugate symplectic methods preserve a modified symplectic form and a modified Hamiltonian when applied to a Hamiltonian system. We show how a blended version of variational and symplectic techniques can be used to compute modified symplectic and Hamiltonian structures. In contrast to other approaches, our backward error analysis method does not rely on an ansatz but computes the structures systematically, provided that a variational formulation of the method is known. The technique is illustrated on the example of symmetric linear multistep methods with matrix coefficients.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"32801","file_name":"BEA_MultiStep_Matrix.pdf","file_size":827030,"description":"The numerical solution of an ordinary differential equation can be interpreted as the exact solution of a nearby modified equation. Investigating the behaviour of numerical solutions by analysing the modified equation is known as backward error analysis. If the original and modified equation share structural properties, then the exact and approximate solution share geometric features such as the existence of conserved quantities. Conjugate symplectic methods preserve a modified symplectic form and a modified Hamiltonian when applied to a Hamiltonian system. We show how a blended version of variational and symplectic techniques can be used to compute modified symplectic and Hamiltonian structures. In contrast to other approaches, our backward error analysis method does not rely on an ansatz but computes the structures systematically, provided that a variational formulation of the method is known. The technique is illustrated on the example of symmetric linear multistep methods with matrix coefficients.","title":"Backward error analysis for conjugate symplectic methods","date_created":"2022-08-12T16:48:59Z","creator":"coffen","date_updated":"2022-08-12T16:48:59Z"}],"publication":"Journal of Geometric Mechanics","ddc":["510"],"keyword":["variational integrators","backward error analysis","Euler--Lagrange equations","multistep methods","conjugate symplectic methods"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2201.03911"]},"citation":{"ama":"McLachlan R, Offen C. Backward error analysis for conjugate symplectic methods. <i>Journal of Geometric Mechanics</i>. 2023;15(1):98-115. doi:<a href=\"https://doi.org/10.3934/jgm.2023005\">10.3934/jgm.2023005</a>","chicago":"McLachlan, Robert, and Christian Offen. “Backward Error Analysis for Conjugate Symplectic Methods.” <i>Journal of Geometric Mechanics</i> 15, no. 1 (2023): 98–115. <a href=\"https://doi.org/10.3934/jgm.2023005\">https://doi.org/10.3934/jgm.2023005</a>.","ieee":"R. McLachlan and C. Offen, “Backward error analysis for conjugate symplectic methods,” <i>Journal of Geometric Mechanics</i>, vol. 15, no. 1, pp. 98–115, 2023, doi: <a href=\"https://doi.org/10.3934/jgm.2023005\">10.3934/jgm.2023005</a>.","mla":"McLachlan, Robert, and Christian Offen. “Backward Error Analysis for Conjugate Symplectic Methods.” <i>Journal of Geometric Mechanics</i>, vol. 15, no. 1, AIMS Press, 2023, pp. 98–115, doi:<a href=\"https://doi.org/10.3934/jgm.2023005\">10.3934/jgm.2023005</a>.","bibtex":"@article{McLachlan_Offen_2023, title={Backward error analysis for conjugate symplectic methods}, volume={15}, DOI={<a href=\"https://doi.org/10.3934/jgm.2023005\">10.3934/jgm.2023005</a>}, number={1}, journal={Journal of Geometric Mechanics}, publisher={AIMS Press}, author={McLachlan, Robert and Offen, Christian}, year={2023}, pages={98–115} }","short":"R. McLachlan, C. Offen, Journal of Geometric Mechanics 15 (2023) 98–115.","apa":"McLachlan, R., &#38; Offen, C. (2023). Backward error analysis for conjugate symplectic methods. <i>Journal of Geometric Mechanics</i>, <i>15</i>(1), 98–115. <a href=\"https://doi.org/10.3934/jgm.2023005\">https://doi.org/10.3934/jgm.2023005</a>"},"page":"98-115","intvolume":"        15","publication_status":"published","has_accepted_license":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/Christian-Offen/BEAConjugateSymplectic"}]},"doi":"10.3934/jgm.2023005","date_updated":"2023-08-10T08:40:30Z","oa":"1","author":[{"first_name":"Robert","last_name":"McLachlan","full_name":"McLachlan, Robert"},{"id":"85279","full_name":"Offen, Christian","orcid":"0000-0002-5940-8057","last_name":"Offen","first_name":"Christian"}],"volume":15,"status":"public","type":"journal_article","article_type":"original","file_date_updated":"2022-08-12T16:48:59Z","_id":"29236","user_id":"85279","department":[{"_id":"636"}]},{"date_updated":"2023-09-14T12:33:22Z","author":[{"full_name":"Soyka, Chantal","id":"83964","orcid":"https://orcid.org/0000-0002-4881-5378","last_name":"Soyka","first_name":"Chantal"},{"full_name":"Ullrich, Meike","last_name":"Ullrich","first_name":"Meike"},{"first_name":"Michael","full_name":"Striewe, Michael","last_name":"Striewe"},{"first_name":"Niclas","full_name":"Schaper, Niclas","last_name":"Schaper"}],"volume":18,"doi":"10.18417/EMISA.18.7","publication_status":"published","has_accepted_license":"1","citation":{"ama":"Soyka C, Ullrich M, Striewe M, Schaper N. Comparison of Required Competences and Task Material in Modeling Education. <i>Enterprise Modelling and Information Systems Architectures</i>. 2023;18. doi:<a href=\"https://doi.org/10.18417/EMISA.18.7\">10.18417/EMISA.18.7</a>","chicago":"Soyka, Chantal, Meike Ullrich, Michael Striewe, and Niclas Schaper. “Comparison of Required Competences and Task Material in Modeling Education.” <i>Enterprise Modelling and Information Systems Architectures</i> 18 (2023). <a href=\"https://doi.org/10.18417/EMISA.18.7\">https://doi.org/10.18417/EMISA.18.7</a>.","ieee":"C. Soyka, M. Ullrich, M. Striewe, and N. Schaper, “Comparison of Required Competences and Task Material in Modeling Education,” <i>Enterprise Modelling and Information Systems Architectures</i>, vol. 18, Art. no. 7, 2023, doi: <a href=\"https://doi.org/10.18417/EMISA.18.7\">10.18417/EMISA.18.7</a>.","apa":"Soyka, C., Ullrich, M., Striewe, M., &#38; Schaper, N. (2023). Comparison of Required Competences and Task Material in Modeling Education. <i>Enterprise Modelling and Information Systems Architectures</i>, <i>18</i>, Article 7. <a href=\"https://doi.org/10.18417/EMISA.18.7\">https://doi.org/10.18417/EMISA.18.7</a>","short":"C. Soyka, M. Ullrich, M. Striewe, N. Schaper, Enterprise Modelling and Information Systems Architectures 18 (2023).","bibtex":"@article{Soyka_Ullrich_Striewe_Schaper_2023, title={Comparison of Required Competences and Task Material in Modeling Education}, volume={18}, DOI={<a href=\"https://doi.org/10.18417/EMISA.18.7\">10.18417/EMISA.18.7</a>}, number={7}, journal={Enterprise Modelling and Information Systems Architectures}, author={Soyka, Chantal and Ullrich, Meike and Striewe, Michael and Schaper, Niclas}, year={2023} }","mla":"Soyka, Chantal, et al. “Comparison of Required Competences and Task Material in Modeling Education.” <i>Enterprise Modelling and Information Systems Architectures</i>, vol. 18, 7, 2023, doi:<a href=\"https://doi.org/10.18417/EMISA.18.7\">10.18417/EMISA.18.7</a>."},"intvolume":"        18","_id":"47065","user_id":"83964","department":[{"_id":"423"}],"article_number":"7","article_type":"original","file_date_updated":"2023-09-14T12:30:14Z","type":"journal_article","status":"public","date_created":"2023-09-14T12:24:03Z","title":"Comparison of Required Competences and Task Material in Modeling Education","quality_controlled":"1","year":"2023","ddc":["006","000","006"],"keyword":["conceptual modeling","higher education","competence-oriented assessment","task analysis","graphical modeling"],"language":[{"iso":"eng"}],"publication":"Enterprise Modelling and Information Systems Architectures","abstract":[{"text":"The reform of the European academic landscape with the introduction of bachelor's and master's degree programs has brought about several profound changes for teaching and assessment in higher education. With regard to the examination system, the shift towards output-oriented teaching is still one of the most significant challenges. Assessments have to be integrated into the teaching and learning arrangements and consistently aligned towards the intended learning outcomes. In particular, assessments should provide valid evidence that learners have acquired competences that are relevant for a specific domain. However, it seems that this didactic goal has not yet been fully achieved in modeling education in computer science. The aim of this study is to investigate whether typical task material used in exercises and exams in modeling education at selected German universities covers relevant competences required for graphical modeling. For this purpose, typical tasks in the field of modeling are first identified by means of a content-analytical procedure. Subsequently, it is determined which competence facets relevant for graphical modeling are addressed by the task types. By contrasting a competence model for modeling with the competences addressed by the tasks, a gap was identified between the required competences and the task material analyzed. In particular, the gap analysis shows the neglect of transversal competence facets as well as those related to the analysis and evaluation of models. The result of this paper is a classification of task types for modeling education and a specification of the competence facets addressed by these tasks. Recommendations for developing and assessing student's competences comprehensively are given.","lang":"eng"}],"file":[{"date_created":"2023-09-14T12:29:05Z","creator":"csoyka","date_updated":"2023-09-14T12:29:05Z","file_name":"emisaj_18_7.pdf","file_id":"47068","access_level":"closed","file_size":632368,"content_type":"application/pdf","relation":"main_file","success":1},{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":229381,"access_level":"closed","file_name":"Supplementary material_Competence facets and task types.pdf","file_id":"47069","date_updated":"2023-09-14T12:30:14Z","date_created":"2023-09-14T12:30:14Z","creator":"csoyka"},{"date_updated":"2023-09-14T12:30:14Z","creator":"csoyka","date_created":"2023-09-14T12:30:14Z","file_size":348555,"file_id":"47070","file_name":"Supplementary material_Competence-oriented Task catalog.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"title":"Editorial","date_created":"2023-09-21T13:29:50Z","year":"2023","quality_controlled":"1","language":[{"iso":"ger"}],"ddc":["900"],"keyword":["Financial History","Discourse Analysis","History of Money"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2023-09-21T13:25:41Z","date_created":"2023-09-21T13:25:41Z","creator":"schoenha","file_size":275465,"file_id":"47156","file_name":"Schönhärl Schotters Thiemeyer Editorial Reden über Geld.pdf","access_level":"closed"}],"abstract":[{"lang":"eng","text":"»Über Geld spricht man nicht.« Diese Benimmregel erweist sich beim Blick in die Ver-\r\ngangenheit als Illusion. Keineswegs war Geld grundsätzlich ein Tabuthema zwischen-\r\nmenschlicher Kommunikation. Ganz im Gegenteil: Mit dem Reden über Geld wird dieses\r\nmit Bedeutung aufgeladen. Die Autor*innen dieses Themenheftes untersuch en Gelddis-\r\nkurse und die Zuschreibungen von Bedeutung an Geld in der internationalen Geschichte."}],"publication":"Werkstatt Geschichte","main_file_link":[{"open_access":"1","url":"https://werkstattgeschichte.de/wp-content/uploads/2023/09/WG88_009-014_EDITORIAL.pdf"}],"author":[{"last_name":"Schönhärl","orcid":"0000-0002-7967-3261","full_name":"Schönhärl, Korinna","id":"89037","first_name":"Korinna"},{"first_name":"Frederike ","last_name":"Schotters","full_name":"Schotters, Frederike "},{"first_name":"Guido","full_name":"Thiemeyer, Guido","last_name":"Thiemeyer"}],"volume":88,"oa":"1","date_updated":"2023-09-21T13:30:14Z","citation":{"apa":"Schönhärl, K., Schotters, F., &#38; Thiemeyer, G. (2023). Editorial. <i>Werkstatt Geschichte</i>, <i>88</i>.","short":"K. Schönhärl, F. Schotters, G. Thiemeyer, Werkstatt Geschichte 88 (2023).","mla":"Schönhärl, Korinna, et al. “Editorial.” <i>Werkstatt Geschichte</i>, vol. 88, 2023.","bibtex":"@article{Schönhärl_Schotters_Thiemeyer_2023, title={Editorial}, volume={88}, journal={Werkstatt Geschichte}, author={Schönhärl, Korinna and Schotters, Frederike  and Thiemeyer, Guido}, year={2023} }","ama":"Schönhärl K, Schotters F, Thiemeyer G. Editorial. <i>Werkstatt Geschichte</i>. 2023;88.","chicago":"Schönhärl, Korinna, Frederike  Schotters, and Guido Thiemeyer. “Editorial.” <i>Werkstatt Geschichte</i> 88 (2023).","ieee":"K. Schönhärl, F. Schotters, and G. Thiemeyer, “Editorial,” <i>Werkstatt Geschichte</i>, vol. 88, 2023."},"jel":["N40"],"intvolume":"        88","publication_status":"published","has_accepted_license":"1","file_date_updated":"2023-09-21T13:25:41Z","article_type":"original","user_id":"89037","department":[{"_id":"445"}],"_id":"47155","status":"public","type":"journal_article"},{"keyword":["Financial History","Discourse Analysis","History of Money"],"language":[{"iso":"ger"}],"_id":"47154","department":[{"_id":"445"}],"user_id":"89037","abstract":[{"lang":"eng","text":"»Über Geld spricht man nicht.« Diese Benimmregel erweist sich beim Blick in die Vergangenheit als Illusion. Keineswegs war Geld grundsätzlich ein Tabuthema zwischenmenschlicher Kommunikation. Ganz im Gegenteil: Mit dem Reden über Geld wird dieses mit Bedeutung aufgeladen. Die Autor*innen dieses Themenheftes untersuchen Gelddiskurse und die Zuschreibungen von Bedeutung an Geld in der internationalen Geschichte."}],"editor":[{"first_name":"Korinna","full_name":"Schönhärl, Korinna","id":"89037","orcid":"0000-0002-7967-3261","last_name":"Schönhärl"},{"first_name":"Frederike","last_name":"Schotters","full_name":"Schotters, Frederike"},{"first_name":"Guido","last_name":"Thiemeyer","full_name":"Thiemeyer, Guido"}],"status":"public","publication":"Werkstatt Geschichte","type":"journal_editor","title":"Reden über Geld","date_updated":"2023-09-21T13:36:09Z","volume":88,"date_created":"2023-09-21T13:23:02Z","year":"2023","intvolume":"        88","citation":{"short":"K. Schönhärl, F. Schotters, G. Thiemeyer, eds., Reden über Geld, 2023.","bibtex":"@book{Schönhärl_Schotters_Thiemeyer_2023, title={Reden über Geld}, volume={88}, journal={Werkstatt Geschichte}, year={2023} }","mla":"Schönhärl, Korinna, et al., editors. “Reden über Geld.” <i>Werkstatt Geschichte</i>, vol. 88, 2023.","apa":"Reden über Geld. (2023). In K. Schönhärl, F. Schotters, &#38; G. Thiemeyer (Eds.), <i>Werkstatt Geschichte</i> (Vol. 88).","ieee":"K. Schönhärl, F. Schotters, and G. Thiemeyer, Eds., <i>Reden über Geld</i>, vol. 88. 2023.","chicago":"Schönhärl, Korinna, Frederike Schotters, and Guido Thiemeyer, eds. <i>Reden über Geld</i>. <i>Werkstatt Geschichte</i>. Vol. 88, 2023.","ama":"Schönhärl K, Schotters F, Thiemeyer G, eds. <i>Reden über Geld</i>. Vol 88.; 2023."},"jel":["B","B2"],"quality_controlled":"1","publication_status":"published","related_material":{"link":[{"url":"https://werkstattgeschichte.de/editorial/nr-8-reden-ueber-geld/","relation":"confirmation"}]}},{"author":[{"first_name":"Mugdha","full_name":"Khedkar, Mugdha","id":"88024","last_name":"Khedkar"}],"date_updated":"2024-09-16T08:46:25Z","doi":"10.1109/ICSE-Companion58688.2023.00054","publication_status":"accepted","has_accepted_license":"1","citation":{"ama":"Khedkar M. Static Analysis for Android GDPR Compliance Assurance. In: <i>2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), Melbourne, Australia, 2023, Pp. 197-199</i>. doi:<a href=\"https://doi.org/10.1109/ICSE-Companion58688.2023.00054\">10.1109/ICSE-Companion58688.2023.00054</a>","ieee":"M. Khedkar, “Static Analysis for Android GDPR Compliance Assurance,” doi: <a href=\"https://doi.org/10.1109/ICSE-Companion58688.2023.00054\">10.1109/ICSE-Companion58688.2023.00054</a>.","chicago":"Khedkar, Mugdha. “Static Analysis for Android GDPR Compliance Assurance.” In <i>2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), Melbourne, Australia, 2023, Pp. 197-199</i>, n.d. <a href=\"https://doi.org/10.1109/ICSE-Companion58688.2023.00054\">https://doi.org/10.1109/ICSE-Companion58688.2023.00054</a>.","short":"M. Khedkar, in: 2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), Melbourne, Australia, 2023, Pp. 197-199, n.d.","mla":"Khedkar, Mugdha. “Static Analysis for Android GDPR Compliance Assurance.” <i>2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), Melbourne, Australia, 2023, Pp. 197-199</i>, doi:<a href=\"https://doi.org/10.1109/ICSE-Companion58688.2023.00054\">10.1109/ICSE-Companion58688.2023.00054</a>.","bibtex":"@inproceedings{Khedkar, title={Static Analysis for Android GDPR Compliance Assurance}, DOI={<a href=\"https://doi.org/10.1109/ICSE-Companion58688.2023.00054\">10.1109/ICSE-Companion58688.2023.00054</a>}, booktitle={2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), Melbourne, Australia, 2023, pp. 197-199}, author={Khedkar, Mugdha} }","apa":"Khedkar, M. (n.d.). Static Analysis for Android GDPR Compliance Assurance. <i>2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), Melbourne, Australia, 2023, Pp. 197-199</i>. <a href=\"https://doi.org/10.1109/ICSE-Companion58688.2023.00054\">https://doi.org/10.1109/ICSE-Companion58688.2023.00054</a>"},"user_id":"88024","department":[{"_id":"76"}],"_id":"44146","file_date_updated":"2023-04-24T12:15:27Z","type":"conference","status":"public","date_created":"2023-04-24T12:14:17Z","title":"Static Analysis for Android GDPR Compliance Assurance","year":"2023","external_id":{"arxiv":["2303.09606"]},"language":[{"iso":"eng"}],"ddc":["004"],"keyword":["static analysis","data protection and privacy","GDPR compliance"],"publication":"2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), Melbourne, Australia, 2023, pp. 197-199","file":[{"file_size":85313,"file_id":"44147","access_level":"closed","file_name":"2023047614.pdf","date_updated":"2023-04-24T12:15:27Z","creator":"khedkarm","date_created":"2023-04-24T12:15:27Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Many Android applications collect data from users. When they do, they must\r\nprotect this collected data according to the current legal frameworks. Such\r\ndata protection has become even more important since the European Union rolled\r\nout the General Data Protection Regulation (GDPR). App developers have limited\r\ntool support to reason about data protection throughout their app development\r\nprocess. Although many Android applications state a privacy policy, privacy\r\npolicy compliance checks are currently manual, expensive, and prone to error.\r\nOne of the major challenges in privacy audits is the significant gap between\r\nlegal privacy statements (in English text) and technical measures that Android\r\napps use to protect their user's privacy. In this thesis, we will explore to\r\nwhat extent we can use static analysis to answer important questions regarding\r\ndata protection. Our main goal is to design a tool based approach that aids app\r\ndevelopers and auditors in ensuring data protection in Android applications,\r\nbased on automated static program analysis."}]},{"publication":"IFAC-PapersOnLine","type":"conference","status":"public","abstract":[{"lang":"eng","text":"Low-quality models that miss relevant dynamics lead to major challenges in modelbased\r\nstate estimation. We address this issue by simultaneously estimating the system’s states\r\nand its model inaccuracies by a square root unscented Kalman filter (SRUKF). Concretely,\r\nwe augment the state with the parameter vector of a linear combination containing suitable\r\nfunctions that approximate the lacking dynamics. Presuming that only a few dynamical terms\r\nare relevant, the parameter vector is claimed to be sparse. In Bayesian setting, properties like\r\nsparsity are expressed by a prior distribution. One common choice for sparsity is a Laplace\r\ndistribution. However, due to disadvantages of a Laplacian prior in regards to the SRUKF,\r\nthe regularized horseshoe distribution, a Gaussian that approximately features sparsity, is\r\napplied instead. Results exhibit small estimation errors with model improvements detected by\r\nan automated model reduction technique."}],"department":[{"_id":"153"},{"_id":"880"}],"user_id":"43992","_id":"44326","language":[{"iso":"eng"}],"keyword":["joint estimation","unscented Kalman filter","sparsity","Laplacian prior","regularized horseshoe","principal component analysis"],"issue":"2","quality_controlled":"1","page":"869-874","intvolume":"        56","citation":{"apa":"Götte, R.-S., &#38; Timmermann, J. (2023). Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF. <i>IFAC-PapersOnLine</i>, <i>56</i>(2), 869–874.","bibtex":"@inproceedings{Götte_Timmermann_2023, title={Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF}, volume={56}, number={2}, booktitle={IFAC-PapersOnLine}, author={Götte, Ricarda-Samantha and Timmermann, Julia}, year={2023}, pages={869–874} }","short":"R.-S. Götte, J. Timmermann, in: IFAC-PapersOnLine, 2023, pp. 869–874.","mla":"Götte, Ricarda-Samantha, and Julia Timmermann. “Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF.” <i>IFAC-PapersOnLine</i>, vol. 56, no. 2, 2023, pp. 869–74.","ama":"Götte R-S, Timmermann J. Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF. In: <i>IFAC-PapersOnLine</i>. Vol 56. ; 2023:869-874.","ieee":"R.-S. Götte and J. Timmermann, “Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF,” in <i>IFAC-PapersOnLine</i>, Yokohama, Japan, 2023, vol. 56, no. 2, pp. 869–874.","chicago":"Götte, Ricarda-Samantha, and Julia Timmermann. “Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF.” In <i>IFAC-PapersOnLine</i>, 56:869–74, 2023."},"year":"2023","volume":56,"date_created":"2023-05-02T15:16:43Z","author":[{"first_name":"Ricarda-Samantha","full_name":"Götte, Ricarda-Samantha","id":"43992","last_name":"Götte"},{"first_name":"Julia","id":"15402","full_name":"Timmermann, Julia","last_name":"Timmermann"}],"date_updated":"2024-11-13T08:42:37Z","conference":{"end_date":"2023-07-14","location":"Yokohama, Japan","name":"22nd IFAC World Congress","start_date":"2023-07-09"},"title":"Approximating a Laplacian Prior for Joint State and Model Estimation within an UKF"},{"user_id":"15249","_id":"36522","file_date_updated":"2023-01-26T10:48:40Z","language":[{"iso":"eng"}],"keyword":["static analysis","python","code comprehension","annotation","literate programming","jupyter notebook"],"ddc":["000"],"type":"conference","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"40304","access_level":"open_access","file_name":"2301.04419.pdf","file_size":1862440,"creator":"ashwin","date_created":"2023-01-26T10:48:40Z","date_updated":"2023-01-26T10:48:40Z"}],"abstract":[{"text":"Jupyter notebooks enable developers to interleave code snippets with rich-text and in-line visualizations. Data scientists use Jupyter notebook as the de-facto standard for creating and sharing machine-learning based solutions, primarily written in Python. Recent studies have demonstrated, however, that a large portion of Jupyter notebooks available on public platforms are undocumented and lacks a narrative structure. This reduces the readability of these notebooks. To address this shortcoming, this paper presents HeaderGen, a novel tool-based approach that automatically annotates code cells with categorical markdown headers based on a taxonomy of machine-learning operations, and classifies and displays function calls according to this taxonomy. For this functionality to be realized, HeaderGen enhances an existing call graph analysis in PyCG. To improve precision, HeaderGen extends PyCG's analysis with support for handling external library code and flow-sensitivity. The former is realized by facilitating the resolution of function return-types. Furthermore, HeaderGen uses type information to perform pattern matching on code syntax to annotate code cells.\r\nThe evaluation on 15 real-world Jupyter notebooks from Kaggle shows that HeaderGen's underlying call graph analysis yields high accuracy (96.4% precision and 95.9% recall). This is because HeaderGen can resolve return-types of external libraries where existing type inference tools such as pytype (by Google), pyright (by Microsoft), and Jedi fall short. The header generation has a precision of 82.2% and a recall rate of 96.8% with regard to headers created manually by experts. In a user study, HeaderGen helps participants finish comprehension and navigation tasks faster. All participants clearly perceive HeaderGen as useful to their task.","lang":"eng"}],"date_created":"2023-01-13T08:03:26Z","author":[{"first_name":"Ashwin Prasad","last_name":"Shivarpatna Venkatesh","full_name":"Shivarpatna Venkatesh, Ashwin Prasad","id":"66637"},{"full_name":"Wang, Jiawei","last_name":"Wang","first_name":"Jiawei"},{"first_name":"Li","last_name":"Li","full_name":"Li, Li"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden"}],"oa":"1","publisher":"IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering)","date_updated":"2025-04-07T10:18:03Z","doi":"10.48550/ARXIV.2301.04419","conference":{"name":"IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering)"},"title":"Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis","has_accepted_license":"1","citation":{"apa":"Shivarpatna Venkatesh, A. P., Wang, J., Li, L., &#38; Bodden, E. (2023). <i>Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis</i>. IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering). <a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">https://doi.org/10.48550/ARXIV.2301.04419</a>","bibtex":"@inproceedings{Shivarpatna Venkatesh_Wang_Li_Bodden_2023, title={Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>}, publisher={IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering)}, author={Shivarpatna Venkatesh, Ashwin Prasad and Wang, Jiawei and Li, Li and Bodden, Eric}, year={2023} }","mla":"Shivarpatna Venkatesh, Ashwin Prasad, et al. <i>Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis</i>. IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023, doi:<a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>.","short":"A.P. Shivarpatna Venkatesh, J. Wang, L. Li, E. Bodden, in: IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023.","ama":"Shivarpatna Venkatesh AP, Wang J, Li L, Bodden E. Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis. In: IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering); 2023. doi:<a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>","ieee":"A. P. Shivarpatna Venkatesh, J. Wang, L. Li, and E. Bodden, “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis,” presented at the IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023, doi: <a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>.","chicago":"Shivarpatna Venkatesh, Ashwin Prasad, Jiawei Wang, Li Li, and Eric Bodden. “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis.” IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023. <a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">https://doi.org/10.48550/ARXIV.2301.04419</a>."},"year":"2023"},{"type":"journal_article","status":"public","_id":"46100","department":[{"_id":"799"}],"user_id":"99427","article_number":"127558","publication_identifier":{"issn":["0022-247X"]},"publication_status":"published","intvolume":"       528","citation":{"ieee":"B. Hinrichs, D. W. Janssen, and J. Ziebell, “Super-Gaussian decay of exponentials: A sufficient condition,” <i>Journal of Mathematical Analysis and Applications</i>, vol. 528, no. 1, Art. no. 127558, 2023, doi: <a href=\"https://doi.org/10.1016/j.jmaa.2023.127558\">10.1016/j.jmaa.2023.127558</a>.","chicago":"Hinrichs, Benjamin, Daan W. Janssen, and Jobst Ziebell. “Super-Gaussian Decay of Exponentials: A Sufficient Condition.” <i>Journal of Mathematical Analysis and Applications</i> 528, no. 1 (2023). <a href=\"https://doi.org/10.1016/j.jmaa.2023.127558\">https://doi.org/10.1016/j.jmaa.2023.127558</a>.","ama":"Hinrichs B, Janssen DW, Ziebell J. Super-Gaussian decay of exponentials: A sufficient condition. <i>Journal of Mathematical Analysis and Applications</i>. 2023;528(1). doi:<a href=\"https://doi.org/10.1016/j.jmaa.2023.127558\">10.1016/j.jmaa.2023.127558</a>","bibtex":"@article{Hinrichs_Janssen_Ziebell_2023, title={Super-Gaussian decay of exponentials: A sufficient condition}, volume={528}, DOI={<a href=\"https://doi.org/10.1016/j.jmaa.2023.127558\">10.1016/j.jmaa.2023.127558</a>}, number={1127558}, journal={Journal of Mathematical Analysis and Applications}, publisher={Elsevier BV}, author={Hinrichs, Benjamin and Janssen, Daan W. and Ziebell, Jobst}, year={2023} }","mla":"Hinrichs, Benjamin, et al. “Super-Gaussian Decay of Exponentials: A Sufficient Condition.” <i>Journal of Mathematical Analysis and Applications</i>, vol. 528, no. 1, 127558, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.jmaa.2023.127558\">10.1016/j.jmaa.2023.127558</a>.","short":"B. Hinrichs, D.W. Janssen, J. Ziebell, Journal of Mathematical Analysis and Applications 528 (2023).","apa":"Hinrichs, B., Janssen, D. W., &#38; Ziebell, J. (2023). Super-Gaussian decay of exponentials: A sufficient condition. <i>Journal of Mathematical Analysis and Applications</i>, <i>528</i>(1), Article 127558. <a href=\"https://doi.org/10.1016/j.jmaa.2023.127558\">https://doi.org/10.1016/j.jmaa.2023.127558</a>"},"date_updated":"2026-01-16T09:04:39Z","oa":"1","volume":528,"author":[{"full_name":"Hinrichs, Benjamin","id":"99427","orcid":"0000-0001-9074-1205","last_name":"Hinrichs","first_name":"Benjamin"},{"first_name":"Daan W.","last_name":"Janssen","full_name":"Janssen, Daan W."},{"first_name":"Jobst","last_name":"Ziebell","full_name":"Ziebell, Jobst"}],"doi":"10.1016/j.jmaa.2023.127558","main_file_link":[{"open_access":"1"}],"publication":"Journal of Mathematical Analysis and Applications","external_id":{"arxiv":["2205.09189"]},"keyword":["Applied Mathematics","Analysis"],"language":[{"iso":"eng"}],"issue":"1","year":"2023","publisher":"Elsevier BV","date_created":"2023-07-20T05:08:49Z","title":"Super-Gaussian decay of exponentials: A sufficient condition"},{"intvolume":"        25","citation":{"apa":"Zirngibl, C., Martin, S., Steinfelder, C., Schleich, B., Tröster, T., Brosius, A., &#38; Wartzack, S. (2023). Methodical approach for the design and dimensioning of mechanical clinched assemblies. <i>Materials Research Proceedings</i>, <i>25</i>. <a href=\"https://doi.org/10.21741/9781644902417-23\">https://doi.org/10.21741/9781644902417-23</a>","mla":"Zirngibl, Christoph, et al. “Methodical Approach for the Design and Dimensioning of Mechanical Clinched Assemblies.” <i>Materials Research Proceedings</i>, vol. 25, Materials Research Forum LLC, 2023, doi:<a href=\"https://doi.org/10.21741/9781644902417-23\">10.21741/9781644902417-23</a>.","short":"C. Zirngibl, S. Martin, C. Steinfelder, B. Schleich, T. Tröster, A. Brosius, S. Wartzack, in: Materials Research Proceedings, Materials Research Forum LLC, 2023.","bibtex":"@inproceedings{Zirngibl_Martin_Steinfelder_Schleich_Tröster_Brosius_Wartzack_2023, title={Methodical approach for the design and dimensioning of mechanical clinched assemblies}, volume={25}, DOI={<a href=\"https://doi.org/10.21741/9781644902417-23\">10.21741/9781644902417-23</a>}, booktitle={Materials Research Proceedings}, publisher={Materials Research Forum LLC}, author={Zirngibl, Christoph and Martin, Sven and Steinfelder, Christian and Schleich, Benjamin and Tröster, Thomas and Brosius, Alexander and Wartzack, Sandro}, year={2023} }","ama":"Zirngibl C, Martin S, Steinfelder C, et al. Methodical approach for the design and dimensioning of mechanical clinched assemblies. In: <i>Materials Research Proceedings</i>. Vol 25. Materials Research Forum LLC; 2023. doi:<a href=\"https://doi.org/10.21741/9781644902417-23\">10.21741/9781644902417-23</a>","ieee":"C. Zirngibl <i>et al.</i>, “Methodical approach for the design and dimensioning of mechanical clinched assemblies,” in <i>Materials Research Proceedings</i>, Erlangen-Nürnberg, 2023, vol. 25, doi: <a href=\"https://doi.org/10.21741/9781644902417-23\">10.21741/9781644902417-23</a>.","chicago":"Zirngibl, Christoph, Sven Martin, Christian Steinfelder, Benjamin Schleich, Thomas Tröster, Alexander Brosius, and Sandro Wartzack. “Methodical Approach for the Design and Dimensioning of Mechanical Clinched Assemblies.” In <i>Materials Research Proceedings</i>, Vol. 25. Materials Research Forum LLC, 2023. <a href=\"https://doi.org/10.21741/9781644902417-23\">https://doi.org/10.21741/9781644902417-23</a>."},"year":"2023","publication_identifier":{"issn":["2474-395X"]},"publication_status":"published","conference":{"end_date":"2023-04-05","location":"Erlangen-Nürnberg","name":"20th International Conference on Sheet Metal","start_date":"2023-04-02"},"doi":"10.21741/9781644902417-23","title":"Methodical approach for the design and dimensioning of mechanical clinched assemblies","volume":25,"date_created":"2025-06-23T08:08:23Z","author":[{"full_name":"Zirngibl, Christoph","last_name":"Zirngibl","first_name":"Christoph"},{"first_name":"Sven","last_name":"Martin","full_name":"Martin, Sven"},{"last_name":"Steinfelder","full_name":"Steinfelder, Christian","first_name":"Christian"},{"first_name":"Benjamin","full_name":"Schleich, Benjamin","last_name":"Schleich"},{"last_name":"Tröster","full_name":"Tröster, Thomas","first_name":"Thomas"},{"first_name":"Alexander","full_name":"Brosius, Alexander","last_name":"Brosius"},{"last_name":"Wartzack","full_name":"Wartzack, Sandro","first_name":"Sandro"}],"publisher":"Materials Research Forum LLC","date_updated":"2025-06-23T08:15:07Z","status":"public","abstract":[{"lang":"eng","text":"The focus towards multi-material and lightweight assemblies, driven by legal requirements on reducing emissions and energy consumptions, reveals important drawbacks and disadvantages of established joining processes, such as welding. In this context, mechanical joining technologies, such as clinching, are becoming more and more relevant especially in the automotive industry. However, the availability of only few standards and almost none systematic design methods causes a still very time- and cost-intensive assembly development process considering mainly expert knowledge and a considerable amount of experimental studies. Motivated by this, the presented work introduces a novel approach for the methodical design and dimensioning of mechanically clinched assemblies. Therefore, the utilization of regression models, such as machine learning algorithms, combined with manufacturing knowledge ensures a reliable estimation of individual clinched joint characteristics. In addition, the implementation of an engineering workbench enables the following data-driven and knowledge-based generation of high-quality initial assembly designs already in early product development phases. In a subsequent analysis and adjustment, these designs are being improved while guaranteeing joining safety and loading conformity. The presented results indicate that the methodological approach can pave the way to a more systematic design process of mechanical joining assemblies, which can significantly shorten the required number of iteration loops and therefore the product development time."}],"publication":"Materials Research Proceedings","type":"conference","language":[{"iso":"eng"}],"keyword":["Joining","Structural Analysis","Machine Learning"],"department":[{"_id":"630"}],"user_id":"104464","_id":"60304","project":[{"grant_number":"418701707","_id":"130","name":"TRR 285: TRR 285:  Methodenentwicklung zur mechanischen Fügbarkeit in wandlungsfähigen Prozessketten"},{"_id":"132","name":"TRR 285 - B: TRR 285 - Project Area B"},{"name":"TRR 285 – B01: TRR 285 - Subproject B01","_id":"140"},{"_id":"144","name":"TRR 285 – B05: TRR 285 - Subproject B05"}]},{"type":"misc","abstract":[{"lang":"eng","text":"Context: Cryptographic APIs are often misused in real-world applications. Therefore, many cryptographic API misuse detection tools have been introduced. However, there exists no established reference benchmark for a fair and comprehensive comparison and evaluation of these tools. While there are benchmarks, they often only address a subset of the domain or were only used to evaluate a subset of existing misuse detection tools. Objective: To fairly compare cryptographic API misuse detection tools and to drive future development in this domain, we will devise such a benchmark. Openness and transparency in the generation process are key factors to fairly generate and establish the needed benchmark. Method: We propose an approach where we derive the benchmark generation methodology from the literature which consists of general best practices in benchmarking and domain-specific benchmark generation. A part of this methodology is transparency and openness of the generation process, which is achieved by pre-registering this work. Based on our methodology we design CamBench, a fair \"Cryptographic API Misuse Detection Tool Benchmark Suite\". We will implement the first version of CamBench limiting the domain to Java, the JCA, and static analyses. Finally, we will use CamBench to compare current misuse detection tools and compare CamBench to related benchmarks of its domain."}],"status":"public","_id":"32409","department":[{"_id":"76"}],"user_id":"32312","keyword":["cryptography","benchmark","API misuse","static analysis"],"language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"confirmation","url":"https://arxiv.org/abs/2204.06447"}]},"year":"2022","citation":{"short":"M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, M. Mezini, CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite, 2022.","bibtex":"@book{Schlichtig_Wickert_Krüger_Bodden_Mezini_2022, title={CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">10.48550/ARXIV.2204.06447</a>}, author={Schlichtig, Michael and Wickert, Anna-Katharina and Krüger, Stefan and Bodden, Eric and Mezini, Mira}, year={2022} }","mla":"Schlichtig, Michael, et al. <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>. 2022, doi:<a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">10.48550/ARXIV.2204.06447</a>.","apa":"Schlichtig, M., Wickert, A.-K., Krüger, S., Bodden, E., &#38; Mezini, M. (2022). <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>. <a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">https://doi.org/10.48550/ARXIV.2204.06447</a>","ama":"Schlichtig M, Wickert A-K, Krüger S, Bodden E, Mezini M. <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>.; 2022. doi:<a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">10.48550/ARXIV.2204.06447</a>","ieee":"M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, and M. Mezini, <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>. 2022.","chicago":"Schlichtig, Michael, Anna-Katharina Wickert, Stefan Krüger, Eric Bodden, and Mira Mezini. <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>, 2022. <a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">https://doi.org/10.48550/ARXIV.2204.06447</a>."},"date_updated":"2022-07-25T10:23:44Z","date_created":"2022-07-25T07:56:59Z","author":[{"orcid":"0000-0001-6600-6171","last_name":"Schlichtig","id":"32312","full_name":"Schlichtig, Michael","first_name":"Michael"},{"full_name":"Wickert, Anna-Katharina","last_name":"Wickert","first_name":"Anna-Katharina"},{"last_name":"Krüger","full_name":"Krüger, Stefan","first_name":"Stefan"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"full_name":"Mezini, Mira","last_name":"Mezini","first_name":"Mira"}],"title":"CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite","doi":"10.48550/ARXIV.2204.06447"},{"related_material":{"link":[{"url":"https://dl.acm.org/doi/10.1145/3533767.3534374","relation":"confirmation"}]},"publication_status":"published","quality_controlled":"1","publication_identifier":{"isbn":["9781450393799"]},"citation":{"mla":"Nachtigall, Marcus, et al. “A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools.” <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, ACM, 2022, pp. 532–43, doi:<a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>.","short":"M. Nachtigall, M. Schlichtig, E. Bodden, in: Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2022, pp. 532–543.","bibtex":"@inproceedings{Nachtigall_Schlichtig_Bodden_2022, title={A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools}, DOI={<a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>}, booktitle={Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis}, publisher={ACM}, author={Nachtigall, Marcus and Schlichtig, Michael and Bodden, Eric}, year={2022}, pages={532–543} }","apa":"Nachtigall, M., Schlichtig, M., &#38; Bodden, E. (2022). A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools. <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 532–543. <a href=\"https://doi.org/10.1145/3533767\">https://doi.org/10.1145/3533767</a>","ama":"Nachtigall M, Schlichtig M, Bodden E. A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools. In: <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>. ACM; 2022:532-543. doi:<a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>","ieee":"M. Nachtigall, M. Schlichtig, and E. Bodden, “A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools,” in <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 2022, pp. 532–543, doi: <a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>.","chicago":"Nachtigall, Marcus, Michael Schlichtig, and Eric Bodden. “A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools.” In <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 532–43. ACM, 2022. <a href=\"https://doi.org/10.1145/3533767\">https://doi.org/10.1145/3533767</a>."},"page":"532 - 543","year":"2022","date_created":"2022-07-25T08:02:36Z","author":[{"first_name":"Marcus","last_name":"Nachtigall","id":"41213","full_name":"Nachtigall, Marcus"},{"first_name":"Michael","last_name":"Schlichtig","orcid":"0000-0001-6600-6171","full_name":"Schlichtig, Michael","id":"32312"},{"orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256","first_name":"Eric"}],"date_updated":"2022-07-26T11:42:23Z","publisher":"ACM","doi":"10.1145/3533767","title":"A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools","type":"conference","publication":"Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis","status":"public","abstract":[{"text":"Static analysis tools support developers in detecting potential coding issues, such as bugs or vulnerabilities. Research on static analysis emphasizes its technical challenges but also mentions severe usability shortcomings. These shortcomings hinder the adoption of static analysis tools, and in some cases, user dissatisfaction even leads to tool abandonment.\r\nTo comprehensively assess the current state of the art, this paper presents the first systematic usability evaluation in a wide range of static analysis tools. We derived a set of 36 relevant criteria from the scientific literature and gathered a collection of 46 static analysis tools complying with our inclusion and exclusion criteria - a representative set of mainly non-proprietary tools. Then, we evaluated how well these tools fulfill the aforementioned criteria.\r\nThe evaluation shows that more than half of the considered tools offer poor warning messages, while about three-quarters of the tools provide hardly any fix support. Furthermore, the integration of user knowledge is strongly neglected, which could be used for improved handling of false positives and tuning the results for the corresponding developer. Finally, issues regarding workflow integration and specialized user interfaces are proved further.\r\nThese findings should prove useful in guiding and focusing further research and development in the area of user experience for static code analyses.","lang":"eng"}],"user_id":"32312","department":[{"_id":"76"}],"_id":"32410","language":[{"iso":"eng"}],"keyword":["Automated static analysis","Software usability"]},{"quality_controlled":"1","related_material":{"link":[{"relation":"confirmation","url":"https://ieeexplore.ieee.org/document/9825763"}]},"year":"2022","page":"673 - 684","citation":{"ama":"Schlichtig M, Sassalla S, Narasimhan K, Bodden E. FUM - A Framework for API Usage constraint and Misuse Classification. In: <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>. ; 2022:673-684. doi:<a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>","ieee":"M. Schlichtig, S. Sassalla, K. Narasimhan, and E. Bodden, “FUM - A Framework for API Usage constraint and Misuse Classification,” in <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2022, pp. 673–684, doi: <a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>.","chicago":"Schlichtig, Michael, Steffen Sassalla, Krishna Narasimhan, and Eric Bodden. “FUM - A Framework for API Usage Constraint and Misuse Classification.” In <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 673–84, 2022. <a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>.","apa":"Schlichtig, M., Sassalla, S., Narasimhan, K., &#38; Bodden, E. (2022). FUM - A Framework for API Usage constraint and Misuse Classification. <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 673–684. <a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>","short":"M. Schlichtig, S. Sassalla, K. Narasimhan, E. Bodden, in: 2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), 2022, pp. 673–684.","bibtex":"@inproceedings{Schlichtig_Sassalla_Narasimhan_Bodden_2022, title={FUM - A Framework for API Usage constraint and Misuse Classification}, DOI={<a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>}, booktitle={2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}, author={Schlichtig, Michael and Sassalla, Steffen and Narasimhan, Krishna and Bodden, Eric}, year={2022}, pages={673–684} }","mla":"Schlichtig, Michael, et al. “FUM - A Framework for API Usage Constraint and Misuse Classification.” <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2022, pp. 673–84, doi:<a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>."},"date_updated":"2022-07-26T11:42:30Z","date_created":"2022-05-09T13:04:10Z","author":[{"orcid":"0000-0001-6600-6171","last_name":"Schlichtig","id":"32312","full_name":"Schlichtig, Michael","first_name":"Michael"},{"full_name":"Sassalla, Steffen","last_name":"Sassalla","first_name":"Steffen"},{"last_name":"Narasimhan","full_name":"Narasimhan, Krishna","first_name":"Krishna"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647"}],"title":"FUM - A Framework for API Usage constraint and Misuse Classification","doi":"https://doi.org/10.1109/SANER53432.2022.00085","publication":"2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)","type":"conference","abstract":[{"lang":"eng","text":"Application Programming Interfaces (APIs) are the primary mechanism that developers use to obtain access to third-party algorithms and services. Unfortunately, APIs can be misused, which can have catastrophic consequences, especially if the APIs provide security-critical functionalities like cryptography. Understanding what API misuses are, and for what reasons they are caused, is important to prevent them, e.g., with API misuse detectors. However, definitions and nominations for API misuses and related terms in literature vary and are diverse. This paper addresses the problem of scattered knowledge and definitions of API misuses by presenting a systematic literature review on the subject and introducing FUM, a novel Framework for API Usage constraint and Misuse classification. The literature review revealed that API misuses are violations of API usage constraints. To capture this, we provide unified definitions and use them to derive FUM. To assess the extent to which FUM aids in determining and guiding the improvement of an API misuses detectors' capabilities, we performed a case study on CogniCrypt, a state-of-the-art misuse detector for cryptographic APIs. The study showed that FUM can be used to properly assess CogniCrypt's capabilities, identify weaknesses and assist in deriving mitigations and improvements. And it appears that also more generally FUM can aid the development and improvement of misuse detection tools."}],"status":"public","_id":"31133","department":[{"_id":"76"}],"user_id":"32312","keyword":["API misuses","API usage constraints","classification framework","API misuse detection","static analysis"],"language":[{"iso":"eng"}]},{"status":"public","editor":[{"first_name":"Joschka","full_name":"Kersting, Joschka","last_name":"Kersting"}],"type":"conference","file_date_updated":"2022-12-01T13:39:48Z","user_id":"58701","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"_id":"31054","citation":{"chicago":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” In <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, edited by Joschka Kersting, 5–9. Barcelona, Spain: IARIA, 2022.","ieee":"J. Kersting and F. S. Bäumer, “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis,” in <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, Barcelona, Spain, 2022, pp. 5–9.","ama":"Kersting J, Bäumer FS. Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In: Kersting J, ed. <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>. IARIA; 2022:5-9.","apa":"Kersting, J., &#38; Bäumer, F. S. (2022). Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In J. Kersting (Ed.), <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i> (pp. 5–9). IARIA.","bibtex":"@inproceedings{Kersting_Bäumer_2022, place={Barcelona, Spain}, title={Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis}, booktitle={Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications}, publisher={IARIA}, author={Kersting, Joschka and Bäumer, Frederik Simon}, editor={Kersting, Joschka}, year={2022}, pages={5–9} }","short":"J. Kersting, F.S. Bäumer, in: J. Kersting (Ed.), Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications, IARIA, Barcelona, Spain, 2022, pp. 5–9.","mla":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, edited by Joschka Kersting, IARIA, 2022, pp. 5–9."},"page":"5-9","place":"Barcelona, Spain","publication_status":"published","has_accepted_license":"1","conference":{"location":"Barcelona, Spain","name":"The Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022)","start_date":"2022-03"},"author":[{"full_name":"Kersting, Joschka","id":"58701","last_name":"Kersting","first_name":"Joschka"},{"first_name":"Frederik Simon","id":"38837","full_name":"Bäumer, Frederik Simon","last_name":"Bäumer"}],"date_updated":"2022-12-01T13:40:11Z","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2022-12-01T13:39:48Z","date_created":"2022-12-01T13:39:48Z","creator":"jkers","file_size":155548,"access_level":"closed","file_name":"Kersting & Bäumer (2022), Kersting2022.pdf","file_id":"34172"}],"abstract":[{"text":"This paper aims at discussing past limitations set in sentiment analysis research regarding explicit and implicit mentions of opinions. Previous studies have regularly neglected this question in favor of methodical research on standard-datasets. Furthermore, they were limited to linguistically less-diverse domains, such as commercial product reviews. We face this issue by annotating a German-language physician review dataset that contains numerous implicit, long, and complex statements that indicate aspect ratings, such as the physician’s friendliness. We discuss the nature of implicit statements and present various samples to illustrate the challenge described.","lang":"eng"}],"publication":"Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications","language":[{"iso":"eng"}],"ddc":["006"],"keyword":["Sentiment analysis","Natural language processing","Aspect phrase extraction"],"year":"2022","title":"Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis","date_created":"2022-05-04T08:12:09Z","publisher":"IARIA"},{"language":[{"iso":"eng"}],"keyword":["Size-exclusion chromatography","triple detection","branching analysis","star polymers","poly(N-isopropylacrylamide)","β-cyclodextrin"],"department":[{"_id":"163"}],"user_id":"94","_id":"32865","status":"public","abstract":[{"text":"For the first time, poly(N-isopropylacrylamide) (PNIPAAm) star polymers with a β-cyclodextrin core are characterized in detail by size-exclusion chromatography (SEC) with triple detection to experimentally verify the number of arms. A combination of a refractive index detector, multi-angle laser light scattering detector, and an online-viscosimeter was used for branching analysis. At first, the SEC system was calibrated and the detector setup was validated using linear polystyrene reference polymers. The applicability of the established triple detection SEC for branching analysis was shown by the analysis of two commercially available polystyrene star polymers. Due to the high molar masses of the star polymers, both the contraction ratio g and g′ could be determined independently, thus allowing the calculation of the viscosity shielding ratio ε. Finally, the branching analysis of the PNIPAAm star polymers could experimentally confirm the assumed arm number of up to 21 arms. Moreover, an increasingly compact molecular structure and the influence of the arm number on the viscosity shielding ratio could be shown.","lang":"eng"}],"publication":"International Journal of Polymer Analysis and Characterization","type":"journal_article","doi":"10.1080/1023666x.2022.2110133","title":"Branching analysis of β-cyclodextrin-based poly(<i>N</i>-isopropylacrylamide) star polymers using triple detection SEC","date_created":"2022-08-17T06:28:55Z","author":[{"id":"94","full_name":"Herberg, Artjom","last_name":"Herberg","first_name":"Artjom"},{"first_name":"Dirk","full_name":"Kuckling, Dirk","id":"287","last_name":"Kuckling"}],"publisher":"Informa UK Limited","date_updated":"2023-01-10T08:13:52Z","page":"1-19","citation":{"apa":"Herberg, A., &#38; Kuckling, D. (2022). Branching analysis of β-cyclodextrin-based poly(<i>N</i>-isopropylacrylamide) star polymers using triple detection SEC. <i>International Journal of Polymer Analysis and Characterization</i>, 1–19. <a href=\"https://doi.org/10.1080/1023666x.2022.2110133\">https://doi.org/10.1080/1023666x.2022.2110133</a>","bibtex":"@article{Herberg_Kuckling_2022, title={Branching analysis of β-cyclodextrin-based poly(<i>N</i>-isopropylacrylamide) star polymers using triple detection SEC}, DOI={<a href=\"https://doi.org/10.1080/1023666x.2022.2110133\">10.1080/1023666x.2022.2110133</a>}, journal={International Journal of Polymer Analysis and Characterization}, publisher={Informa UK Limited}, author={Herberg, Artjom and Kuckling, Dirk}, year={2022}, pages={1–19} }","short":"A. Herberg, D. Kuckling, International Journal of Polymer Analysis and Characterization (2022) 1–19.","mla":"Herberg, Artjom, and Dirk Kuckling. “Branching Analysis of β-Cyclodextrin-Based Poly(<i>N</i>-Isopropylacrylamide) Star Polymers Using Triple Detection SEC.” <i>International Journal of Polymer Analysis and Characterization</i>, Informa UK Limited, 2022, pp. 1–19, doi:<a href=\"https://doi.org/10.1080/1023666x.2022.2110133\">10.1080/1023666x.2022.2110133</a>.","ama":"Herberg A, Kuckling D. Branching analysis of β-cyclodextrin-based poly(<i>N</i>-isopropylacrylamide) star polymers using triple detection SEC. <i>International Journal of Polymer Analysis and Characterization</i>. Published online 2022:1-19. doi:<a href=\"https://doi.org/10.1080/1023666x.2022.2110133\">10.1080/1023666x.2022.2110133</a>","ieee":"A. Herberg and D. Kuckling, “Branching analysis of β-cyclodextrin-based poly(<i>N</i>-isopropylacrylamide) star polymers using triple detection SEC,” <i>International Journal of Polymer Analysis and Characterization</i>, pp. 1–19, 2022, doi: <a href=\"https://doi.org/10.1080/1023666x.2022.2110133\">10.1080/1023666x.2022.2110133</a>.","chicago":"Herberg, Artjom, and Dirk Kuckling. “Branching Analysis of β-Cyclodextrin-Based Poly(<i>N</i>-Isopropylacrylamide) Star Polymers Using Triple Detection SEC.” <i>International Journal of Polymer Analysis and Characterization</i>, 2022, 1–19. <a href=\"https://doi.org/10.1080/1023666x.2022.2110133\">https://doi.org/10.1080/1023666x.2022.2110133</a>."},"year":"2022","publication_identifier":{"issn":["1023-666X","1563-5341"]},"publication_status":"published"},{"volume":12,"date_created":"2023-11-14T15:58:57Z","author":[{"first_name":"Lena","full_name":"Clever, Lena","last_name":"Clever"},{"first_name":"Janina Susanne","last_name":"Pohl","full_name":"Pohl, Janina Susanne"},{"full_name":"Bossek, Jakob","id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"publisher":"{Multidisciplinary Digital Publishing Institute}","date_updated":"2023-12-13T10:50:56Z","doi":"10.3390/app12189094","title":"Process-Oriented Stream Classification Pipeline: A Literature Review","issue":"18","publication_identifier":{"issn":["2076-3417"]},"page":"9094","intvolume":"        12","citation":{"apa":"Clever, L., Pohl, J. S., Bossek, J., Kerschke, P., &#38; Trautmann, H. (2022). Process-Oriented Stream Classification Pipeline: A Literature Review. <i>Applied Sciences</i>, <i>12</i>(18), 9094. <a href=\"https://doi.org/10.3390/app12189094\">https://doi.org/10.3390/app12189094</a>","bibtex":"@article{Clever_Pohl_Bossek_Kerschke_Trautmann_2022, title={Process-Oriented Stream Classification Pipeline: A Literature Review}, volume={12}, DOI={<a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>}, number={18}, journal={Applied Sciences}, publisher={{Multidisciplinary Digital Publishing Institute}}, author={Clever, Lena and Pohl, Janina Susanne and Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2022}, pages={9094} }","mla":"Clever, Lena, et al. “Process-Oriented Stream Classification Pipeline: A Literature Review.” <i>Applied Sciences</i>, vol. 12, no. 18, {Multidisciplinary Digital Publishing Institute}, 2022, p. 9094, doi:<a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>.","short":"L. Clever, J.S. Pohl, J. Bossek, P. Kerschke, H. Trautmann, Applied Sciences 12 (2022) 9094.","chicago":"Clever, Lena, Janina Susanne Pohl, Jakob Bossek, Pascal Kerschke, and Heike Trautmann. “Process-Oriented Stream Classification Pipeline: A Literature Review.” <i>Applied Sciences</i> 12, no. 18 (2022): 9094. <a href=\"https://doi.org/10.3390/app12189094\">https://doi.org/10.3390/app12189094</a>.","ieee":"L. Clever, J. S. Pohl, J. Bossek, P. Kerschke, and H. Trautmann, “Process-Oriented Stream Classification Pipeline: A Literature Review,” <i>Applied Sciences</i>, vol. 12, no. 18, p. 9094, 2022, doi: <a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>.","ama":"Clever L, Pohl JS, Bossek J, Kerschke P, Trautmann H. Process-Oriented Stream Classification Pipeline: A Literature Review. <i>Applied Sciences</i>. 2022;12(18):9094. doi:<a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>"},"year":"2022","department":[{"_id":"819"}],"user_id":"102979","_id":"48878","language":[{"iso":"eng"}],"keyword":["big data","data mining","data stream analysis","machine learning","stream classification","supervised learning"],"publication":"Applied Sciences","type":"journal_article","status":"public","abstract":[{"text":"Due to the rise of continuous data-generating applications, analyzing data streams has gained increasing attention over the past decades. A core research area in stream data is stream classification, which categorizes or detects data points within an evolving stream of observations. Areas of stream classification are diverse\\textemdash ranging, e.g., from monitoring sensor data to analyzing a wide range of (social) media applications. Research in stream classification is related to developing methods that adapt to the changing and potentially volatile data stream. It focuses on individual aspects of the stream classification pipeline, e.g., designing suitable algorithm architectures, an efficient train and test procedure, or detecting so-called concept drifts. As a result of the many different research questions and strands, the field is challenging to grasp, especially for beginners. This survey explores, summarizes, and categorizes work within the domain of stream classification and identifies core research threads over the past few years. It is structured based on the stream classification process to facilitate coordination within this complex topic, including common application scenarios and benchmarking data sets. Thus, both newcomers to the field and experts who want to widen their scope can gain (additional) insight into this research area and find starting points and pointers to more in-depth literature on specific issues and research directions in the field.","lang":"eng"}]},{"doi":"10.1515/cmam-2022-0145","date_updated":"2024-04-03T09:20:30Z","volume":23,"author":[{"last_name":"Bohn","full_name":"Bohn, Jan","first_name":"Jan"},{"first_name":"Michael","full_name":"Feischl, Michael","last_name":"Feischl"},{"first_name":"Balázs","last_name":"Kovács","orcid":"0000-0001-9872-3474","id":"100441","full_name":"Kovács, Balázs"}],"intvolume":"        23","page":"19-48","citation":{"bibtex":"@article{Bohn_Feischl_Kovács_2022, title={FEM-BEM Coupling for the Maxwell–Landau–Lifshitz–Gilbert Equations via Convolution Quadrature: Weak Form and Numerical Approximation}, volume={23}, DOI={<a href=\"https://doi.org/10.1515/cmam-2022-0145\">10.1515/cmam-2022-0145</a>}, number={1}, journal={Computational Methods in Applied Mathematics}, publisher={Walter de Gruyter GmbH}, author={Bohn, Jan and Feischl, Michael and Kovács, Balázs}, year={2022}, pages={19–48} }","short":"J. Bohn, M. Feischl, B. Kovács, Computational Methods in Applied Mathematics 23 (2022) 19–48.","mla":"Bohn, Jan, et al. “FEM-BEM Coupling for the Maxwell–Landau–Lifshitz–Gilbert Equations via Convolution Quadrature: Weak Form and Numerical Approximation.” <i>Computational Methods in Applied Mathematics</i>, vol. 23, no. 1, Walter de Gruyter GmbH, 2022, pp. 19–48, doi:<a href=\"https://doi.org/10.1515/cmam-2022-0145\">10.1515/cmam-2022-0145</a>.","apa":"Bohn, J., Feischl, M., &#38; Kovács, B. (2022). FEM-BEM Coupling for the Maxwell–Landau–Lifshitz–Gilbert Equations via Convolution Quadrature: Weak Form and Numerical Approximation. <i>Computational Methods in Applied Mathematics</i>, <i>23</i>(1), 19–48. <a href=\"https://doi.org/10.1515/cmam-2022-0145\">https://doi.org/10.1515/cmam-2022-0145</a>","ama":"Bohn J, Feischl M, Kovács B. FEM-BEM Coupling for the Maxwell–Landau–Lifshitz–Gilbert Equations via Convolution Quadrature: Weak Form and Numerical Approximation. <i>Computational Methods in Applied Mathematics</i>. 2022;23(1):19-48. doi:<a href=\"https://doi.org/10.1515/cmam-2022-0145\">10.1515/cmam-2022-0145</a>","ieee":"J. Bohn, M. Feischl, and B. Kovács, “FEM-BEM Coupling for the Maxwell–Landau–Lifshitz–Gilbert Equations via Convolution Quadrature: Weak Form and Numerical Approximation,” <i>Computational Methods in Applied Mathematics</i>, vol. 23, no. 1, pp. 19–48, 2022, doi: <a href=\"https://doi.org/10.1515/cmam-2022-0145\">10.1515/cmam-2022-0145</a>.","chicago":"Bohn, Jan, Michael Feischl, and Balázs Kovács. “FEM-BEM Coupling for the Maxwell–Landau–Lifshitz–Gilbert Equations via Convolution Quadrature: Weak Form and Numerical Approximation.” <i>Computational Methods in Applied Mathematics</i> 23, no. 1 (2022): 19–48. <a href=\"https://doi.org/10.1515/cmam-2022-0145\">https://doi.org/10.1515/cmam-2022-0145</a>."},"publication_identifier":{"issn":["1609-4840","1609-9389"]},"publication_status":"published","_id":"45956","department":[{"_id":"841"}],"user_id":"100441","status":"public","type":"journal_article","title":"FEM-BEM Coupling for the Maxwell–Landau–Lifshitz–Gilbert Equations via Convolution Quadrature: Weak Form and Numerical Approximation","publisher":"Walter de Gruyter GmbH","date_created":"2023-07-10T11:43:13Z","year":"2022","issue":"1","keyword":["Applied Mathematics","Computational Mathematics","Numerical Analysis"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>The full Maxwell equations in the unbounded three-dimensional space coupled to the Landau–Lifshitz–Gilbert equation serve as a well-tested model for ferromagnetic materials.\r\nWe propose a weak formulation of the coupled system based on the boundary integral formulation of the exterior Maxwell equations.\r\nWe show existence and partial uniqueness of a weak solution and propose a new numerical algorithm based on finite elements and boundary elements as spatial discretization with backward Euler and convolution quadrature for the time domain.\r\nThis is the first numerical algorithm which is able to deal with the coupled system of Landau–Lifshitz–Gilbert equation and full Maxwell’s equations without any simplifications like quasi-static approximations (e.g. eddy current model) and without restrictions on the shape of the domain (e.g. convexity).\r\nWe show well-posedness and convergence of the numerical algorithm under minimal assumptions on the regularity of the solution.\r\nThis is particularly important as there are few regularity results available and one generally expects the solution to be non-smooth.\r\nNumerical experiments illustrate and expand on the theoretical results.</jats:p>"}],"publication":"Computational Methods in Applied Mathematics"},{"year":"2022","citation":{"apa":"Winkler, M. (2022). Slow Grow-up in a Quasilinear Keller–Segel System. <i>Journal of Dynamics and Differential Equations</i>. <a href=\"https://doi.org/10.1007/s10884-022-10167-w\">https://doi.org/10.1007/s10884-022-10167-w</a>","short":"M. Winkler, Journal of Dynamics and Differential Equations (2022).","mla":"Winkler, Michael. “Slow Grow-up in a Quasilinear Keller–Segel System.” <i>Journal of Dynamics and Differential Equations</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s10884-022-10167-w\">10.1007/s10884-022-10167-w</a>.","bibtex":"@article{Winkler_2022, title={Slow Grow-up in a Quasilinear Keller–Segel System}, DOI={<a href=\"https://doi.org/10.1007/s10884-022-10167-w\">10.1007/s10884-022-10167-w</a>}, journal={Journal of Dynamics and Differential Equations}, publisher={Springer Science and Business Media LLC}, author={Winkler, Michael}, year={2022} }","chicago":"Winkler, Michael. “Slow Grow-up in a Quasilinear Keller–Segel System.” <i>Journal of Dynamics and Differential Equations</i>, 2022. <a href=\"https://doi.org/10.1007/s10884-022-10167-w\">https://doi.org/10.1007/s10884-022-10167-w</a>.","ieee":"M. Winkler, “Slow Grow-up in a Quasilinear Keller–Segel System,” <i>Journal of Dynamics and Differential Equations</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s10884-022-10167-w\">10.1007/s10884-022-10167-w</a>.","ama":"Winkler M. Slow Grow-up in a Quasilinear Keller–Segel System. <i>Journal of Dynamics and Differential Equations</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s10884-022-10167-w\">10.1007/s10884-022-10167-w</a>"},"publication_status":"published","publication_identifier":{"issn":["1040-7294","1572-9222"]},"title":"Slow Grow-up in a Quasilinear Keller–Segel System","doi":"10.1007/s10884-022-10167-w","publisher":"Springer Science and Business Media LLC","date_updated":"2024-04-07T12:39:17Z","date_created":"2024-04-07T12:39:12Z","author":[{"first_name":"Michael","last_name":"Winkler","full_name":"Winkler, Michael"}],"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>In a ball <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Omega =B_R(0)\\subset \\mathbb {R}^n$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>Ω</mml:mi>\r\n                  <mml:mo>=</mml:mo>\r\n                  <mml:msub>\r\n                    <mml:mi>B</mml:mi>\r\n                    <mml:mi>R</mml:mi>\r\n                  </mml:msub>\r\n                  <mml:mrow>\r\n                    <mml:mo>(</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                    <mml:mo>)</mml:mo>\r\n                  </mml:mrow>\r\n                  <mml:mo>⊂</mml:mo>\r\n                  <mml:msup>\r\n                    <mml:mrow>\r\n                      <mml:mi>R</mml:mi>\r\n                    </mml:mrow>\r\n                    <mml:mi>n</mml:mi>\r\n                  </mml:msup>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$n\\ge 2$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>n</mml:mi>\r\n                  <mml:mo>≥</mml:mo>\r\n                  <mml:mn>2</mml:mn>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula>, the chemotaxis system <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} \\left\\{ \\begin{array}{l}u_t = \\nabla \\cdot \\big ( D(u) \\nabla u \\big ) - \\nabla \\cdot \\big ( uS(u)\\nabla v\\big ), \\\\ 0 = \\Delta v - \\mu + u, \\qquad \\mu =\\frac{1}{|\\Omega |} \\int _\\Omega u, \\end{array} \\right. \\qquad \\qquad (\\star ) \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mtable>\r\n                    <mml:mtr>\r\n                      <mml:mtd>\r\n                        <mml:mrow>\r\n                          <mml:mfenced>\r\n                            <mml:mrow>\r\n                              <mml:mtable>\r\n                                <mml:mtr>\r\n                                  <mml:mtd>\r\n                                    <mml:mrow>\r\n                                      <mml:msub>\r\n                                        <mml:mi>u</mml:mi>\r\n                                        <mml:mi>t</mml:mi>\r\n                                      </mml:msub>\r\n                                      <mml:mo>=</mml:mo>\r\n                                      <mml:mi>∇</mml:mi>\r\n                                      <mml:mo>·</mml:mo>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mi>D</mml:mi>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                        <mml:mi>u</mml:mi>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mi>∇</mml:mi>\r\n                                      <mml:mi>u</mml:mi>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mo>-</mml:mo>\r\n                                      <mml:mi>∇</mml:mi>\r\n                                      <mml:mo>·</mml:mo>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mi>u</mml:mi>\r\n                                      <mml:mi>S</mml:mi>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                        <mml:mi>u</mml:mi>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mi>∇</mml:mi>\r\n                                      <mml:mi>v</mml:mi>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mo>,</mml:mo>\r\n                                    </mml:mrow>\r\n                                  </mml:mtd>\r\n                                </mml:mtr>\r\n                                <mml:mtr>\r\n                                  <mml:mtd>\r\n                                    <mml:mrow>\r\n                                      <mml:mrow />\r\n                                      <mml:mn>0</mml:mn>\r\n                                      <mml:mo>=</mml:mo>\r\n                                      <mml:mi>Δ</mml:mi>\r\n                                      <mml:mi>v</mml:mi>\r\n                                      <mml:mo>-</mml:mo>\r\n                                      <mml:mi>μ</mml:mi>\r\n                                      <mml:mo>+</mml:mo>\r\n                                      <mml:mi>u</mml:mi>\r\n                                      <mml:mo>,</mml:mo>\r\n                                      <mml:mspace />\r\n                                      <mml:mi>μ</mml:mi>\r\n                                      <mml:mo>=</mml:mo>\r\n                                      <mml:mfrac>\r\n                                        <mml:mn>1</mml:mn>\r\n                                        <mml:mrow>\r\n                                          <mml:mo>|</mml:mo>\r\n                                          <mml:mi>Ω</mml:mi>\r\n                                          <mml:mo>|</mml:mo>\r\n                                        </mml:mrow>\r\n                                      </mml:mfrac>\r\n                                      <mml:msub>\r\n                                        <mml:mo>∫</mml:mo>\r\n                                        <mml:mi>Ω</mml:mi>\r\n                                      </mml:msub>\r\n                                      <mml:mi>u</mml:mi>\r\n                                      <mml:mo>,</mml:mo>\r\n                                    </mml:mrow>\r\n                                  </mml:mtd>\r\n                                </mml:mtr>\r\n                              </mml:mtable>\r\n                            </mml:mrow>\r\n                          </mml:mfenced>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mrow>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mo>⋆</mml:mo>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:mrow>\r\n                      </mml:mtd>\r\n                    </mml:mtr>\r\n                  </mml:mtable>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:disp-formula>is considered under no-flux boundary conditions, with a focus on nonlinearities <jats:inline-formula><jats:alternatives><jats:tex-math>$$S\\in C^2([0,\\infty ))$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>S</mml:mi>\r\n                  <mml:mo>∈</mml:mo>\r\n                  <mml:msup>\r\n                    <mml:mi>C</mml:mi>\r\n                    <mml:mn>2</mml:mn>\r\n                  </mml:msup>\r\n                  <mml:mrow>\r\n                    <mml:mo>(</mml:mo>\r\n                    <mml:mrow>\r\n                      <mml:mo>[</mml:mo>\r\n                      <mml:mn>0</mml:mn>\r\n                      <mml:mo>,</mml:mo>\r\n                      <mml:mi>∞</mml:mi>\r\n                      <mml:mo>)</mml:mo>\r\n                    </mml:mrow>\r\n                    <mml:mo>)</mml:mo>\r\n                  </mml:mrow>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula> which exhibit super-algebraically fast decay in the sense that with some <jats:inline-formula><jats:alternatives><jats:tex-math>$$K_S&gt;0, \\beta \\in [0,1)$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:msub>\r\n                    <mml:mi>K</mml:mi>\r\n                    <mml:mi>S</mml:mi>\r\n                  </mml:msub>\r\n                  <mml:mo>&gt;</mml:mo>\r\n                  <mml:mn>0</mml:mn>\r\n                  <mml:mo>,</mml:mo>\r\n                  <mml:mi>β</mml:mi>\r\n                  <mml:mo>∈</mml:mo>\r\n                  <mml:mrow>\r\n                    <mml:mo>[</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                    <mml:mo>,</mml:mo>\r\n                    <mml:mn>1</mml:mn>\r\n                    <mml:mo>)</mml:mo>\r\n                  </mml:mrow>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\xi _0&gt;0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:msub>\r\n                    <mml:mi>ξ</mml:mi>\r\n                    <mml:mn>0</mml:mn>\r\n                  </mml:msub>\r\n                  <mml:mo>&gt;</mml:mo>\r\n                  <mml:mn>0</mml:mn>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula>, <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} S(\\xi )&gt;0 \\quad \\text{ and } \\quad S'(\\xi ) \\le -K_S\\xi ^{-\\beta } S(\\xi ) \\qquad \\text{ for } \\text{ all } \\xi \\ge \\xi _0. \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mtable>\r\n                    <mml:mtr>\r\n                      <mml:mtd>\r\n                        <mml:mrow>\r\n                          <mml:mi>S</mml:mi>\r\n                          <mml:mrow>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                          <mml:mo>&gt;</mml:mo>\r\n                          <mml:mn>0</mml:mn>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mtext>and</mml:mtext>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:msup>\r\n                            <mml:mi>S</mml:mi>\r\n                            <mml:mo>′</mml:mo>\r\n                          </mml:msup>\r\n                          <mml:mrow>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                          <mml:mo>≤</mml:mo>\r\n                          <mml:mo>-</mml:mo>\r\n                          <mml:msub>\r\n                            <mml:mi>K</mml:mi>\r\n                            <mml:mi>S</mml:mi>\r\n                          </mml:msub>\r\n                          <mml:msup>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mrow>\r\n                              <mml:mo>-</mml:mo>\r\n                              <mml:mi>β</mml:mi>\r\n                            </mml:mrow>\r\n                          </mml:msup>\r\n                          <mml:mi>S</mml:mi>\r\n                          <mml:mrow>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mtext>for</mml:mtext>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mtext>all</mml:mtext>\r\n                          <mml:mspace />\r\n                          <mml:mi>ξ</mml:mi>\r\n                          <mml:mo>≥</mml:mo>\r\n                          <mml:msub>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:msub>\r\n                          <mml:mo>.</mml:mo>\r\n                        </mml:mrow>\r\n                      </mml:mtd>\r\n                    </mml:mtr>\r\n                  </mml:mtable>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:disp-formula>It is, inter alia, shown that if furthermore <jats:inline-formula><jats:alternatives><jats:tex-math>$$D\\in C^2((0,\\infty ))$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>D</mml:mi>\r\n                  <mml:mo>∈</mml:mo>\r\n                  <mml:msup>\r\n                    <mml:mi>C</mml:mi>\r\n                    <mml:mn>2</mml:mn>\r\n                  </mml:msup>\r\n                  <mml:mrow>\r\n                    <mml:mo>(</mml:mo>\r\n                    <mml:mrow>\r\n                      <mml:mo>(</mml:mo>\r\n                      <mml:mn>0</mml:mn>\r\n                      <mml:mo>,</mml:mo>\r\n                      <mml:mi>∞</mml:mi>\r\n                      <mml:mo>)</mml:mo>\r\n                    </mml:mrow>\r\n                    <mml:mo>)</mml:mo>\r\n                  </mml:mrow>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula> is positive and suitably small in relation to <jats:italic>S</jats:italic> by satisfying <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} \\frac{\\xi S(\\xi )}{D(\\xi )} \\ge K_{SD}\\xi ^\\lambda \\qquad \\text{ for } \\text{ all } \\xi \\ge \\xi _0 \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mtable>\r\n                    <mml:mtr>\r\n                      <mml:mtd>\r\n                        <mml:mrow>\r\n                          <mml:mfrac>\r\n                            <mml:mrow>\r\n                              <mml:mi>ξ</mml:mi>\r\n                              <mml:mi>S</mml:mi>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mi>ξ</mml:mi>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                            <mml:mrow>\r\n                              <mml:mi>D</mml:mi>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mi>ξ</mml:mi>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mfrac>\r\n                          <mml:mo>≥</mml:mo>\r\n                          <mml:msub>\r\n                            <mml:mi>K</mml:mi>\r\n                            <mml:mrow>\r\n                              <mml:mi>SD</mml:mi>\r\n                            </mml:mrow>\r\n                          </mml:msub>\r\n                          <mml:msup>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mi>λ</mml:mi>\r\n                          </mml:msup>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mtext>for</mml:mtext>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mtext>all</mml:mtext>\r\n                          <mml:mspace />\r\n                          <mml:mi>ξ</mml:mi>\r\n                          <mml:mo>≥</mml:mo>\r\n                          <mml:msub>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:msub>\r\n                        </mml:mrow>\r\n                      </mml:mtd>\r\n                    </mml:mtr>\r\n                  </mml:mtable>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:disp-formula>with some <jats:inline-formula><jats:alternatives><jats:tex-math>$$K_{SD}&gt;0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:msub>\r\n                    <mml:mi>K</mml:mi>\r\n                    <mml:mrow>\r\n                      <mml:mi>SD</mml:mi>\r\n                    </mml:mrow>\r\n                  </mml:msub>\r\n                  <mml:mo>&gt;</mml:mo>\r\n                  <mml:mn>0</mml:mn>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda &gt;\\frac{2}{n}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>λ</mml:mi>\r\n                  <mml:mo>&gt;</mml:mo>\r\n                  <mml:mfrac>\r\n                    <mml:mn>2</mml:mn>\r\n                    <mml:mi>n</mml:mi>\r\n                  </mml:mfrac>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula>, then throughout a considerably large set of initial data, (<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\star $$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mo>⋆</mml:mo>\r\n              </mml:math></jats:alternatives></jats:inline-formula>) admits global classical solutions (<jats:italic>u</jats:italic>, <jats:italic>v</jats:italic>) fulfilling <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} \\frac{z(t)}{C} \\le \\Vert u(\\cdot ,t)\\Vert _{L^\\infty (\\Omega )} \\le Cz(t) \\qquad \\text{ for } \\text{ all } t&gt;0, \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mtable>\r\n                    <mml:mtr>\r\n                      <mml:mtd>\r\n                        <mml:mrow>\r\n                          <mml:mfrac>\r\n                            <mml:mrow>\r\n                              <mml:mi>z</mml:mi>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mi>t</mml:mi>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                            <mml:mi>C</mml:mi>\r\n                          </mml:mfrac>\r\n                          <mml:mo>≤</mml:mo>\r\n                          <mml:msub>\r\n                            <mml:mrow>\r\n                              <mml:mo>‖</mml:mo>\r\n                              <mml:mi>u</mml:mi>\r\n                              <mml:mrow>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mo>·</mml:mo>\r\n                                <mml:mo>,</mml:mo>\r\n                                <mml:mi>t</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mo>‖</mml:mo>\r\n                            </mml:mrow>\r\n                            <mml:mrow>\r\n                              <mml:msup>\r\n                                <mml:mi>L</mml:mi>\r\n                                <mml:mi>∞</mml:mi>\r\n                              </mml:msup>\r\n                              <mml:mrow>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mi>Ω</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                            </mml:mrow>\r\n                          </mml:msub>\r\n                          <mml:mo>≤</mml:mo>\r\n                          <mml:mi>C</mml:mi>\r\n                          <mml:mi>z</mml:mi>\r\n                          <mml:mrow>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mi>t</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mtext>for</mml:mtext>\r\n                          <mml:mspace />\r\n                          <mml:mspace />\r\n                          <mml:mtext>all</mml:mtext>\r\n                          <mml:mspace />\r\n                          <mml:mi>t</mml:mi>\r\n                          <mml:mo>&gt;</mml:mo>\r\n                          <mml:mn>0</mml:mn>\r\n                          <mml:mo>,</mml:mo>\r\n                        </mml:mrow>\r\n                      </mml:mtd>\r\n                    </mml:mtr>\r\n                  </mml:mtable>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:disp-formula>with some <jats:inline-formula><jats:alternatives><jats:tex-math>$$C=C^{(u,v)}\\ge 1$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>C</mml:mi>\r\n                  <mml:mo>=</mml:mo>\r\n                  <mml:msup>\r\n                    <mml:mi>C</mml:mi>\r\n                    <mml:mrow>\r\n                      <mml:mo>(</mml:mo>\r\n                      <mml:mi>u</mml:mi>\r\n                      <mml:mo>,</mml:mo>\r\n                      <mml:mi>v</mml:mi>\r\n                      <mml:mo>)</mml:mo>\r\n                    </mml:mrow>\r\n                  </mml:msup>\r\n                  <mml:mo>≥</mml:mo>\r\n                  <mml:mn>1</mml:mn>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula>, where <jats:italic>z</jats:italic> denotes the solution of <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} \\left\\{ \\begin{array}{l}z'(t) = z^2(t) \\cdot S\\big ( z(t)\\big ), \\qquad t&gt;0, \\\\ z(0)=\\xi _0, \\end{array} \\right. \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mtable>\r\n                    <mml:mtr>\r\n                      <mml:mtd>\r\n                        <mml:mfenced>\r\n                          <mml:mrow>\r\n                            <mml:mtable>\r\n                              <mml:mtr>\r\n                                <mml:mtd>\r\n                                  <mml:mrow>\r\n                                    <mml:msup>\r\n                                      <mml:mi>z</mml:mi>\r\n                                      <mml:mo>′</mml:mo>\r\n                                    </mml:msup>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>(</mml:mo>\r\n                                      <mml:mi>t</mml:mi>\r\n                                      <mml:mo>)</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mo>=</mml:mo>\r\n                                    <mml:msup>\r\n                                      <mml:mi>z</mml:mi>\r\n                                      <mml:mn>2</mml:mn>\r\n                                    </mml:msup>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>(</mml:mo>\r\n                                      <mml:mi>t</mml:mi>\r\n                                      <mml:mo>)</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mo>·</mml:mo>\r\n                                    <mml:mi>S</mml:mi>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>(</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mi>z</mml:mi>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>(</mml:mo>\r\n                                      <mml:mi>t</mml:mi>\r\n                                      <mml:mo>)</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>)</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mo>,</mml:mo>\r\n                                    <mml:mspace />\r\n                                    <mml:mi>t</mml:mi>\r\n                                    <mml:mo>&gt;</mml:mo>\r\n                                    <mml:mn>0</mml:mn>\r\n                                    <mml:mo>,</mml:mo>\r\n                                  </mml:mrow>\r\n                                </mml:mtd>\r\n                              </mml:mtr>\r\n                              <mml:mtr>\r\n                                <mml:mtd>\r\n                                  <mml:mrow>\r\n                                    <mml:mrow />\r\n                                    <mml:mi>z</mml:mi>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>(</mml:mo>\r\n                                      <mml:mn>0</mml:mn>\r\n                                      <mml:mo>)</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mo>=</mml:mo>\r\n                                    <mml:msub>\r\n                                      <mml:mi>ξ</mml:mi>\r\n                                      <mml:mn>0</mml:mn>\r\n                                    </mml:msub>\r\n                                    <mml:mo>,</mml:mo>\r\n                                  </mml:mrow>\r\n                                </mml:mtd>\r\n                              </mml:mtr>\r\n                            </mml:mtable>\r\n                          </mml:mrow>\r\n                        </mml:mfenced>\r\n                      </mml:mtd>\r\n                    </mml:mtr>\r\n                  </mml:mtable>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:disp-formula>which is seen to exist globally, and to satisfy <jats:inline-formula><jats:alternatives><jats:tex-math>$$z(t)\\rightarrow +\\infty $$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>z</mml:mi>\r\n                  <mml:mo>(</mml:mo>\r\n                  <mml:mi>t</mml:mi>\r\n                  <mml:mo>)</mml:mo>\r\n                  <mml:mo>→</mml:mo>\r\n                  <mml:mo>+</mml:mo>\r\n                  <mml:mi>∞</mml:mi>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula> as <jats:inline-formula><jats:alternatives><jats:tex-math>$$t\\rightarrow \\infty $$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mrow>\r\n                  <mml:mi>t</mml:mi>\r\n                  <mml:mo>→</mml:mo>\r\n                  <mml:mi>∞</mml:mi>\r\n                </mml:mrow>\r\n              </mml:math></jats:alternatives></jats:inline-formula>. As particular examples, exponentially and doubly exponentially decaying <jats:italic>S</jats:italic> are found to imply corresponding infinite-time blow-up properties in (<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\star $$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                <mml:mo>⋆</mml:mo>\r\n              </mml:math></jats:alternatives></jats:inline-formula>) at logarithmic and doubly logarithmic rates, respectively.</jats:p>","lang":"eng"}],"status":"public","type":"journal_article","publication":"Journal of Dynamics and Differential Equations","keyword":["Analysis"],"language":[{"iso":"eng"}],"_id":"53323","user_id":"31496"},{"status":"public","type":"journal_article","publication":"Journal of Differential Equations","language":[{"iso":"eng"}],"keyword":["Analysis","Applied Mathematics"],"user_id":"31496","_id":"53327","citation":{"ieee":"Y. Tao and M. Winkler, “Global solutions to a Keller-Segel-consumption system involving singularly signal-dependent motilities in domains of arbitrary dimension,” <i>Journal of Differential Equations</i>, vol. 343, pp. 390–418, 2022, doi: <a href=\"https://doi.org/10.1016/j.jde.2022.10.022\">10.1016/j.jde.2022.10.022</a>.","chicago":"Tao, Youshan, and Michael Winkler. “Global Solutions to a Keller-Segel-Consumption System Involving Singularly Signal-Dependent Motilities in Domains of Arbitrary Dimension.” <i>Journal of Differential Equations</i> 343 (2022): 390–418. <a href=\"https://doi.org/10.1016/j.jde.2022.10.022\">https://doi.org/10.1016/j.jde.2022.10.022</a>.","ama":"Tao Y, Winkler M. Global solutions to a Keller-Segel-consumption system involving singularly signal-dependent motilities in domains of arbitrary dimension. <i>Journal of Differential Equations</i>. 2022;343:390-418. doi:<a href=\"https://doi.org/10.1016/j.jde.2022.10.022\">10.1016/j.jde.2022.10.022</a>","apa":"Tao, Y., &#38; Winkler, M. (2022). Global solutions to a Keller-Segel-consumption system involving singularly signal-dependent motilities in domains of arbitrary dimension. <i>Journal of Differential Equations</i>, <i>343</i>, 390–418. <a href=\"https://doi.org/10.1016/j.jde.2022.10.022\">https://doi.org/10.1016/j.jde.2022.10.022</a>","mla":"Tao, Youshan, and Michael Winkler. “Global Solutions to a Keller-Segel-Consumption System Involving Singularly Signal-Dependent Motilities in Domains of Arbitrary Dimension.” <i>Journal of Differential Equations</i>, vol. 343, Elsevier BV, 2022, pp. 390–418, doi:<a href=\"https://doi.org/10.1016/j.jde.2022.10.022\">10.1016/j.jde.2022.10.022</a>.","bibtex":"@article{Tao_Winkler_2022, title={Global solutions to a Keller-Segel-consumption system involving singularly signal-dependent motilities in domains of arbitrary dimension}, volume={343}, DOI={<a href=\"https://doi.org/10.1016/j.jde.2022.10.022\">10.1016/j.jde.2022.10.022</a>}, journal={Journal of Differential Equations}, publisher={Elsevier BV}, author={Tao, Youshan and Winkler, Michael}, year={2022}, pages={390–418} }","short":"Y. Tao, M. Winkler, Journal of Differential Equations 343 (2022) 390–418."},"intvolume":"       343","page":"390-418","year":"2022","publication_status":"published","publication_identifier":{"issn":["0022-0396"]},"doi":"10.1016/j.jde.2022.10.022","title":"Global solutions to a Keller-Segel-consumption system involving singularly signal-dependent motilities in domains of arbitrary dimension","date_created":"2024-04-07T12:42:28Z","author":[{"last_name":"Tao","full_name":"Tao, Youshan","first_name":"Youshan"},{"full_name":"Winkler, Michael","last_name":"Winkler","first_name":"Michael"}],"volume":343,"publisher":"Elsevier BV","date_updated":"2024-04-07T12:42:32Z"},{"publication":"Nonlinear Analysis","type":"journal_article","status":"public","_id":"53325","user_id":"31496","keyword":["Applied Mathematics","Analysis"],"article_number":"113153","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0362-546X"]},"publication_status":"published","year":"2022","intvolume":"       226","citation":{"chicago":"Desvillettes, Laurent, Philippe Laurençot, Ariane Trescases, and Michael Winkler. “Weak Solutions to Triangular Cross Diffusion Systems Modeling Chemotaxis with Local Sensing.” <i>Nonlinear Analysis</i> 226 (2022). <a href=\"https://doi.org/10.1016/j.na.2022.113153\">https://doi.org/10.1016/j.na.2022.113153</a>.","ieee":"L. Desvillettes, P. Laurençot, A. Trescases, and M. Winkler, “Weak solutions to triangular cross diffusion systems modeling chemotaxis with local sensing,” <i>Nonlinear Analysis</i>, vol. 226, Art. no. 113153, 2022, doi: <a href=\"https://doi.org/10.1016/j.na.2022.113153\">10.1016/j.na.2022.113153</a>.","ama":"Desvillettes L, Laurençot P, Trescases A, Winkler M. Weak solutions to triangular cross diffusion systems modeling chemotaxis with local sensing. <i>Nonlinear Analysis</i>. 2022;226. doi:<a href=\"https://doi.org/10.1016/j.na.2022.113153\">10.1016/j.na.2022.113153</a>","apa":"Desvillettes, L., Laurençot, P., Trescases, A., &#38; Winkler, M. (2022). Weak solutions to triangular cross diffusion systems modeling chemotaxis with local sensing. <i>Nonlinear Analysis</i>, <i>226</i>, Article 113153. <a href=\"https://doi.org/10.1016/j.na.2022.113153\">https://doi.org/10.1016/j.na.2022.113153</a>","short":"L. Desvillettes, P. Laurençot, A. Trescases, M. Winkler, Nonlinear Analysis 226 (2022).","mla":"Desvillettes, Laurent, et al. “Weak Solutions to Triangular Cross Diffusion Systems Modeling Chemotaxis with Local Sensing.” <i>Nonlinear Analysis</i>, vol. 226, 113153, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.na.2022.113153\">10.1016/j.na.2022.113153</a>.","bibtex":"@article{Desvillettes_Laurençot_Trescases_Winkler_2022, title={Weak solutions to triangular cross diffusion systems modeling chemotaxis with local sensing}, volume={226}, DOI={<a href=\"https://doi.org/10.1016/j.na.2022.113153\">10.1016/j.na.2022.113153</a>}, number={113153}, journal={Nonlinear Analysis}, publisher={Elsevier BV}, author={Desvillettes, Laurent and Laurençot, Philippe and Trescases, Ariane and Winkler, Michael}, year={2022} }"},"date_updated":"2024-04-07T12:41:20Z","publisher":"Elsevier BV","volume":226,"author":[{"last_name":"Desvillettes","full_name":"Desvillettes, Laurent","first_name":"Laurent"},{"first_name":"Philippe","full_name":"Laurençot, Philippe","last_name":"Laurençot"},{"first_name":"Ariane","last_name":"Trescases","full_name":"Trescases, Ariane"},{"first_name":"Michael","full_name":"Winkler, Michael","last_name":"Winkler"}],"date_created":"2024-04-07T12:41:15Z","title":"Weak solutions to triangular cross diffusion systems modeling chemotaxis with local sensing","doi":"10.1016/j.na.2022.113153"},{"_id":"50024","user_id":"186","department":[{"_id":"475"},{"_id":"19"},{"_id":"200"}],"keyword":["Statistics","Probability and Uncertainty","Numerical Analysis","Statistics and Probability"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"The R Journal","status":"public","date_updated":"2024-06-12T12:57:13Z","publisher":"The R Foundation","author":[{"full_name":"Feng, Yuanhua","last_name":"Feng","first_name":"Yuanhua"},{"last_name":"Gries","full_name":"Gries, Thomas","first_name":"Thomas"},{"first_name":"Sebastian","full_name":"Letmathe, Sebastian","last_name":"Letmathe"},{"last_name":"Schulz","full_name":"Schulz, Dominik","first_name":"Dominik"}],"date_created":"2023-12-21T12:09:31Z","volume":14,"title":"The smoots Package in R for Semiparametric Modeling of Trend Stationary Time Series","doi":"10.32614/rj-2022-017","publication_status":"published","publication_identifier":{"issn":["2073-4859"]},"issue":"1","year":"2022","citation":{"apa":"Feng, Y., Gries, T., Letmathe, S., &#38; Schulz, D. (2022). The smoots Package in R for Semiparametric Modeling of Trend Stationary Time Series. <i>The R Journal</i>, <i>14</i>(1), 182–195. <a href=\"https://doi.org/10.32614/rj-2022-017\">https://doi.org/10.32614/rj-2022-017</a>","short":"Y. Feng, T. Gries, S. Letmathe, D. Schulz, The R Journal 14 (2022) 182–195.","bibtex":"@article{Feng_Gries_Letmathe_Schulz_2022, title={The smoots Package in R for Semiparametric Modeling of Trend Stationary Time Series}, volume={14}, DOI={<a href=\"https://doi.org/10.32614/rj-2022-017\">10.32614/rj-2022-017</a>}, number={1}, journal={The R Journal}, publisher={The R Foundation}, author={Feng, Yuanhua and Gries, Thomas and Letmathe, Sebastian and Schulz, Dominik}, year={2022}, pages={182–195} }","mla":"Feng, Yuanhua, et al. “The Smoots Package in R for Semiparametric Modeling of Trend Stationary Time Series.” <i>The R Journal</i>, vol. 14, no. 1, The R Foundation, 2022, pp. 182–95, doi:<a href=\"https://doi.org/10.32614/rj-2022-017\">10.32614/rj-2022-017</a>.","ieee":"Y. Feng, T. Gries, S. Letmathe, and D. Schulz, “The smoots Package in R for Semiparametric Modeling of Trend Stationary Time Series,” <i>The R Journal</i>, vol. 14, no. 1, pp. 182–195, 2022, doi: <a href=\"https://doi.org/10.32614/rj-2022-017\">10.32614/rj-2022-017</a>.","chicago":"Feng, Yuanhua, Thomas Gries, Sebastian Letmathe, and Dominik Schulz. “The Smoots Package in R for Semiparametric Modeling of Trend Stationary Time Series.” <i>The R Journal</i> 14, no. 1 (2022): 182–95. <a href=\"https://doi.org/10.32614/rj-2022-017\">https://doi.org/10.32614/rj-2022-017</a>.","ama":"Feng Y, Gries T, Letmathe S, Schulz D. The smoots Package in R for Semiparametric Modeling of Trend Stationary Time Series. <i>The R Journal</i>. 2022;14(1):182-195. doi:<a href=\"https://doi.org/10.32614/rj-2022-017\">10.32614/rj-2022-017</a>"},"intvolume":"        14","page":"182-195"}]