Refine
Year of publication
- 2016 (251) (remove)
Document Type
- Article (113)
- Conference Proceeding (71)
- Part of a Book (27)
- Book (22)
- Other (9)
- Report (5)
- Doctoral Thesis (3)
- Patent (1)
Has Fulltext
- no (251) (remove)
Keywords
- Technical Operations Research (2)
- Additive Manufacturing (1)
- Annulus Fibrosus (1)
- Assessment (1)
- Asymptotic efficiency (1)
- Bacillus atrophaeus (1)
- Balance (1)
- Balanced hypergraph (1)
- Brandfall (1)
- Building Systems (1)
- Business Simulations (1)
- Cardiac myocytes (1)
- Cardiac tissue (1)
- CellDrum (1)
- Censored data (1)
- Co-managed care (1)
- Collaborative robot (1)
- Computational biomechanics (1)
- Controller Parameter (1)
- DNA biosensor (1)
Institute
- Fachbereich Medizintechnik und Technomathematik (51)
- Fachbereich Chemie und Biotechnologie (36)
- Fachbereich Bauingenieurwesen (35)
- IfB - Institut für Bioengineering (33)
- Fachbereich Elektrotechnik und Informationstechnik (32)
- Fachbereich Wirtschaftswissenschaften (30)
- Fachbereich Luft- und Raumfahrttechnik (26)
- Fachbereich Maschinenbau und Mechatronik (19)
- Fachbereich Energietechnik (16)
- INB - Institut für Nano- und Biotechnologien (15)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (11)
- Institut fuer Angewandte Polymerchemie (5)
- Nowum-Energy (5)
- Solar-Institut Jülich (5)
- ZHQ - Bereich Hochschuldidaktik und Evaluation (5)
- ECSM European Center for Sustainable Mobility (4)
- Fachbereich Architektur (3)
- IBB - Institut für Baustoffe und Baukonstruktionen (2)
- Fachbereich Gestaltung (1)
Replacement tissues, designed to fill in articular cartilage defects, should exhibit the same properties as the native material. The aim of this study is to foster the understanding of, firstly, the mechanical behavior of the material itself and, secondly, the influence of cultivation parameters on cell seeded implants as well as on cell migration into acellular implants. In this study, acellular cartilage replacement material is theoretically, numerically and experimentally investigated regarding its viscoelastic properties, where a phenomenological model for practical applications is developed. Furthermore, remodeling and cell migration are investigated.
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.
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.
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.