Refine
H-BRS Bibliography
- yes (252) (remove)
Departments, institutes and facilities
- Fachbereich Informatik (68)
- Fachbereich Wirtschaftswissenschaften (58)
- Fachbereich Ingenieurwissenschaften und Kommunikation (43)
- Fachbereich Sozialpolitik und Soziale Sicherung (38)
- Fachbereich Angewandte Naturwissenschaften (36)
- Institut für Technik, Ressourcenschonung und Energieeffizienz (TREE) (34)
- Graduierteninstitut (15)
- Institut für Verbraucherinformatik (IVI) (14)
- Institute of Visual Computing (IVC) (14)
- Institut für funktionale Gen-Analytik (IFGA) (7)
- Institut für Cyber Security & Privacy (ICSP) (6)
- Institut für Medienentwicklung und -analyse (IMEA) (6)
- Internationales Zentrum für Nachhaltige Entwicklung (IZNE) (5)
- Zentrum für Innovation und Entwicklung in der Lehre (ZIEL) (4)
- Institut für Soziale Innovationen (ISI) (3)
- Zentrum für Ethik und Verantwortung (ZEV) (3)
- Centrum für Entrepreneurship, Innovation und Mittelstand (CENTIM) (2)
- Institut für Sicherheitsforschung (ISF) (2)
- Sprachenzentrum (1)
- Verwaltung (1)
Document Type
- Article (78)
- Conference Object (61)
- Part of a Book (40)
- Book (monograph, edited volume) (22)
- Doctoral Thesis (15)
- Preprint (15)
- Contribution to a Periodical (6)
- Report (5)
- Research Data (4)
- Master's Thesis (2)
- Working Paper (2)
- Bachelor Thesis (1)
- Video (1)
Year of publication
- 2020 (252) (remove)
Has Fulltext
- no (252) (remove)
Keywords
- Digitalisierung (3)
- Lehrbuch (3)
- Quality diversity (3)
- post-buckling (3)
- ARIMA (2)
- Artificial Intelligence (2)
- Autoencoder (2)
- Automatic Short Answer Grading (2)
- Bayesian optimization (2)
- Computational fluid dynamics (2)
Bei der sechsten Ausgabe des wissenschaftlichen Workshops ”Usable Security und Privacy” auf der Mensch und Computer 2020 werden wie in den vergangenen Jahren aktuelle Forschungs- und Praxisbeiträge präsentiert und anschließend mit allen Teilnehmenden diskutiert. Drei Beiträge befassen sich dieses Jahr mit dem Thema Privatsphäre, einer mit dem Thema Sicherheit. Mit dem Workshop wird ein etabliertes Forum fortgeführt und weiterentwickelt, in dem sich Expert*innen aus unterschiedlichen Domänen, z. B. dem Usability- und Security-Engineering, transdisziplinär austauschen können.
Solving differential-algebraic equations (DAEs) efficiently by means of appropriate numerical schemes for time-integration is an ongoing topic in applied mathematics. In this context, especially when considering large systems that occur with respect to many fields of practical application effective computation becomes relevant. In particular, corresponding examples are given when having to simulate network structures that consider transport of fluid and gas or electrical circuits. Due to the stiffness properties of DAEs, time-integration of such problems generally demands for implicit strategies. Among the schemes that prove to be an adequate choice are linearly implicit Rung-Kutta methods in the form of Rosenbrock-Wanner (ROW) schemes. Compared to fully implicit methods, they are easy to implement and avoid the solution of non-linear equations by including Jacobian information within their formulation. However, Jacobian calculations are a costly operation. Hence, necessity of having to compute the exact Jacobian with every successful time-step proves to be a considerable drawback. To overcome this drawback, a ROW-type method is introduced that allows for non-exact Jacobian entries when solving semi-explicit DAEs of index one. The resulting scheme thus enables to exploit several strategies for saving computational effort. Examples include using partial explicit integration of non-stiff components, utilizing more advantageous sparse Jacobian structures or making use of time-lagged Jacobian information. In fact, due to the property of allowing for non-exact Jacobian expressions, the given scheme can be interpreted as a generalized ROW-type method for DAEs. This is because it covers many different ROW-type schemes known from literature. To derive the order conditions of the ROW-type method introduced, a theory is developed that allows to identify occurring differentials and coefficients graphically by means of rooted trees. Rooted trees for describing numerical methods were originally introduced by J.C. Butcher. They significantly simplify the determination and definition of relevant characteristics because they allow for applying straightforward procedures. In fact, the theory presented combines strategies used to represent ROW-type methods with exact Jacobian for DAEs and ROW-type methods with non-exact Jacobian for ODEs. For this purpose, new types of vertices are considered in order to describe occurring non-exact elementary differentials completely. The resulting theory thus automatically comprises relevant approaches known from literature. As a consequence, it allows to recognize order conditions of familiar methods covered and to identify new conditions. With the theory developed, new sets of coefficients are derived that allow to realize the ROW-type method introduced up to orders two and three. Some of them are constructed based on methods known from literature that satisfy additional conditions for the purpose of avoiding effects of order reduction. It is shown that these methods can be improved by means of the new order conditions derived without having to increase the number of internal stages. Convergence of the resulting methods is analyzed with respect to several academic test problems. Results verify the theory determined and the order conditions found as only schemes satisfying the order conditions predicted preserve their order when using non-exact Jacobian expressions.
Autonomous driving enables new mobility concepts such as shared-autonomous services. Although significant re-search has been done on passenger-car interaction, work on passenger interaction with robo-taxis is still rare. In this paper, we tackle the question of how passengers experience robo-taxis as a service in real-life settings to inform the interaction design. We conducted a Wizard of Oz study with an electric vehicle where the driver was hidden from the passenger to simulate the service experience of a robo-taxi. 10 participants had the opportunity to use the simulated shared-autonomous service in real-life situations for one week. By the week's end, 33 rides were completed and recorded on video. Also, we flanked the study conducting interviews before and after with all participants. The findings provided insights into four design themes that could inform the service design of robo-taxis along the different stages including hailing, pick-up, travel, and drop-off.
Abschlussbericht zum BMBF-Fördervorhaben Enabling Infrastructure for HPC-Applications (EI-HPC)
(2020)
Optimization plays an essential role in industrial design, but is not limited to minimization of a simple function, such as cost or strength. These tools are also used in conceptual phases, to better understand what is possible. To support this exploration we focus on Quality Diversity (QD) algorithms, which produce sets of varied, high performing solutions. These techniques often require the evaluation of millions of solutions -- making them impractical in design cases. In this thesis we propose methods to radically improve the data-efficiency of QD with machine learning, enabling its application to design. In our first contribution, we develop a method of modeling the performance of evolved neural networks used for control and design. The structures of these networks grow and change, making them difficult to model -- but with a new method we are able to estimate their performance based on their heredity, improving data-efficiency by several times. In our second contribution we combine model-based optimization with MAP-Elites, a QD algorithm. A model of performance is created from known designs, and MAP-Elites creates a new set of designs using this approximation. A subset of these designs are the evaluated to improve the model, and the process repeats. We show that this approach improves the efficiency of MAP-Elites by orders of magnitude. Our third contribution integrates generative models into MAP-Elites to learn domain specific encodings. A variational autoencoder is trained on the solutions produced by MAP-Elites, capturing the common “recipe” for high performance. This learned encoding can then be reused by other algorithms for rapid optimization, including MAP-Elites. Throughout this thesis, though the focus of our vision is design, we examine applications in other fields, such as robotics. These advances are not exclusive to design, but serve as foundational work on the integration of QD and machine learning.
Graph drawing with spring embedders employs a V x V computation phase over the graph's vertex set to compute repulsive forces. Here, the efficacy of forces diminishes with distance: a vertex can effectively only influence other vertices in a certain radius around its position. Therefore, the algorithm lends itself to an implementation using search data structures to reduce the runtime complexity. NVIDIA RT cores implement hierarchical tree traversal in hardware. We show how to map the problem of finding graph layouts with force-directed methods to a ray tracing problem that can subsequently be implemented with dedicated ray tracing hardware. With that, we observe speedups of 4x to 13x over a CUDA software implementation.
Unter dem Begriff „Additive Fertigung“ werden alle Verfahren zusammengefasst, die dazu dienen Formteile aufgrund von CAD-Daten schichtweise aufzubauen. Dabei geschieht der Aufbau stets selektiv, entsprechend der durch die CAD-Daten vorgegebenen Positionen. Während für Metalle und Kunststoffe diese Technik bereits in der industriellen Anwendung etabliert ist, befindet sie sich im Bereich der keramischen Werkstoffe noch in einer frühen Entwicklungs- bzw. Anwendungsphase. Um so wichtiger ist es, den aktuellen Stand der Technik und das Potenzial für keramische Bauteile umfassend darzustellen.
In optimization methods that return diverse solution sets, three interpretations of diversity can be distinguished: multi-objective optimization which searches diversity in objective space, multimodal optimization which tries spreading out the solutions in genetic space, and quality diversity which performs diversity maintenance in phenotypic space. We introduce niching methods that provide more flexibility to the analysis of diversity and a simple domain to compare and provide insights about the paradigms. We show that multiobjective optimization does not always produce much diversity, quality diversity is not sensitive to genetic neutrality and creates the most diverse set of solutions, and multimodal optimization produces higher fitness solutions. An autoencoder is used to discover phenotypic features automatically, producing an even more diverse solution set. Finally, we make recommendations about when to use which approach.
Analytische Chemie II
(2020)
Dieses Arbeitsbuch führt durch das erfolgreiche Lehrbuch Skoog/Holler/Crouch, Instrumentelle Analytik und ist vor allem für das Selbststudium konzipiert. In fünf Teilen werden die Vorlesungsinhalte der fortgeschritteneren Analytischen Chemie zusammengefasst und anhand ausgewählter Beispiele erläutert: Mit der Untersuchung von Molekülen befassen sich Massenspektrometrie und Kernresonanzspektroskopie, zudem werden zahlreiche elektroanalytische Methoden wie Potentiometrie, Coulometrie, Amperometrie und Voltammetrie behandelt. In einem Überblick über speziellere Verfahren der Analytik geht es unter anderem ebenso um den Einsatz radioaktiver Substanzen und die Nutzung verschiedener Fluoreszenzverfahren wie um Methoden der Informationsgewinnung in der zunehmend wichtigen elektrochemischen und optischen Sensortechnik sowie deren Automatisierbarkeit. Den Abschluss bildet eine Zusammenfassung verschiedener Prinzipien und Anwendungsmethoden der Statistik, die im Rahmen der Analytik schlichtweg unverzichtbar sind. Um das selbstständige Lernen zu erleichtern, wird dabei in allen Teilen des Buches immer wieder auf essenzielle Abschnitte und Abbildungen des Lehrbuches verwiesen.