@inproceedings{66263,
  author       = {{Chen, Jian-Jia and Shi, Junjie and Günzel, Mario and von der Brüggen, Georg and Chen, Kuan-Hsun and Bella, Peter}},
  booktitle    = {{37th Euromicro Conference on Real-Time Systems (ECRTS 2025)}},
  editor       = {{Mancuso, Renato}},
  isbn         = {{978-3-95977-377-5}},
  issn         = {{1868-8969}},
  pages        = {{17:1–17:26}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Theoretical Foundations of Utility Accrual for Real-Time Systems}}},
  doi          = {{10.4230/LIPIcs.ECRTS.2025.17}},
  volume       = {{335}},
  year         = {{2025}},
}

@inproceedings{66161,
  author       = {{Cishugi, Elijah Seth and Smit, Tijmen T. and Forlin, Bruno and Cazzaniga, Carlo and Chen, Kuan-Hsun and Ottavi, Marco}},
  booktitle    = {{2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)}},
  publisher    = {{IEEE}},
  title        = {{{Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation}}},
  doi          = {{10.1109/iolts65288.2025.11116913}},
  year         = {{2025}},
}

@article{66163,
  title        = {{{CHRONOS: Compensating Hardware Related Overheads with Native Multi Timer Support for Real-Time Operating Systems}}},
  doi          = {{10.48550/ARXIV.2503.01444}},
  year         = {{2025}},
}

@article{66164,
  title        = {{{InTreeger: An End-to-End Framework for Integer-Only Decision Tree Inference}}},
  doi          = {{10.48550/ARXIV.2505.15391}},
  year         = {{2025}},
}

@article{66160,
  title        = {{{Resilient Endurance-Aware NVM-based PUF against Learning-based Attacks}}},
  doi          = {{10.48550/ARXIV.2501.06367}},
  year         = {{2025}},
}

@article{66162,
  title        = {{{WCDT: Systematic WCET Optimization for Decision Tree Implementations}}},
  doi          = {{10.48550/ARXIV.2501.17428}},
  year         = {{2025}},
}

@article{66147,
  abstract     = {{<jats:title>Abstract</jats:title>
          <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>}},
  author       = {{Shi, Junjie and Chen, Kuan-Hsun}},
  issn         = {{0922-6443}},
  journal      = {{Real-Time Systems}},
  number       = {{2}},
  pages        = {{306--310}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Shielded reinforcement learning for fault-tolerant scheduling in real-time systems}}},
  doi          = {{10.1007/s11241-025-09441-z}},
  volume       = {{61}},
  year         = {{2025}},
}

@article{66153,
  author       = {{Chen, Kuan-Hsun and Li, Jing and Reghenzani, Federico and Chen, Jian-Jia}},
  issn         = {{2378-962X}},
  journal      = {{ACM Transactions on Cyber-Physical Systems}},
  number       = {{1}},
  pages        = {{1--2}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2}}},
  doi          = {{10.1145/3712019}},
  volume       = {{9}},
  year         = {{2025}},
}

@article{66148,
  author       = {{Chen, Kuan-Hsun and Li, Jing and Reghenzani, Federico and Chen, Jian-Jia}},
  issn         = {{2378-962X}},
  journal      = {{ACM Transactions on Cyber-Physical Systems}},
  number       = {{1}},
  pages        = {{1--2}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part 2}}},
  doi          = {{10.1145/3712019}},
  volume       = {{9}},
  year         = {{2025}},
}

@inbook{66157,
  author       = {{Spaan, Jeffrey and Chen, Kuan-Hsun and Bader, David A. and Varbanescu, Ana-Lucia}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031998713}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Wedge-Parallel Triangle Counting for GPUs}}},
  doi          = {{10.1007/978-3-031-99872-0_1}},
  year         = {{2025}},
}

@inproceedings{66158,
  author       = {{Cishugi, Elijah Seth and Smit, Tijmen T. and Forlin, Bruno and Cazzaniga, Carlo and Chen, Kuan-Hsun and Ottavi, Marco}},
  booktitle    = {{2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS)}},
  publisher    = {{IEEE}},
  title        = {{{Bloom Filters for Soft Error Detection: Neutron and Fault Injection Validation}}},
  doi          = {{10.1109/iolts65288.2025.11116913}},
  year         = {{2025}},
}

@inproceedings{66156,
  author       = {{Winschermann, Leoni and Günzel, Mario and Chen, Kuan-Hsun and Hurink, Johann}},
  booktitle    = {{Proceedings of the 16th ACM International Conference on Future and Sustainable Energy Systems}},
  publisher    = {{ACM}},
  title        = {{{Optimizing Electric Vehicle Scheduling with Charging Guarantees using Flow Models with Local Penalties}}},
  doi          = {{10.1145/3679240.3734593}},
  year         = {{2025}},
}

@inproceedings{66152,
  author       = {{Nassar, Hassan and Wei, Ming-Liang and Yang, Chia-Lin and Henkel, Jörg and Chen, Kuan-Hsun}},
  booktitle    = {{2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)}},
  publisher    = {{IEEE}},
  title        = {{{REAP-NVM: Resilient Endurance-Aware NVM-Based PUF Against Learning-Based Attacks}}},
  doi          = {{10.23919/date64628.2025.10992747}},
  year         = {{2025}},
}

