@inproceedings{46490,
  author       = {{Gräßler, Iris and Tusek, Alena Marie and Özcan, Deniz}},
  booktitle    = {{Automation 2023}},
  isbn         = {{9783181024195}},
  location     = {{Baden-Baden}},
  pages        = {{863 -- 874}},
  publisher    = {{VDI Verlag}},
  title        = {{{Entwicklung zukunftsfähiger Geschäftsmodelle in der Automatisierungstechnik anhand von Megatrends}}},
  doi          = {{10.51202/9783181024195-863}},
  volume       = {{2419}},
  year         = {{2023}},
}

@inproceedings{67336,
  author       = {{Sammak, Rami and Rotthaler, Anna Lena and Sri Ramulu, Harshini and Wermke, Dominik and Acar, Yasemin}},
  booktitle    = {{Proceedings of the 2024 Workshop on Software Supply Chain Offensive Research and Ecosystem Defenses}},
  pages        = {{56–66}},
  title        = {{{Developers’ approaches to software supply chain security: An interview study}}},
  year         = {{2023}},
}

@article{45112,
  author       = {{Beverungen, Daniel and Kundisch, Dennis and Mirbabaie, Milad and Müller, Oliver and Schryen, Guido and Trang, Simon Thanh-Nam and Trier, Matthias}},
  journal      = {{Business & Information Systems Engineering}},
  number       = {{4}},
  pages        = {{463 -- 474}},
  title        = {{{Digital Responsibility – a Multilevel Framework for Responsible Digitalization}}},
  doi          = {{10.1007/s12599-023-00822-x}},
  volume       = {{65}},
  year         = {{2023}},
}

@article{51825,
  author       = {{Schmitt, Martin}},
  issn         = {{1058-6180, 1934-1547}},
  journal      = {{IEEE Annals of the History of Computing}},
  keywords     = {{Sozialismus, Schachcomputer, Deutschland {\textless}DDR{\textgreater}, KI, Schach, Spätsozialismus, 1980er-Jahre}},
  pages        = {{66–79}},
  title        = {{{Socialist AI? Societal Use, Economic Implementation, and the Tensions of Applied Computer Science in Late Socialist GDR}}},
  doi          = {{10.1109/MAHC.2023.3298694}},
  year         = {{2023}},
}

@article{66182,
  abstract     = {{<jats:p>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.</jats:p>}},
  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}},
}

@article{66188,
  abstract     = {{<jats:p>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.</jats:p>
          <jats:p>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.</jats:p>
          <jats:p>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.</jats:p>}},
  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}},
}

@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}},
}

@inproceedings{31849,
  author       = {{Hoffmann, Max and Biehler, Rolf}},
  booktitle    = {{Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)}},
  editor       = {{Trigueros, Marı́a and Barquero, Berta and Hochmuth, Reinhard and Peters, Jana}},
  keywords     = {{Teaching and learning of specific topics in university mathematics, Transition to, across and from university mathematics, Student Teachers, Geometry, Congruence, Double Discontinuity.}},
  publisher    = {{University of Hannover and INDRUM.}},
  title        = {{{Student Teachers’ Knowledge of Congruence before a University Course on Geometry}}},
  year         = {{2023}},
}

