@inproceedings{KesslerBalcGebhardt2016, author = {Kessler, Julia and Balc, Nicolae and Gebhardt, Andreas}, title = {Basic research on lattice structures focused on the strut shape and welding beads}, series = {Physics Procedia}, volume = {Vol. 83}, booktitle = {Physics Procedia}, issn = {1875-3884}, doi = {10.1016/j.phpro.2016.08.086}, pages = {833 -- 838}, year = {2016}, language = {en} } @inproceedings{RieperGebhardtStucker2016, author = {Rieper, Harald and Gebhardt, Andreas and Stucker, Brent}, title = {Process parameters for Selective Laser Melting of AgCu7}, series = {DDMC, Fraunhofer Direct Digital Manufacturing Conference, 3}, booktitle = {DDMC, Fraunhofer Direct Digital Manufacturing Conference, 3}, publisher = {Fraunhofer-Verlag}, address = {Stuttgart}, isbn = {978-3-8396-1001-5}, pages = {171 -- 176}, year = {2016}, language = {en} } @inproceedings{KleineKallweitMichauxetal.2016, author = {Kleine, Harald and Kallweit, Stephan and Michaux, Frank and Havermann, Marc and Olivier, Herbert}, title = {PIV Measurement of Shock Wave Diffraction}, series = {18th International Symposium on Applications of Laser Techniques to Fluid Mechanics, 2016, Lissabon}, booktitle = {18th International Symposium on Applications of Laser Techniques to Fluid Mechanics, 2016, Lissabon}, pages = {1 -- 14}, year = {2016}, language = {en} } @inproceedings{SchleupenEngemannBagherietal.2016, author = {Schleupen, Josef and Engemann, Heiko and Bagheri, Mohsen and Kallweit, Stephan}, title = {The potential of SMART climbing robot combined with a weatherproof cabin for rotor blade maintenance}, series = {17th European Conference on Composite Materials - ECCM, Munich, Germany}, booktitle = {17th European Conference on Composite Materials - ECCM, Munich, Germany}, pages = {1 -- 8}, year = {2016}, language = {en} } @article{KosterScheidweilerTieves2016, author = {Koster, Arie and Scheidweiler, Robert and Tieves, Martin}, title = {A flow based pruning scheme for enumerative equitable coloring algorithms}, series = {A flow based pruning scheme for enumerative equitable coloring algorithms}, journal = {A flow based pruning scheme for enumerative equitable coloring algorithms}, doi = {10.48550/arXiv.1607.08754}, pages = {1 -- 30}, year = {2016}, abstract = {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.}, language = {en} } @article{BeckenbachScheidweiler2016, author = {Beckenbach, Isabel and Scheidweiler, Robert}, title = {Perfect ƒ-Matchings and ƒ-Factors in Hypergraphs - A Combinatorial Approach}, series = {Discrete Mathematics}, volume = {240}, journal = {Discrete Mathematics}, number = {10}, publisher = {Elsevier}, address = {Amsterdam}, issn = {2192-7782}, doi = {10.1016/j.disc.2017.05.005}, pages = {2499 -- 2506}, year = {2016}, abstract = {We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard.}, language = {en} } @article{ScheidweilerTriesch2016, author = {Scheidweiler, Robert and Triesch, Eberhard}, title = {A note on the duality between matchings and vertex covers in balanced hypergraphs}, series = {Journal of Combinatorial Optimization}, volume = {32}, journal = {Journal of Combinatorial Optimization}, number = {2}, publisher = {Springer}, address = {Berlin}, issn = {1573-2886}, doi = {10.1007/s10878-015-9887-5}, pages = {639 -- 644}, year = {2016}, abstract = {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.}, language = {en} } @inproceedings{KoenigWolf2016, author = {K{\"o}nig, Johannes Alexander and Wolf, Martin R.}, title = {A new definition of competence developing games - and a framework to assess them}, series = {ACHI 2016 : The Ninth International Conference on Advances in Computer-Human Interactions}, booktitle = {ACHI 2016 : The Ninth International Conference on Advances in Computer-Human Interactions}, isbn = {978-1-61208-468-8}, pages = {95 -- 97}, year = {2016}, abstract = {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.}, language = {en} } @inproceedings{ThurnGebhardt2017, author = {Thurn, Laura and Gebhardt, Andreas}, title = {Arousing Enthusiasm for STEM: Teaching 3D Printing Technology}, series = {Conference Proceedings: New Perspectives in Science Education}, booktitle = {Conference Proceedings: New Perspectives in Science Education}, publisher = {liberiauniversitaria.it}, address = {Padua}, isbn = {978-88-6292-847-2}, pages = {87 -- 92}, year = {2017}, language = {en} } @article{KilicRaatschenKoerfgenetal.2017, author = {Kilic, S. A. and Raatschen, Hans-J{\"u}rgen and K{\"o}rfgen, B. and Apaydin, N. M. and Astaneh-Asl, A.}, title = {FE Model of the Fatih Sultan Mehmet Suspension Bridge Using Thin Shell Finite Elements}, series = {Arabian Journal for Science and Engineering}, volume = {42}, journal = {Arabian Journal for Science and Engineering}, number = {3}, publisher = {Springer Nature}, issn = {2191-4281}, doi = {10.1007/s13369-016-2316-y}, pages = {1103 -- 1116}, year = {2017}, abstract = {This paper presents the results of an eigenvalue analysis of the Fatih Sultan Mehmet Bridge. A high-resolution finite element model was created directly from the available design documents. All physical properties of the structural components were included in detail, so no calibration to the measured data was necessary. The deck and towers were modeled with shell elements. A nonlinear static analysis was performed before the eigenvalue calculation. The calculated natural frequencies and corresponding mode shapes showed good agreement with the available measured ambient vibration data. The calculation of the effective modal mass showed that nine modes had single contributions higher than 5 \% of the total mass. They were in a frequency range up to 1.2 Hz. The comparison of the results for the torsional modes especially demonstrated the advantage of using thin shell finite elements over the beam modeling approach.}, language = {en} }