@article{16142,
  abstract     = {{<jats:p>The increasing use of hybrid materials requires efficient manufacturing processes. With the concept of the intrinsic hybrids the shaping or forming of the part is combined with the hybridization in the same process step and thereby the same tool. Hence new tooling concepts, which realise the process requirements, are necessary. This paper describes tooling concepts and design methods for the manufacturing of intrinsic hybrid parts. Different solutions for rotational and planar parts with thermosetting or thermoplastic matrix material are presented. Additionally the integration of inserts in such tools is discussed. Finally the main challenges for the design of tools for intrinsic hybrids will be presented.</jats:p>}},
  author       = {{Wang, Zheng and Riemer, Matthias and Koch, Simon Frederik and Barfuss, Daniel and Grützner, Raik and Augenthaler, Florian and Schwennen, Jan}},
  issn         = {{1662-8985}},
  journal      = {{Advanced Materials Research}},
  pages        = {{247--254}},
  title        = {{{Intrinsic Hybrid Composites for Lightweight Structures: Tooling Technologies}}},
  doi          = {{10.4028/www.scientific.net/amr.1140.247}},
  year         = {{2016}},
}

@article{16144,
  abstract     = {{<jats:p>This publication describes new process chain approaches for the manufacturing of intrinsic hybrid composites for lightweight structures. The introduced process chains show a variety of different part and sample types, like insert technology for fastening of hollow hybrid shafts and profiles. Another field of research are hybrid laminates with different layers of carbon fiber reinforced plastics stacked with aluminum or steel sheets. The derived process chains base on automated fiber placement, resin transfer molding, deep drawing, rotational molding and integral tube blow molding.</jats:p>}},
  author       = {{Koch, Simon Frederik and Barfuss, Daniel and Bobbert, Mathias and Groß, Lukas and Grützner, Raik and Riemer, Matthias and Stefaniak, Daniel and Wang, Zheng}},
  issn         = {{1662-8985}},
  journal      = {{Advanced Materials Research}},
  pages        = {{239--246}},
  title        = {{{Intrinsic Hybrid Composites for Lightweight Structures: New Process Chain Approaches}}},
  doi          = {{10.4028/www.scientific.net/amr.1140.239}},
  year         = {{2016}},
}

@phdthesis{16145,
  author       = {{Reuter, C.}},
  isbn         = {{978-3-8440-4797-4}},
  title        = {{{Versagensverhalten und Energieabsorptionssimulation von Faser-Kunststoff-Verbunden und Aluminium-FKV-Hybridwerkstoffen}}},
  year         = {{2016}},
}

@article{16146,
  author       = {{Grienitz, Volker and Tröster, Thomas and Meiners, Stefan}},
  issn         = {{0001-2785}},
  journal      = {{ATZ - Automobiltechnische Zeitschrift}},
  pages        = {{36--41}},
  title        = {{{Technikevaluation für die generative Fertigung eines Serien-Radträgers}}},
  doi          = {{10.1007/s35148-016-0090-5}},
  year         = {{2016}},
}

@misc{162,
  author       = {{Zhang, Guangli}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions}}},
  year         = {{2016}},
}

@inproceedings{16264,
  author       = {{Wang, Z. and Tröster, Thomas}},
  location     = {{Kaiserslautern}},
  title        = {{{Parameterstudien an intrinsisch hergestellten Metall-FVK-Hybridstrukturen mittels RTM-Verfahren}}},
  year         = {{2016}},
}

@inproceedings{16266,
  author       = {{Striewe, Jan André and Reuter, C. and Oberkönig, C. and Lauter, C. and Tröster, Thomas}},
  location     = {{Merseburg}},
  title        = {{{Experimentelle Untersuchung und Analyse des Energieabsorptionsverhaltens axial belasteter Faserverbundkunststoffe}}},
  year         = {{2016}},
}

@inproceedings{16267,
  author       = {{Striewe, Jan André and Lauter, C. and Reuter, C. and Tröster, Thomas}},
  location     = {{Porto}},
  title        = {{{Manufacturing and Crashworthiness of Fabric Reinforced Thermoplastic Composites}}},
  year         = {{2016}},
}

@inproceedings{16268,
  author       = {{Striewe, Jan André and Reuter, C. and Lauter, C. and Tröster, Thomas}},
  location     = {{Porto}},
  title        = {{{Innovative largescale Production Process for multilayered Sheet-Metal-FRP-Structures}}},
  year         = {{2016}},
}

