TY - JOUR A1 - Heuermann, Holger A1 - Schiek, Burkhard T1 - A Fast and Robust Procedure for the Determination of the Scattering Parameters for Network Analyzer Calibration Y1 - 1992 N1 - Precision electromagnetic measurements : conference Paris, 9-12 June 1992 = Conférence sur les Mesures Electromagnétiques de Précision. SP - 373 EP - 374 CY - Paris ER - TY - JOUR A1 - Schmitz, Günter A1 - Roetert, J. A1 - Pischinger, M. T1 - A Fast Intelligent VMEbus System for Combustion Analysis in Engines JF - 19th [nineteenth] International Symposium on Automotive Technology & [and] Automation : with particular reference to cell control and quality management systems for the manufacturing industries; Monte Carlo, 24. - 28. October 1988. Y1 - 1988 SN - 0947719229 SP - 381 EP - 391 PB - Automotive Automation Ltd CY - Croydon 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 - http://dx.doi.org/10.1016/j.compositesa.2016.05.036 SN - 1359-835X VL - 88 SP - 216 EP - 225 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Jacobs, Stephan T1 - A Fault Diagnosis System Using Temporary Relations between Symptoms JF - Operations research '93 : extended abstracts of the 18th Symposium on Operations Research held at the University of Cologne, September 1 - 3, 1993 / Achim Bachem ... (ed.) Y1 - 1994 SN - 379080794X N1 - Symposium on Operations Research ; (18, 1993, Köln) PB - Physica-Verl. CY - Heidelberg ER - TY - JOUR A1 - Helmig, Ilka T1 - A few (hi)stories about french illustration JF - Slanted Y1 - 2015 SN - 1867-6510 IS - 25 (Paris) SP - 210 EP - 217 PB - Slanted Publishers CY - Karlsruhe ER - TY - JOUR A1 - Schöning, Michael Josef A1 - Kloock, Joachim P. A1 - Mourzina, Y. A1 - Schubert, J. T1 - A first step towards a microfabricated thin-film sensor array on the basis of chalcogenide glass materials JF - Sensors. 2 (2002), H. 9 Y1 - 2002 SN - 1424-8220 SP - 356 EP - 365 ER - TY - JOUR A1 - Schiffels, Johannes A1 - Selmer, Thorsten T1 - A flexible toolbox to study protein-assisted metalloenzyme assembly in vitro JF - Biotechnology and Bioengineering Y1 - 2015 U6 - http://dx.doi.org/10.1002/bit.25658 SN - 1097-0290 VL - 112 IS - 11 SP - 2360 EP - 2372 PB - Wiley CY - Weinheim 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 - Stulpe, Werner A1 - Hellwig, K.-E. T1 - A Formulation of Quantum Stochastic Processes and Some of its Properties. Hellwig, K.-E.; Stulpe, W. JF - Foundations of Physics. 13 (1983), H. 7 Y1 - 1983 SN - 1572-9516 SP - 673 EP - 699 ER - TY - JOUR A1 - Höttges, Jörg T1 - A Full Finite Element Solution for the Unsteady Advection-Diffusion Equation JF - Computational methods in water resources : [proceedings of the Ninth International Conference on Computational Methods in Water Resources held at the University of Colorado at Denver, U.S.A., in June 1992] / ed.: T. F. Russell Y1 - 1992 SN - 185312169X N1 - International Conference on Computational Methods in Water Resources ; (9, 1992, Denver, Colo.) PB - Computational Mechanics Publications [u.a.] CY - Southampton [u.a.] ER -