Refine
Year of publication
Document Type
- Article (147)
- Conference Proceeding (107)
- Book (8)
- Part of a Book (8)
- Lecture (3)
- Bachelor Thesis (1)
- Contribution to a Periodical (1)
- Doctoral Thesis (1)
- Master's Thesis (1)
- Report (1)
Language
- English (278) (remove)
Keywords
- Gamification (4)
- Additive manufacturing (3)
- additive manufacturing (3)
- Actuators (2)
- Additive Manufacturing (2)
- Aktor (2)
- Aktoren (2)
- Brake set-up (2)
- Digital Twin (2)
- Freight rail (2)
- IO-Link (2)
- L-PBF (2)
- Microfabrication (2)
- Rapid Prototyping (2)
- Rapid prototyping (2)
- Sensor (2)
- Sensoren (2)
- Sensores (2)
- factory planning (2)
- fused filament fabrication (2)
Institute
- Fachbereich Maschinenbau und Mechatronik (278) (remove)
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.
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.
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.
The aim of this work was to perform a detailed investigation of the use of Selective Laser Melting (SLM) technology to process eutectic silver-copper alloy Ag 28 wt. % Cu (also called AgCu28). The processing occurred with a Realizer SLM 50 desktop machine. The powder analysis (SEM-topography, EDX, particle distribution) was reported as well as the absorption rates for the near-infrared (NIR) spectrum. Microscope imaging showed the surface topography of the manufactured parts. Furthermore, microsections were conducted for the analysis of porosity. The Design of Experiments approach used the response surface method in order to model the statistical relationship between laser power, spot distance and pulse time.
The potential of SMART climbing robot combined with a weatherproof cabin for rotor blade maintenance
(2016)
There are different types of games that try to make use of the motivation of a gaming situation in learning contexts. This paper introduces the new terminology ‘Competence Developing Game’ (CDG) as an umbrella term for all games with this intention. Based on this new terminology, an assessment framework has been developed and validated in scope of an empirical study. Now, all different types of CDGs can be evaluated according to a defined and uniform set of assessment criteria and, thus, are comparable according to their characteristics and effectiveness.
We present an electromechanically coupled Finite Element model for cardiac tissue. It bases on the mechanical model for cardiac tissue of Hunter et al. that we couple to the McAllister-Noble-Tsien electrophysiological model of purkinje fibre cells. The corresponding system of ordinary differential equations is implemented on the level of the constitutive equations in a geometrically and physically nonlinear version of the so-called edge-based smoothed FEM for plates. Mechanical material parameters are determined from our own pressure-deflection experimental setup. The main purpose of the model is to further examine the experimental results not only on mechanical but also on electrophysiological level down to ion channel gates. Moreover, we present first drug treatment simulations and validate the model with respect to the experiments.