@inproceedings{66207, author = {{Liang, Geng-Ming and Yuan, Chuan-Yue and Yu, Meng-Shiun and Chen, Tai-Liang and Chen, Kuan-Hsun and Lee, Jenq-Kuen}}, booktitle = {{Workshop Proceedings of the 51st International Conference on Parallel Processing}}, publisher = {{ACM}}, title = {{{The Support of MLIR HLS Adaptor for LLVM IR}}}, doi = {{10.1145/3547276.3548515}}, year = {{2023}}, } @article{66182, abstract = {{Real-time systems require the formal guarantee of timing constraints, not only for the individual tasks but also for the end-to-end latency of data flows. The data flow among multiple tasks, e.g., from sensors to actuators, is described by a cause-effect chain, independent from the priority order of the tasks. In this article, we provide an end-to-end timing-analysis for cause-effect chains on asynchronized distributed systems with periodic task activations, considering the maximum reaction time (MRT) (i.e., the duration of data processing) and the maximum data age (MDA) (i.e., the worst-case data freshness). We first provide an analysis of the end-to-end latency on one local electronic control unit (ECU) that has to consider only the jobs in a bounded time interval. We extend our analysis to globally asynchronized systems by exploiting a compositional property to combine the local results. Throughout synthesized data based on an automotive benchmark as well as on randomized parameters, we show that our analytical results improve the state-of-the-art.}}, author = {{Günzel, Mario and Chen, Kuan-Hsun and Ueter, Niklas and Brüggen, Georg von der and Dürr, Marco and Chen, Jian-Jia}}, issn = {{1539-9087}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{4}}, pages = {{1--34}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains}}}, doi = {{10.1145/3587036}}, volume = {{22}}, year = {{2023}}, } @inproceedings{66191, author = {{Hölscher, Nils and Truong, Minh Duy and Hakert, Christian and Seidl, Tristan and Chen, Kuan-Hsun and Chen, Jian-Jia}}, booktitle = {{2023 IEEE 12th Non-Volatile Memory Systems and Applications Symposium (NVMSA)}}, publisher = {{IEEE}}, title = {{{Rapid NVM Simulation and Analysis on Single Bit Granularity Featuring Gem5 and NVMain}}}, doi = {{10.1109/nvmsa58981.2023.00012}}, year = {{2023}}, } @inproceedings{66194, author = {{Lin, Ching-Chi and Günzel, Mario and Shi, Junjie and Seidl, Tristan Taylan and Chen, Kuan-Hsun and Chen, Jian-Jia}}, booktitle = {{2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS)}}, publisher = {{IEEE}}, title = {{{Scheduling Periodic Segmented Self-Suspending Tasks without Timing Anomalies}}}, doi = {{10.1109/rtas58335.2023.00020}}, year = {{2023}}, } @inproceedings{66192, author = {{Shi, Junjie and Ueter, Niklas and Chen, Jian-Jia and Chen, Kuan-Hsun}}, booktitle = {{2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS)}}, publisher = {{IEEE}}, title = {{{Average Task Execution Time Minimization under (m, k) Soft Error Constraint}}}, doi = {{10.1109/rtas58335.2023.00008}}, year = {{2023}}, } @inproceedings{66197, author = {{Guenzel, Mario and Ueter, Niklas and Chen, Kuan-Hsun and Chen, Jian-Jia}}, booktitle = {{The 31st International Conference on Real-Time Networks and Systems}}, publisher = {{ACM}}, title = {{{Timing Analysis of Cause-Effect Chains with Heterogeneous Communication Mechanisms}}}, doi = {{10.1145/3575757.3593640}}, year = {{2023}}, } @unpublished{66312, abstract = {{Let $X$ be a complex abelian variety. We prove an analogue of both the (cohomological) $P=W$ conjecture and the geometric $P=W$ conjecture connecting the finer topological structure of the Dolbeault moduli space of topologically trivial semistable Higgs bundles on $X$ and the Betti moduli space of characters of the fundamental group of $X$. The geometric heart of our approach is the spectral data morphism for Dolbeault moduli spaces on abelian varieties that naturally factors the Hitchin morphism and whose target is not an affine space of pluricanonical sections, but a suitable symmetric product.}}, author = {{Bolognese, Barbara and Küronya, Alex and Ulirsch, Martin}}, booktitle = {{arXiv:2303.03734}}, title = {{{$P=W$ phenomena on abelian varieties}}}, year = {{2023}}, } @article{66325, abstract = {{AbstractLet$\mathfrak{A}$be a finite abelian group. In this paper, we classify harmonic$\mathfrak{A}$-covers of a tropical curve$\Gamma$(which allow dilation along edges and at vertices) in terms of the cohomology group of a suitably defined sheaf on$\Gamma$. We give a realisability criterion for harmonic$\mathfrak{A}$-covers by patching local monodromy data in an extended homology group on$\Gamma$. As an explicit example, we work out the case$\mathfrak{A}=\mathbb{Z}/p\mathbb{Z}$and explain how realisability for such covers is related to the nowhere-zero flow problem from graph theory.}}, author = {{Len, Yoav and Ulirsch, Martin and Zakharov, Dmitry}}, issn = {{0305-0041}}, journal = {{Mathematical Proceedings of the Cambridge Philosophical Society}}, number = {{2}}, pages = {{395--416}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{Abelian tropical covers}}}, doi = {{10.1017/S0305004123000518}}, volume = {{176}}, year = {{2023}}, } @misc{65608, author = {{Sperling, Sonja}}, booktitle = {{Die Grundschulzeitschrift}}, number = {{341}}, pages = {{32--34}}, title = {{{Grammatik in Bewegung. Klammerstrukturen in Sätzen erforschen}}}, year = {{2023}}, } @article{53539, abstract = {{AbstractThe infinite Brownian loop on a Riemannian manifold is the limit in distribution of the Brownian bridge of length T around a fixed origin when $$T \rightarrow +\infty $$ T → + ∞ . The aim of this note is to study its long-time asymptotics on Riemannian symmetric spaces G/K of noncompact type and of general rank. This amounts to the behavior of solutions to the heat equation subject to the Doob transform induced by the ground spherical function. Unlike the standard Brownian motion, we observe in this case phenomena which are similar to the Euclidean setting, namely $$L^1$$ L 1 asymptotic convergence without requiring bi-K-invariance for initial data, and strong $$L^{\infty }$$ L ∞ convergence.}}, author = {{Papageorgiou, Efthymia}}, issn = {{2296-9020}}, journal = {{Journal of Elliptic and Parabolic Equations}}, keywords = {{Applied Mathematics, Numerical Analysis, Analysis}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Asymptotics for the infinite Brownian loop on noncompact symmetric spaces}}}, doi = {{10.1007/s41808-023-00250-8}}, year = {{2023}}, } @inproceedings{66199, author = {{Lin, Ching-Chi and Günzel, Mario and Shi, Junjie and Seidl, Tristan Taylan and Chen, Kuan-Hsun and Chen, Jian-Jia}}, booktitle = {{2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS)}}, publisher = {{IEEE}}, title = {{{Scheduling Periodic Segmented Self-Suspending Tasks without Timing Anomalies}}}, doi = {{10.1109/rtas58335.2023.00020}}, year = {{2023}}, } @article{66198, title = {{{Simulation Environment with Customized RISC-V Instructions for Logic-in-Memory Architectures}}}, doi = {{10.48550/ARXIV.2303.12128}}, year = {{2023}}, } @article{66183, abstract = {{In many embedded systems, for instance, in the automotive, avionic, or robotics domain, critical functionalities are implemented via chains of communicating recurrent tasks. To ensure safety and correctness of such systems, guarantees on the reaction time, that is, the delay between a cause (e.g., an external activity or reading of a sensor) and the corresponding effect, must be provided. Current approaches focus on the maximum reaction time, considering the worst-case system behavior. However, in many scenarios, probabilistic guarantees on the reaction time are sufficient. That is, it is sufficient to provide a guarantee that the reaction does not exceed a certain threshold with (at least) a certain probability. This work provides such probabilistic guarantees on the reaction time, considering two types of randomness: response time randomness and failure probabilities. To the best of our knowledge, this is the first work that defines and analyzes probabilistic reaction time for cause-effect chains based on sporadic tasks.}}, author = {{Günzel, Mario and Ueter, Niklas and Chen, Kuan-Hsun and von der Brüggen, Georg and Chen, Jian-Jia}}, issn = {{1539-9087}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{5s}}, pages = {{1--22}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Probabilistic Reaction Time Analysis}}}, doi = {{10.1145/3609390}}, volume = {{22}}, year = {{2023}}, } @article{66188, abstract = {{In many embedded systems, for instance, in the automotive, avionic, or robotics domain, critical functionalities are implemented via chains of communicating recurrent tasks. To ensure safety and correctness of such systems, guarantees on the reaction time, that is, the delay between a cause (e.g., an external activity or reading of a sensor) and the corresponding effect, must be provided. Current approaches focus on the maximum reaction time, considering the worst-case system behavior. However, in many scenarios, probabilistic guarantees on the reaction time are sufficient. That is, it is sufficient to provide a guarantee that the reaction does not exceed a certain threshold with (at least) a certain probability. This work provides such probabilistic guarantees on the reaction time, considering two types of randomness: response time randomness and failure probabilities. To the best of our knowledge, this is the first work that defines and analyzes probabilistic reaction time for cause-effect chains based on sporadic tasks.}}, author = {{Günzel, Mario and Ueter, Niklas and Chen, Kuan-Hsun and von der Brüggen, Georg and Chen, Jian-Jia}}, issn = {{1539-9087}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{5s}}, pages = {{1--22}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Probabilistic Reaction Time Analysis}}}, doi = {{10.1145/3609390}}, volume = {{22}}, year = {{2023}}, } @article{66185, author = {{Chen, Kuan-Hsun and Lin, Yung-Chia and Lee, Jenq-Kuen}}, issn = {{1939-8018}}, journal = {{Journal of Signal Processing Systems}}, number = {{5}}, pages = {{569--570}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Guest Editorial: Special Issue on Systems Optimizations for DSP and AI Applications}}}, doi = {{10.1007/s11265-023-01854-y}}, volume = {{95}}, year = {{2023}}, } @inproceedings{66196, author = {{Hölscher, Nils and Truong, Minh Duy and Hakert, Christian and Seidl, Tristan and Chen, Kuan-Hsun and Chen, Jian-Jia}}, booktitle = {{2023 IEEE 12th Non-Volatile Memory Systems and Applications Symposium (NVMSA)}}, publisher = {{IEEE}}, title = {{{Rapid NVM Simulation and Analysis on Single Bit Granularity Featuring Gem5 and NVMain}}}, doi = {{10.1109/nvmsa58981.2023.00012}}, year = {{2023}}, } @inproceedings{66195, author = {{Teper, Harun and Betz, Tobias and Von Der Brüggen, Georg and Chen, Kuan-Hsun and Betz, Johannes and Chen, Jian-Jia}}, booktitle = {{2023 IEEE 29th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)}}, publisher = {{IEEE}}, title = {{{Timing-Aware ROS 2 Architecture and System Optimization}}}, doi = {{10.1109/rtcsa58653.2023.00032}}, year = {{2023}}, } @article{66358, abstract = {{AbstractAffine Bruhat–Tits buildings are geometric spaces extracting the combinatorics of algebraic groups. The building of parameterizes flags of subspaces/lattices in or, equivalently, norms on a fixed finite‐dimensional vector space, up to homothety. It has first been studied by Goldman and Iwahori as a piecewise‐linear analogue of symmetric spaces. The space of seminorms compactifies the space of norms and admits a natural surjective restriction map from the Berkovich analytification of projective space that factors the natural tropicalization map. Inspired by Payne's result that the analytification is the limit of all tropicalizations, we show that the space of seminorms is the limit of all tropicalized linear embeddings and prove a faithful tropicalization result for compactified linear spaces. The space of seminorms is in fact the tropical linear space associated to the universal realizable valuated matroid.}}, author = {{Battistella, Luca and Kühn, Kevin and Kuhrs, Arne and Ulirsch, Martin and Vargas, Alejandro}}, issn = {{0024-6107}}, journal = {{Journal of the London Mathematical Society}}, number = {{1}}, publisher = {{Wiley}}, title = {{{Buildings, valuated matroids, and tropical linear spaces}}}, doi = {{10.1112/jlms.12850}}, volume = {{109}}, year = {{2023}}, } @article{25041, author = {{Pelster, Matthias and Schaltegger, Stefan}}, journal = {{Business Ethics, the Environment & Responsibility}}, number = {{1}}, pages = {{80--99}}, title = {{{The dark triad and corporate sustainability: An empirical analysis of personality traits of middle managers}}}, doi = {{10.1111/beer.12398}}, volume = {{ 31}}, year = {{2022}}, } @inbook{28338, author = {{Kehrbusch, Burkhard and Engels, Gregor}}, booktitle = {{Digital Transformation: Core Technologies and Emerging Topics from a Computer Science Perspective}}, editor = {{Vogel-Heuser, Birgit and Wimmer, Manuel}}, publisher = {{Springer-Vieweg}}, title = {{{Digital Transformation - Towards flexible human-centric enterprises}}}, year = {{2022}}, }