@article{52807,
  abstract     = {{Many preservice mathematics teachers lose their motivation during their first year at university. This phenomenon has been repeatedly described in recent years but is not yet fully under­stood. Since motivation may relate to different objects such as mathematics or teaching, we aim to qualitatively reconstruct different facets of the central motivational constructs of Situated-Expectancy-Value theory (intrinsic value, attainment value, utility value, cost, and expectancy of success) for preservice mathematics teachers. The analysis of longitudinal group interviews of 14 pre­service higher-secondary mathematic teachers from a German university revealed different objects of motivation (e.g., teaching mathematics, scientific mathematics, procedural mathematics, or proof-based mathematics) in preservice teachers' values and expectancy of success. Furthermore, relations between those values and expectancy of success were identified that played a significant role in preservice teachers’ motivational development over their first semester (e.g., relations of attain­ment value for scientific mathematics and psychological cost). Theoretical and practical implications towards a teaching-specific conceptualization of expectancy of success and values and value interventions are being discussed.}},
  author       = {{Gildehaus, Lara and Liebendörfer, Michael and Schukajlow, Stanislaw}},
  journal      = {{Quadrante: Revista de Investigação em Educação Matemática}},
  keywords     = {{Situated Expectancy-Value theory, identity, teacher education, longitudinal qualitative study}},
  number       = {{2}},
  pages        = {{25--48}},
  title        = {{{Preservice teachers’ mathematics-related values and expectancy of success in their first study year}}},
  doi          = {{10.48489/QUADRANTE.31191}},
  volume       = {{32}},
  year         = {{2023}},
}

@unpublished{48293,
  abstract     = {{Recent developments in deep learning have led to great success in various natural language processing (NLP) tasks. However, these applications may involve data that contain sensitive information. Therefore, how to achieve good performance while also protecting the privacy of sensitive data is a crucial challenge in NLP. To preserve privacy, Differential Privacy (DP), which can prevent reconstruction attacks and protect against potential side knowledge, is becoming a de facto technique for private data analysis. In recent years, NLP in DP models (DP-NLP) has been studied from different perspectives, which deserves a comprehensive review. In this paper, we provide the first systematic review of recent advances in DP deep learning models in NLP. In particular, we first discuss some differences and additional challenges of DP-NLP compared with the standard DP deep learning. Then, we investigate some existing work on DP-NLP and present its recent developments from three aspects: gradient perturbation based methods, embedding vector perturbation based methods, and ensemble model based methods. We also discuss some challenges and future directions.}},
  author       = {{Hu, Lijie and Habernal, Ivan and Shen, Lei and Wang, Di}},
  title        = {{{Differentially Private Natural Language Models: Recent Advances and Future Directions}}},
  year         = {{2023}},
}

@unpublished{63043,
  abstract     = {{Spatial modes of light have become highly attractive to increase the dimension and, thereby, security and information capacity in quantum key distribution (QKD). So far, only transverse electric field components have been considered, while longitudinal polarization components have remained neglected. Here, we present an approach to include all three spatial dimensions of electric field oscillation in QKD by implementing our tunable, on-a-chip vector beam decoder (VBD). This inversely designed device pioneers the "preparation" and "measurement" of three-dimensionally polarized mutually unbiased basis states for high-dimensional (HD) QKD and paves the way for the integration of HD QKD with spatial modes in multifunctional on-a-chip photonics platforms.}},
  author       = {{Otte, Eileen and White, Alexander D. and Güsken, Nicholas A. and Vučković, Jelena and Brongersma, Mark L.}},
  title        = {{{Tunable vector beam decoder by inverse design for high-dimensional quantum key distribution with 3D polarized spatial modes}}},
  year         = {{2023}},
}

@article{53539,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The infinite Brownian loop on a Riemannian manifold is the limit in distribution of the Brownian bridge of length <jats:italic>T</jats:italic> around a fixed origin when <jats:inline-formula><jats:alternatives><jats:tex-math>$$T \rightarrow +\infty $$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                <mml:mrow>
                  <mml:mi>T</mml:mi>
                  <mml:mo>→</mml:mo>
                  <mml:mo>+</mml:mo>
                  <mml:mi>∞</mml:mi>
                </mml:mrow>
              </mml:math></jats:alternatives></jats:inline-formula>. The aim of this note is to study its long-time asymptotics on Riemannian symmetric spaces <jats:italic>G</jats:italic>/<jats:italic>K</jats:italic> 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 <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^1$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                <mml:msup>
                  <mml:mi>L</mml:mi>
                  <mml:mn>1</mml:mn>
                </mml:msup>
              </mml:math></jats:alternatives></jats:inline-formula> asymptotic convergence without requiring bi-<jats:italic>K</jats:italic>-invariance for initial data, and strong <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^{\infty }$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                <mml:msup>
                  <mml:mi>L</mml:mi>
                  <mml:mi>∞</mml:mi>
                </mml:msup>
              </mml:math></jats:alternatives></jats:inline-formula> convergence.</jats:p>}},
  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}},
}

@article{66358,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Affine 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 <jats:italic>linear</jats:italic> 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.</jats:p>}},
  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}},
}

@inbook{66442,
  author       = {{Burban, Igor}},
  booktitle    = {{Springer Proceedings in Mathematics &amp; Statistics}},
  isbn         = {{9783031178580}},
  issn         = {{2194-1009}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Du Val Singularities}}},
  doi          = {{10.1007/978-3-031-17859-7_7}},
  year         = {{2023}},
}

@inbook{66441,
  author       = {{Burban, Igor}},
  booktitle    = {{Springer Proceedings in Mathematics &amp; Statistics}},
  isbn         = {{9783031178580}},
  issn         = {{2194-1009}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Du Val Singularities}}},
  doi          = {{10.1007/978-3-031-17859-7_7}},
  year         = {{2023}},
}

@inproceedings{49373,
  author       = {{Kablo, Emiram and Arias Cabarcos, Patricia}},
  booktitle    = {{Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security}},
  publisher    = {{ACM}},
  title        = {{{Privacy in the Age of Neurotechnology: Investigating Public Attitudes towards Brain Data Collection and Use}}},
  doi          = {{10.1145/3576915.3623164}},
  year         = {{2023}},
}

@inproceedings{48060,
  author       = {{Röse, Markus and Kablo, Emiram and Arias Cabarcos, Patricia}},
  booktitle    = {{Proceedings of the 2023 European Symposium on Usable Security}},
  publisher    = {{ACM}},
  title        = {{{Overcoming Theory: Designing Brainwave Authentication for the Real World}}},
  doi          = {{10.1145/3617072.3617120}},
  year         = {{2023}},
}

