Fachbereich Maschinenbau und Mechatronik
Refine
Year of publication
- 2024 (5)
- 2023 (5)
- 2022 (3)
- 2021 (3)
- 2020 (9)
- 2019 (8)
- 2018 (13)
- 2017 (11)
- 2016 (8)
- 2015 (8)
- 2014 (9)
- 2013 (3)
- 2012 (11)
- 2011 (10)
- 2010 (8)
- 2009 (8)
- 2008 (15)
- 2007 (9)
- 2006 (9)
- 2005 (13)
- 2004 (12)
- 2003 (16)
- 2002 (16)
- 2001 (16)
- 2000 (5)
- 1999 (15)
- 1998 (19)
- 1997 (16)
- 1996 (24)
- 1995 (21)
- 1994 (17)
- 1993 (12)
- 1992 (12)
- 1991 (9)
- 1990 (4)
- 1989 (7)
- 1988 (7)
- 1987 (8)
- 1986 (6)
- 1985 (11)
- 1984 (12)
- 1983 (11)
- 1982 (4)
- 1981 (7)
- 1979 (4)
- 1978 (2)
- 1977 (2)
- 1974 (4)
- 1973 (2)
- 1972 (4)
- 1971 (3)
- 1970 (1)
Institute
Has Fulltext
- no (477) (remove)
Document Type
- Article (477) (remove)
Keywords
- SLM (4)
- Additive Manufacturing (3)
- additive manufacturing (3)
- Additive manufacturing (2)
- LPBF (2)
- fused filament fabrication (2)
- rapid tooling (2)
- 316L (1)
- 3D nonlinear finite element model (1)
- 802.15.4 (1)
Proteins are important ingredients in food and feed, they are the active components of many pharmaceutical products, and they are necessary, in the form of enzymes, for the success of many technical processes. However, production can be challenging, especially when using heterologous host cells such as bacteria to express and assemble recombinant mammalian proteins. The manufacturability of proteins can be hindered by low solubility, a tendency to aggregate, or inefficient purification. Tools such as in silico protein engineering and models that predict separation criteria can overcome these issues but usually require the complex shape and surface properties of proteins to be represented by a small number of quantitative numeric values known as descriptors, as similarly used to capture the features of small molecules. Here, we review the current status of protein descriptors, especially for application in quantitative structure activity relationship (QSAR) models. First, we describe the complexity of proteins and the properties that descriptors must accommodate. Then we introduce descriptors of shape and surface properties that quantify the global and local features of proteins. Finally, we highlight the current limitations of protein descriptors and propose strategies for the derivation of novel protein descriptors that are more informative.
Alles automatisch : komplexes qualitätsorientiertes Logistikmanagement durch Vollautomatisierung
(1998)
Traditional vulcanization mold manufacturing is complex, costly, and under pressure due to shorter product lifecycles and diverse variations. Additive manufacturing using Fused Filament Fabrication and high-performance polymers like PEEK offer a promising future in this industry. This study assesses the compressive strength of various infill structures (honeycomb, grid, triangle, cubic, and gyroid) when considering two distinct build directions (Z, XY) to enhance PEEK’s economic and resource efficiency in rapid tooling. A comparison with PETG samples shows the behavior of the infill strategies. Additionally, a proof of concept illustrates the application of a PEEK mold in vulcanization. A peak compressive strength of 135.6 MPa was attained in specimens that were 100% solid and subjected to thermal post-treatment. This corresponds to a 20% strength improvement in the Z direction. In terms of time and mechanical properties, the anisotropic grid and isotropic cubic infill have emerged for use in rapid tooling. Furthermore, the study highlights that reducing the layer thickness from 0.15 mm to 0.1 mm can result in a 15% strength increase. The study unveils the successful utilization of a room-temperature FFF-printed PEEK mold in vulcanization injection molding. The parameters and infill strategies identified in this research enable the resource-efficient FFF printing of PEEK without compromising its strength properties. Using PEEK in rapid tooling allows a cost reduction of up to 70% in tool production.
Additive Manufacturing of metal parts by Selective Laser Melting has become a powerful tool for the direct manufacturing of complex parts mainly for the aerospace and medical industry. With the introduction of its desktop machine, Realizer targeted the dental market. The contribution describes the special features of the machine, discusses details of the process and shows manufacturing results focused on metal dental devices.
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.
Assistance systems have been widely adopted in the manufacturing sector to facilitate various processes and tasks in production environments. However, existing systems are mostly equipped with rigid functional logic and do not provide individual user experiences or adapt to their capabilities. This work integrates human factors in assistance systems by adjusting the hardware and instruction presented to the workers’ cognitive and physical demands. A modular system architecture is designed accordingly, which allows a flexible component exchange according to the user and the work task. Gamification, the use of game elements in non-gaming contexts, has been further adopted in this work to provide level-based instructions and personalised feedback. The developed framework is validated by applying it to a manual workstation for industrial assembly routines.
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.