@inproceedings{16269,
  author       = {{Wang, Z. and Lauter, C. and Löseke, Julian and Tröster, Thomas}},
  location     = {{Lisbon, Portugal}},
  title        = {{{CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications}}},
  year         = {{2016}},
}

@inproceedings{1627,
  author       = {{Gutierrez, P. A. Aranda and Rojas, E. and Schwabe, A. and Stritzke, C. and Doriguzzi-Corin, R. and Leckey, A. and Petralia, G. and Marsico, A. and Phemius, K. and Tamurejo, S.}},
  booktitle    = {{2016 IEEE NetSoft Conference and Workshops (NetSoft)}},
  isbn         = {{9781467394864}},
  publisher    = {{IEEE}},
  title        = {{{NetIDE: All-in-one framework for next generation, composed SDN applications}}},
  doi          = {{10.1109/netsoft.2016.7502408}},
  year         = {{2016}},
}

@article{16270,
  author       = {{Hickmann, T. and Ahlers, Dominik and Tröster, Thomas}},
  journal      = {{Der Stahlformenbauer }},
  number       = {{5}},
  publisher    = {{Technischer Fachverlag Möller}},
  title        = {{{Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten}}},
  year         = {{2016}},
}

@proceedings{163,
  editor       = {{Dressler, Falko and Meyer auf der Heide, Friedhelm}},
  location     = {{Paderborn, Germany}},
  publisher    = {{ACM}},
  title        = {{{Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}}},
  doi          = {{10.1145/2942358}},
  year         = {{2016}},
}

@inproceedings{1630,
  author       = {{Marsico, Antonio and Doriguzzi-Corin, Roberto and Gerola, Matteo and Siracusa, Domenico and Schwabe, Arne}},
  booktitle    = {{NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}},
  isbn         = {{9781509002238}},
  publisher    = {{IEEE}},
  title        = {{{A non-disruptive automated approach to update SDN applications at runtime}}},
  doi          = {{10.1109/noms.2016.7502946}},
  year         = {{2016}},
}

@inproceedings{1632,
  author       = {{Doriguzzi-Corin, Roberto and Siracusa, Domenico and Salvador, Elio and Schwabe, Arne}},
  booktitle    = {{NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}},
  isbn         = {{9781509002238}},
  publisher    = {{IEEE}},
  title        = {{{Empowering network operating systems with memory management techniques}}},
  doi          = {{10.1109/noms.2016.7502889}},
  year         = {{2016}},
}

@article{16323,
  author       = {{Vollmers, Nora Jenny and Müller, Patrick and Hoffmann, Alexander and Herres-Pawlis, Sonja and Rohrmüller, Martin and Schmidt, Wolf Gero and Gerstmann, Uwe and Bauer, Matthias}},
  issn         = {{0020-1669}},
  journal      = {{Inorganic Chemistry}},
  pages        = {{11694--11706}},
  title        = {{{Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State}}},
  doi          = {{10.1021/acs.inorgchem.6b01704}},
  year         = {{2016}},
}

@inproceedings{16351,
  abstract     = {{Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.
}},
  author       = {{Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf}},
  booktitle    = {{Algorithm Engineering}},
  editor       = {{Kliemann, Lasse and Sanders, Peter}},
  pages        = {{226--244}},
  publisher    = {{Springer}},
  title        = {{{Algorithm Engineering Aspects of Real-Time Rendering Algorithms}}},
  doi          = {{10.1007/978-3-319-49487-6_7 }},
  volume       = {{9220}},
  year         = {{2016}},
}

@inproceedings{16358,
  author       = {{Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}},
  booktitle    = {{Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}},
  publisher    = {{Springer}},
  title        = {{{The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}}},
  doi          = {{10.1007/978-3-319-53058-1_5 }},
  year         = {{2016}},
}

@inproceedings{16359,
  abstract     = {{In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2).}},
  author       = {{Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  pages        = {{301--312}},
  publisher    = {{ACM}},
  title        = {{{Asymptotically Optimal Gathering on a Grid}}},
  doi          = {{10.1145/2935764.2935789}},
  year         = {{2016}},
}

@inproceedings{16360,
  abstract     = {{We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. }},
  author       = {{Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}},
  pages        = {{689--699}},
  publisher    = {{IEEE}},
  title        = {{{Gathering a Closed Chain of Robots on a Grid}}},
  doi          = {{10.1109/IPDPS.2016.51}},
  year         = {{2016}},
}