Fachbereich Maschinenbau und Mechatronik
Refine
Year of publication
Institute
- Fachbereich Maschinenbau und Mechatronik (800) (remove)
Has Fulltext
- no (800) (remove)
Document Type
- Article (463)
- Conference Proceeding (188)
- Book (98)
- Part of a Book (32)
- Report (8)
- Contribution to a Periodical (3)
- Doctoral Thesis (2)
- Patent (2)
- Bachelor Thesis (1)
- Master's Thesis (1)
Keywords
- Gamification (4)
- Additive manufacturing (3)
- Additive Manufacturing (2)
- Digital Twin (2)
- Geschichte (2)
- IO-Link (2)
- L-PBF (2)
- SLM (2)
- additive manufacturing (2)
- fused filament fabrication (2)
The potential of SMART climbing robot combined with a weatherproof cabin for rotor blade maintenance
(2016)
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.
Genussrechte als Instrument der Unternehmensfinanzierung von kommunalen Wohnungs- baugesellschaften
(2016)
Die kommunalen Wohnungsbaugesellschaften und ihr Geschäftszweck bzw. Versorgungsauftrag erfahren aus gesamtgesellschaftlichen Gründen aktuell einen erheblichen Bedeutungszuwachs. Der kommunale Wohnungsbau soll und muss intensiviert werden, da z.B. zunehmend Wohnungsbindungen auslaufen. Bezahlbare Neubauten fehlen speziell Familien, Senioren, Studenten und Flüchtlingen. Um das Investitionsvolumen zu bewältigen, bedarf es nicht nur der Förderkredite, sondern auch der Zuführung „frischen Kapitals“. Der Beitrag stellt dar, dass Genussrechte ein interessantes und oft unbekanntes Finanzierungsinstrument für kommunale Wohnungsbaugesellschaften mit passgenauen Ausgestaltungsmöglichkeiten sind. Mit Hilfe von Genussrechten können die notwendigen Neubau-Investitionen solide mit Quasi-Eigenkapital unterlegt werden und den sozialen Wohnungsbau wiederbeleben. Genussrechte als Hybridkapital lassen sich mangels gesetzlicher Eingrenzung exakt und individuell ebenso an die Bedürfnisse der kommunalen Wohnungsbaugesellschaft anpassen wie an die der Gesellschafter und des jeweiligen Neubauvorhabens.
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.