TY - JOUR A1 - Topçu, Murat A1 - Madabhushi, Gopal S.P. A1 - Staat, Manfred T1 - A generalized shear-lag theory for elastic stress transfer between matrix and fibres having a variable radius JF - International Journal of Solids and Structures N2 - A generalized shear-lag theory for fibres with variable radius is developed to analyse elastic fibre/matrix stress transfer. The theory accounts for the reinforcement of biological composites, such as soft tissue and bone tissue, as well as for the reinforcement of technical composite materials, such as fibre-reinforced polymers (FRP). The original shear-lag theory proposed by Cox in 1952 is generalized for fibres with variable radius and with symmetric and asymmetric ends. Analytical solutions are derived for the distribution of axial and interfacial shear stress in cylindrical and elliptical fibres, as well as conical and paraboloidal fibres with asymmetric ends. Additionally, the distribution of axial and interfacial shear stress for conical and paraboloidal fibres with symmetric ends are numerically predicted. The results are compared with solutions from axisymmetric finite element models. A parameter study is performed, to investigate the suitability of alternative fibre geometries for use in FRP. KW - Natural fibres KW - Polymer-matrix composites KW - Biocomposites KW - Stress concentrations KW - Finite element analysis Y1 - 2022 U6 - https://doi.org/10.1016/j.ijsolstr.2022.111464 SN - 0020-7683 VL - 239–240 IS - Art. No. 111464 PB - Elsevier CY - New York, NY ER - TY - JOUR A1 - Heuermann, Holger A1 - Schiek, Burkhard T1 - A Generalization of the Txx Network Analyzer Self-Calibration Procedure JF - Conference proceedings : monday 24th to thursday 27th august 1992, Helsinki University of Technology, Espoo, Finland ; [the international conference and exhibition designed for the Microwave Community]. Vol. 2 Y1 - 1992 SN - 0-946821-77-1 N1 - European Microwave Conference <22, 1992, Espoo> ; Teknillinen Korkeakoulu SP - 907 EP - 912 PB - Microwave Exhibitions and Publishers CY - Tunbridge Wells ER - TY - JOUR A1 - Ferrein, Alexander A1 - Schiffer, Stefan A1 - Lakemeyer, Gerhard T1 - A Fuzzy Set Semantics for Qualitative Fluents in the Situation Calculus / Ferrein, Alexander ; Schiffer, Stefan ; Lakemeyer, Gerhard JF - Intelligent Robotics and Applications : First International Conference, ICIRA 2008 Wuhan, China, October 15-17, 2008 Proceedings, Part I Y1 - 2008 N1 - Lecture Notes in Computer Science ; 5314 SP - 498 EP - 509 PB - Springer CY - Berlin 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 - 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 - 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 - Schiffels, Johannes A1 - Selmer, Thorsten T1 - A flexible toolbox to study protein-assisted metalloenzyme assembly in vitro JF - Biotechnology and Bioengineering Y1 - 2015 U6 - https://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 - 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 - 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 - 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 -