@techreport{37088, abstract = {{We examine variation in mandatory CSR reporting practices based on a large sample of non-publicly listed savings banks in Germany. They do not have typical shareholders but rather are established by municipal trustees and can serve clients only in their distinct operating area. This setting permits us to identify demand for CSR information by their main stakeholder groups – municipal trustees and private and corporate clients. In this way, our analysis focuses on the double-materiality approach to CSR reporting. We find that demand for CSR information by supervisory board chairperson belonging to a left-wing or green party and the presence of more supervisory board members belonging to a left-wing or green party are associated with longer CSR reports and more disclosure on environmental, social, employee and human rights matters. In addition, competition for private clients and the sustainability orientation of corporate clients are associated with longer reports and more disclosure on environmental, employee and human rights matters. These findings suggest that savings banks’ CSR reports cater to their principal stakeholders’ demand for CSR information.}}, author = {{Gulenko, Maryna and Kohlhase, Saskia and Kosi, Urska}}, keywords = {{Corporate social responsibility, Mandatory reporting, Non-publicly listed banks, Double materiality, Stakeholder groups, Political influence}}, title = {{{CSR Reporting under the Non-Financial Reporting Directive: Evidence from Non-publicly Listed Firms}}}, doi = {{10.2139/ssrn.4040946}}, year = {{2022}}, } @inproceedings{65890, author = {{Herold-Blasius, Raja and Rott, Benjamin}}, booktitle = {{Twelfth Congress of the European Society for Research in Mathematics Education (CERME12)}}, location = {{Bozen-Bolzano}}, pages = {{452--459}}, title = {{{Low-achieving secondary students learn mathematical problem solving. A longitudinal, qualitative video study}}}, year = {{2022}}, } @inproceedings{66265, author = {{Chen, Kuan-Hsun and Günzel, Mario and Jablkowski, Boguslaw and Buschhoff, Markus and Chen, Jian-Jia}}, booktitle = {{34th Euromicro Conference on Real-Time Systems (ECRTS 2022)}}, editor = {{Maggio, Martina}}, isbn = {{978-3-95977-239-6}}, issn = {{1868-8969}}, pages = {{6:1–6:22}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{Unikernel-Based Real-Time Virtualization Under Deferrable Servers: Analysis and Realization}}}, doi = {{10.4230/LIPIcs.ECRTS.2022.6}}, volume = {{231}}, year = {{2022}}, } @inproceedings{66262, author = {{Hahn, Sebastian and Jacobs, Michael and Hölscher, Nils and Chen, Kuan-Hsun and Chen, Jian-Jia and Reineke, Jan}}, booktitle = {{20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)}}, editor = {{Ballabriga, Clément}}, isbn = {{978-3-95977-244-0}}, issn = {{2190-6807}}, pages = {{2:1–2:17}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{LLVMTA: An LLVM-Based WCET Analysis Tool}}}, doi = {{10.4230/OASIcs.WCET.2022.2}}, volume = {{103}}, year = {{2022}}, } @inproceedings{66224, author = {{Freymann, Raphael and Shi, Junjie and Chen, Jian-Jia and Chen, Kuan-Hsun}}, booktitle = {{2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC)}}, publisher = {{IEEE}}, title = {{{Renovation of EdgeCloudSim: An Efficient Discrete-Event Approach}}}, doi = {{10.1109/fmec54266.2021.9732572}}, year = {{2022}}, } @article{66203, abstract = {{For timing-sensitive edge applications, the demand for efficient lightweight machine learning solutions has increased recently. Tree ensembles are among the state-of-the-art in many machine learning applications. While single decision trees are comparably small, an ensemble of trees can have a significant memory footprint leading to cache locality issues, which are crucial to performance in terms of execution time. In this work, we analyze memory-locality issues of the two most common realizations of decision trees, i.e., native and if-else trees. We highlight that both realizations demand a more careful memory layout to improve caching behavior and maximize performance. We adopt a probabilistic model of decision tree inference to find the best memory layout for each tree at the application layer. Further, we present an efficient heuristic to take architecture-dependent information into account thereby optimizing the given ensemble for a target computer architecture. Our code-generation framework, which is freely available on an open-source repository, produces optimized code sessions while preserving the structure and accuracy of the trees. With several real-world data sets, we evaluate the elapsed time of various tree realizations on server hardware as well as embedded systems for Intel and ARM processors. Our optimized memory layout achieves a reduction in execution time up to 75 % execution for server-class systems, and up to 70 % for embedded systems, respectively.}}, author = {{Chen, Kuan-Hsun and Su, Chiahui and Hakert, Christian and Buschjäger, Sebastian and Lee, Chao-Lin and Lee, Jenq-Kuen and Morik, Katharina and Chen, Jian-Jia}}, issn = {{1539-9087}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{6}}, pages = {{1--26}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Efficient Realization of Decision Trees for Real-Time Inference}}}, doi = {{10.1145/3508019}}, volume = {{21}}, year = {{2022}}, } @article{66209, abstract = {{For timing-sensitive edge applications, the demand for efficient lightweight machine learning solutions has increased recently. Tree ensembles are among the state-of-the-art in many machine learning applications. While single decision trees are comparably small, an ensemble of trees can have a significant memory footprint leading to cache locality issues, which are crucial to performance in terms of execution time. In this work, we analyze memory-locality issues of the two most common realizations of decision trees, i.e., native and if-else trees. We highlight that both realizations demand a more careful memory layout to improve caching behavior and maximize performance. We adopt a probabilistic model of decision tree inference to find the best memory layout for each tree at the application layer. Further, we present an efficient heuristic to take architecture-dependent information into account thereby optimizing the given ensemble for a target computer architecture. Our code-generation framework, which is freely available on an open-source repository, produces optimized code sessions while preserving the structure and accuracy of the trees. With several real-world data sets, we evaluate the elapsed time of various tree realizations on server hardware as well as embedded systems for Intel and ARM processors. Our optimized memory layout achieves a reduction in execution time up to 75 % execution for server-class systems, and up to 70 % for embedded systems, respectively.}}, author = {{Chen, Kuan-Hsun and Su, Chiahui and Hakert, Christian and Buschjäger, Sebastian and Lee, Chao-Lin and Lee, Jenq-Kuen and Morik, Katharina and Chen, Jian-Jia}}, issn = {{1539-9087}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{6}}, pages = {{1--26}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Efficient Realization of Decision Trees for Real-Time Inference}}}, doi = {{10.1145/3508019}}, volume = {{21}}, year = {{2022}}, } @article{66202, abstract = {{ In-memory wear-leveling has become an important research field for emerging non-volatile main memories over the past years. Many approaches in the literature perform wear-leveling by making use of special hardware. Since most non-volatile memories only wear out from write accesses, the proposed approaches in the literature also usually try to spread write accesses widely over the entire memory space. Some non-volatile memories, however, also wear out from read accesses, because every read causes a consecutive write access. Software-based solutions only operate from the application or kernel level, where read and write accesses are realized with different instructions and semantics. Therefore different mechanisms are required to handle reads and writes on the software level. First, we design a method to approximate read and write accesses to the memory to allow aging aware coarse-grained wear-leveling in the absence of special hardware, providing the age information. Second, we provide specific solutions to resolve access hot-spots within the compiled program code (text segment) and on the application stack. In our evaluation, we estimate the cell age by counting the total amount of accesses per cell. The results show that employing all our methods improves the memory lifetime by up to a factor of 955×. }}, author = {{Hakert, Christian and Chen, Kuan-Hsun and Schirmeier, Horst and Bauer, Lars and Genssler, Paul R. and von der Brüggen, Georg and Amrouch, Hussam and Henkel, Jörg and Chen, Jian-Jia}}, issn = {{1539-9087}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{1}}, pages = {{1--24}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory}}}, doi = {{10.1145/3483839}}, volume = {{21}}, year = {{2022}}, } @inproceedings{66210, author = {{Chen, Kuan-Hsun and Gunzel, Mario and von der Bruggen, Georg and Chen, Jian-Jia}}, booktitle = {{2022 IEEE Real-Time Systems Symposium (RTSS)}}, publisher = {{IEEE}}, title = {{{Critical Instant for Probabilistic Timing Guarantees: Refuted and Revisited}}}, doi = {{10.1109/rtss55097.2022.00022}}, year = {{2022}}, } @inbook{66213, author = {{Kotthaus, Helena and Marwedel, Peter and Yayla, Mikail and Buschjäger, Sebastian and Amrouch, Hussam and Chen, Kuan-Hsun}}, booktitle = {{Fundamentals}}, isbn = {{9783110785944}}, publisher = {{De Gruyter}}, title = {{{7 Memory Awareness}}}, doi = {{10.1515/9783110785944-007}}, year = {{2022}}, } @inproceedings{66211, author = {{Gunzel, Mario and von der Bruggen, Georg and Chen, Kuan-Hsun and Chen, Jian-Jia}}, booktitle = {{2022 IEEE Real-Time Systems Symposium (RTSS)}}, publisher = {{IEEE}}, title = {{{EDF-Like Scheduling for Self-Suspending Real-Time Tasks}}}, doi = {{10.1109/rtss55097.2022.00024}}, year = {{2022}}, } @article{66180, author = {{Hakert, Christian and Khan, Asif Ali and Chen, Kuan-Hsun and Hameed, Fazal and Castrillon, Jeronimo and Chen, Jian-Jia}}, issn = {{0018-9340}}, journal = {{IEEE Transactions on Computers}}, number = {{5}}, pages = {{1488--1502}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{ROLLED: Racetrack Memory Optimized Linear Layout and Efficient Decomposition of Decision Trees}}}, doi = {{10.1109/tc.2022.3197094}}, volume = {{72}}, year = {{2022}}, } @article{66181, author = {{Hölscher, Nils and Hakert, Christian and Nassar, Hassan and Chen, Kuan-Hsun and Bauer, Lars and Chen, Jian-Jia and Henkel, Jörg}}, issn = {{0278-0070}}, journal = {{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}}, number = {{8}}, pages = {{2527--2539}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Memory Carousel: LLVM-Based Bitwise Wear Leveling for Nonvolatile Main Memory}}}, doi = {{10.1109/tcad.2022.3228897}}, volume = {{42}}, year = {{2022}}, } @article{66283, author = {{Riegraf, Birgitt and Weber, Lena}}, journal = {{Bürger & Staat - Care-Arbeit. Pflege auf dem Prüfstand}}, pages = {{86--91}}, publisher = {{Landeszentrale für Politische Bildung Baden-Württemberg}}, title = {{{Care und Care-Arbeit: Themen und Policies im Spiegel alter und neuer Entwicklungen.}}}, volume = {{3}}, year = {{2022}}, } @article{48429, abstract = {{Since her debut on Instagram in 2016, Lil Miquela has amassed over 3 million followers. She was the first of many virtual influencers; avatars with a hyper-realistic humanoid appearance who operate on social media. This article investigates how the fashioning of virtual influencers informs the relationship between virtual and human bodies. A visual and textual analysis of virtual influencers on Instagram has revealed that they are emblematic of a coalescence between the virtual and the actual. Virtual influencers often evoke discussions about human nature because their cyberpunk narratives and uncanny appearance position them as autonomous posthuman subjects. Virtual influencers are positioned as Bodies without Organs, as their bodies can be manipulated into any form. Yet, they adhere to normative ideals of youth, slimness and beauty, encouraging their audiences to follow suit. Their fashion reflects the streetwear aesthetic but is often designed by luxury brands. This strategy positions virtual influencers as authentic, while generating visibility within the attention economy. Further, the Deleuzian concept of the fold serves as a metaphor to understand fashion as an interface between surface and depth. It is fashion in its folded form that hominizes virtual influencers, although they are merely a fashionable surface.}}, author = {{Brachtendorf, Charlotte}}, issn = {{2050-0734}}, journal = {{Fashion, Style & Popular Culture}}, keywords = {{authenticity, body-without-organs, Deleuze, digital avatars, fashionable ideal, hominization, Instagram}}, number = {{4}}, pages = {{483--499}}, title = {{{Lil Miquela in the Folds of Fashion: (Ad-)Dressing Virtual Influencers}}}, doi = {{10.1386/fspc_00157_1}}, volume = {{9}}, year = {{2022}}, } @unpublished{66313, abstract = {{Using the notion of a root datum of a reductive group $G$ we propose a tropical analogue of a principal $G$-bundle on a metric graph. We focus on the case $G=\mathrm{GL}_n$, i.e. the case of vector bundles. Here we give a characterization of vector bundles in terms of multidivisors and use this description to prove analogues of the Weil--Riemann--Roch theorem and the Narasimhan--Seshadri correspondence. We proceed by studying the process of tropicalization. In particular, we show that the non-Archimedean skeleton of the moduli space of semistable vector bundles on a Tate curve is isomorphic to a certain component of the moduli space of semistable tropical vector bundles on its dual metric graph.}}, author = {{Gross, Andreas and Ulirsch, Martin and Zakharov, Dmitry}}, booktitle = {{arXiv:2206.10219}}, title = {{{Principal bundles on metric graphs: the $\mathrm{GL}_n$ case}}}, year = {{2022}}, } @article{66316, author = {{Gross, Andreas and Ulirsch, Martin and Zakharov, Dmitry}}, issn = {{0001-8708}}, journal = {{Advances in Mathematics}}, publisher = {{Elsevier BV}}, title = {{{Principal bundles on metric graphs: the $\mathrm{GL}_n$ case}}}, doi = {{10.1016/j.aim.2022.108775}}, volume = {{411}}, year = {{2022}}, } @book{58740, abstract = {{Der Terminus Wissenstransfer hat in den letzten Jahren verstärkt an Bedeutung gewonnen. Er bezieht sich auf die Zirkulation von Wissen zwischen Systemen, Organisationen oder Parteien, etwa zwischen Hochschulen und Gesellschaft. Damit ist nicht ‚nur‘ der Transfer wissenschaftlicher Erkenntnisse in gesellschaftliche Kontexte gemeint, sondern vielmehr - über den Erwerb und die Weitergabe von Wissen hinaus - der Dialog und die Diskursbildung zwischen Wissenschaft und Gesellschaft. Der vorliegende Band nimmt dabei entstehende Aufgaben, Herausforderungen und Chancen kulturwissenschaftlicher Forschung in den Blick. Entgegen der Annahme, Projekte aus dem Feld der Kulturwissenschaften würden im Bereich des Abstrakten verbleiben, präsentiert er Beispiele kulturwissenschaftlicher Forschung, die Theorie und Praxis berücksichtigen sowie die Verzahnung von theoretischen Erkenntnissen und ihr Mitwirken an gesellschaftlichen Diskursen verdeutlichen.}}, editor = {{Harmening, Anda-Lisa and Leinfellner, Stefanie and Meier, Rebecca}}, isbn = {{978-3-534-27585-4}}, pages = {{352}}, publisher = {{Herder}}, title = {{{Wissenstransfer. Aufgabe, Herausforderung und Chance kulturwissenschaftlicher Forschung}}}, volume = {{1}}, year = {{2022}}, } @inbook{39614, author = {{Kullmann, Harry and Globisch, Eva-Luisa and Heister, Nicolas}}, booktitle = {{Wege der Kooperation im Kontext inklusiver Bildung}}, editor = {{Serke, Björn and Streese, Bettina}}, pages = {{130 -- 146}}, publisher = {{Julius Klinkhardt}}, title = {{{Hier wie dort? Ein Vergleich der Tätigkeits- und Kooperationsprofile von Schulbegleitungen an inklusiven Gesamtschulen und Förderschulen in Nordrhein-Westfalen}}}, doi = {{doi.org/10.35468/5958}}, year = {{2022}}, } @article{58021, author = {{Bauer, A. and Glück, C. W. and Jonas, K. and Mayer, A. and Sallat, S. and Stitzinger, U.}}, journal = {{Praxis Sprache}}, title = {{{Kernkompetenzen für das Studium der Pädagogik im sonderpädagogischen Förderschwerpunkt Sprache und Kommunikation}}}, year = {{2022}}, }