@article{63500, abstract = {{Abstract We prove various estimates for the asymptotics of counting functions associated to point sets of coherent frames and Riesz sequences. The obtained results recover the necessary density conditions for coherent frames and Riesz sequences for general unimodular amenable groups, while providing more precise estimates under additional localization conditions on the coherent system for groups of polynomial growth. }}, author = {{Papageorgiou, Efthymia and van Velthoven, Jordy Timo}}, issn = {{0373-3114}}, journal = {{Annali di Matematica Pura ed Applicata (1923 -)}}, number = {{4}}, pages = {{1469--1491}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Counting function estimates for coherent frames and Riesz sequences}}}, doi = {{10.1007/s10231-024-01535-y}}, volume = {{204}}, year = {{2024}}, } @article{66179, title = {{{Dawn of the Dead(line Misses): Impact of Job Dismiss on the Deadline Miss Rate}}}, doi = {{10.48550/ARXIV.2401.15503}}, year = {{2024}}, } @article{66165, 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 = {{3}}, pages = {{1--3}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Introduction to the Special Issue on Fault-Resilient Cyber-Physical Systems—Part I}}}, doi = {{10.1145/3677021}}, volume = {{8}}, year = {{2024}}, } @article{66177, abstract = {{Ensuring timing guarantees for every individual tasks is critical in real-time systems. Even for periodic tasks, providing timing guarantees for tasks with segmented self-suspending behavior is challenging due to timing anomalies, i.e., the reduction of execution or suspension time of some jobs increases the response time of another job. The release jitter of tasks can add further complexity to the situation, affecting the predictability and timing guarantees of real-time systems. The existing worst-case response time analyses for sporadic self-suspending tasks are only over-approximations and lead to overly pessimistic results. In this work, we address timing anomalies without compromising the worst-case response time (WCRT) analysis when scheduling periodic segmented self-suspending tasks with release jitter. We propose two treatments: segment release time enforcement and segment priority modification, and prove their effectiveness in eliminating timing anomalies. Our evaluation demonstrates that the proposed treatments achieve higher acceptance ratios in terms of schedulability compared to state-of-the-art scheduling algorithms. Additionally, we implement the segment-level fixed-priority scheduling mechanism on RTEMS and verify the validity of our segment priority modification treatment. This work expands our previous conference publication at the 29th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2023), which considers only periodic segmented self-suspending tasks without release jitter.}}, title = {{{Eliminating Timing Anomalies in Scheduling Periodic Segmented Self-Suspending Tasks with Release Jitter}}}, doi = {{10.48550/ARXIV.2409.09061}}, year = {{2024}}, } @article{66176, title = {{{Sky$^ε$-Tree: Embracing the Batch Updates of B$^ε$-trees through Access Port Parallelism on Skyrmion Racetrack Memory}}}, doi = {{10.48550/ARXIV.2407.17499}}, year = {{2024}}, } @article{66178, title = {{{Dawn of the Dead(line Misses): Impact of Job Dismiss on the Deadline Miss Rate}}}, doi = {{10.48550/ARXIV.2401.15503}}, year = {{2024}}, } @article{66175, title = {{{TREE: Tree Regularization for Efficient Execution}}}, doi = {{10.48550/ARXIV.2406.12531}}, year = {{2024}}, } @unpublished{66306, abstract = {{Recently, several proofs of the Mason--Welsh conjecture for matroids have been found, which asserts the log-concavity of the sequence that counts independent sets of a given size. In this article we use the theory of Lorentzian polynomials, developed by Brändén and Huh, to prove a generalization of the Mason-Welsh conjecture to the context of valuated matroids. In fact, we provide a log-concavity result in the more general setting of valuated discrete polymatroids, or equivalently, M-convex functions. Our approach is via the construction of a generic extension of a valuated matroid or M-convex function, so that the bases of the extension are related to the independent sets of the original matroid. We also provide a similar log-concavity result for valuated bimatroids, which, we believe, might be of independent interest.}}, author = {{Giansiracusa, Jeffrey and Rincón, Felipe and Schleis, Victoria and Ulirsch, Martin}}, booktitle = {{arXiv:2407.05808}}, title = {{{Log-concavity for independent sets of valuated matroids}}}, year = {{2024}}, } @unpublished{66305, abstract = {{Motivated by the recent surge of interest in the geometry of hybrid spaces, we prove an Abel-Jacobi theorem for a metrized complex of Riemann surfaces, generalizing both the classical Abel-Jacobi theorem and its tropical analogue.}}, author = {{Hofmann, Maximilian C. E. and Ulirsch, Martin}}, booktitle = {{arXiv:2408.03851}}, title = {{{An Abel-Jacobi theorem for metrized complexes of Riemann surfaces}}}, year = {{2024}}, } @techreport{66110, author = {{Radermacher, Katharina and Rösener, M.}}, title = {{{Eine Analyse der Arbeitsplatzkonzepte preisgekrönter Unternehmen. Auf dem Weg zum Arbeitsplatz der Zukunft.}}}, year = {{2024}}, } @article{53542, abstract = {{AbstractThis work deals with the extension problem for the fractional Laplacian on Riemannian symmetric spaces G/K of noncompact type and of general rank, which gives rise to a family of convolution operators, including the Poisson operator. More precisely, motivated by Euclidean results for the Poisson semigroup, we study the long-time asymptotic behavior of solutions to the extension problem for $$L^1$$ L 1 initial data. In the case of the Laplace–Beltrami operator, we show that if the initial data are bi-K-invariant, then the solution to the extension problem behaves asymptotically as the mass times the fundamental solution, but this convergence may break down in the non-bi-K-invariant case. In the second part, we investigate the long-time asymptotic behavior of the extension problem associated with the so-called distinguished Laplacian on G/K. In this case, we observe phenomena which are similar to the Euclidean setting for the Poisson semigroup, such as $$L^1$$ L 1 asymptotic convergence without the assumption of bi-K-invariance.}}, author = {{Papageorgiou, Efthymia}}, issn = {{1424-3199}}, journal = {{Journal of Evolution Equations}}, keywords = {{Mathematics (miscellaneous)}}, number = {{2}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces}}}, doi = {{10.1007/s00028-024-00959-6}}, volume = {{24}}, year = {{2024}}, } @article{63502, abstract = {{Abstract Let $$\mu $$ μ be a radial compactly supported distribution on a harmonic NA group. We prove that the right convolution operator $$c_{\mu }:f \mapsto f* \mu $$ c μ : f ↦ f ∗ μ maps the space of smooth $$\mathfrak {v}$$ v -radial functions onto itself if and only if the spherical Fourier transform $$\widetilde{\mu }(\lambda )$$ μ ~ ( λ ) , $$\lambda \in \mathbb {C}$$ λ ∈ C , is slowly decreasing. As an application, we prove that certain averages over spheres are surjective on the space of smooth $$\mathfrak {v}$$ v -radial functions.}}, author = {{Papageorgiou, Efthymia}}, issn = {{1050-6926}}, journal = {{The Journal of Geometric Analysis}}, number = {{1}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Surjectivity of Convolution Operators on Harmonic NA Groups}}}, doi = {{10.1007/s12220-024-01837-w}}, volume = {{35}}, year = {{2024}}, } @article{63504, author = {{Kolountzakis, Mihail N. and Papageorgiou, Efthymia}}, issn = {{1948-206X}}, journal = {{Analysis & PDE}}, number = {{1}}, pages = {{93--108}}, publisher = {{Mathematical Sciences Publishers}}, title = {{{Large sets containing no copies of a given infinite sequence}}}, doi = {{10.2140/apde.2025.18.93}}, volume = {{18}}, year = {{2024}}, } @inproceedings{66190, author = {{Henkel, Jorg and Siddhu, Lokesh and Bauer, Lars and Teich, Jurgen and Wildermann, Stefan and Tahoori, Mehdi and Mayahinia, Mahta and Castrillon, Jeronimo and Khan, Asif Ali and Farzaneh, Hamid and Lima, Joao Paulo C. De and Chen, Jian-Jia and Hakert, Christian and Chen, Kuan-Hsun and Yang, Chia-Lin and Cheng, Hsiang-Yun}}, booktitle = {{Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems}}, publisher = {{ACM}}, title = {{{Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications}}}, doi = {{10.1145/3607889.3609088}}, year = {{2024}}, } @inproceedings{66186, author = {{Henkel, Jorg and Siddhu, Lokesh and Bauer, Lars and Teich, Jurgen and Wildermann, Stefan and Tahoori, Mehdi and Mayahinia, Mahta and Castrillon, Jeronimo and Khan, Asif Ali and Farzaneh, Hamid and Lima, Joao Paulo C. De and Chen, Jian-Jia and Hakert, Christian and Chen, Kuan-Hsun and Yang, Chia-Lin and Cheng, Hsiang-Yun}}, booktitle = {{Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems}}, publisher = {{ACM}}, title = {{{Special Session - Non-Volatile Memories: Challenges and Opportunities for Embedded System Architectures with Focus on Machine Learning Applications}}}, doi = {{10.1145/3607889.3609088}}, year = {{2024}}, } @inproceedings{66189, author = {{Ridder, Frank and Chen, Kuan-Hsun and Alachiotis, Nikolaos}}, booktitle = {{2023 International Conference on Field Programmable Technology (ICFPT)}}, publisher = {{IEEE}}, title = {{{Accelerated Real-Time Classification of Evolving Data Streams using Adaptive Random Forests}}}, doi = {{10.1109/icfpt59805.2023.00031}}, year = {{2024}}, } @article{66166, author = {{Shi, Liang and Shi, Jingtong and Amrouch, Hussam and Chen, Kuan-Hsun and Zhao, Mengying and Liu, Weichen}}, issn = {{1539-9087}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{6}}, pages = {{1--3}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems}}}, doi = {{10.1145/3677018}}, volume = {{23}}, year = {{2024}}, } @inproceedings{66172, author = {{Malcher, Jannik and Biebert, Daniel and Chen, Kuan-Hsun and Buschjäger, Sebastian and Hakert, Christian and Chen, Jian-Jia}}, booktitle = {{Proceedings of the 25th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems}}, publisher = {{ACM}}, title = {{{Language-Based Deployment Optimization for Random Forests (Invited Paper)}}}, doi = {{10.1145/3652032.3659366}}, year = {{2024}}, } @inproceedings{66170, author = {{Smit, Tijmen T. and Forlin, Bruno Endres and Chen, Kuan-Hsun and Souvatzoglou, Ioanna and Psarakis, Mihalis and Ottavi, Marco}}, booktitle = {{2024 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)}}, publisher = {{IEEE}}, title = {{{An Enhanced Fault Injection Framework for FPGA-Based Soft-Cores}}}, doi = {{10.1109/dft63277.2024.10753564}}, year = {{2024}}, } @inproceedings{66167, author = {{Forlin, Bruno and Chen, Kuan-Hsun and Alachiotis, Nikolaos and Cassano, Luca and Ottavi, Marco}}, booktitle = {{2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)}}, publisher = {{IEEE}}, title = {{{Lightweight Instrumentation for Accurate Performance Monitoring in RTOSes}}}, doi = {{10.23919/date58400.2024.10546790}}, year = {{2024}}, }