TY - CHAP A1 - Altherr, Lena A1 - Ederer, Thorsten A1 - Lorenz, Ulf A1 - Pelz, Peter F. A1 - Pöttgen, Philipp ED - Lübbecke, Marco E. ED - Koster, Arie ED - Letmathe, Peter ED - Madlener, Reihard ED - Preis, Britta ED - Walther, Grit T1 - Designing a feedback control system via mixed-integer programming T2 - Operations Research Proceedings 2014: Selected Papers of the Annual International Conference of the German Operations Research N2 - Pure analytical or experimental methods can only find a control strategy for technical systems with a fixed setup. In former contributions we presented an approach that simultaneously finds the optimal topology and the optimal open-loop control of a system via Mixed Integer Linear Programming (MILP). In order to extend this approach by a closed-loop control we present a Mixed Integer Program for a time discretized tank level control. This model is the basis for an extension by combinatorial decisions and thus for the variation of the network topology. Furthermore, one is able to appraise feasible solutions using the global optimality gap. KW - Optimal Topology KW - Controller Parameter KW - Level Control System KW - Technical Operation Research KW - Optimal Closed Loop Y1 - 2016 SN - 978-3-319-28695-2 U6 - https://doi.org/10.1007/978-3-319-28697-6_18 SP - 121 EP - 127 PB - Springer CY - Cham ER - TY - CHAP A1 - Nursinski-Stolberg, André A1 - Gangatharan, Kiritharan A1 - Czarnecki, Christian ED - Mayr, Heinrich C. ED - Pinzger, Martin T1 - Development of a subject-oriented reference process model for the telecommunications industry T2 - GI Edition Proceedings Band 259 INFORMATIK 2016 N2 - Generally the usage of reference models can be structured top-down or bottom-up. The practical need of agile change and flexible organizational implementation requires a consistent mapping to an operational level. In this context, well-established reference process models are typically structured top-down. The subject-oriented Business Process Management (sBPM) offers a modeling concept that is structured bottom-up and concentrates on the process actors on an operational level. This paper applies sBPM to the enhanced Telecom Operations Map (eTOM), a well-accepted reference process model in the telecommunications industry. The resulting design artifact is a concrete example for a combination of a bottom-up and top-down developed reference model. The results are evaluated and confirmed in practical context through the involvement of the industry body TMForum. KW - Subject-oriented Business Process Management KW - Reference Process Model KW - eTOM KW - Telecommunications Industry. Y1 - 2016 SN - 9783885796534 SN - 1617-5468 N1 - 26.-30. September 2016, Klagenfurt. SP - 699 EP - 712 PB - Gesellschaft für Informatik e.V. CY - Bonn 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 - https://doi.org/10.48550/arXiv.1607.08754 N1 - Lehrstuhl II für Mathematik, RWTH Aachen University SP - 1 EP - 30 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 - https://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 - 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 - https://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 - 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 - https://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 - CHAP A1 - Hoeveler, Bastian A1 - Janser, Frank T1 - The aerodynamically optimized design of a fan-in-wing duct T2 - Applied Aerodynamics Research Conference 2016, Bristol, GB, Jul 19-21, 2016 Y1 - 2016 SN - 1-85768-371-4 N1 - G1-3-paper.pdf SP - 1 EP - 10 ER - TY - CHAP A1 - Otten, D. A1 - Schmidt, M. A1 - Weber, Tobias T1 - Advances in Determination of Material Parameters for Functional Simulations Based on Process Simulations T2 - SAMPE Europe Conference 16 Liege Y1 - 2016 SN - 978-1-5108-3800-0 SP - 570 EP - 577 ER - TY - CHAP A1 - Weber, Tobias A1 - Tellis, Jane J. A1 - Duhovic, Miro T1 - Characterization of tool-part-interaction an interlaminar friction for manufacturing process simulation T2 - ECCM 17, 17th European Conference on Composite Materials, München, DE, Jun 26-30, 2016 Y1 - 2016 SN - 978-3-00-053387-7 SP - 1 EP - 7 ER - TY - JOUR A1 - Weber, Tobias A1 - Arent, Jan-Christoph A1 - Münch, Lukas A1 - Duhovic, Miro A1 - Balvers, Johannes M. T1 - A fast method for the generation of boundary conditions for thermal autoclave simulation JF - Composites Part A N2 - 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. Y1 - 2016 U6 - https://doi.org/10.1016/j.compositesa.2016.05.036 SN - 1359-835X VL - 88 SP - 216 EP - 225 PB - Elsevier CY - Amsterdam ER -