@article{VergePoettgenAltherretal.2016,
  author    = {Verg{\´e}, Angela and P{\"o}ttgen, Philipp and Altherr, Lena and Ederer, Thorsten and Pelz, Peter F.},
  title     = {Lebensdauer als Optimierungsziel: Algorithmische Struktursynthese am Beispiel eines hydrostatischen Getriebes},
  series = {O+P - {\"O}lhydraulik und Pneumatik},
  volume    = {60},
  journal   = {O+P - {\"O}lhydraulik und Pneumatik},
  number    = {1-2},
  editor    = {Greuloch, Ivo and Weber, Manfred and Meier, Miles},
  publisher = {Vereinigte Fachverl.},
  address   = {Mainz},
  issn      = {1614-9602},
  pages     = {114 -- 121},
  year      = {2016},
  abstract  = {Verf{\"u}gbarkeit und Nachhaltigkeit sind wichtige Anforderungen bei der Planung langlebiger technischer Systeme. Meist werden bei Lebensdaueroptimierungen lediglich einzelne Komponenten vordefinierter Systeme untersucht. Ob eine optimale Lebensdauer eine g{\"a}nzlich andere Systemvariante bedingt, wird nur selten hinterfragt. Technical Operations Research (TOR) erlaubt es, aus Obermengen technischer Systeme automatisiert die lebensdaueroptimale Systemstruktur auszuw{\"a}hlen. Der Artikel zeigt dies am Beispiel eines hydrostatischen Getriebes.},
  language  = {de}
}
@article{HoerenbaumLaumannProkop2016,
  author    = {H{\"o}renbaum, Christoph and Laumann, J{\"o}rg and Prokop, Ines},
  title     = {Zur Anwendung des Eurocode 3 Teil 1-2 f{\"u}r die Heißbemessung und Anregungen f{\"u}r dessen Novellierung},
  series = {Stahlbau},
  volume    = {85},
  journal   = {Stahlbau},
  number    = {6},
  publisher = {Ernst \& Sohn GmbH},
  address   = {Berlin},
  issn      = {1437-1049},
  doi       = {10.1002/stab.201610382},
  pages     = {429 -- 434},
  year      = {2016},
  abstract  = {Die Eurocodes werden bis zum Jahr 2020 im Europ{\"a}ischen Komitee f{\"u}r Normung (CEN), Technisches Komitee TC 250, {\"u}berarbeitet. In Vorbereitung auf die Eurocode-Novellierung haben engagierte Ingenieure im Rahmen der Initiative PraxisRegeln Bau (PRB) die f{\"u}r die praktische Anwendung h{\"a}ufig genutzten Teile des Eurocode 3 untersucht. Mit dem Ziel, die Praxistauglichkeit des Eurocode 3 f{\"u}r die Heißbemessung zu verbessern, wurden die bestehende Norm EN 1993 Teil 1-2 insbesondere in Bezug auf die Anwenderfreundlichkeit analysiert und Vorschl{\"a}ge f{\"u}r die europ{\"a}ische Novellierung erarbeitet. Die Analysen zeigen, dass durch Umstrukturierungen und durch die Einf{\"u}hrung von Tabellen die Verst{\"a}ndlichkeit und Anwenderfreundlichkeit der Regeln f{\"u}r die Heißbemessung bedeutend erh{\"o}ht werden k{\"o}nnen.},
  language  = {de}
}
@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}
}
@article{NiedermeyerZhouDursunetal.2016,
  author    = {Niedermeyer, Angela and Zhou, Bei and Dursun, G{\"o}zde and Temiz Artmann, Ayseg{\"u}l and Markert, Bernd},
  title     = {An examination of tissue engineered scaffolds in a bioreactor},
  series = {Proceedings in Applied Mathematics and Mechanics PAMM},
  volume    = {16},
  journal   = {Proceedings in Applied Mathematics and Mechanics PAMM},
  number    = {1},
  publisher = {Wiley-VCH},
  address   = {Weinheim},
  issn      = {1617-7061},
  doi       = {10.1002/pamm.201610038},
  pages     = {99 -- 100},
  year      = {2016},
  abstract  = {Replacement tissues, designed to fill in articular cartilage defects, should exhibit the same properties as the native material. The aim of this study is to foster the understanding of, firstly, the mechanical behavior of the material itself and, secondly, the influence of cultivation parameters on cell seeded implants as well as on cell migration into acellular implants. In this study, acellular cartilage replacement material is theoretically, numerically and experimentally investigated regarding its viscoelastic properties, where a phenomenological model for practical applications is developed. Furthermore, remodeling and cell migration are investigated.},
  language  = {en}
}
@article{BarnatKennewegSaldenetal.2016,
  author    = {Barnat, Miriam and Kenneweg, Anne Cornelia and Salden, Peter and Schramm, Christin and Schumann, Marlen},
  title     = {Das ‚Junge Forum' als Format der Nachwuchsf{\"o}rderung. Ein Beitrag zu Professionalisierung, Netzwerkbildung und kooperativem Lernen},
  series = {Lern- und Bildungsprozesse gestalten. Junges Forum Medien und Hochschulentwicklung (JFMH13)},
  journal   = {Lern- und Bildungsprozesse gestalten. Junges Forum Medien und Hochschulentwicklung (JFMH13)},
  publisher = {Waxmann},
  address   = {M{\"u}nster},
  isbn      = {978-3-8309-3397-7},
  doi       = {10.25656/01:16852},
  url       = {http://nbn-resolving.de/urn:nbn:de:0111-pedocs-168520},
  pages     = {269 -- 282},
  year      = {2016},
  abstract  = {Im Mai 2012 fand in Hamburg erstmals das „Junge Forum Hochschul- und Mediendidaktik" statt, im Juni 2013 folgte in Potsdam die zweite Auflage als „Junges Forum Medien und Hochschulentwicklung". 2014 wurde das dritte „Forum" in Dresden und 2015 das vierte in D{\"u}sseldorf ausgerichtet. Das f{\"u}nfte Forum wird 2016 an der Technischen Universit{\"a}t Darmstadt stattfinden. Initiiert und organisiert wird die Veranstaltung stets von jungen Praktikerinnen und Praktikern sowie Forscherinnen und Forschern mit dem Ziel, dem ‚Nachwuchs' in diesem Bereich ein Austauschforum zu geben. Der vorliegende Artikel stellt die konzeptionellen {\"U}berlegungen vor, die hinter diesen Treffen stehen. Er zeigt im R{\"u}ckgriff auf Netzwerktheorie und aktuelle Diskussionen um Professionalisierung und Third Space, wieso f{\"u}r dieses Format ein aktueller Bedarf besteht, und begr{\"u}ndet dann im R{\"u}ckgriff auf didaktische Konzepte auch die methodische Gestaltung der Veranstaltungen. Unsere These: Das kooperative Lernen in Netzwerken ist ein wichtiger Baustein f{\"u}r die Professionalisierung des hochschul- und mediendidaktischen Nachwuchses.},
  language  = {de}
}
@article{OlbertzGroth2016,
  author    = {Olbertz, Klaus and Groth, Alexandra},
  title     = {Arbeitnehmer{\"u}berlassung: Neue gesetzliche Spielregeln ab dem 1.1.2017},
  series = {Gesellschafts- und Wirtschaftsrecht : GWR},
  journal   = {Gesellschafts- und Wirtschaftsrecht : GWR},
  issn      = {1868-1816},
  pages     = {371 -- 374},
  year      = {2016},
  abstract  = {Die bereits mit Koalitionsvertrag vom 16.12.2013 in Aussicht genommene Neuregulierung der Leiharbeit steht nunmehr kurz bevor. Nach diversen Korrekturen des urspr{\"u}nglichen Referentenentwurfes des Bundesministeriums f{\"u}r Arbeit und Soziales liegt seit dem 20.7.2016 der endg{\"u}ltige Entwurf des Gesetzes zur {\"A}nderung des Arbeitnehmer{\"u}berlassungsgesetzes und anderer Gesetze vor (A{\"U}G-E). Die {\"A}nderungen sollen zum 1.1.2017 in Kraft treten. Von gr{\"o}ßeren {\"A}nderungen des Gesetzesentwurfs wird allgemein nicht mehr ausgegangen. F{\"u}r die betriebliche Praxis sollte dies Anlass sein, sich bereits jetzt mit den sich abzeichnenden wichtigsten Neuerungen vertraut zu machen und diese entsprechend umzusetzen, um nachteilige Konsequenzen zu vermeiden.},
  language  = {de}
}
@article{WeberArentMuenchetal.2016,
  author    = {Weber, Tobias and Arent, Jan-Christoph and M{\"u}nch, Lukas and Duhovic, Miro and Balvers, Johannes M.},
  title     = {A fast method for the generation of boundary conditions for thermal autoclave simulation},
  series = {Composites Part A},
  volume    = {88},
  journal   = {Composites Part A},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {1359-835X},
  doi       = {10.1016/j.compositesa.2016.05.036},
  pages     = {216 -- 225},
  year      = {2016},
  abstract  = {Manufacturing process simulation enables the evaluation and improvement of autoclave mold concepts early in the design phase. To achieve a high part quality at low cycle times, the thermal behavior of the autoclave mold can be investigated by means of simulations. Most challenging for such a simulation is the generation of necessary boundary conditions. Heat-up and temperature distribution in an autoclave mold are governed by flow phenomena, tooling material and shape, position within the autoclave, and the chosen autoclave cycle. This paper identifies and summarizes the most important factors influencing mold heat-up and how they can be introduced into a thermal simulation. Thermal measurements are used to quantify the impact of the various parameters. Finally, the gained knowledge is applied to develop a semi-empirical approach for boundary condition estimation that enables a simple and fast thermal simulation of the autoclave curing process with reasonably high accuracy for tooling optimization.},
  language  = {en}
}
@article{SvaneborgKarimiVarzanehHojdisetal.2016,
  author    = {Svaneborg, Carsten and Karimi-Varzaneh, Hossein Ali and Hojdis, Nils and Fleck, Franz and Everaers, Ralf},
  title     = {Multiscale approach to equilibrating model polymer melts},
  series = {Physical Review E},
  volume    = {94},
  journal   = {Physical Review E},
  number    = {032502},
  publisher = {AIP Publishing},
  address   = {Melville, NY},
  issn      = {2470-0053},
  doi       = {10.1103/PhysRevE.94.032502},
  year      = {2016},
  abstract  = {We present an effective and simple multiscale method for equilibrating Kremer Grest model polymer melts of varying stiffness. In our approach, we progressively equilibrate the melt structure above the tube scale, inside the tube and finally at the monomeric scale. We make use of models designed to be computationally effective at each scale. Density fluctuations in the melt structure above the tube scale are minimized through a Monte Carlo simulated annealing of a lattice polymer model. Subsequently the melt structure below the tube scale is equilibrated via the Rouse dynamics of a force-capped Kremer-Grest model that allows chains to partially interpenetrate. Finally the Kremer-Grest force field is introduced to freeze the topological state and enforce correct monomer packing. We generate 15 melts of 500 chains of 10.000 beads for varying chain stiffness as well as a number of melts with 1.000 chains of 15.000 monomers. To validate the equilibration process we study the time evolution of bulk, collective, and single-chain observables at the monomeric, mesoscopic, and macroscopic length scales. Extension of the present method to longer, branched, or polydisperse chains, and/or larger system sizes is straightforward.},
  language  = {en}
}