@misc{22216, author = {{Rehnen, Jakob Werner}}, title = {{{Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib}}}, year = {{2021}}, } @inbook{22221, author = {{Blankenfeldt, Maximilian and Müller, Jens and Weinrich, Arndt}}, booktitle = {{Intangibles - Immaterielle Werte}}, editor = {{Vögele, Alexander}}, isbn = {{978-3-406-71601-0}}, publisher = {{C.H.Beck}}, title = {{{Forschung und Entwicklung: Kriterien für die Aktivierung in der Unternehmenspraxis}}}, year = {{2021}}, } @inproceedings{22225, author = {{Ivanjko, Martin and Beck, Robert and Meschut, Gerson and Zweck, Jonas and Richter, Thomas}}, location = {{Bad Nauheim}}, title = {{{Development of an adaptive, sensor-based FDS-robot-system}}}, year = {{2021}}, } @proceedings{22230, editor = {{Sousa Santos, Beatriz and Domik, Gitta}}, isbn = {{ISBN 978-3-03868-132-8 }}, location = {{Vienna}}, publisher = {{Eurographics Association }}, title = {{{EUROGRAPHICS 2021: Education Papers Frontmatter}}}, doi = {{10.2312/EGED.20212000}}, year = {{2021}}, } @inproceedings{22260, author = {{Schmolke, Tobias and Meschut, Gerson}}, location = {{Aachen}}, title = {{{Untersuchung der Dichtheitseigenschaften hybridgefügter Mischbauverbindungen für den Einsatz in Batteriegehäusen für Elektrofahrzeuge}}}, year = {{2021}}, } @misc{22275, author = {{Böhne, Christoph and Tümkaya, Gökhan and Meschut, Gerson}}, booktitle = {{Schweißen und Schneiden}}, number = {{1-2}}, pages = {{26 -- 31}}, title = {{{Reduzierung der Flanschbreiten beim Widerstandspunktschweißen durch Einsatz exzentrischer Elektrodenkappengeometrien}}}, volume = {{73}}, year = {{2021}}, } @inproceedings{22276, author = {{Böhne, Christoph and Meschut, Gerson and Biegler, Max and Rethmeier, Michael}}, location = {{virtual event}}, title = {{{Practical methods for avoidance of liquid metal embrittlement in resistance spot welds of advanced high strength steels}}}, year = {{2021}}, } @inproceedings{22277, author = {{Böhne, Christoph and Biegler, Max and Meschut, Gerson and Rethmeier, Michael}}, location = {{virtual conference}}, title = {{{Application-oriented avoidance of liquid metal embrittlement during resistance spot welding of zinc-coated advanced high strenght steels}}}, year = {{2021}}, } @inproceedings{22280, author = {{Lienen, Julian and Hüllermeier, Eyke and Ewerth, Ralph and Nommensen, Nils}}, booktitle = {{Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR}}, location = {{Online}}, pages = {{14595--14604}}, title = {{{Monocular Depth Estimation via Listwise Ranking using the Plackett-Luce Model}}}, year = {{2021}}, } @inproceedings{22281, author = {{Rotzsche, Dirk and Meschut, Gerson and Fuss, Dennis and Bangel, Martin and Uffelmann, Marcel and Werner, Kai and Oleff, Nils and Günter, Heinrich}}, booktitle = {{Joining in Car Body Engineering 2021}}, location = {{online}}, title = {{{Joining of press-hardened profiles for the mixed-intensive lightweight structural design in electric vehicles}}}, year = {{2021}}, } @inproceedings{22283, abstract = {{ We show how to construct an overlay network of constant degree and diameter $O(\log n)$ in time $O(\log n)$ starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers. If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\log n)$ messages in each round in time $O(\log n)$, w.h.p., which beats the currently best $O(\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19]. Since the problem cannot be solved faster than by using pointer jumping for $O(\log n)$ rounds (which would even require each node to communicate $\Omega(n)$ bits), our algorithm is asymptotically optimal. We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14]. Additionally, we show how our algorithm can be used to efficiently solve graph problems in \emph{hybrid networks} [Augustine et al., SODA'20]. Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution. For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\log n)$, w.h.p. Furthermore, we show how to compute an MIS in time $O(\log d + \log \log n)$, w.h.p., where $d$ is the initial degree of $G$.}}, author = {{Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}}, booktitle = {{Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)}}, editor = {{Censor-Hillel, Keren}}, location = {{Virtual}}, publisher = {{ACM}}, title = {{{Time-Optimal Construction of Overlays}}}, doi = {{10.1145/3465084.3467932}}, year = {{2021}}, } @inproceedings{22287, author = {{Gräßler, Iris and Roesmann, Daniel and Cappello, Chiara and Steffen, Eckhard}}, booktitle = {{Procedia CIRP Design}}, editor = {{Lutters, Eric}}, issn = {{2212-8271}}, location = {{Enschede}}, pages = {{433--438}}, publisher = {{Elsevier}}, title = {{{Skill-based worker assignment in a manual assembly line}}}, doi = {{10.1016/j.procir.2021.05.100}}, year = {{2021}}, } @phdthesis{22301, abstract = {{Im Rahmen der Mischbau-Modulbauweise gewinnt das Fügen von artverschiedenen Werkstoffen mit hyperelastischen Klebstoffsystemen zunehmend an Bedeutung. Um diese auch unter zyklischer Beanspruchung sicher und effizient auszulegen, wird in der vorliegenden Arbeit eine Methode für die spannungsbasierte Lebensdauerberechnung von 2K-PU-Klebverbindungen unter Berücksichtigung von iso- sowie anisotropen Fügeteilwerkstoffen aufgezeigt. Ausgehend von den theoretischen Grundlagen wird das Deformations- und Versagensverhalten einer repräsentativen 2K-PU-Klebverbindung in Grundversuchen mit steifen Fügeteilen unter quasistatischer und zyklischer Belastung experimentell untersucht. Dies bildet die Basis für die Modellierung des Klebschichtversagens in Abhängigkeit der Beanspruchungsmehrachsigkeit. Anhand von im Detail aufgebauten FE-Modellen der untersuchten Verbindungen werden die notwendigen Ansatzparameter identifiziert, verifiziert und in einer Sensitivitätsanalyse hinsichtlich der Klebschichtdiskretisierung in Bezug auf ihre Robustheit und einfache Anwendbarkeit bewertet. Eine abschließende Validierung der entwickelten Methode erfolgt mit zunehmender Komplexität an technologischen und bauteilähnlichen Verbindungsproben. Die Gegenüberstellung der numerisch berechneten mit der experimentellen Anriss- und Versagenslebensdauer belegt ein hohes Maß an Sicherheit und trägt somit zum Vertrauen in die Fügetechnologie Kleben bei.}}, author = {{Çavdar, Serkan}}, isbn = {{978-3-8440-8084-1}}, keywords = {{Lebensdauerberechnung, numerische Lebensdauerberechnung, Polyurethan-Klebstoffe, semistrukturelle Klebverbindungen, hyperelastische Klebverbindungen, Hyperelastizität, mehrachsige Klebschichtbeanspruchung, zyklische Klebschichtbeanspruchung}}, pages = {{138}}, publisher = {{Shaker Verlag}}, title = {{{Spannungsbasierte Lebensdauerberechnung von zyklisch beanspruchten Klebverbindungen mit hyperelastischem Deformationsverhalten}}}, doi = {{10.2370/9783844080841}}, volume = {{152}}, year = {{2021}}, } @misc{22304, author = {{Schott, Stefan}}, title = {{{Android App Analysis Benchmark Case Generation}}}, year = {{2021}}, } @inbook{22306, author = {{Koldewey, Christian and Gausemeier, Jürgen and Dumitrescu, Roman and Evers, Hans-Heinrich and Frank, Maximilian and Reinhold, Jannik}}, booktitle = {{Digitalization}}, editor = {{Schallmo, Daniel R. and Tidd, Joseph}}, pages = {{205--237}}, publisher = {{Springer Nature}}, title = {{{Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization}}}, doi = {{https://doi.org/10.1007/978-3-030-69380-0_12#DOI}}, year = {{2021}}, } @inproceedings{22307, author = {{Eckertz, Daniel and Möller, Marus and Anacker, Harald and Dumitrescu, Roman}}, booktitle = {{ Proceedings of the International Conference on Information and Computer Technologies}}, location = {{Kahului, Hawaii, United States of America}}, title = {{{Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies}}}, year = {{2021}}, } @inproceedings{22309, abstract = {{Approximate computing (AC) has acquired significant maturity in recent years as a promising approach to obtain energy and area-efficient hardware. Automated approximate accelerator synthesis involves a great deal of complexity on the size of design space which exponentially grows with the number of possible approximations. Design space exploration of approximate accelerator synthesis is usually targeted via heuristic-based search methods. The majority of existing frameworks prune a large part of the design space using a greedy-based approach to keep the problem tractable. Therefore, they result in inferior solutions since many potential solutions are neglected in the pruning process without the possibility of backtracking of removed approximate instances. In this paper, we address the aforementioned issue by adopting Monte Carlo Tree Search (MCTS), as an efficient stochastic learning-based search algorithm, in the context of automated synthesis of approximate accelerators. This enables the synthesis frameworks to deeply subsamples the design space of approximate accelerator synthesis toward most promising approximate instances based on the required performance goals, i.e., power consumption, area, or/and delay. We investigated the challenges of providing an efficient open-source framework that benefits analytical and search-based approximation techniques simultaneously to both speed up the synthesis runtime and improve the quality of obtained results. Besides, we studied the utilization of machine learning algorithms to improve the performance of several critical steps, i.e., accelerator quality testing, in the synthesis framework. The proposed framework can help the community to rapidly generate efficient approximate accelerators in a reasonable runtime.}}, author = {{Awais, Muhammad and Platzner, Marco}}, booktitle = {{Proceedings of IEEE Computer Society Annual Symposium on VLSI}}, keywords = {{Approximate computing, Design space exploration, Accelerator synthesis}}, location = {{Tampa, Florida USA (Virtual)}}, pages = {{384--389}}, publisher = {{IEEE}}, title = {{{MCTS-Based Synthesis Towards Efficient Approximate Accelerators}}}, year = {{2021}}, } @article{22447, abstract = {{Die Additive Fertigung bietet ein hohes Maß an Gestaltungsfreiheit und ermöglicht die wirt-schaftliche Nutzung von konventionell schwer zu verarbeitenden Materialien. Diese Merk-male ermöglichen neuartige Lösungsansätze bei Funktionsbauteilen in fast allen Anwen-dungsbereichen. Dieses Potential kann auch im Elektromaschinenbau genutzt werden. Am Bespiel des Rotors einer permanentmagneterregten Synchronmaschine (PMSM) lassen sich die Herausforderungen und Möglichkeiten exemplarisch beschreiben.}}, author = {{Magerkohl, Sebastian and Zimmer, Detmar and Tasche, Lennart and Schaper, Mirko and Urbanek, Stefan and Ponick, Bernd}}, isbn = {{0722-8546 (eISSN: 2747-7991)}}, journal = {{antriebstechnik - Zeitschrift für Konstruktion, Entwicklung und Anwendung von Antrieben und Steuerungen }}, number = {{6}}, pages = {{36--43}}, publisher = {{Vereinigte Fachverlage GmbH}}, title = {{{Funktionsoptimierte AM-Gestaltung eines E-Rotors}}}, volume = {{60}}, year = {{2021}}, } @inproceedings{22448, author = {{Kiesel, Johannes and Spina, Damiano and Wachsmuth, Henning and Stein, Benno}}, booktitle = {{Proceedings of the 2021 Conversational User Interfaces Conference}}, pages = {{1--5}}, title = {{{The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases}}}, year = {{2021}}, } @article{22449, author = {{Alshomary, Milad and Wachsmuth, Henning}}, journal = {{Patterns}}, number = {{6}}, title = {{{Toward Audience-aware Argument Generation}}}, volume = {{2}}, year = {{2021}}, }