@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} } @book{Feuerriegel2016, author = {Feuerriegel, Uwe}, title = {Verfahrenstechnik mit EXCEL: Verfahrenstechnische Berechnungen effektiv durchf{\"u}hren und professionell dokumentieren}, publisher = {Springer Fachmedien}, address = {Wiesbaden}, isbn = {978-3-658-02902-9}, doi = {10.1007/978-3-658-02903-6}, pages = {XVII, 381 Seiten}, year = {2016}, language = {de} } @book{Gebhardt2016, author = {Gebhardt, Andreas}, title = {Additive Fertigungsverfahren : Additive Manufacturing und 3D-Drucken f{\"u}r Prototyping - Tooling - Produktion}, edition = {5. aktualisierte und erweiterte Auflage}, publisher = {Hanser}, address = {M{\"u}nchen}, isbn = {978-3-446-44401-0 ; 978-3-446-44539-0}, doi = {10.3139/9783446445390}, pages = {XXIV, 711 S. : zahlr. Ill. u. graph. Darst.}, year = {2016}, language = {de} } @book{GebhardtHoetter2016, author = {Gebhardt, Andreas and H{\"o}tter, Jan-Steffen}, title = {Additive manufacturing : 3D printing for prototyping and manufacturing}, publisher = {Hanser Publishers}, address = {Munich}, isbn = {978-1-56990-582-1 ; 978-1-56990-583-8}, pages = {591 S.}, year = {2016}, language = {en} } @book{GebhardtKesslerThurn2016, author = {Gebhardt, Andreas and Kessler, Julia and Thurn, Laura}, title = {3D-Drucken: Grundlagen und Anwendungen des additive manufacturing (AM)}, edition = {2., neu bearbeitete und erweiterte Auflage}, publisher = {Hanser}, address = {M{\"u}nchen}, isbn = {978-3-446-44672-4}, doi = {10.3139/9783446448452}, pages = {XVI, 218 Seiten}, year = {2016}, language = {de} } @incollection{KallweitGottschalkWalenta2016, author = {Kallweit, Stephan and Gottschalk, Michael and Walenta, Robert}, title = {ROS based safety concept for collaborative robots in industrial applications}, series = {Advances in robot design and intelligent control : proceedings of the 24th International Conference on Robotics in Alpe-Adria-Danube Region (RAAD). (Advances in intelligent systems and computing ; 371)}, booktitle = {Advances in robot design and intelligent control : proceedings of the 24th International Conference on Robotics in Alpe-Adria-Danube Region (RAAD). (Advances in intelligent systems and computing ; 371)}, publisher = {Springer}, address = {Cham}, organization = {International Conference on Robotics in Alpe-Adria-Danube Region <24, 2015, Bucharest>}, isbn = {978-3-319-21289-0 (Print) ; 978-3-319-21290-6 (E-Book)}, doi = {10.1007/978-3-319-21290-6_3}, pages = {27 -- 35}, year = {2016}, abstract = {The production and assembly of customized products increases the demand for flexible automation systems. One approach is to remove the safety fences that separate human and industrial robot to combine their skills. This collaboration possesses a certain risk for the human co-worker, leading to numerous safety concepts to protect him. The human needs to be monitored and tracked by a safety system using different sensors. The proposed system consists of a RGBD camera for surveillance of the common working area, an array of optical distance sensors to compensate shadowing effects of the RGBD camera and a laser range finder to detect the co-worker when approaching the work cell. The software for collision detection, path planning, robot control and predicting the behaviour of the co-worker is based on the Robot Operating System (ROS). A first prototype of the work cell shows that with advanced algorithms from the field of mobile robotics a very flexible safety concept can be realized: the robot not simply stops its movement when detecting a collision, but plans and executes an alternative path around the obstacle.}, language = {en} } @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{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} } @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} } @inproceedings{KoenigWolf2016, author = {K{\"o}nig, Johannes Alexander and Wolf, Martin}, 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} }