TY - BOOK A1 - Lauth, Jakob T1 - Physikalische Chemie, 5: Elektrochemie Y1 - 2016 SN - 978-3-662-47559-1 PB - Springer CY - Berlin ER - TY - CHAP A1 - Heuermann, Holger A1 - Sadeghfam, Arash T1 - Analog Amplitude-Locked Loop Circuit to Support RF Energy Solutions T2 - IEEE MTT-S International Microwave Symposium Digest Y1 - 2016 SN - 978-150900698-4 U6 - http://dx.doi.org/10.1109/MWSYM.2016.7540092 ER - TY - JOUR A1 - Niedermeyer, Angela A1 - Zhou, Bei A1 - Dursun, Gözde A1 - Temiz Artmann, Aysegül A1 - Markert, Bernd T1 - An examination of tissue engineered scaffolds in a bioreactor JF - Proceedings in Applied Mathematics and Mechanics PAMM N2 - 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. Y1 - 2016 U6 - http://dx.doi.org/10.1002/pamm.201610038 SN - 1617-7061 N1 - Joint Annual Meeting of DMV and GAMM 2016, 87th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM) and Deutsche Mathematiker-Vereinigung (DMV), Braunschweig, DE, Mar 7-11, 2016 VL - 16 IS - 1 SP - 99 EP - 100 PB - Wiley-VCH CY - Weinheim ER - TY - JOUR A1 - Scheidweiler, Robert A1 - Triesch, Eberhard T1 - A note on the duality between matchings and vertex covers in balanced hypergraphs JF - Journal of Combinatorial Optimization N2 - 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. KW - Hall’s Theorem KW - Koenig’s Theorem KW - Duality KW - Balanced hypergraph KW - Hypergraph KW - Vertex cover KW - Matching Y1 - 2016 U6 - http://dx.doi.org/10.1007/s10878-015-9887-5 SN - 1573-2886 N1 - Lehrstuhl II für Mathematik RWTH Aachen VL - 32 IS - 2 SP - 639 EP - 644 PB - Springer CY - Berlin ER - TY - JOUR A1 - Beckenbach, Isabel A1 - Scheidweiler, Robert T1 - Perfect ƒ-Matchings and ƒ-Factors in Hypergraphs - A Combinatorial Approach JF - Discrete Mathematics N2 - 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. Y1 - 2016 U6 - http://dx.doi.org/10.1016/j.disc.2017.05.005 SN - 2192-7782 N1 - Als Volltext auch bei ZIB (Zuse Institute Berlin) VL - 240 IS - 10 SP - 2499 EP - 2506 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Koster, Arie A1 - Scheidweiler, Robert A1 - Tieves, Martin T1 - A flow based pruning scheme for enumerative equitable coloring algorithms JF - A flow based pruning scheme for enumerative equitable coloring algorithms N2 - 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. Y1 - 2016 U6 - http://dx.doi.org/10.48550/arXiv.1607.08754 N1 - Lehrstuhl II für Mathematik, RWTH Aachen University SP - 1 EP - 30 ER - TY - JOUR A1 - Levers, A. A1 - Staat, Manfred A1 - Laack, Walter van T1 - Analysis of the long-term effect of the MBST® nuclear magnetic resonance therapy on gonarthrosis JF - Orthopedic Practice Y1 - 2016 VL - 47 IS - 11 SP - 521 EP - 528 ER - TY - BOOK A1 - Gebhardt, Andreas A1 - Kessler, Julia A1 - Thurn, Laura T1 - 3D-Drucken: Grundlagen und Anwendungen des additive manufacturing (AM) Y1 - 2016 SN - 978-3-446-44672-4 U6 - http://dx.doi.org/10.3139/9783446448452 PB - Hanser CY - München ET - 2., neu bearbeitete und erweiterte Auflage ER - TY - CHAP A1 - Tran, Ngoc Trinh A1 - Tran, Thanh Ngoc A1 - Matthies, Hermann G. A1 - Stavroulakis, Georgios Eleftherios A1 - Staat, Manfred T1 - FEM Shakedown of uncertain structures by chance constrained programming T2 - PAMM Proceedings in Applied Mathematics and Mechanics Y1 - 2016 U6 - http://dx.doi.org/10.1002/pamm.201610346 SN - 1617-7061 N1 - Special Issue: Joint 87th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM) and Deutsche Mathematiker-Vereinigung VL - 16 IS - 1 SP - 715 EP - 716 ER - TY - JOUR A1 - König, Johannes Alexander A1 - Völker, Veronika A1 - Wolf, Martin A1 - Schuba, Marko T1 - Gamified Hacking Offence Simulation-based Training (GHOST) JF - Crisis Prevention Y1 - 2016 VL - 2016 IS - 3 SP - 44 EP - 46 PB - Beta CY - Bonn ER -