Report
Refine
Year of publication
Document Type
- Report (486) (remove)
Keywords
- Mathematikunterricht (7)
- modelling (7)
- numerical upscaling (7)
- Modellierung (6)
- praxisorientiert (6)
- Ambient Intelligence (5)
- Regelung (5)
- hub location (5)
- Elastoplastizität (4)
- Integer programming (4)
Faculty / Organisational entity
- Fraunhofer (ITWM) (198)
- Kaiserslautern - Fachbereich Informatik (139)
- Kaiserslautern - Fachbereich Mathematik (121)
- Kaiserslautern - Fachbereich Elektrotechnik und Informationstechnik (9)
- Kaiserslautern - Fachbereich Sozialwissenschaften (8)
- Kaiserslautern - Fachbereich Raum- und Umweltplanung (7)
- Kaiserslautern - Fachbereich ARUBI (2)
- Distance and Independent Studies Center (DISC) (1)
- Universität (1)
This contribution presents a model reduction method for nonlinear problems in structural mechanics. Emanating from a Finite Element model of the structure, a subspace and a lookup table are generated which do not require a linearisation of the equations. The method is applied to a model created with commercial FEM software. In this case, the terms describing geometrical and material nonlinearities are not explicitly known.
Online Delay Management
(2010)
We present extensions to the Online Delay Management Problem on a Single Train Line. While a train travels along the line, it learns at each station how many of the passengers wanting to board the train have a delay of delta. If the train does not wait for them, they get delayed even more since they have to wait for the next train. Otherwise, the train waits and those passengers who were on time are delayed by delta. The problem consists in deciding when to wait in order to minimize the total delay of all passengers on the train line. We provide an improved lower bound on the competitive ratio of any deterministic online algorithm solving the problem using game tree evaluation. For the extension of the original model to two possible passenger delays delta_1 and delta_2, we present a 3-competitive deterministic online algorithm. Moreover, we study an objective function modeling the refund system of the German national railway company, which pays passengers with a delay of at least Delta a part of their ticket price back. In this setting, the aim is to maximize the profit. We show that there cannot be a deterministic competitive online algorithm for this problem and present a 2-competitive randomized algorithm.
In the generalized max flow problem, the aim is to find a maximum flow in a generalized network, i.e., a network with multipliers on the arcs that specify which portion of the flow entering an arc at its tail node reaches its head node. We consider this problem for the class of series-parallel graphs. First, we study the continuous case of the problem and prove that it can be solved using a greedy approach. Based on this result, we present a combinatorial algorithm that runs in O(m*m) time and a dynamic programming algorithm with running time O(m*log(m)) that only computes the maximum flow value but not the flow itself. For the integral version of the problem, which is known to be NP-complete, we present a pseudo-polynomial algorithm.
We present a parsimonious multi-asset Heston model. All single-asset submodels follow the well-known Heston dynamics and their parameters are typically calibrated on implied market volatilities. We focus on the calibration of the correlation structure between the single-asset marginals in the absence of sucient liquid cross-asset option price data. The presented model is parsimonious in the sense that d(d􀀀1)=2 asset-asset cross-correlations are required for a d-asset Heston model. In order to calibrate the model, we present two general setups corresponding to relevant practical situations: (1) when the empirical cross-asset correlations in the risk neutral world are given by the user and we need to calibrate the correlations between the driving Brownian motions or (2) when they have to be estimated from the historical time series. The theoretical background, including the ergodicity of the multidimensional CIR process, for the proposed estimators is also studied.
The understanding of the motion of long slender elastic fibers in turbulent flows is of great interest to research, development and production in technical textiles manufacturing. The fiber dynamics depend on the drag forces that are imposed on the fiber by the fluid. Their computation requires in principle a coupling of fiber and flow with no-slip interface conditions. However, theneeded high resolution and adaptive grid refinement make the direct numerical simulation of the three-dimensional fluid-solid-problem for slender fibers and turbulent flows not only extremely costly and complex, but also still impossible for practically relevant applications. Embedded in a slender body theory, an aerodynamic force concept for a general drag model was therefore derived on basis of a stochastic k-o; description for a turbulent flow field in [23]. The turbulence effects on the fiber dynamics were modeled by a correlated random Gaussian force and its asymptotic limit on a macroscopic fiber scale by Gaussian white noise with flow-dependent amplitude. The concept was numerically studied under the conditions of a melt-spinning process for nonwoven materials in [24] – for the specific choice of a non-linear Taylor drag model. Taylor [35] suggested the heuristic model for high Reynolds number flows, Re in [20, 3 · 105], around inclined slender objects under an angle of attack of alpha in (pi/36, pi/2] between flow and object tangent. Since the Reynolds number is considered with respect to the relative velocity between flow and fiber, the numerical results lackaccuracy evidently for small Re that occur in cases of flexible light fibers moving occasionally with the flow velocity. In such a regime (Re << 1), linear Stokes drag forces were successfully applied for the prediction of small particles immersed in turbulent flows, see e.g. [25, 26, 32, 39], a modifiedStokes force taking also into account the particle oscillations was presented in [14]. The linear drag relation was also conferred to longer filaments by imposing free-draining assumptions [29, 8]. Apart from this, the Taylor drag suffers from its non-applicability to tangential incident flow situations (alpha = 0) that often occur in fiber and nonwoven production processes.
In this work we use the Parsimonious Multi–Asset Heston model recently developed in [Dimitroff et al., 2009] at Fraunhofer ITWM, Department Financial Mathematics, Kaiserslautern (Germany) and apply it to Quanto options. We give a summary of the model and its calibration scheme. A suitable transformation of the Quanto option payoff is explained and used to price Quantos within the new framework. Simulated prices are given and compared to market prices and Black–Scholes prices. We find that the new approach underprices the chosen options, but gives better results than the Black–Scholes approach, which is prevailing in the literature on Quanto options.
Home Health Care (HHC) services are becoming increasingly important in Europe’s aging societies. Elderly people have varying degrees of need for assistance and medical treatment. It is advantageous to allow them to live in their own homes as long as possible, since a long-term stay in a nursing home can be much more costly for the social insurance system than a treatment at home providing assistance to the required level. Therefore, HHC services are a cost-effective and flexible instrument in the social system. In Germany, organizations providing HHC services are generally either larger charities with countrywide operations or small private companies offering services only in a city or a rural area. While the former have a hierarchical organizational structure and a large number of employees, the latter typically only have some ten to twenty nurses under contract. The relationship to the patients (“customers”) is often long-term and can last for several years. Therefore acquiring and keeping satisfied customers is crucial for HHC service providers and intensive competition among them is observed.
In dem Forschungsvorhaben “Schubtragverhalten des Stahlbetongurtes von Verbundträgern im Bereich von großen Stegöffnungen“ wurden umfangreiche experimentelle und rechnerische Untersuchungen zum Querkrafttragverhalten und zur Querkrafttragfähigkeit des Betongurts im Bereich von großen Stegöffnungen durchgeführt. Anhand von 21 großmaßstäblichen Traglastversuchen, die erstmals so konzipiert waren, dass im Öffnungsbereich nahezu die gesamte Querkraft durch den Betongurt übertragen werden musste, konnte die Querkrafttragfähigkeit des Betongurts bestimmt werden. Neue Erkenntnisse über den Lastabtragungs- und Versagensmechanismus im Öffnungsbereich konnten durch die Auswertung der Dehnungen der Kopfbolzendübel im Öffnungsbereich und das nachträgliche Aufsägen des Betongurts der Versuchsträger gewonnen werden. Im rechnerischen Teil wurden ein dreidimensionales FE-Modell erstellt, das die Versuche in ihren wesentlichen Teilen abbildete, und Vergleichsberechnungen durchgeführt. Durch den Vergleich der rechnerischen mit den experimentell ermittelten Werten wurde das Modell überprüft. Auf dieser Grundlage wurden anschließend Parameteruntersuchungen durchgeführt. Schließlich wurde auf der Basis der experimentellen und rechnerischen Untersuchungen ein Ingenieurmodell zur Bestimmung der Querkrafttragfähigkeit im Öffnungsbereich entwickelt, mit dem sich die Querkrafttragfähigkeit des Betongurts im Öffnungsbereich nachweisen lässt. Ferner stellte sich heraus, dass die Querkrafttragfähigkeit des Betongurts im Öffnungsbereich durch Dübelleisten erheblich gesteigert werden kann, was wirtschaftliche Vorteile eröffnet.
The capacitated single-allocation hub location problem revisited: A note on a classical formulation
(2009)
Denote by G = (N;A) a complete graph where N is the set of nodes and A is the set of edges. Assume that a °ow wij should be sent from each node i to each node j (i; j 2 N). One possibility is to send these °ows directly between the corresponding pairs of nodes. However, in practice this is often neither e±cient nor costly attractive because it would imply that a link was built between each pair of nodes. An alternative is to select some nodes to become hubs and use them as consolidation and redistribution points that altogether process more e±ciently the flow in the network. Accordingly, hubs are nodes in the graph that receive tra±c (mail, phone calls, passengers, etc) from di®erent origins (nodes) and redirect this tra±c directly to the destination nodes (when a link exists) or else to other hubs. The concentration of tra±c in the hubs and its shipment to other hubs lead to a natural decrease in the overall cost due to economies of scale.
Radiotherapy is one of the major forms in cancer treatment. The patient is irradiated with high-energetic photons or charged particles with the primary goal of delivering sufficiently high doses to the tumor tissue while simultaneously sparing the surrounding healthy tissue. The inverse search for the treatment plan giving the desired dose distribution is done by means of numerical optimization [11, Chapters 3-5]. For this purpose, the aspects of dose quality in the tissue are modeled as criterion functions, whose mathematical properties also affect the type of the corresponding optimization problem. Clinical practice makes frequent use of criteria that incorporate volumetric and spatial information about the shape of the dose distribution. The resulting optimization problems are of global type by empirical knowledge and typically computed with generic global solver concepts, see for example [16]. The development of good global solvers to compute radiotherapy optimization problems is an important topic of research in this application, however, the structural properties of the underlying criterion functions are typically not taken into account in this context.