@article{66150,
  abstract     = {{<jats:p>
            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
            <jats:italic toggle="yes">LazyTick</jats:italic>
            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
            <jats:italic toggle="yes">LazyTick</jats:italic>
            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.
          </jats:p>}},
  author       = {{Heider, Kay and Hakert, Christian and Chen, Kuan-Hsun and Chen, Jian-Jia}},
  issn         = {{1539-9087}},
  journal      = {{ACM Transactions on Embedded Computing Systems}},
  number       = {{5s}},
  pages        = {{1--25}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems}}},
  doi          = {{10.1145/3762651}},
  volume       = {{24}},
  year         = {{2025}},
}

@unpublished{63620,
  abstract     = {{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.}},
  author       = {{Baumeister, Barbara and Burban, Igor and Neaime, Georges and Schwabe, Charly Merlin}},
  booktitle    = {{arXiv:2512.01729}},
  title        = {{{Non-crossing partitions for exceptional hereditary curves}}},
  year         = {{2025}},
}

@inproceedings{66151,
  author       = {{Cishugi, Elijah Seth and Buschjäger, Sebastian and Noorlander, Martijn and Ottavi, Marco and Chen, Kuan-Hsun}},
  booktitle    = {{2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)}},
  publisher    = {{IEEE}},
  title        = {{{TrackScorer: Skyrmion Logic-in-Memory Accelerator for Tree-Based Ranking Models}}},
  doi          = {{10.23919/date64628.2025.10992934}},
  year         = {{2025}},
}

@unpublished{66304,
  abstract     = {{Let $G$ be a connected reductive algebraic group over an algebraically closed field of characteristic zero carrying the trivial valuation. In this article we discuss two candidates for what could be the tropicalization of $G$.
  Our first suggestion is the extended affine building associated to $G$. This perspective makes makes use of Berkovich's embedding of the extended affine building into the Berkovich analytic space $G^{\textrm{an}}$ and expands on work of Mumford by associating a toroidal bordification of $G$ to the choice of stacky fan in the building. We show that the natural retraction onto the building is compatible with the tropicalization map associated to a toroidal bordification.
  Our second suggestion is a Weyl chamber of $G$, a special instance of spherical tropicalization, where we think of $G$ as a spherical $G\times G$-variety with respect to left-right-multiplication. We show that the spherical tropicalization map may be identified with the toroidal tropicalization map associated to a wonderful compactification of $G$. This map also has a moduli-theoretic interpretation expanding on the compactifications of $G$ as moduli spaces of framed $\mathbb{G}_m$-equivariant principal bundles on chains of projective lines introduced by Martens and Thaddeus.}},
  author       = {{Coles, Desmond and Ulirsch, Martin}},
  booktitle    = {{arXiv:2503.21654}},
  title        = {{{Towards the tropicalization of reductive groups}}},
  year         = {{2025}},
}

@unpublished{66303,
  abstract     = {{We propose an elementary tropical analogue of a reductive group that combines the datum of a Weyl group and the tropicalization of a fixed maximal torus. For the classical groups, as well as $G_2$, these tropical reductive groups admit descriptions as tropical matrix groups that resemble their classical counterparts. Employing this perspective, we introduce tropical principal bundles on metric graphs and study their explicit presentations as pushforwards of line bundles along covers with symmetries and extra data. Our main result identifies the essential skeleton of the moduli space of semistable principal bundles on a Tate curve with its tropical analogue.}},
  author       = {{Gross, Andreas and Kuhrs, Arne and Ulirsch, Martin and Zakharov, Dmitry}},
  booktitle    = {{arXiv:2511.05422}},
  title        = {{{Tropical reductive groups and principal bundles on metric graphs}}},
  year         = {{2025}},
}

@inbook{64806,
  author       = {{Biehler, Rolf and Kawakami, T. and Lampen, E. and Weiland, T. and Zapata-Cardona, L.}},
  booktitle    = {{Proceedings of the 15th International Congress on Mathematical Education}},
  editor       = {{Beswick, K. and Kaur, B. and Makar, K. and Ochoviet, C. and Venkat, H.}},
  pages        = {{198--203}},
  publisher    = {{MERGA}},
  title        = {{{Statistics and data science education as a vehicle for empowering citizens – short summary of a survey}}},
  volume       = {{1}},
  year         = {{2025}},
}

@techreport{65863,
  abstract     = {{We investigate the impact of Brexit on the corporate bond market by analyzing a comprehensive database covering corporate bond listings on European and UK trading venues. We find a significant shift in bond market activity, evidenced by a 49% increase in the number of bond listings in the EEA30 countries relative to the UK market after Brexit. Country-level analyses reveal a staggered effect on market activity, with predominantly international issuers adjusting their bond listings between the initially scheduled Brexit date and the final withdrawal date. At the issuer level, our findings indicate that the relative attractiveness of the EEA30 market has increased post-Brexit. Overall, these results suggest that the European capital market has successfully adapted to the loss of its largest financial center and exhibits a rising corporate bond market activity.}},
  author       = {{Franke, Benedikt and Kosi, Urska and Stoczek, Pia}},
  publisher    = {{TRR 266 Accounting for Transparency }},
  title        = {{{Brexit and European Corporate Bond Markets}}},
  doi          = {{10.2139/ssrn.5230141}},
  year         = {{2025}},
}