[{"title":"ZeKK Live - 45 Minuten mit Dr. Yasemin El-Menouar","year":"2025","status":"public","author":[{"full_name":"Breckner, Anne","first_name":"Anne","last_name":"Breckner","id":"24573"}],"date_updated":"2026-06-26T19:46:14Z","main_file_link":[{"url":"https://youtu.be/vferKLcUPEI?feature=shared","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"60601","user_id":"24573","citation":{"chicago":"Breckner, Anne. <i>ZeKK Live - 45 Minuten Mit Dr. Yasemin El-Menouar</i>, 2025.","short":"A. Breckner, ZeKK Live - 45 Minuten Mit Dr. Yasemin El-Menouar, 2025.","ieee":"A. Breckner, <i>ZeKK Live - 45 Minuten mit Dr. Yasemin El-Menouar</i>. 2025.","apa":"Breckner, A. (2025). <i>ZeKK Live - 45 Minuten mit Dr. Yasemin El-Menouar</i>.","bibtex":"@book{Breckner_2025, title={ZeKK Live - 45 Minuten mit Dr. Yasemin El-Menouar}, author={Breckner, Anne}, year={2025} }","ama":"Breckner A. <i>ZeKK Live - 45 Minuten Mit Dr. Yasemin El-Menouar</i>.; 2025.","mla":"Breckner, Anne. <i>ZeKK Live - 45 Minuten Mit Dr. Yasemin El-Menouar</i>. 2025."},"date_created":"2025-07-14T09:12:13Z","type":"misc","department":[{"_id":"550"}],"oa":"1"},{"date_updated":"2026-06-24T09:42:31Z","intvolume":"      2025","year":"2025","title":"Missbrauch einer marktbeherrschenden Stellung durch Bevorzugung eigener Dienstleistungen","status":"public","author":[{"full_name":"Bartlitz, David","last_name":"Bartlitz","first_name":"David"}],"user_id":"90186","volume":2025,"main_file_link":[{"url":"https://www.juris.de/perma?d=jzs-ZIP-2025-30-002-1772"}],"page":"1772-1780","_id":"66033","language":[{"iso":"eng"}],"publisher":"Verlag Dr. Otto Schmitd, Köln","publication":"Zeitschrift für Wirtschaftsrecht (ZIP)","issue":"30","citation":{"chicago":"Bartlitz, David. “Missbrauch Einer Marktbeherrschenden Stellung Durch Bevorzugung Eigener Dienstleistungen.” <i>Zeitschrift Für Wirtschaftsrecht (ZIP)</i> 2025, no. 30 (2025): 1772–80.","short":"D. Bartlitz, Zeitschrift Für Wirtschaftsrecht (ZIP) 2025 (2025) 1772–1780.","ieee":"D. Bartlitz, “Missbrauch einer marktbeherrschenden Stellung durch Bevorzugung eigener Dienstleistungen,” <i>Zeitschrift für Wirtschaftsrecht (ZIP)</i>, vol. 2025, no. 30, pp. 1772–1780, 2025.","apa":"Bartlitz, D. (2025). Missbrauch einer marktbeherrschenden Stellung durch Bevorzugung eigener Dienstleistungen. <i>Zeitschrift Für Wirtschaftsrecht (ZIP)</i>, <i>2025</i>(30), 1772–1780.","bibtex":"@article{Bartlitz_2025, title={Missbrauch einer marktbeherrschenden Stellung durch Bevorzugung eigener Dienstleistungen}, volume={2025}, number={30}, journal={Zeitschrift für Wirtschaftsrecht (ZIP)}, publisher={Verlag Dr. Otto Schmitd, Köln}, author={Bartlitz, David}, year={2025}, pages={1772–1780} }","ama":"Bartlitz D. Missbrauch einer marktbeherrschenden Stellung durch Bevorzugung eigener Dienstleistungen. <i>Zeitschrift für Wirtschaftsrecht (ZIP)</i>. 2025;2025(30):1772-1780.","mla":"Bartlitz, David. “Missbrauch Einer Marktbeherrschenden Stellung Durch Bevorzugung Eigener Dienstleistungen.” <i>Zeitschrift Für Wirtschaftsrecht (ZIP)</i>, vol. 2025, no. 30, Verlag Dr. Otto Schmitd, Köln, 2025, pp. 1772–80."},"type":"journal_article","department":[{"_id":"845"}],"date_created":"2026-06-24T09:42:10Z"},{"_id":"61851","language":[{"iso":"ger"}],"page":"1-11","user_id":"90186","author":[{"orcid":"0000-0003-2967-8299 ","first_name":"David","last_name":"Bartlitz","full_name":"Bartlitz, David","id":"104560"}],"year":"2025","status":"public","title":"Wohlverhaltenspflichten nach § 63 Abs. 4, Abs. 5 WpHG (Product Governance)","date_updated":"2026-06-24T08:39:07Z","date_created":"2025-10-15T12:44:14Z","department":[{"_id":"845"}],"type":"journal_article","citation":{"short":"D. Bartlitz, iff Infobrief (2025) 1–11.","chicago":"Bartlitz, David. “Wohlverhaltenspflichten nach § 63 Abs. 4, Abs. 5 WpHG (Product Governance).” <i>iff Infobrief</i>, no. 17 (2025): 1–11.","ieee":"D. Bartlitz, “Wohlverhaltenspflichten nach § 63 Abs. 4, Abs. 5 WpHG (Product Governance),” <i>iff Infobrief</i>, no. 17, pp. 1–11, 2025.","apa":"Bartlitz, D. (2025). Wohlverhaltenspflichten nach § 63 Abs. 4, Abs. 5 WpHG (Product Governance). <i>iff Infobrief</i>, <i>17</i>, 1–11.","bibtex":"@article{Bartlitz_2025, title={Wohlverhaltenspflichten nach § 63 Abs. 4, Abs. 5 WpHG (Product Governance)}, number={17}, journal={iff Infobrief}, author={Bartlitz, David}, year={2025}, pages={1–11} }","ama":"Bartlitz D. Wohlverhaltenspflichten nach § 63 Abs. 4, Abs. 5 WpHG (Product Governance). <i>iff Infobrief</i>. 2025;(17):1-11.","mla":"Bartlitz, David. “Wohlverhaltenspflichten nach § 63 Abs. 4, Abs. 5 WpHG (Product Governance).” <i>iff Infobrief</i>, no. 17, 2025, pp. 1–11."},"issue":"17","publication":"iff Infobrief"},{"type":"journal_article","date_created":"2026-01-06T09:40:00Z","citation":{"short":"T. Bruno, E. Papageorgiou, Journal d’Analyse Mathématique 157 (2025) 733–767.","chicago":"Bruno, Tommaso, and Effie Papageorgiou. “Pointwise Convergence to Initial Data for Some Evolution Equations on Symmetric Spaces.” <i>Journal d’Analyse Mathématique</i> 157, no. 2 (2025): 733–67. <a href=\"https://doi.org/10.1007/s11854-025-0403-2\">https://doi.org/10.1007/s11854-025-0403-2</a>.","ieee":"T. Bruno and E. Papageorgiou, “Pointwise convergence to initial data for some evolution equations on symmetric spaces,” <i>Journal d’Analyse Mathématique</i>, vol. 157, no. 2, pp. 733–767, 2025, doi: <a href=\"https://doi.org/10.1007/s11854-025-0403-2\">10.1007/s11854-025-0403-2</a>.","apa":"Bruno, T., &#38; Papageorgiou, E. (2025). Pointwise convergence to initial data for some evolution equations on symmetric spaces. <i>Journal d’Analyse Mathématique</i>, <i>157</i>(2), 733–767. <a href=\"https://doi.org/10.1007/s11854-025-0403-2\">https://doi.org/10.1007/s11854-025-0403-2</a>","bibtex":"@article{Bruno_Papageorgiou_2025, title={Pointwise convergence to initial data for some evolution equations on symmetric spaces}, volume={157}, DOI={<a href=\"https://doi.org/10.1007/s11854-025-0403-2\">10.1007/s11854-025-0403-2</a>}, number={2}, journal={Journal d’Analyse Mathématique}, publisher={Springer Science and Business Media LLC}, author={Bruno, Tommaso and Papageorgiou, Effie}, year={2025}, pages={733–767} }","ama":"Bruno T, Papageorgiou E. Pointwise convergence to initial data for some evolution equations on symmetric spaces. <i>Journal d’Analyse Mathématique</i>. 2025;157(2):733-767. doi:<a href=\"https://doi.org/10.1007/s11854-025-0403-2\">10.1007/s11854-025-0403-2</a>","mla":"Bruno, Tommaso, and Effie Papageorgiou. “Pointwise Convergence to Initial Data for Some Evolution Equations on Symmetric Spaces.” <i>Journal d’Analyse Mathématique</i>, vol. 157, no. 2, Springer Science and Business Media LLC, 2025, pp. 733–67, doi:<a href=\"https://doi.org/10.1007/s11854-025-0403-2\">10.1007/s11854-025-0403-2</a>."},"publication":"Journal d'Analyse Mathématique","issue":"2","volume":157,"doi":"10.1007/s11854-025-0403-2","user_id":"100325","_id":"63503","language":[{"iso":"eng"}],"publisher":"Springer Science and Business Media LLC","page":"733-767","intvolume":"       157","date_updated":"2026-07-03T12:36:50Z","publication_status":"published","publication_identifier":{"issn":["0021-7670","1565-8538"]},"author":[{"last_name":"Bruno","first_name":"Tommaso","full_name":"Bruno, Tommaso"},{"last_name":"Papageorgiou","first_name":"Effie","full_name":"Papageorgiou, Effie"}],"year":"2025","title":"Pointwise convergence to initial data for some evolution equations on symmetric spaces","status":"public"},{"date_created":"2026-07-05T14:40:01Z","place":"Dagstuhl, Germany","type":"conference","citation":{"bibtex":"@inproceedings{Chen_Shi_Günzel_von der Brüggen_Chen_Bella_2025, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Theoretical Foundations of Utility Accrual for Real-Time Systems}, volume={335}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2025.17\">10.4230/LIPIcs.ECRTS.2025.17</a>}, booktitle={37th Euromicro Conference on Real-Time Systems (ECRTS 2025)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Chen, Jian-Jia and Shi, Junjie and Günzel, Mario and von der Brüggen, Georg and Chen, Kuan-Hsun and Bella, Peter}, editor={Mancuso, Renato}, year={2025}, pages={17:1–17:26}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Chen J-J, Shi J, Günzel M, von der Brüggen G, Chen K-H, Bella P. Theoretical Foundations of Utility Accrual for Real-Time Systems. In: Mancuso R, ed. <i>37th Euromicro Conference on Real-Time Systems (ECRTS 2025)</i>. Vol 335. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2025:17:1–17:26. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2025.17\">10.4230/LIPIcs.ECRTS.2025.17</a>","mla":"Chen, Jian-Jia, et al. “Theoretical Foundations of Utility Accrual for Real-Time Systems.” <i>37th Euromicro Conference on Real-Time Systems (ECRTS 2025)</i>, edited by Renato Mancuso, vol. 335, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, p. 17:1–17:26, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2025.17\">10.4230/LIPIcs.ECRTS.2025.17</a>.","short":"J.-J. Chen, J. Shi, M. Günzel, G. von der Brüggen, K.-H. Chen, P. Bella, in: R. Mancuso (Ed.), 37th Euromicro Conference on Real-Time Systems (ECRTS 2025), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025, p. 17:1–17:26.","chicago":"Chen, Jian-Jia, Junjie Shi, Mario Günzel, Georg von der Brüggen, Kuan-Hsun Chen, and Peter Bella. “Theoretical Foundations of Utility Accrual for Real-Time Systems.” In <i>37th Euromicro Conference on Real-Time Systems (ECRTS 2025)</i>, edited by Renato Mancuso, 335:17:1–17:26. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2025.17\">https://doi.org/10.4230/LIPIcs.ECRTS.2025.17</a>.","ieee":"J.-J. Chen, J. Shi, M. Günzel, G. von der Brüggen, K.-H. Chen, and P. Bella, “Theoretical Foundations of Utility Accrual for Real-Time Systems,” in <i>37th Euromicro Conference on Real-Time Systems (ECRTS 2025)</i>, 2025, vol. 335, p. 17:1–17:26, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2025.17\">10.4230/LIPIcs.ECRTS.2025.17</a>.","apa":"Chen, J.-J., Shi, J., Günzel, M., von der Brüggen, G., Chen, K.-H., &#38; Bella, P. (2025). Theoretical Foundations of Utility Accrual for Real-Time Systems. In R. Mancuso (Ed.), <i>37th Euromicro Conference on Real-Time Systems (ECRTS 2025)</i> (Vol. 335, p. 17:1–17:26). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ECRTS.2025.17\">https://doi.org/10.4230/LIPIcs.ECRTS.2025.17</a>"},"publication":"37th Euromicro Conference on Real-Time Systems (ECRTS 2025)","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","_id":"66263","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","page":"17:1–17:26","volume":335,"editor":[{"last_name":"Mancuso","first_name":"Renato","full_name":"Mancuso, Renato"}],"user_id":"128464","doi":"10.4230/LIPIcs.ECRTS.2025.17","author":[{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"},{"first_name":"Junjie","last_name":"Shi","full_name":"Shi, Junjie"},{"full_name":"Günzel, Mario","first_name":"Mario","last_name":"Günzel"},{"last_name":"von der Brüggen","first_name":"Georg","full_name":"von der Brüggen, Georg"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"},{"full_name":"Bella, Peter","last_name":"Bella","first_name":"Peter"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-377-5"]},"title":"Theoretical Foundations of Utility Accrual for Real-Time Systems","year":"2025","status":"public","intvolume":"       335","date_updated":"2026-07-05T14:43:00Z"},{"citation":{"mla":"Cishugi, Elijah Seth, et al. “Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation.” <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>.","ama":"Cishugi ES, Smit TT, Forlin B, Cazzaniga C, Chen K-H, Ottavi M. Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation. In: <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>","bibtex":"@inproceedings{Cishugi_Smit_Forlin_Cazzaniga_Chen_Ottavi_2025, title={Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation}, DOI={<a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>}, booktitle={2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)}, publisher={IEEE}, author={Cishugi, Elijah Seth and Smit, Tijmen T. and Forlin, Bruno and Cazzaniga, Carlo and Chen, Kuan-Hsun and Ottavi, Marco}, year={2025} }","apa":"Cishugi, E. S., Smit, T. T., Forlin, B., Cazzaniga, C., Chen, K.-H., &#38; Ottavi, M. (2025). Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation. <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>. <a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">https://doi.org/10.1109/iolts65288.2025.11116913</a>","ieee":"E. S. Cishugi, T. T. Smit, B. Forlin, C. Cazzaniga, K.-H. Chen, and M. Ottavi, “Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation,” 2025, doi: <a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>.","short":"E.S. Cishugi, T.T. Smit, B. Forlin, C. Cazzaniga, K.-H. Chen, M. Ottavi, in: 2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS), IEEE, 2025.","chicago":"Cishugi, Elijah Seth, Tijmen T. Smit, Bruno Forlin, Carlo Cazzaniga, Kuan-Hsun Chen, and Marco Ottavi. “Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation.” In <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">https://doi.org/10.1109/iolts65288.2025.11116913</a>."},"publication":"2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)","date_created":"2026-07-03T21:10:19Z","type":"conference","author":[{"last_name":"Cishugi","first_name":"Elijah Seth","full_name":"Cishugi, Elijah Seth"},{"full_name":"Smit, Tijmen T.","last_name":"Smit","first_name":"Tijmen T."},{"last_name":"Forlin","first_name":"Bruno","full_name":"Forlin, Bruno"},{"first_name":"Carlo","last_name":"Cazzaniga","full_name":"Cazzaniga, Carlo"},{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"full_name":"Ottavi, Marco","last_name":"Ottavi","first_name":"Marco"}],"year":"2025","status":"public","title":"Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation","date_updated":"2026-07-05T14:47:37Z","publication_status":"published","_id":"66161","publisher":"IEEE","doi":"10.1109/iolts65288.2025.11116913","user_id":"128464"},{"date_updated":"2026-07-05T14:47:50Z","title":"CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems","year":"2025","status":"public","citation":{"short":"(2025).","chicago":"“CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems,” 2025. <a href=\"https://doi.org/10.48550/ARXIV.2503.01444\">https://doi.org/10.48550/ARXIV.2503.01444</a>.","ieee":"“CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems,” 2025, doi: <a href=\"https://doi.org/10.48550/ARXIV.2503.01444\">10.48550/ARXIV.2503.01444</a>.","apa":"<i>CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems</i>. (2025). <a href=\"https://doi.org/10.48550/ARXIV.2503.01444\">https://doi.org/10.48550/ARXIV.2503.01444</a>","bibtex":"@article{CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems_2025, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2503.01444\">10.48550/ARXIV.2503.01444</a>}, year={2025} }","ama":"CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems. Published online 2025. doi:<a href=\"https://doi.org/10.48550/ARXIV.2503.01444\">10.48550/ARXIV.2503.01444</a>","mla":"<i>CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems</i>. 2025, doi:<a href=\"https://doi.org/10.48550/ARXIV.2503.01444\">10.48550/ARXIV.2503.01444</a>."},"doi":"10.48550/ARXIV.2503.01444","user_id":"128464","type":"journal_article","_id":"66163","date_created":"2026-07-03T21:10:36Z"},{"type":"journal_article","user_id":"128464","doi":"10.48550/ARXIV.2505.15391","date_created":"2026-07-03T21:10:57Z","_id":"66164","date_updated":"2026-07-05T14:47:53Z","status":"public","title":"InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference","year":"2025","citation":{"mla":"<i>InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference</i>. 2025, doi:<a href=\"https://doi.org/10.48550/ARXIV.2505.15391\">10.48550/ARXIV.2505.15391</a>.","ama":"InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference. Published online 2025. doi:<a href=\"https://doi.org/10.48550/ARXIV.2505.15391\">10.48550/ARXIV.2505.15391</a>","bibtex":"@article{InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference_2025, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2505.15391\">10.48550/ARXIV.2505.15391</a>}, year={2025} }","apa":"<i>InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference</i>. (2025). <a href=\"https://doi.org/10.48550/ARXIV.2505.15391\">https://doi.org/10.48550/ARXIV.2505.15391</a>","ieee":"“InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference,” 2025, doi: <a href=\"https://doi.org/10.48550/ARXIV.2505.15391\">10.48550/ARXIV.2505.15391</a>.","chicago":"“InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference,” 2025. <a href=\"https://doi.org/10.48550/ARXIV.2505.15391\">https://doi.org/10.48550/ARXIV.2505.15391</a>.","short":"(2025)."}},{"_id":"66160","date_created":"2026-07-03T21:10:13Z","doi":"10.48550/ARXIV.2501.06367","type":"journal_article","user_id":"128464","year":"2025","title":"Resilient Endurance-Aware NVM-based PUF against Learning-based Attacks","status":"public","citation":{"ama":"Resilient Endurance-Aware NVM-based PUF against Learning-based Attacks. Published online 2025. doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.06367\">10.48550/ARXIV.2501.06367</a>","bibtex":"@article{Resilient Endurance-Aware NVM-based PUF against Learning-based Attacks_2025, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2501.06367\">10.48550/ARXIV.2501.06367</a>}, year={2025} }","mla":"<i>Resilient Endurance-Aware NVM-Based PUF against Learning-Based Attacks</i>. 2025, doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.06367\">10.48550/ARXIV.2501.06367</a>.","chicago":"“Resilient Endurance-Aware NVM-Based PUF against Learning-Based Attacks,” 2025. <a href=\"https://doi.org/10.48550/ARXIV.2501.06367\">https://doi.org/10.48550/ARXIV.2501.06367</a>.","short":"(2025).","apa":"<i>Resilient Endurance-Aware NVM-based PUF against Learning-based Attacks</i>. (2025). <a href=\"https://doi.org/10.48550/ARXIV.2501.06367\">https://doi.org/10.48550/ARXIV.2501.06367</a>","ieee":"“Resilient Endurance-Aware NVM-based PUF against Learning-based Attacks,” 2025, doi: <a href=\"https://doi.org/10.48550/ARXIV.2501.06367\">10.48550/ARXIV.2501.06367</a>."},"date_updated":"2026-07-05T14:47:33Z"},{"title":"WCDT: Systematic WCET Optimization for Decision Tree Implementations","year":"2025","status":"public","citation":{"mla":"<i>WCDT: Systematic WCET Optimization for Decision Tree Implementations</i>. 2025, doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.17428\">10.48550/ARXIV.2501.17428</a>.","ama":"WCDT: Systematic WCET Optimization for Decision Tree Implementations. Published online 2025. doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.17428\">10.48550/ARXIV.2501.17428</a>","bibtex":"@article{WCDT: Systematic WCET Optimization for Decision Tree Implementations_2025, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2501.17428\">10.48550/ARXIV.2501.17428</a>}, year={2025} }","apa":"<i>WCDT: Systematic WCET Optimization for Decision Tree Implementations</i>. (2025). <a href=\"https://doi.org/10.48550/ARXIV.2501.17428\">https://doi.org/10.48550/ARXIV.2501.17428</a>","ieee":"“WCDT: Systematic WCET Optimization for Decision Tree Implementations,” 2025, doi: <a href=\"https://doi.org/10.48550/ARXIV.2501.17428\">10.48550/ARXIV.2501.17428</a>.","chicago":"“WCDT: Systematic WCET Optimization for Decision Tree Implementations,” 2025. <a href=\"https://doi.org/10.48550/ARXIV.2501.17428\">https://doi.org/10.48550/ARXIV.2501.17428</a>.","short":"(2025)."},"date_updated":"2026-07-05T14:47:43Z","date_created":"2026-07-03T21:10:24Z","_id":"66162","user_id":"128464","type":"journal_article","doi":"10.48550/ARXIV.2501.17428"},{"citation":{"bibtex":"@article{Shi_Chen_2025, title={Shielded reinforcement learning for fault-tolerant scheduling in real-time systems}, volume={61}, DOI={<a href=\"https://doi.org/10.1007/s11241-025-09441-z\">10.1007/s11241-025-09441-z</a>}, number={2}, journal={Real-Time Systems}, publisher={Springer Science and Business Media LLC}, author={Shi, Junjie and Chen, Kuan-Hsun}, year={2025}, pages={306–310} }","ama":"Shi J, Chen K-H. Shielded reinforcement learning for fault-tolerant scheduling in real-time systems. <i>Real-Time Systems</i>. 2025;61(2):306-310. doi:<a href=\"https://doi.org/10.1007/s11241-025-09441-z\">10.1007/s11241-025-09441-z</a>","mla":"Shi, Junjie, and Kuan-Hsun Chen. “Shielded Reinforcement Learning for Fault-Tolerant Scheduling in Real-Time Systems.” <i>Real-Time Systems</i>, vol. 61, no. 2, Springer Science and Business Media LLC, 2025, pp. 306–10, doi:<a href=\"https://doi.org/10.1007/s11241-025-09441-z\">10.1007/s11241-025-09441-z</a>.","short":"J. Shi, K.-H. Chen, Real-Time Systems 61 (2025) 306–310.","chicago":"Shi, Junjie, and Kuan-Hsun Chen. “Shielded Reinforcement Learning for Fault-Tolerant Scheduling in Real-Time Systems.” <i>Real-Time Systems</i> 61, no. 2 (2025): 306–10. <a href=\"https://doi.org/10.1007/s11241-025-09441-z\">https://doi.org/10.1007/s11241-025-09441-z</a>.","ieee":"J. Shi and K.-H. Chen, “Shielded reinforcement learning for fault-tolerant scheduling in real-time systems,” <i>Real-Time Systems</i>, vol. 61, no. 2, pp. 306–310, 2025, doi: <a href=\"https://doi.org/10.1007/s11241-025-09441-z\">10.1007/s11241-025-09441-z</a>.","apa":"Shi, J., &#38; Chen, K.-H. (2025). Shielded reinforcement learning for fault-tolerant scheduling in real-time systems. <i>Real-Time Systems</i>, <i>61</i>(2), 306–310. <a href=\"https://doi.org/10.1007/s11241-025-09441-z\">https://doi.org/10.1007/s11241-025-09441-z</a>"},"page":"306-310","_id":"66147","publisher":"Springer Science and Business Media LLC","user_id":"128464","volume":61,"status":"public","date_created":"2026-07-03T21:07:18Z","type":"journal_article","issue":"2","publication":"Real-Time Systems","abstract":[{"text":"<jats:title>Abstract</jats:title>\n          <jats:p>Reinforcement Learning (RL) has emerged as a promising tool for decision-making in various applications, particularly in uncertain environments. While its adoption in embedded systems—especially hard real-time systems—faces challenges due to stringent timing constraints, integrating shielding mechanisms may offer a pathway for RL to optimize its scheduling decisions, preserving worst-case timing guarantees. This position paper shows a use case where RL selects compliant execution versions for fault-tolerant real-time systems while minimizing the system utilization in runtime. Furthermore, we discuss possible directions for further exploring RL’s role in real-time systems for improved adaptability.</jats:p>","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1007/s11241-025-09441-z","title":"Shielded reinforcement learning for fault-tolerant scheduling in real-time systems","year":"2025","publication_identifier":{"issn":["0922-6443","1573-1383"]},"author":[{"first_name":"Junjie","last_name":"Shi","full_name":"Shi, Junjie"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"}],"publication_status":"published","date_updated":"2026-07-05T14:48:45Z","intvolume":"        61"},{"date_updated":"2026-07-05T14:48:37Z","publication_status":"published","intvolume":"         9","year":"2025","title":"Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2","status":"public","publication_identifier":{"issn":["2378-962X","2378-9638"]},"author":[{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"first_name":"Jing","last_name":"Li","full_name":"Li, Jing"},{"full_name":"Reghenzani, Federico","last_name":"Reghenzani","first_name":"Federico"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"doi":"10.1145/3712019","user_id":"128464","volume":9,"page":"1-2","publisher":"Association for Computing Machinery (ACM)","_id":"66153","language":[{"iso":"eng"}],"issue":"1","publication":"ACM Transactions on Cyber-Physical Systems","citation":{"chicago":"Chen, Kuan-Hsun, Jing Li, Federico Reghenzani, and Jian-Jia Chen. “Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2.” <i>ACM Transactions on Cyber-Physical Systems</i> 9, no. 1 (2025): 1–2. <a href=\"https://doi.org/10.1145/3712019\">https://doi.org/10.1145/3712019</a>.","short":"K.-H. Chen, J. Li, F. Reghenzani, J.-J. Chen, ACM Transactions on Cyber-Physical Systems 9 (2025) 1–2.","apa":"Chen, K.-H., Li, J., Reghenzani, F., &#38; Chen, J.-J. (2025). Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2. <i>ACM Transactions on Cyber-Physical Systems</i>, <i>9</i>(1), 1–2. <a href=\"https://doi.org/10.1145/3712019\">https://doi.org/10.1145/3712019</a>","ieee":"K.-H. Chen, J. Li, F. Reghenzani, and J.-J. Chen, “Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2,” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. 9, no. 1, pp. 1–2, 2025, doi: <a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>.","ama":"Chen K-H, Li J, Reghenzani F, Chen J-J. Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2. <i>ACM Transactions on Cyber-Physical Systems</i>. 2025;9(1):1-2. doi:<a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>","bibtex":"@article{Chen_Li_Reghenzani_Chen_2025, title={Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2}, volume={9}, DOI={<a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>}, number={1}, journal={ACM Transactions on Cyber-Physical Systems}, publisher={Association for Computing Machinery (ACM)}, author={Chen, Kuan-Hsun and Li, Jing and Reghenzani, Federico and Chen, Jian-Jia}, year={2025}, pages={1–2} }","mla":"Chen, Kuan-Hsun, et al. “Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2.” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. 9, no. 1, Association for Computing Machinery (ACM), 2025, pp. 1–2, doi:<a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>."},"type":"journal_article","date_created":"2026-07-03T21:08:22Z"},{"date_updated":"2026-07-05T14:48:47Z","publication_status":"published","intvolume":"         9","year":"2025","title":"Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2","status":"public","author":[{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"},{"first_name":"Jing","last_name":"Li","full_name":"Li, Jing"},{"full_name":"Reghenzani, Federico","last_name":"Reghenzani","first_name":"Federico"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"}],"publication_identifier":{"issn":["2378-962X","2378-9638"]},"doi":"10.1145/3712019","user_id":"128464","volume":9,"page":"1-2","language":[{"iso":"eng"}],"_id":"66148","publisher":"Association for Computing Machinery (ACM)","issue":"1","publication":"ACM Transactions on Cyber-Physical Systems","citation":{"chicago":"Chen, Kuan-Hsun, Jing Li, Federico Reghenzani, and Jian-Jia Chen. “Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2.” <i>ACM Transactions on Cyber-Physical Systems</i> 9, no. 1 (2025): 1–2. <a href=\"https://doi.org/10.1145/3712019\">https://doi.org/10.1145/3712019</a>.","short":"K.-H. Chen, J. Li, F. Reghenzani, J.-J. Chen, ACM Transactions on Cyber-Physical Systems 9 (2025) 1–2.","apa":"Chen, K.-H., Li, J., Reghenzani, F., &#38; Chen, J.-J. (2025). Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2. <i>ACM Transactions on Cyber-Physical Systems</i>, <i>9</i>(1), 1–2. <a href=\"https://doi.org/10.1145/3712019\">https://doi.org/10.1145/3712019</a>","ieee":"K.-H. Chen, J. Li, F. Reghenzani, and J.-J. Chen, “Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2,” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. 9, no. 1, pp. 1–2, 2025, doi: <a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>.","ama":"Chen K-H, Li J, Reghenzani F, Chen J-J. Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2. <i>ACM Transactions on Cyber-Physical Systems</i>. 2025;9(1):1-2. doi:<a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>","bibtex":"@article{Chen_Li_Reghenzani_Chen_2025, title={Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2}, volume={9}, DOI={<a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>}, number={1}, journal={ACM Transactions on Cyber-Physical Systems}, publisher={Association for Computing Machinery (ACM)}, author={Chen, Kuan-Hsun and Li, Jing and Reghenzani, Federico and Chen, Jian-Jia}, year={2025}, pages={1–2} }","mla":"Chen, Kuan-Hsun, et al. “Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2.” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. 9, no. 1, Association for Computing Machinery (ACM), 2025, pp. 1–2, doi:<a href=\"https://doi.org/10.1145/3712019\">10.1145/3712019</a>."},"type":"journal_article","date_created":"2026-07-03T21:07:37Z"},{"place":"Cham","date_created":"2026-07-03T21:09:16Z","type":"book_chapter","publication":"Lecture Notes in Computer Science","citation":{"mla":"Spaan, Jeffrey, et al. “Wedge-Parallel Triangle Counting for GPUs.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-99872-0_1\">10.1007/978-3-031-99872-0_1</a>.","bibtex":"@inbook{Spaan_Chen_Bader_Varbanescu_2025, place={Cham}, title={Wedge-Parallel Triangle Counting for GPUs}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-99872-0_1\">10.1007/978-3-031-99872-0_1</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Spaan, Jeffrey and Chen, Kuan-Hsun and Bader, David A. and Varbanescu, Ana-Lucia}, year={2025} }","ama":"Spaan J, Chen K-H, Bader DA, Varbanescu A-L. Wedge-Parallel Triangle Counting for GPUs. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-99872-0_1\">10.1007/978-3-031-99872-0_1</a>","ieee":"J. Spaan, K.-H. Chen, D. A. Bader, and A.-L. Varbanescu, “Wedge-Parallel Triangle Counting for GPUs,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2025.","apa":"Spaan, J., Chen, K.-H., Bader, D. A., &#38; Varbanescu, A.-L. (2025). Wedge-Parallel Triangle Counting for GPUs. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-99872-0_1\">https://doi.org/10.1007/978-3-031-99872-0_1</a>","short":"J. Spaan, K.-H. Chen, D.A. Bader, A.-L. Varbanescu, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","chicago":"Spaan, Jeffrey, Kuan-Hsun Chen, David A. Bader, and Ana-Lucia Varbanescu. “Wedge-Parallel Triangle Counting for GPUs.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-99872-0_1\">https://doi.org/10.1007/978-3-031-99872-0_1</a>."},"language":[{"iso":"eng"}],"_id":"66157","publisher":"Springer Nature Switzerland","doi":"10.1007/978-3-031-99872-0_1","user_id":"128464","year":"2025","status":"public","title":"Wedge-Parallel Triangle Counting for GPUs","author":[{"first_name":"Jeffrey","last_name":"Spaan","full_name":"Spaan, Jeffrey"},{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"},{"full_name":"Bader, David A.","last_name":"Bader","first_name":"David A."},{"last_name":"Varbanescu","first_name":"Ana-Lucia","full_name":"Varbanescu, Ana-Lucia"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031998713","9783031998720"]},"date_updated":"2026-07-05T14:48:31Z","publication_status":"published"},{"type":"conference","date_created":"2026-07-03T21:09:35Z","citation":{"apa":"Cishugi, E. S., Smit, T. T., Forlin, B., Cazzaniga, C., Chen, K.-H., &#38; Ottavi, M. (2025). Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation. <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>. <a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">https://doi.org/10.1109/iolts65288.2025.11116913</a>","ieee":"E. S. Cishugi, T. T. Smit, B. Forlin, C. Cazzaniga, K.-H. Chen, and M. Ottavi, “Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation,” 2025, doi: <a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>.","short":"E.S. Cishugi, T.T. Smit, B. Forlin, C. Cazzaniga, K.-H. Chen, M. Ottavi, in: 2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS), IEEE, 2025.","chicago":"Cishugi, Elijah Seth, Tijmen T. Smit, Bruno Forlin, Carlo Cazzaniga, Kuan-Hsun Chen, and Marco Ottavi. “Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation.” In <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">https://doi.org/10.1109/iolts65288.2025.11116913</a>.","mla":"Cishugi, Elijah Seth, et al. “Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation.” <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>.","ama":"Cishugi ES, Smit TT, Forlin B, Cazzaniga C, Chen K-H, Ottavi M. Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation. In: <i>2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>","bibtex":"@inproceedings{Cishugi_Smit_Forlin_Cazzaniga_Chen_Ottavi_2025, title={Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation}, DOI={<a href=\"https://doi.org/10.1109/iolts65288.2025.11116913\">10.1109/iolts65288.2025.11116913</a>}, booktitle={2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)}, publisher={IEEE}, author={Cishugi, Elijah Seth and Smit, Tijmen T. and Forlin, Bruno and Cazzaniga, Carlo and Chen, Kuan-Hsun and Ottavi, Marco}, year={2025} }"},"publication":"2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)","user_id":"128464","doi":"10.1109/iolts65288.2025.11116913","publisher":"IEEE","_id":"66158","publication_status":"published","date_updated":"2026-07-05T14:48:27Z","author":[{"full_name":"Cishugi, Elijah Seth","last_name":"Cishugi","first_name":"Elijah Seth"},{"first_name":"Tijmen T.","last_name":"Smit","full_name":"Smit, Tijmen T."},{"full_name":"Forlin, Bruno","last_name":"Forlin","first_name":"Bruno"},{"last_name":"Cazzaniga","first_name":"Carlo","full_name":"Cazzaniga, Carlo"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"},{"first_name":"Marco","last_name":"Ottavi","full_name":"Ottavi, Marco"}],"year":"2025","title":"Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation","status":"public"},{"date_created":"2026-07-03T21:08:59Z","type":"conference","publication":"Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems","citation":{"apa":"Winschermann, L., Günzel, M., Chen, K.-H., &#38; Hurink, J. (2025). Optimizing Electric Vehicle Scheduling with Charging Guarantees using Flow Models with Local Penalties. <i>Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems</i>. <a href=\"https://doi.org/10.1145/3679240.3734593\">https://doi.org/10.1145/3679240.3734593</a>","ieee":"L. Winschermann, M. Günzel, K.-H. Chen, and J. Hurink, “Optimizing Electric Vehicle Scheduling with Charging Guarantees using Flow Models with Local Penalties,” 2025, doi: <a href=\"https://doi.org/10.1145/3679240.3734593\">10.1145/3679240.3734593</a>.","chicago":"Winschermann, Leoni, Mario Günzel, Kuan-Hsun Chen, and Johann Hurink. “Optimizing Electric Vehicle Scheduling with Charging Guarantees Using Flow Models with Local Penalties.” In <i>Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems</i>. ACM, 2025. <a href=\"https://doi.org/10.1145/3679240.3734593\">https://doi.org/10.1145/3679240.3734593</a>.","short":"L. Winschermann, M. Günzel, K.-H. Chen, J. Hurink, in: Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems, ACM, 2025.","mla":"Winschermann, Leoni, et al. “Optimizing Electric Vehicle Scheduling with Charging Guarantees Using Flow Models with Local Penalties.” <i>Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems</i>, ACM, 2025, doi:<a href=\"https://doi.org/10.1145/3679240.3734593\">10.1145/3679240.3734593</a>.","ama":"Winschermann L, Günzel M, Chen K-H, Hurink J. Optimizing Electric Vehicle Scheduling with Charging Guarantees using Flow Models with Local Penalties. In: <i>Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems</i>. ACM; 2025. doi:<a href=\"https://doi.org/10.1145/3679240.3734593\">10.1145/3679240.3734593</a>","bibtex":"@inproceedings{Winschermann_Günzel_Chen_Hurink_2025, title={Optimizing Electric Vehicle Scheduling with Charging Guarantees using Flow Models with Local Penalties}, DOI={<a href=\"https://doi.org/10.1145/3679240.3734593\">10.1145/3679240.3734593</a>}, booktitle={Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems}, publisher={ACM}, author={Winschermann, Leoni and Günzel, Mario and Chen, Kuan-Hsun and Hurink, Johann}, year={2025} }"},"publisher":"ACM","_id":"66156","user_id":"128464","doi":"10.1145/3679240.3734593","title":"Optimizing Electric Vehicle Scheduling with Charging Guarantees using Flow Models with Local Penalties","status":"public","year":"2025","author":[{"first_name":"Leoni","last_name":"Winschermann","full_name":"Winschermann, Leoni"},{"first_name":"Mario","last_name":"Günzel","full_name":"Günzel, Mario"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"last_name":"Hurink","first_name":"Johann","full_name":"Hurink, Johann"}],"publication_status":"published","date_updated":"2026-07-05T14:48:39Z"},{"user_id":"128464","doi":"10.23919/date64628.2025.10992747","_id":"66152","publisher":"IEEE","publication_status":"published","date_updated":"2026-07-05T14:48:34Z","author":[{"first_name":"Hassan","last_name":"Nassar","full_name":"Nassar, Hassan"},{"first_name":"Ming-Liang","last_name":"Wei","full_name":"Wei, Ming-Liang"},{"last_name":"Yang","first_name":"Chia-Lin","full_name":"Yang, Chia-Lin"},{"last_name":"Henkel","first_name":"Jörg","full_name":"Henkel, Jörg"},{"full_name":"Chen, Kuan-Hsun","first_name":"Kuan-Hsun","last_name":"Chen"}],"year":"2025","status":"public","title":"REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks","type":"conference","date_created":"2026-07-03T21:08:20Z","citation":{"ama":"Nassar H, Wei M-L, Yang C-L, Henkel J, Chen K-H. REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks. In: <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.23919/date64628.2025.10992747\">10.23919/date64628.2025.10992747</a>","bibtex":"@inproceedings{Nassar_Wei_Yang_Henkel_Chen_2025, title={REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks}, DOI={<a href=\"https://doi.org/10.23919/date64628.2025.10992747\">10.23919/date64628.2025.10992747</a>}, booktitle={2025 Design, Automation &#38;amp;amp; Test in Europe Conference (DATE)}, publisher={IEEE}, author={Nassar, Hassan and Wei, Ming-Liang and Yang, Chia-Lin and Henkel, Jörg and Chen, Kuan-Hsun}, year={2025} }","mla":"Nassar, Hassan, et al. “REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks.” <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.23919/date64628.2025.10992747\">10.23919/date64628.2025.10992747</a>.","short":"H. Nassar, M.-L. Wei, C.-L. Yang, J. Henkel, K.-H. Chen, in: 2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE), IEEE, 2025.","chicago":"Nassar, Hassan, Ming-Liang Wei, Chia-Lin Yang, Jörg Henkel, and Kuan-Hsun Chen. “REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks.” In <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>. IEEE, 2025. <a href=\"https://doi.org/10.23919/date64628.2025.10992747\">https://doi.org/10.23919/date64628.2025.10992747</a>.","apa":"Nassar, H., Wei, M.-L., Yang, C.-L., Henkel, J., &#38; Chen, K.-H. (2025). REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks. <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>. <a href=\"https://doi.org/10.23919/date64628.2025.10992747\">https://doi.org/10.23919/date64628.2025.10992747</a>","ieee":"H. Nassar, M.-L. Wei, C.-L. Yang, J. Henkel, and K.-H. Chen, “REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks,” 2025, doi: <a href=\"https://doi.org/10.23919/date64628.2025.10992747\">10.23919/date64628.2025.10992747</a>."},"publication":"2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)"},{"type":"journal_article","date_created":"2026-07-03T21:07:51Z","abstract":[{"text":"<jats:p>\n            Releasing jobs and performing scheduling decisions in real-time operating systems (RTOSes) is often realized within tick interrupts. In each tick interrupt, a set of tasks that are waiting to release new jobs, namely, the waiting set, is inspected to determine the jobs that should be released at this tick. Such a waiting set is sorted whenever a job has finished, by which the release process can be efficiently achieved. However, the overhead of sorting can vary vastly depending on the task set, which has to be taken into account in the worst-case timing analysis. Moreover, the tick interrupt in common practices is backed by a single hardware timer that is configured to trigger interrupts, either with a fixed period or reconfigured to the next release time (so-called one-shot timer). Since not necessarily at every interrupt a job will be released, several tick interrupts might be redundant. For the one-shot timers, the reconfiguration during runtime also incurs overheads at a variable interval. To reduce such variability and amount of overhead, in this work, we propose\n            <jats:italic toggle=\"yes\">LazyTick</jats:italic>\n            which partitions the task set and distributes the subsets over multiple timers. Specifically, we propose two job release procedures with constant operations overhead—one for harmonic task sets and one for non-harmonic task sets. We implemented the support for multiple hardware timers in FreeRTOS and conducted intensive experimental evaluations. The evaluation shows that\n            <jats:italic toggle=\"yes\">LazyTick</jats:italic>\n            can reduce the variability in overhead by up to ≈ 5 × in peak and ≈ 3× on average in comparison to the default implementation. Additionally, the combined overhead of the job release process is reduced by up to ≈ 6.1 × in peak and ≈ 3.6× on average.\n          </jats:p>","lang":"eng"}],"publication":"ACM Transactions on Embedded Computing Systems","issue":"5s","doi":"10.1145/3762651","language":[{"iso":"eng"}],"intvolume":"        24","publication_status":"published","date_updated":"2026-07-05T14:48:51Z","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"last_name":"Heider","first_name":"Kay","full_name":"Heider, Kay"},{"full_name":"Hakert, Christian","first_name":"Christian","last_name":"Hakert"},{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"year":"2025","title":"LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems","citation":{"ama":"Heider K, Hakert C, Chen K-H, Chen J-J. LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2025;24(5s):1-25. doi:<a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>","bibtex":"@article{Heider_Hakert_Chen_Chen_2025, title={LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems}, volume={24}, DOI={<a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>}, number={5s}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Heider, Kay and Hakert, Christian and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2025}, pages={1–25} }","mla":"Heider, Kay, et al. “LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 24, no. 5s, Association for Computing Machinery (ACM), 2025, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>.","chicago":"Heider, Kay, Christian Hakert, Kuan-Hsun Chen, and Jian-Jia Chen. “LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems.” <i>ACM Transactions on Embedded Computing Systems</i> 24, no. 5s (2025): 1–25. <a href=\"https://doi.org/10.1145/3762651\">https://doi.org/10.1145/3762651</a>.","short":"K. Heider, C. Hakert, K.-H. Chen, J.-J. Chen, ACM Transactions on Embedded Computing Systems 24 (2025) 1–25.","apa":"Heider, K., Hakert, C., Chen, K.-H., &#38; Chen, J.-J. (2025). LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems. <i>ACM Transactions on Embedded Computing Systems</i>, <i>24</i>(5s), 1–25. <a href=\"https://doi.org/10.1145/3762651\">https://doi.org/10.1145/3762651</a>","ieee":"K. Heider, C. Hakert, K.-H. Chen, and J.-J. Chen, “LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 24, no. 5s, pp. 1–25, 2025, doi: <a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>."},"volume":24,"user_id":"128464","publisher":"Association for Computing Machinery (ACM)","_id":"66150","page":"1-25","status":"public"},{"language":[{"iso":"eng"}],"_id":"63620","user_id":"103440","status":"public","title":"Non-crossing partitions for exceptional hereditary curves","year":"2025","author":[{"first_name":"Barbara","last_name":"Baumeister","full_name":"Baumeister, Barbara"},{"id":"72064","last_name":"Burban","first_name":"Igor","full_name":"Burban, Igor"},{"full_name":"Neaime, Georges","first_name":"Georges","last_name":"Neaime"},{"full_name":"Schwabe, Charly Merlin","last_name":"Schwabe","first_name":"Charly Merlin","id":"103440"}],"date_updated":"2026-07-06T07:56:11Z","external_id":{"arxiv":["2512.01729"]},"date_created":"2026-01-15T09:37:34Z","type":"preprint","publication":"arXiv:2512.01729","citation":{"ieee":"B. Baumeister, I. Burban, G. Neaime, and C. M. Schwabe, “Non-crossing partitions for exceptional hereditary curves,” <i>arXiv:2512.01729</i>. 2025.","apa":"Baumeister, B., Burban, I., Neaime, G., &#38; Schwabe, C. M. (2025). Non-crossing partitions for exceptional hereditary curves. In <i>arXiv:2512.01729</i>.","chicago":"Baumeister, Barbara, Igor Burban, Georges Neaime, and Charly Merlin Schwabe. “Non-Crossing Partitions for Exceptional Hereditary Curves.” <i>ArXiv:2512.01729</i>, 2025.","short":"B. Baumeister, I. Burban, G. Neaime, C.M. Schwabe, ArXiv:2512.01729 (2025).","mla":"Baumeister, Barbara, et al. “Non-Crossing Partitions for Exceptional Hereditary Curves.” <i>ArXiv:2512.01729</i>, 2025.","bibtex":"@article{Baumeister_Burban_Neaime_Schwabe_2025, title={Non-crossing partitions for exceptional hereditary curves}, journal={arXiv:2512.01729}, author={Baumeister, Barbara and Burban, Igor and Neaime, Georges and Schwabe, Charly Merlin}, year={2025} }","ama":"Baumeister B, Burban I, Neaime G, Schwabe CM. Non-crossing partitions for exceptional hereditary curves. <i>arXiv:251201729</i>. Published online 2025."},"abstract":[{"lang":"eng","text":"We introduce a new class of reflection groups associated with the canonical bilinear lattices of Lenzing, which we call reflection groups of canonical type. The main result of this work is a categorification of the corresponding poset of non-crossing partitions for any such group, realized via the poset of thick subcategories of the category of coherent sheaves on an exceptional hereditary curve generated by an exceptional sequence. A second principal result, essential for the categorification, is a proof of the transitivity of the Hurwitz action in these reflection groups."}]},{"doi":"10.23919/date64628.2025.10992934","user_id":"128464","_id":"66151","publisher":"IEEE","date_updated":"2026-07-05T14:48:53Z","publication_status":"published","year":"2025","status":"public","title":"TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models","author":[{"last_name":"Cishugi","first_name":"Elijah Seth","full_name":"Cishugi, Elijah Seth"},{"full_name":"Buschjäger, Sebastian","last_name":"Buschjäger","first_name":"Sebastian"},{"first_name":"Martijn","last_name":"Noorlander","full_name":"Noorlander, Martijn"},{"last_name":"Ottavi","first_name":"Marco","full_name":"Ottavi, Marco"},{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"}],"type":"conference","date_created":"2026-07-03T21:08:05Z","publication":"2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)","citation":{"short":"E.S. Cishugi, S. Buschjäger, M. Noorlander, M. Ottavi, K.-H. Chen, in: 2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE), IEEE, 2025.","chicago":"Cishugi, Elijah Seth, Sebastian Buschjäger, Martijn Noorlander, Marco Ottavi, and Kuan-Hsun Chen. “TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models.” In <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>. IEEE, 2025. <a href=\"https://doi.org/10.23919/date64628.2025.10992934\">https://doi.org/10.23919/date64628.2025.10992934</a>.","ieee":"E. S. Cishugi, S. Buschjäger, M. Noorlander, M. Ottavi, and K.-H. Chen, “TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models,” 2025, doi: <a href=\"https://doi.org/10.23919/date64628.2025.10992934\">10.23919/date64628.2025.10992934</a>.","apa":"Cishugi, E. S., Buschjäger, S., Noorlander, M., Ottavi, M., &#38; Chen, K.-H. (2025). TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models. <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>. <a href=\"https://doi.org/10.23919/date64628.2025.10992934\">https://doi.org/10.23919/date64628.2025.10992934</a>","bibtex":"@inproceedings{Cishugi_Buschjäger_Noorlander_Ottavi_Chen_2025, title={TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models}, DOI={<a href=\"https://doi.org/10.23919/date64628.2025.10992934\">10.23919/date64628.2025.10992934</a>}, booktitle={2025 Design, Automation &#38;amp;amp; Test in Europe Conference (DATE)}, publisher={IEEE}, author={Cishugi, Elijah Seth and Buschjäger, Sebastian and Noorlander, Martijn and Ottavi, Marco and Chen, Kuan-Hsun}, year={2025} }","ama":"Cishugi ES, Buschjäger S, Noorlander M, Ottavi M, Chen K-H. TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models. In: <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.23919/date64628.2025.10992934\">10.23919/date64628.2025.10992934</a>","mla":"Cishugi, Elijah Seth, et al. “TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models.” <i>2025 Design, Automation &#38;amp;Amp; Test in Europe Conference (DATE)</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.23919/date64628.2025.10992934\">10.23919/date64628.2025.10992934</a>."}}]