Refine
Year of publication
- 2016 (158) (remove)
Institute
- Fachbereich Medizintechnik und Technomathematik (43)
- Fachbereich Chemie und Biotechnologie (29)
- IfB - Institut für Bioengineering (29)
- Fachbereich Elektrotechnik und Informationstechnik (26)
- Fachbereich Luft- und Raumfahrttechnik (22)
- Fachbereich Bauingenieurwesen (13)
- INB - Institut für Nano- und Biotechnologien (13)
- Fachbereich Maschinenbau und Mechatronik (12)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (11)
- Fachbereich Energietechnik (10)
Language
- English (158) (remove)
Document Type
- Article (78)
- Conference Proceeding (66)
- Part of a Book (7)
- Conference: Meeting Abstract (3)
- Book (2)
- Doctoral Thesis (1)
- Report (1)
Keywords
- Technical Operations Research (2)
- Additive Manufacturing (1)
- Annulus Fibrosus (1)
- Assessment (1)
- Asymptotic efficiency (1)
- Bacillus atrophaeus (1)
- Balance (1)
- Balanced hypergraph (1)
- Building Systems (1)
- Business Simulations (1)
The scientific interest for near-Earth asteroids as well as the interest in potentially hazardous asteroids from the perspective of planetary defense led the space community to focus on near-Earth asteroid mission studies. A multiple near-Earth asteroid rendezvous mission with close-up observations of several objects can help to improve the characterization of these asteroids. This work explores the design of a solar-sail spacecraft for such a mission, focusing on the search of possible sequences of encounters and the trajectory optimization. This is done in two sequential steps: a sequence search by means of a simplified trajectory model and a set of heuristic rules based on astrodynamics, and a subsequent optimization phase. A shape-based approach for solar sailing has been developed and is used for the first phase. The effectiveness of the proposed approach is demonstrated through a fully optimized multiple near-Earth asteroid rendezvous mission. The results show that it is possible to visit five near-Earth asteroids within 10 years with near-term solar-sail technology.
Development of a subject-oriented reference process model for the telecommunications industry
(2016)
Generally the usage of reference models can be structured top-down or bottom-up. The practical need of agile change and flexible organizational implementation requires a consistent mapping to an operational level. In this context, well-established reference process models are typically structured top-down. The subject-oriented Business Process Management (sBPM) offers a modeling concept that is structured bottom-up and concentrates on the process actors on an
operational level. This paper applies sBPM to the enhanced Telecom Operations Map (eTOM), a well-accepted reference process model in the telecommunications industry. The resulting design artifact is a concrete example for a combination of a bottom-up and top-down developed reference model. The results are evaluated and confirmed in practical context through the involvement of the industry body TMForum.
Analysis of the long-term effect of the MBST® nuclear magnetic resonance therapy on gonarthrosis
(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.
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.
The composition of plant biomass varies depending on the feedstock and pre-treatment conditions and influences its processing in biorefineries. In order to ensure optimal process conditions, the quantitative proportion of the main polymeric components of the pre-treated biomass has to be determined. Current standard procedures for biomass compositional analysis are complex, the measurements are afflicted with errors and therefore often not comparable. Hence, new powerful analytical methods are urgently required to characterize biomass. In this contribution, Differential Scanning Calorimetry (DSC) was applied in combination with multivariate data analysis (MVA) to detect the cellulose content of the plant biomass pretreated by Liquid Hot Water (LHW) and Organosolv processes under various conditions. Unlike conventional techniques, the developed analytic method enables the accurate quantification of monosaccharide content of the plant biomass without any previous sample preparation. It is easy to handle and avoids errors in sample preparation.
This paper describes the development of a capacitively coupled high-pressure lamp with input power between 20 and 43 W at 2.45 GHz, using a coaxial line network. Compared with other electrodeless lamp systems, no cavity has to be used and a reduction in the input power is achieved. Therefore, this lamp is an alternative to the halogen incandescent lamp for domestic lighting. To serve the demands of domestic lighting, the filling of the lamp is optimized over all other resulting requirements, such as high efficacy at low induced powers and fast startups. A workflow to develop RF-driven plasma applications is presented, which makes use of the hot S-parameter technique. Descriptions of the fitting process inside a circuit and FEM simulator are given. Results of the combined ignition and operation network from simulations and measurements are compared. An initial prototype is built and measurements of the lamp's lighting properties are presented along with an investigation of the efficacy optimizations using large signal amplitude modulation. With this lamp, an efficacy of 135 lmW -1 is achieved.
In this paper we present an extension of the action language Golog that allows for using fuzzy notions in non-deterministic argument choices and the reward function in decision-theoretic planning. Often, in decision-theoretic planning, it is cumbersome to specify the set of values to pick from in the non-deterministic-choice-of-argument statement. Also, even for domain experts, it is not always easy to specify a reward function. Instead of providing a finite domain for values in the non-deterministic-choice-of-argument statement in Golog, we now allow for stating the argument domain by simply providing a formula over linguistic terms and fuzzy uents. In Golog’s forward-search DT planning algorithm, these formulas are evaluated in order to find the agent’s optimal policy. We illustrate this in the Diner Domain where the agent needs to calculate the optimal serving order.