Refine
Year of publication
Document Type
- Article (3149)
- Conference Proceeding (1016)
- Part of a Book (184)
- Book (144)
- Doctoral Thesis (30)
- Patent (25)
- Other (9)
- Report (9)
- Preprint (4)
- Poster (3)
- Talk (3)
- Master's Thesis (2)
- Working Paper (2)
- Bachelor Thesis (1)
- Contribution to a Periodical (1)
- Habilitation (1)
Language
- English (4583) (remove)
Has Fulltext
- no (4583) (remove)
Keywords
- Gamification (6)
- avalanche (6)
- Earthquake (5)
- Enterprise Architecture (5)
- MINLP (5)
- solar sail (5)
- Diversity Management (4)
- Energy storage (4)
- Engineering optimization (4)
- LAPS (4)
- Natural language processing (4)
- Papierkunst (4)
- Power plants (4)
- Seismic design (4)
- field-effect sensor (4)
- frequency mixing magnetic detection (4)
- hydrogen (4)
- metal structure (4)
- snow (4)
- steel (4)
Institute
- Fachbereich Medizintechnik und Technomathematik (1545)
- Fachbereich Elektrotechnik und Informationstechnik (686)
- IfB - Institut für Bioengineering (560)
- Fachbereich Energietechnik (552)
- INB - Institut für Nano- und Biotechnologien (532)
- Fachbereich Chemie und Biotechnologie (522)
- Fachbereich Luft- und Raumfahrttechnik (463)
- Fachbereich Maschinenbau und Mechatronik (261)
- Fachbereich Wirtschaftswissenschaften (196)
- Solar-Institut Jülich (160)
- Fachbereich Bauingenieurwesen (146)
- ECSM European Center for Sustainable Mobility (75)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (62)
- Fachbereich Gestaltung (24)
- Nowum-Energy (24)
- Institut fuer Angewandte Polymerchemie (23)
- Sonstiges (21)
- Fachbereich Architektur (20)
- Freshman Institute (18)
- Kommission für Forschung und Entwicklung (18)
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.
Since fluid-structure interaction within the finite-element method is state of the art in many engineering fields, this method is used in voice analysis. A quasi two-dimensional model of the vocal folds including the ventricular folds is presented. First results of self-sustained vocal fold oscillation are presented and possibilities as well as limitations are discussed.
A Formulation of Quantum Stochastic Processes and Some of its Properties. Hellwig, K.-E.; Stulpe, W.
(1983)
IT Products are viewed and managed differently depending on the perspectives and the stage within the life cycle. A model is presented that integrates different perspectives and stages serving as an aid for the analysis of business models and focused positioning of IT-products. Four generic business models are analysed with regard to the product management function in general and the positioning field for IT-products specifically: off-the-shelf (license), license plus service, project, and system service (incl. cloud computing).