@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}
}
@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}
}
@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}
}
@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}
}
@article{WollertBooke2016,
  author    = {Wollert, J{\"o}rg and Booke, Andreas},
  title     = {IoT von der Stange},
  series = {elektronik},
  journal   = {elektronik},
  number    = {21 (2016)},
  publisher = {WEKA-Fachmedien},
  address   = {M{\"u}nchen},
  pages     = {30 -- 37},
  year      = {2016},
  abstract  = {Heute sollte am besten jedes Ger{\"a}t in die große Rechnerwolke eingebettet werden. Doch so einfach ist das nicht, denn Cloud ist viel mehr als nur das Internet der Dinge. Als Anwender muss man sich also fragen, welche Dienste man m{\"o}chte und welchem Anbieter man sein Vertrauen schenkt.},
  language  = {de}
}
@book{Schmidt2016,
  author    = {Schmidt, Bernd},
  title     = {Grundlagen der Elektrotechnik und Elektronik f{\"u}r Ingenieure der Schienenfahrzeugtechnik und anderer Fachrichtungen},
  edition   = {1. Aufl.},
  publisher = {B. Schmidt, Fachverlag f{\"u}r Elektro- und Informationstechnik},
  address   = {Bielefeld},
  isbn      = {978-3-944131-02-3},
  pages     = {XXIII, 255 Seiten : Illustrationen},
  year      = {2016},
  language  = {de}
}
@article{PfaffSchmidt2016,
  author    = {Pfaff, Raphael and Schmidt, Bernd},
  title     = {Daten in der Cloud - und dann?},
  series = {Deine Bahn},
  journal   = {Deine Bahn},
  number    = {6},
  publisher = {Bahn-Fachverlag},
  address   = {Berlin},
  issn      = {0948-7263},
  pages     = {50 -- 55},
  year      = {2016},
  abstract  = {Schienenverkehrssysteme stehen in zunehmendem Wettbewerb, sowohl untereinander als auch mit anderen Verkehrstr{\"a}gern. Als wichtiger Aspekt zur Steigerung der Kosteneffizienz wird die Digitalisierung des Betriebs und der Fahrzeuge betrachtet. {\"U}ber eine Prognose der Ausfallwahrscheinlichkeit bzw. Restlebensdauer von Subsystemen k{\"o}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{\"u}gbarkeit aus den beobachteten Fehlerraten der Teilfunktionen vorhersagen l{\"a}sst.},
  language  = {de}
}
@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}
}