TY - CHAP A1 - Kallweit, Stephan A1 - Schleupen, Josef A1 - Dahmann, Peter A1 - Bagheri, Mohsen A1 - Engemann, Heiko T1 - Entwicklung eines Kletterroboters zur Diagnose und Instandsetzung von Windenergieanlagen (SMART) T2 - Automatisierung im Fokus von Industrie 4.0 : Tagungsband AALE 2016 ; 13. Fachkonferenz, Lübeck Y1 - 2016 SN - 978-3-8356-7312-0 N1 - AALE-Konferenz <13., 2016, Lübeck> SP - 207 EP - 212 PB - DIV Deutscher Industrieverlag GmbH CY - München ER - TY - CHAP A1 - Kessler, Julia A1 - Balc, Nicolae A1 - Gebhardt, Andreas T1 - Basic research on lattice structures focused on the strut shape and welding beads T2 - Physics Procedia Y1 - 2016 U6 - https://doi.org/10.1016/j.phpro.2016.08.086 SN - 1875-3884 N1 - Laser Assisted Net Shape Engineering 9th International Conference on Photonic Technologies Proceedings of the LANE 2016 VL - Vol. 83 SP - 833 EP - 838 ER - TY - CHAP A1 - Kleine, Harald A1 - Kallweit, Stephan A1 - Michaux, Frank A1 - Havermann, Marc A1 - Olivier, Herbert T1 - PIV Measurement of Shock Wave Diffraction T2 - 18th International Symposium on Applications of Laser Techniques to Fluid Mechanics, 2016, Lissabon Y1 - 2016 SP - 1 EP - 14 ER - TY - JOUR A1 - Koster, Arie A1 - Scheidweiler, Robert A1 - Tieves, Martin T1 - A flow based pruning scheme for enumerative equitable coloring algorithms JF - A flow based pruning scheme for enumerative equitable coloring algorithms N2 - An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest number k such that G admits such equitable k-coloring. We focus on enumerative algorithms for the computation of the equitable coloring number and propose a general scheme to derive pruning rules for them: We show how the extendability of a partial coloring into an equitable coloring can be modeled via network flows. Thus, we obtain pruning rules which can be checked via flow algorithms. Computational experiments show that the search tree of enumerative algorithms can be significantly reduced in size by these rules and, in most instances, such naive approach even yields a faster algorithm. Moreover, the stability, i.e., the number of solved instances within a given time limit, is greatly improved. Since the execution of flow algorithms at each node of a search tree is time consuming, we derive arithmetic pruning rules (generalized Hall-conditions) from the network model. Adding these rules to an enumerative algorithm yields an even larger runtime improvement. Y1 - 2016 U6 - https://doi.org/10.48550/arXiv.1607.08754 N1 - Lehrstuhl II für Mathematik, RWTH Aachen University SP - 1 EP - 30 ER - TY - CHAP A1 - König, Johannes Alexander A1 - Wolf, Martin T1 - A new definition of competence developing games - and a framework to assess them T2 - ACHI 2016 : The Ninth International Conference on Advances in Computer-Human Interactions N2 - There are different types of games that try to make use of the motivation of a gaming situation in learning contexts. This paper introduces the new terminology ‘Competence Developing Game’ (CDG) as an umbrella term for all games with this intention. Based on this new terminology, an assessment framework has been developed and validated in scope of an empirical study. Now, all different types of CDGs can be evaluated according to a defined and uniform set of assessment criteria and, thus, are comparable according to their characteristics and effectiveness. KW - Serious Games KW - Gamification KW - Business Simulations KW - Assessment Y1 - 2016 SN - 978-1-61208-468-8 N1 - Proceeding of the Ninth International Conference on Advances in Computer-Human Interactions (ACHI 2016), Venice. SP - 95 EP - 97 ER - TY - CHAP A1 - Nakagawa, Masaki A1 - Kallweit, Stephan A1 - Michaux, Frank A1 - Hojo, Teppei T1 - Typical Velocity Fields and Vortical Structures around a Formula One Car, based on Experimental Investigations using Particle Image Velocimetry T2 - SAE International Journal of Passenger Cars - Mechanical Systems Y1 - 2016 U6 - https://doi.org/10.4271/2016-01-1611 SN - 1946-4002 ER - TY - JOUR A1 - Pfaff, Raphael A1 - Schmidt, Bernd T1 - Daten in der Cloud - und dann? JF - Deine Bahn N2 - Schienenverkehrssysteme stehen in zunehmendem Wettbewerb, sowohl untereinander als auch mit anderen Verkehrsträgern. Als wichtiger Aspekt zur Steigerung der Kosteneffizienz wird die Digitalisierung des Betriebs und der Fahrzeuge betrachtet. Über eine Prognose der Ausfallwahrscheinlichkeit bzw. Restlebensdauer von Subsystemen können mittels Digitalisierung die Instandhaltungskosten gesenkt werden. Die geringen Fehlerraten im System Bahn machen die Nutzung besonderer Simulationstechniken notwendig. In diesem Beitrag wird gezeigt, wie sich die Subsystemverfügbarkeit aus den beobachteten Fehlerraten der Teilfunktionen vorhersagen lässt. Y1 - 2016 SN - 0948-7263 IS - 6 SP - 50 EP - 55 PB - Bahn-Fachverlag CY - Berlin ER - TY - JOUR A1 - Rieper, Harald A1 - Gebhardt, Andreas A1 - Stucker, Brent T1 - Selective Laser Melting of the Eutectic Silver-Copper Alloy Ag 28 wt % Cu JF - RTejournal - Forum für Rapid Technologie N2 - The aim of this work was to perform a detailed investigation of the use of Selective Laser Melting (SLM) technology to process eutectic silver-copper alloy Ag 28 wt. % Cu (also called AgCu28). The processing occurred with a Realizer SLM 50 desktop machine. The powder analysis (SEM-topography, EDX, particle distribution) was reported as well as the absorption rates for the near-infrared (NIR) spectrum. Microscope imaging showed the surface topography of the manufactured parts. Furthermore, microsections were conducted for the analysis of porosity. The Design of Experiments approach used the response surface method in order to model the statistical relationship between laser power, spot distance and pulse time. KW - SLM KW - Response Surface Method KW - Porositat KW - Eutectic Silver Copper alloy KW - Additive Manufacturing Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?nbn:de:0009-2-44141 SN - 1614-0923 VL - 13 ER - TY - CHAP A1 - Rieper, Harald A1 - Gebhardt, Andreas A1 - Stucker, Brent T1 - Process parameters for Selective Laser Melting of AgCu7 T2 - DDMC, Fraunhofer Direct Digital Manufacturing Conference, 3 Y1 - 2016 SN - 978-3-8396-1001-5 N1 - DDMC, 2016, Fraunhofer Direct Digital Manufacturing Conference, 3rd, Berlin, DE, 2016-03-16 - 2016-03-17 SP - 171 EP - 176 PB - Fraunhofer-Verlag CY - Stuttgart ER - TY - JOUR A1 - Scheidweiler, Robert A1 - Triesch, Eberhard T1 - A note on the duality between matchings and vertex covers in balanced hypergraphs JF - Journal of Combinatorial Optimization N2 - We present a new Min-Max theorem for an optimization problem closely connected to matchings and vertex covers in balanced hypergraphs. The result generalizes Kőnig’s Theorem (Berge and Las Vergnas in Ann N Y Acad Sci 175:32–40, 1970; Fulkerson et al. in Math Progr Study 1:120–132, 1974) and Hall’s Theorem (Conforti et al. in Combinatorica 16:325–329, 1996) for balanced hypergraphs. KW - Hall’s Theorem KW - Koenig’s Theorem KW - Duality KW - Balanced hypergraph KW - Hypergraph KW - Vertex cover KW - Matching Y1 - 2016 U6 - https://doi.org/10.1007/s10878-015-9887-5 SN - 1573-2886 N1 - Lehrstuhl II für Mathematik RWTH Aachen VL - 32 IS - 2 SP - 639 EP - 644 PB - Springer CY - Berlin ER -