@inproceedings{29306, abstract = {{Recently, there has been a rising interest in sound recognition via Acoustic Sensor Networks to support applications such as ambient assisted living or environmental habitat monitoring. With state-of-the-art sound recognition being dominated by deep-learning-based approaches, there is a high demand for labeled training data. Despite the availability of large-scale data sets such as Google's AudioSet, acquiring training data matching a certain application environment is still often a problem. In this paper we are concerned with human activity monitoring in a domestic environment using an ASN consisting of multiple nodes each providing multichannel signals. We propose a self-training based domain adaptation approach, which only requires unlabeled data from the target environment. Here, a sound recognition system trained on AudioSet, the teacher, generates pseudo labels for data from the target environment on which a student network is trained. The student can furthermore glean information about the spatial arrangement of sensors and sound sources to further improve classification performance. It is shown that the student significantly improves recognition performance over the pre-trained teacher without relying on labeled data from the environment the system is deployed in.}}, author = {{Ebbers, Janek and Keyser, Moritz Curt and Haeb-Umbach, Reinhold}}, booktitle = {{Proceedings of the 29th European Signal Processing Conference (EUSIPCO)}}, pages = {{1135–1139}}, title = {{{Adapting Sound Recognition to A New Environment Via Self-Training}}}, year = {{2021}}, } @article{29901, author = {{Santos, Beatriz Sousa and Domik, Gitta and Anderson, Eike Falk}}, journal = {{Graph. Vis. Comput.}}, pages = {{200028}}, title = {{{Foreword to the special section on Computer Graphics education in the time of Covid}}}, doi = {{10.1016/j.gvc.2021.200028}}, volume = {{4}}, year = {{2021}}, } @misc{49145, abstract = {{Auch in diesem Semester finden Veranstaltungen im Fach Philosophie an den meisten Universitäten vor allem online statt; die Pandemie-Lage lässt eine Öffnung der Unis für Präsenzveranstaltungen kaum zu. Die folgenden Überlegungen hat Sebastian Luft, Professor an der Marquette University in Milwaukee/WI, aus aktuellem Anlass verfasst. 2019 erschien sein Buch »Philosophie lehren« zur philosophischen Hochschuldidaktik. Der folgende Text bietet eine aktuelle Ergänzung zur dortigen Handreichung für die philosophische Lehre.}}, author = {{Luft, Sebastian}}, pages = {{7}}, publisher = {{Meiner Telegramm}}, title = {{{»Wir hören Dich nicht, schalte bitte Dein Mikro an ! « Einige Gedanken zur digitalen Lehre in der Pandemie.}}}, year = {{2021}}, } @article{49149, author = {{Luft, Sebastian}}, journal = {{Information Philosophie}}, number = {{4}}, publisher = {{Claudia Moser Verlag}}, title = {{{In Amerika promovieren? Hinweise von Sebastian Luft}}}, year = {{2021}}, } @inbook{49183, author = {{Gretz, Daniela}}, booktitle = {{Text + Kritik: Thomas Meinecke}}, editor = {{Jaeckel, Charlotte}}, pages = {{65--72}}, publisher = {{edition text + kritik}}, title = {{{»Hubert Fichte (…), der hamburgische Pionier der Popliteratur im langen schwingenden Pelzmantel«. Thomas Meineckes Erfindung (s)einer Tradition}}}, volume = {{231}}, year = {{2021}}, } @inbook{47957, author = {{Schneider, Jennifer Nicole}}, booktitle = {{Fostering Digitisation and Industry 4.0: Education – Vocation - Industry – Future. New Opportunities and Challenges for European VET. Insights in the DigI-VET Project}}, editor = {{Beutner, Marc and Pechuel, Rasmus and Schneider, Jennifer }}, pages = {{57 -- 62 }}, title = {{{Digital transformation in industry}}}, year = {{2021}}, } @inbook{47966, author = {{Schneider, Jennifer }}, booktitle = {{Fostering Digitisation and Industry 4.0: Education – Vocation - Industry – Future. New Opportunities and Challenges for European VET. Insights in the DigI-VET Project}}, editor = {{Beutner, Marc and Pechuel, Rasmus and Schneider, Jennifer}}, pages = {{150 -- 165}}, title = {{{Teaching and Learning Materials}}}, year = {{2021}}, } @book{47975, editor = {{Beutner, Marc and Pechuel, Rasmus and Schneider, Jennifer}}, title = {{{Förderung von Digitalisierung und Industrie 4.0: Bildung – Beruf – Industrie – Zukunft. Neue Möglichkeiten und Herausforderungen für die europäische Berufsbildung. Einblick in das Projekt DigI-VET}}}, year = {{2021}}, } @phdthesis{37520, author = {{Cornel, Stefanie}}, isbn = {{978-3-7815-2428-6}}, title = {{{Differenz und Normalität in der Grundschule. Subjektive Theorien von Studierenden im Praxissemester }}}, year = {{2021}}, } @inbook{49376, author = {{Kammeyer, Katharina}}, booktitle = {{Handbuch ethische Bildung. Religionspädagogische Fokussierungen }}, editor = {{Lindner , Konstantin and Zimmermann, Mirjam }}, isbn = {{978-3825256043}}, pages = {{396}}, publisher = {{UTB}}, title = {{{Ethische Bildung und inklusionsorientierter Religionsunterricht}}}, year = {{2021}}, } @inbook{49377, author = {{Kammeyer, Katharina}}, booktitle = {{Musik als Lebensmittel. Kulturwissenschaftlich-theologische Rationen für ein Jahr}}, editor = {{Keuchen, Marion and Janus, Richard}}, isbn = {{978-3643150257}}, pages = {{309}}, publisher = {{LIT Verlag}}, title = {{{This is my Fight Sing}}}, year = {{2021}}, } @article{24456, abstract = {{One objective of current research in explainable intelligent systems is to implement social aspects in order to increase the relevance of explanations. In this paper, we argue that a novel conceptual framework is needed to overcome shortcomings of existing AI systems with little attention to processes of interaction and learning. Drawing from research in interaction and development, we first outline the novel conceptual framework that pushes the design of AI systems toward true interactivity with an emphasis on the role of the partner and social relevance. We propose that AI systems will be able to provide a meaningful and relevant explanation only if the process of explaining is extended to active contribution of both partners that brings about dynamics that is modulated by different levels of analysis. Accordingly, our conceptual framework comprises monitoring and scaffolding as key concepts and claims that the process of explaining is not only modulated by the interaction between explainee and explainer but is embedded into a larger social context in which conventionalized and routinized behaviors are established. We discuss our conceptual framework in relation to the established objectives of transparency and autonomy that are raised for the design of explainable AI systems currently.}}, author = {{Rohlfing, Katharina J. and Cimiano, Philipp and Scharlau, Ingrid and Matzner, Tobias and Buhl, Heike M. and Buschmeier, Hendrik and Esposito, Elena and Grimminger, Angela and Hammer, Barbara and Haeb-Umbach, Reinhold and Horwath, Ilona and Hüllermeier, Eyke and Kern, Friederike and Kopp, Stefan and Thommes, Kirsten and Ngonga Ngomo, Axel-Cyrille and Schulte, Carsten and Wachsmuth, Henning and Wagner, Petra and Wrede, Britta}}, issn = {{2379-8920}}, journal = {{IEEE Transactions on Cognitive and Developmental Systems}}, keywords = {{Explainability, process ofexplaining andunderstanding, explainable artificial systems}}, number = {{3}}, pages = {{717--728}}, title = {{{Explanation as a Social Practice: Toward a Conceptual Framework for the Social Design of AI Systems}}}, doi = {{10.1109/tcds.2020.3044366}}, volume = {{13}}, year = {{2021}}, } @inbook{49487, author = {{Malancu, Natalia and Florea, Alexandra}}, booktitle = {{Handbook of Citizenship and Migration}}, editor = {{Giugni, Marco and Grasso, Maria}}, title = {{{Chapter 5: Quantitative methodological approaches to citizenship and migration}}}, doi = {{https://doi.org/10.4337/9781789903133.00011}}, year = {{2021}}, } @techreport{47098, author = {{Alt, Marius and Gallier, Carlo and Sturm, Bodo and Kesternich, Martin}}, publisher = {{ZEW Policy Brief 21-09}}, title = {{{Ausblick auf die COP26 in Glasgow, Eine schrittweise Erhöhung der Klimaschutzbeiträge reicht nicht – ein Klimaklub sollte mitgedacht werden}}}, year = {{2021}}, } @techreport{47100, author = {{Frick, Marc and Conzelmann, Annabell and von Graevenitz, Kathrine and Kesternich, Martin and Wagner, Ulrich and Rausch, Sebastian}}, title = {{{Transparente Klimabilanzen - Information für klimafreundliches Handeln}}}, year = {{2021}}, } @article{49530, author = {{Meyer zu Hörste-Bührer, Raphaela}}, journal = {{Römerbrief und Tageszeitung! Politik in der Theologie Karl Barths.}}, pages = {{133--154}}, title = {{{Barth for Future? Eine Barth-Relektüre vor dem Hintergrund der Bewegung „Fridays for Future“.}}}, year = {{2021}}, } @inproceedings{48853, abstract = {{In practise, it is often desirable to provide the decision-maker with a rich set of diverse solutions of decent quality instead of just a single solution. In this paper we study evolutionary diversity optimization for the knapsack problem (KP). Our goal is to evolve a population of solutions that all have a profit of at least (1 - {$ϵ$}) {$\cdot$} OPT, where OPT is the value of an optimal solution. Furthermore, they should differ in structure with respect to an entropy-based diversity measure. To this end we propose a simple ({$\mu$} + 1)-EA with initial approximate solutions calculated by a well-known FPTAS for the KP. We investigate the effect of different standard mutation operators and introduce biased mutation and crossover which puts strong probability on flipping bits of low and/or high frequency within the population. An experimental study on different instances and settings shows that the proposed mutation operators in most cases perform slightly inferior in the long term, but show strong benefits if the number of function evaluations is severely limited.}}, author = {{Bossek, Jakob and Neumann, Aneta and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-8350-9}}, keywords = {{evolutionary algorithms, evolutionary diversity optimization, knapsack problem, tailored operators}}, pages = {{556–564}}, publisher = {{Association for Computing Machinery}}, title = {{{Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms}}}, doi = {{10.1145/3449639.3459364}}, year = {{2021}}, } @inproceedings{48855, abstract = {{Computing sets of high quality solutions has gained increasing interest in recent years. In this paper, we investigate how to obtain sets of optimal solutions for the classical knapsack problem. We present an algorithm to count exactly the number of optima to a zero-one knapsack problem instance. In addition, we show how to efficiently sample uniformly at random from the set of all global optima. In our experimental study, we investigate how the number of optima develops for classical random benchmark instances dependent on their generator parameters. We find that the number of global optima can increase exponentially for practically relevant classes of instances with correlated weights and profits which poses a justification for the considered exact counting problem.}}, author = {{Bossek, Jakob and Neumann, Aneta and Neumann, Frank}}, booktitle = {{Learning and Intelligent Optimization}}, isbn = {{978-3-030-92120-0}}, keywords = {{Dynamic programming, Exact counting, Sampling, Zero-one knapsack problem}}, pages = {{40–54}}, publisher = {{Springer-Verlag}}, title = {{{Exact Counting and~Sampling of Optima for the Knapsack Problem}}}, doi = {{10.1007/978-3-030-92121-7_4}}, year = {{2021}}, } @inproceedings{48860, abstract = {{In the area of evolutionary computation the calculation of diverse sets of high-quality solutions to a given optimization problem has gained momentum in recent years under the term evolutionary diversity optimization. Theoretical insights into the working principles of baseline evolutionary algorithms for diversity optimization are still rare. In this paper we study the well-known Minimum Spanning Tree problem (MST) in the context of diversity optimization where population diversity is measured by the sum of pairwise edge overlaps. Theoretical results provide insights into the fitness landscape of the MST diversity optimization problem pointing out that even for a population of {$\mu$} = 2 fitness plateaus (of constant length) can be reached, but nevertheless diverse sets can be calculated in polynomial time. We supplement our theoretical results with a series of experiments for the unconstrained and constraint case where all solutions need to fulfill a minimal quality threshold. Our results show that a simple ({$\mu$} + 1)-EA can effectively compute a diversified population of spanning trees of high quality.}}, author = {{Bossek, Jakob and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-8350-9}}, keywords = {{evolutionary algorithms, evolutionary diversity optimization, minimum spanning tree, runtime analysis}}, pages = {{198–206}}, publisher = {{Association for Computing Machinery}}, title = {{{Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem}}}, doi = {{10.1145/3449639.3459363}}, year = {{2021}}, } @inbook{48862, abstract = {{Most runtime analyses of randomised search heuristics focus on the expected number of function evaluations to find a unique global optimum. We ask a fundamental question: if additional search points are declared optimal, or declared as desirable target points, do these additional optima speed up evolutionary algorithms? More formally, we analyse the expected hitting time of a target set OPT {$\cup$} S where S is a set of non-optimal search points and OPT is the set of optima and compare it to the expected hitting time of OPT. We show that the answer to our question depends on the number and placement of search points in S. For all black-box algorithms and all fitness functions we show that, if additional optima are placed randomly, even an exponential number of optima has a negligible effect on the expected optimisation time. Considering Hamming balls around all global optima gives an easier target for some algorithms and functions and can shift the phase transition with respect to offspring population sizes in the (1,{$\lambda$}) EA on One-Max. Finally, on functions where search trajectories typically join in a single search point, turning one search point into an optimum drastically reduces the expected optimisation time.}}, author = {{Bossek, Jakob and Sudholt, Dirk}}, booktitle = {{Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}}, isbn = {{978-1-4503-8352-3}}, keywords = {{evolutionary algorithms, pseudo-boolean functions, runtime analysis, theory}}, pages = {{1–11}}, publisher = {{Association for Computing Machinery}}, title = {{{Do Additional Optima Speed up Evolutionary Algorithms?}}}, year = {{2021}}, }