### Refine

#### Year of publication

#### Document Type

- Report (477) (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)
- Lineare Algebra (4)
- linear algebra (4)
- mathematical education (4)
- poroelasticity (4)
- praxis orientated (4)
- Darcy’s law (3)
- Dienstgüte (3)
- Elastic BVP (3)
- Elastoplasticity (3)
- Elektrotechnik (3)
- Formalisierung (3)
- Heston model (3)
- Hysterese (3)
- Lagrangian mechanics (3)
- Szenario (3)
- effective heat conductivity (3)
- facility location (3)
- non-Newtonian flow in porous media (3)
- polynomial algorithms (3)
- variational inequalities (3)
- virtual material design (3)
- American options (2)
- Bartlett spectrum (2)
- Betriebsfestigkeit (2)
- Chisel (2)
- Elastisches RWP (2)
- Elastoplastisches RWP (2)
- Field-programmable gate array (FPGA) (2)
- HJB equation (2)
- Heuristics (2)
- IMRT planning (2)
- Inverses Problem (2)
- Jiang's model (2)
- Jiang-Modell (2)
- Lineare Optimierung (2)
- Logistics (2)
- MAC type grid (2)
- Networked Control Systems (2)
- Netzwerk (2)
- Noether’s theorem (2)
- Nonlinear multigrid (2)
- Portfolio optimisation (2)
- Ratenunabhängigkeit (2)
- Regularisierung (2)
- Rotational spinning process (2)
- Simplex (2)
- Slender body theory (2)
- Special Cosserat rods (2)
- Sportentwicklung (2)
- Sportstättenplanung (2)
- Sportwissenschaft (2)
- Stadtplanung (2)
- Standortplanung (2)
- Stücklisten (2)
- Supply Chain Management (2)
- Theorie schwacher Lösungen (2)
- Variationsungleichungen (2)
- Wavelet (2)
- adaptive refinement (2)
- algorithmic game theory (2)
- asymptotic homogenization (2)
- branch and cut (2)
- discontinuous coefficients (2)
- discrete mechanics (2)
- domain decomposition (2)
- elastoplastic BVP (2)
- energy minimization (2)
- facets (2)
- fast Fourier transform (2)
- fiber orientation (2)
- fiber-fluid interaction (2)
- filling processes (2)
- finite volume method (2)
- finite-volume method (2)
- free-surface phenomena (2)
- heuristic (2)
- hydraulics (2)
- hysteresis (2)
- image analysis (2)
- image processing (2)
- injection molding (2)
- integer programming (2)
- interface boundary conditions (2)
- linear elasticity (2)
- linear optimization (2)
- model reduction (2)
- multibody dynamics (2)
- multigrid (2)
- multilayered material (2)
- non-overlapping constraints (2)
- online optimization (2)
- optimal control (2)
- optimization (2)
- option pricing (2)
- porous media (2)
- portfolio choice (2)
- power spectrum (2)
- rectangular packing (2)
- simplex (2)
- simulation (2)
- single phase flow (2)
- software development (2)
- stochastic control (2)
- supply chain management (2)
- valid inequalities (2)
- work effort (2)
- (dynamic) network flows (1)
- 3D (1)
- 3d imaging (1)
- : Navier-Stokes equations (1)
- : multiple criteria optimization (1)
- : multiple objective programming (1)
- AG-RESY (1)
- AKLEON (1)
- Abstract linear systems theory (1)
- Ad-hoc-Netz (1)
- Aktien (1)
- AmICA (1)
- Analysis (1)
- Anisotropic Gaussian filter (1)
- Arbeitsgedächtnis (1)
- Assigment (1)
- Asymptotic Expansion (1)
- Asymptotic expansions (1)
- Asymptotic homogenization (1)
- Ausfallwahrscheinlichkeit (1)
- Automatic Differentiation (1)
- Automatische Differentiation (1)
- Bauindustrie (1)
- Bauplanung (1)
- Bayesian Model Averaging (1)
- Bell Number (1)
- Berechnungskomplexität (1)
- Bevölkerungsumfrage (1)
- Bingham viscoplastic model (1)
- Biot poroelasticity system (1)
- Biot-Savart Operator (1)
- Biot-Savart operator (1)
- Black–Scholes approach (1)
- Blocked Neural Networks (1)
- Boolean polynomials (1)
- Bootstrap (1)
- Boundary Value Problem (1)
- Brinkman (1)
- Brinkman equations (1)
- Börse (1)
- CAD (1)
- CAE-Kette zur Strukturoptimierung (1)
- CFD (1)
- CHAMP <Satellitenmission> (1)
- CIR model (1)
- Capacitated Hub Location (1)
- Capacity decisions (1)
- Code Inspection (1)
- Competitive Analysis (1)
- Compiler (1)
- Complexity theory (1)
- Constant Maturity Credit Default Swap (1)
- Constrained mechanical systems (1)
- Constraint Programming (1)
- Continuum mechanics (1)
- Convex sets (1)
- Coq (1)
- Core (1)
- Cosserat rod (1)
- Credit Default Swaption (1)
- Curved viscous fibers (1)
- Customer distribution (1)
- Datenerfassung und -auswertung (1)
- Decision support systems (1)
- Delaunay Triangulation (1)
- Delaunay mesh generation (1)
- Design (1)
- Didaktik (1)
- Differentialinklusionen (1)
- Discrete linear systems (1)
- Distortion measure (1)
- Domain Decomposition (1)
- Drahtloses Sensorsystem (1)
- Dynamic Network Flows (1)
- Dynamical Coupling (1)
- Education (1)
- Elastoplastic BVP (1)
- Electrophysiology (1)
- Elliptic boundary value problems (1)
- Energie (1)
- Energieerzeugung (1)
- Equicofactor matrix polynomials (1)
- Euler number (1)
- Eulerian-Lagrangian formulation (1)
- Existence of Solutions (1)
- Extraction (1)
- FEM (1)
- FETI (1)
- FPM (1)
- FPTAS (1)
- Facility location (1)
- Fahrrad (1)
- Fahrzeugprüfstände (1)
- Fault Prediction (1)
- Festigkeitsverteilung (1)
- Filippov theory (1)
- Filippov-Theorie (1)
- Filtering (1)
- Financial Mathematics (1)
- Finanzmathematik (1)
- Finite rotations (1)
- Flexible multibody dynamics (1)
- Flooding (1)
- FlowLoc (1)
- Fluid Structure Interaction (1)
- Fluid dynamics (1)
- Fokker-Planck Equation (1)
- Fokker-Planck equations (1)
- Folgar-Tucker equation (1)
- Folgar-Tucker model (1)
- Formal Semantics (1)
- Forschung (1)
- Free boundary value problem (1)
- Front Propagation (1)
- Fräsen (1)
- Funknetz (1)
- G2++ model (1)
- Galerkin Approximation (1)
- Generalized LBE (1)
- Geographical Information Systems (1)
- Geomagnetic Field Modelling (1)
- Geomagnetismus (1)
- Geomathematik (1)
- Geometric (1)
- Geostrophic flow (1)
- Geothermal Flow (1)
- Geothermischer Fluss (1)
- Gießprozesssimulation (1)
- Gießtechnische Restriktionen (1)
- Gradual Covering (1)
- Graphentheorie (1)
- Gravimetrie (1)
- Greedy Heuristic (1)
- Green’s function (1)
- Grid Generation (1)
- Gröber basis (1)
- HJM (1)
- Hals-Nasen-Ohren-Chirurgie (1)
- Hals-Nasen-Ohren-Heilkunde (1)
- Hankel matrix (1)
- Hardware Description Langauge (HDL) (1)
- Hardware Description Language (HDL) (1)
- Hedge funds (1)
- Helmholtz-Decomposition (1)
- Helmholtz-Zerlegung (1)
- Heston Model (1)
- Heuristic (1)
- Home Health Care (1)
- Homotopie (1)
- Homotopiehochhebungen (1)
- Homotopy (1)
- Homotopy lifting (1)
- Hub Location (1)
- Hub-and-Spoke-System (1)
- Hull White model (1)
- Human resource modeling (1)
- Hydraulik (1)
- Hysteresis (1)
- Hörgerät (1)
- IMRT planning on adaptive volume structures – a significant advance of computational complexity (1)
- Implantation (1)
- Incompressible Navier-Stokes equations (1)
- Infiltration (1)
- Informatik (1)
- Injectivity of mappings (1)
- Injektivität von Abbildungen (1)
- Inkorrekt gestelltes Problem (1)
- Integration (1)
- Integration innovativ (1)
- Investigation (1)
- Isabelle/HOL (1)
- Iterative learning control (1)
- Jiang's constitutive model (1)
- Jiangsches konstitutives Gesetz (1)
- Jiang’s Model of Elastoplasticity (1)
- Kaiserslautern (1)
- Kaktusgraph (1)
- Kalman Filter (1)
- Kirchhoff and Cosserat rods (1)
- Kirchhoff\\\'s geometrically theory (1)
- Knowledge Extraction (1)
- Kommunikationsprotokoll (1)
- Komplexitätsklasse NP (1)
- Konfidenz (1)
- Kontinuumsmechanik (1)
- Konvexe Mengen (1)
- Kristallmathematik (1)
- Kundenbeanspruchung (1)
- LIBOR market model (1)
- Lagrange formalism (1)
- Large deformations (1)
- Lattice Boltzmann (1)
- Lattice Boltzmann method (1)
- Lattice Boltzmann methods (1)
- Lattice Boltzmann models (1)
- Lattice-Boltzmann method (1)
- Least squares approximation (1)
- Least squares method (1)
- Lebensdauerberechnung (1)
- Lehramtsstudium (1)
- Lehre (1)
- Lehrerbildung (1)
- Lehrerfortbildung (1)
- Lehrerweiterbildung (1)
- Lehrmittel (1)
- Level Set method (1)
- Level-Set Methode (1)
- Li Ion Batteries (1)
- Linear Programming (1)
- Linear kinematic hardening (1)
- Linear kinematische Verfestigung (1)
- Liquid Polymer Moulding (1)
- Load Balancing (1)
- Locational Planning (1)
- MBS (1)
- MBS simulation (1)
- META-AKAD (1)
- MILP formulations (1)
- MIP formulations (1)
- MKS (1)
- Mapping (1)
- Mastoid (1)
- Mastoidektomie (1)
- Mathematical modeling (1)
- Matrix perturbation theory (1)
- Maximum-Likelihood (1)
- Mehrskalenanalyse (1)
- Melt spinning (1)
- Mesh-less methods (1)
- Meshfree Method (1)
- Meshfree method (1)
- Metaheuristics (1)
- Methode der Fundamentallösungen (1)
- Mie-Darstellung (1)
- Mie-Representation (1)
- Model Checking (1)
- Model reduction (1)
- Modeling (1)
- Modelling (1)
- Monte Carlo methods (1)
- Monte-Carlo methods (1)
- Multi-dimensional systems (1)
- Multibody simulation (1)
- Multicriteria decision making (1)
- Multipoint flux approximation (1)
- Multiscale problem (1)
- Multiscale problems (1)
- Multiscale structures (1)
- Multiskalenapproximation (1)
- NP-hard (1)
- Nash equilibria (1)
- Navier-Stokes (1)
- Navier-Stokes equation (1)
- Navier-Stokes equations (1)
- Navier-Stokes-Brinkmann system of equations (1)
- Network Location (1)
- Network design (1)
- Networks (1)
- Neumann Wavelets (1)
- Neumann problem (1)
- Neumann wavelets (1)
- Nichtlineare/große Verformungen (1)
- Node Platform Design (1)
- Non-Newtonian flow (1)
- Non-homogeneous Poisson Process (1)
- Nonequilibrium Thermodynamics (1)
- Nonlinear Regression (1)
- Nonlinear energy (1)
- Nonlinear/large deformations (1)
- Numerical modeling (1)
- Nutzungsprofil (1)
- OCL 2.0 (1)
- Ohrenchirurgie (1)
- One-dimensional systems (1)
- Online Algorithms (1)
- Onlineumfrage (1)
- Optimal parameter estimation (1)
- Optimization (1)
- Option pricing (1)
- Optionen (1)
- Ordered Median Function (1)
- Ornstein-Uhlenbeck Process (1)
- Order of printed copy (1)
- Parallel Programming (1)
- Parameter Identification (1)
- Parameter identification (1)
- Parameteridentifikation (1)
- Parametrisation of rotations (1)
- Parsimonious Heston Model (1)
- Parteto surface (1)
- Particle scheme (1)
- Peer-to-Peer-Netz (1)
- Performance of iterative solvers (1)
- Pleated Filter (1)
- Poisson equation (1)
- Poisson line process (1)
- Poroelastizität (1)
- Portfolio-Optimierung (1)
- Preconditioners (1)
- Produktion (1)
- Profiles (1)
- Projection method (1)
- Projektplanung (1)
- Prüfkonzepte (1)
- Pseudopolynomial-Time Algorithm (1)
- Quanto option (1)
- RONAF (1)
- Random set (1)
- Rate-independency (1)
- Realization theory (1)
- Recycling (1)
- Reliability Prediction (1)
- Reservierungsprotokoll (1)
- Restricted Shortest Path (1)
- Ripley’s K function (1)
- Roboter (1)
- Rosenbrock methods (1)
- Rotational Fiber Spinning (1)
- Rounding (1)
- Route Planning (1)
- Routing (1)
- SAW filters (1)
- SDL (1)
- SDL-2000 (1)
- SGG (1)
- SIMPLE (1)
- SST (1)
- Satellitengradiometrie (1)
- Scheduling (1)
- Schädelchirurgie (1)
- Sensitivitäten (1)
- Shapley Value (1)
- Shapley value (1)
- Shapleywert (1)
- Sheet ofPaper (1)
- Simulation (1)
- Solid-Gas Separation (1)
- Solid-Liquid Separation (1)
- Spezifikation (1)
- Spieltheorie (1)
- Sprachprofile (1)
- Stationary heat equation (1)
- Stein equation (1)
- Stochastic Differential Equations (1)
- Stokes Wavelets (1)
- Stokes wavelets (1)
- Stokes-Brinkman equations (1)
- Stop- and Play-Operators (1)
- Stop- und Play-Operator (1)
- Stop-und Play-Operator (1)
- Stress-strain correction (1)
- Stromnetz (1)
- Stromverbrauch (1)
- Strömungsmechanik (1)
- Supply Chain Design (1)
- Switching regression model (1)
- System Abstractions (1)
- Thermal Transport (1)
- Titration (1)
- Topologieoptimierung (1)
- Train Rearrangement (1)
- Training (1)
- Translation Validation (1)
- Trennverfahren (1)
- UML 2 (1)
- UML Profile (1)
- Unstructured Grid (1)
- VCG payment scheme (1)
- VHDL (1)
- Variational inequalities (1)
- Variationsungleichugen (1)
- Vasicek model (1)
- Vectorial Wavelets (1)
- Vehicle test rigs (1)
- Vektor-Wavelets (1)
- Vektorkugelfunktionen (1)
- Vektorwavelets (1)
- Viscous Fibers (1)
- Weak Solution Theory (1)
- Weibull (1)
- Winner Determination Problem (WDP) (1)
- Wireless Communication (1)
- Wireless Sensor Network (1)
- Wireless sensor network (1)
- Zuwanderung (1)
- a posteriori error estimates (1)
- a-priori domain decomposition (1)
- acoustic absorption (1)
- adaptive local refinement (1)
- adaptive triangulation (1)
- additive outlier (1)
- aerodynamic drag (1)
- air drag (1)
- algebraic constraints (1)
- algebraic cryptoanalysis (1)
- algorithm by Bortfeld and Boyer (1)
- aliasing (1)
- analog circuits (1)
- angewandte Mathematik (1)
- anisotropic cicosity (1)
- anisotropy (1)
- applied mathematics (1)
- artial differential algebraic equations (1)
- asymptotic (1)
- asymptotic Cosserat models (1)
- asymptotic limits (1)
- automated analog circuit design (1)
- automatic differentiation (1)
- autoregressive process (1)
- basic systems theoretic properties (1)
- batch presorting problem (1)
- battery modeling (1)
- bedingte Aktionen (1)
- behavioral modeling (1)
- ber dynamics (1)
- big triangle small triangle method (1)
- bills of material (1)
- bills of materials (1)
- bin coloring (1)
- binarization (1)
- boudary condistions (1)
- bounce-back rule (1)
- boundary value problems (1)
- bounds (1)
- cactus graph (1)
- calibration (1)
- calls (1)
- cell volume (1)
- change analysis (1)
- circuit sizing (1)
- cliquet options (1)
- clustering (1)
- clustering and disaggregation techniques (1)
- combinatorial procurement (1)
- competetive analysis (1)
- competitive analysis (1)
- compiler (1)
- complexity (1)
- composite materials (1)
- computational fluid dynamics (1)
- computer algebra (1)
- concentrated electrolyte (1)
- constrained mechanical systems (1)
- constraint propagation (1)
- consumption (1)
- contact problems (1)
- continuing teacher education (1)
- continuous optimization (1)
- control (1)
- controlling (1)
- convergence of approximate solution (1)
- convex (1)
- convex optimization (1)
- cooperative game (1)
- core (1)
- corre- lation (1)
- correlation (1)
- coupled flow in plain and porous media (1)
- credit risk (1)
- credit spread (1)
- cuboidal lattice (1)
- curved viscous fibers (1)
- curved viscous fibers with surface tension (1)
- decision support systems (1)
- decomposition (1)
- defect detection (1)
- deformable bodies (1)
- deformable porous media (1)
- delay management (1)
- design centering (1)
- design optimization (1)
- deterministic technical systems (1)
- dial-a-ride (1)
- dif (1)
- differential algebraic equations (1)
- differential inclusions (1)
- differentialalgebraic equations (1)
- discrete facility location (1)
- discrete location (1)
- discrete optimization (1)
- discrete time setting (1)
- discretisation of control problems (1)
- discriminant analysis (1)
- diusion limits (1)
- dividend discount model (1)
- dividends (1)
- domains (1)
- drag models (1)
- drift due to noise (1)
- durability (1)
- dynamic capillary pressure (1)
- dynamic mode (1)
- dynamic network flows (1)
- earliest arrival flows (1)
- edge detection (1)
- effective elastic moduli (1)
- effective thermal conductivity (1)
- efficient set (1)
- eigenvalue problems (1)
- elastoplasticity (1)
- electrochemical diusive processes (1)
- electrochemical simulation (1)
- electronic circuit design (1)
- elliptic equation (1)
- encapsulation (1)
- energy conservation (1)
- error estimates (1)
- estimation of compression (1)
- evolutionary algorithms (1)
- executive compensation (1)
- executive stockholder (1)
- expert system (1)
- explicit jump (1)
- explicit jump immersed interface method (1)
- exponential utility (1)
- extreme equilibria (1)
- extreme solutions (1)
- fatigue (1)
- fiber dynamics (1)
- fiber model (1)
- fiber-fluid interactions (1)
- fiber-turbulence interaction scales (1)
- fibrous insulation materials (1)
- fibrous materials (1)
- film casting process (1)
- filtration (1)
- financial decisions (1)
- finite difference discretization (1)
- finite differences (1)
- finite element method (1)
- finite elements (1)
- finite sample breakdown point (1)
- finite volume discretization (1)
- finite volume discretization discretization (1)
- finite volume discretizations (1)
- finite volume methods (1)
- flexible bodies (1)
- flexible fibers (1)
- flow in heterogeneous porous media (1)
- flow in porous media (1)
- flow resistivity (1)
- flows (1)
- fluid-fiber interactions (1)
- fluid-structure interaction (1)
- force-based simulation (1)
- formal verification (1)
- forward starting options (1)
- fptas (1)
- frameindifference (1)
- free boundary value problem (1)
- free surface (1)
- free surface Stokes flow (1)
- full vehicle model (1)
- functional Hilbert space (1)
- fuzzy logic (1)
- general semi-infinite optimization (1)
- generalized Pareto distribution (1)
- genetic algorithms (1)
- geographical information systems (1)
- geomathematics (1)
- geometrically exact rod models (1)
- geometrically exact rods (1)
- glass processing (1)
- global optimization (1)
- global robustness (1)
- graph laplacian (1)
- guarded actions (1)
- harmonic density (1)
- harmonische Dichte (1)
- heterogeneous porous media (1)
- heuristics (1)
- hierarchical shape functions (1)
- human factors (1)
- human visual system (1)
- hyperealstic (1)
- image segmentation (1)
- impinging jets (1)
- improving and feasible directions (1)
- in-house hospital transportation (1)
- incompressible flow (1)
- inertial and viscous-inertial fiber regimes (1)
- inhomogeneous Helmholtz type differential equations in bounded domains (1)
- innovation outlier (1)
- integral constitutive equation (1)
- intensity maps (1)
- intensity modulated (1)
- intensity modulated radiotherapy planning (1)
- interactive multi-objective optimization (1)
- interactive navigation (1)
- interfa (1)
- interface problem (1)
- interface problems (1)
- interval arithmetic (1)
- invariant excitation (1)
- invariants (1)
- ion transport (1)
- isotropy test (1)
- kernel estimate (1)
- kernel function (1)
- kinetic derivation (1)
- knowledge management (1)
- knowledge representation (1)
- kooperative Spieltheorie (1)
- large scale optimization (1)
- lattice Boltzmann equation (1)
- learning curve (1)
- level-set (1)
- lid-driven flow in a (1)
- linear elasticity equations (1)
- linear filtering (1)
- linear kinematic hardening (1)
- liquid composite moulding (1)
- liquid film (1)
- lithium-ion battery (1)
- local approximation of sea surface topography (1)
- local robustness (1)
- locally supported (Green’s) vector wavelets (1)
- locally supported wavelets (1)
- location theory (1)
- locational planning (1)
- log utility (1)
- logistic regression (1)
- logistics (1)
- long slender fibers (1)
- macro modeling (1)
- macroscopic equations (1)
- magnetic field (1)
- mass & spring (1)
- mastoid (1)
- mastoidectomy (1)
- mathematica education (1)
- maximal function (1)
- mbs simulation (1)
- mechanism design (1)
- metal foams (1)
- method of fundamental solutions (1)
- microstructure simulatio (1)
- microstructure simulation (1)
- minimaler Schnittbaum (1)
- minimum cut tree (1)
- models (1)
- modified gradient projection method (1)
- moment matching (1)
- multi-asset (1)
- multi-period planning (1)
- multi-stage stochastic programming (1)
- multibody system simulation (1)
- multicriteria optimization (1)
- multigrid methods (1)
- multiobjective evolutionary algorithms (1)
- multiphase flow (1)
- multiple objective optimization (1)
- multiscale approximation (1)
- multiscale problem (1)
- multiscale problems (1)
- multiscale structures (1)
- multivalued fundamental diagram (1)
- nD image processing (1)
- nearest neighbour distance (1)
- neighborhod relationships (1)
- network congestion game (1)
- neural network (1)
- non-Newtonian fluids (1)
- non-linear optimization (1)
- non-linear wealth dynamics (1)
- non-local conditions (1)
- non-woven (1)
- nonlinear algorithms (1)
- nonlinear diffusion (1)
- nonlinear model reduction (1)
- nonlinear programming (1)
- nonlinear stochastic systems (1)
- nonlinearity (1)
- nonparametric regression (1)
- numerical methods (1)
- numerical simulation (1)
- numerical solution (1)
- object-orientation (1)
- occupational choice (1)
- oil filters (1)
- on-board simulation (1)
- open cell foam (1)
- operator-dependent prolongation (1)
- optimal control theory (1)
- optimal portfolio choice (1)
- optimization algorithms (1)
- optimization strategies (1)
- options (1)
- ordered median (1)
- orientation analysis (1)
- orientation space (1)
- orthogonal orientations (1)
- oscillating coefficients (1)
- otorhinolaryngological surgery (1)
- ownership (1)
- pH-sensitive microelectrodes (1)
- paper machine (1)
- parallel computing (1)
- parallel implementation (1)
- parametric (1)
- particle methods (1)
- path-connected sublevelsets (1)
- permeability of fractured porous media (1)
- phase space (1)
- phase transitions (1)
- piezoelectric periodic surface acoustic wave filters (1)
- planar location (1)
- polar ice (1)
- political districting (1)
- porous microstructure (1)
- power utility (1)
- preconditioner (1)
- pressing section of a paper machine (1)
- price of anarchy (1)
- price of stability (1)
- productivity (1)
- project management and scheduling (1)
- projection-type splitting (1)
- pseudo-plastic fluids (1)
- public transit (1)
- public transport (1)
- public transportation (1)
- puts (1)
- quadratic assignment problem (1)
- quantile estimation (1)
- quasistatic deformations (1)
- quickest path (1)
- radiation therapy planning (1)
- radiotherapy planning (1)
- random -Gaussian aerodynamic force (1)
- random set (1)
- random system of fibers (1)
- rate-independency (1)
- rate-indepenhysteresis (1)
- real-life applications. (1)
- real-time (1)
- real-time simulation (1)
- real-world accident data (1)
- regularization (1)
- regularized models (1)
- representative systems of Pareto solutions (1)
- reproducing kernel (1)
- risk (1)
- robust network flows (1)
- robustness (1)
- rotational spinning processes (1)
- safety critical components (1)
- safety function (1)
- sales territory alignment (1)
- satisfiability (1)
- selfish routing (1)
- semi-infinite programming (1)
- sensitivities (1)
- separable filters (1)
- sequences (1)
- sequential test (1)
- series-parallel graphs (1)
- shape (1)
- shape optimization (1)
- sharp function (1)
- sicherheitsrelevante Bauteile (1)
- single layer kernel (1)
- singularity (1)
- slender- body theory (1)
- slender-body theory (1)
- slenderbody theory (1)
- smoothness (1)
- software process (1)
- software tools (1)
- spherical decomposition (1)
- spinning processes (1)
- stability (1)
- statistical modeling (1)
- steady Richards’ equation (1)
- steady modified Richards’ equation (1)
- stochastic Hamiltonian system (1)
- stochastic averaging. (1)
- stochastic dif (1)
- stochastic volatility (1)
- stokes (1)
- stop and go waves (1)
- stop- and play-operator (1)
- stop- and play-operators (1)
- strategic (1)
- strength (1)
- strong equilibria (1)
- strut thickness (1)
- subgrid approach (1)
- subgrid approximation (1)
- suspension (1)
- swap (1)
- symbolic analysis (1)
- synchrone Sprachen (1)
- synchronous languages (1)
- system simulation (1)
- tabu search (1)
- technology (1)
- territory desgin (1)
- testing philosophy (1)
- textile quality control (1)
- texture classification (1)
- theorem prover (1)
- thin films (1)
- tolerance analysis (1)
- topological sensitivity (1)
- topology optimization (1)
- total latency (1)
- tr (1)
- trace stability (1)
- traffic flow (1)
- transfer quality (1)
- translation validation (1)
- transportation (1)
- tree method (1)
- turbulence modeling (1)
- turbulence modelling (1)
- two-grid algorithm (1)
- two-way coupling (1)
- types (1)
- unstructured grid (1)
- upscaling (1)
- urban elevation (1)
- variable aggregation method (1)
- variable neighborhood search (1)
- variational formulation (1)
- vector spherical harmonics (1)
- vectorial wavelets (1)
- viscous thermal jets (1)
- visual (1)
- visual interfaces (1)
- visualization (1)
- volatility (1)
- volume of fluid method (1)
- wave based method (1)
- wave propagation (1)
- weak solution theory (1)
- weakly/ strictly pareto optima (1)
- white noise (1)
- wild bootstrap test (1)
- working memory (1)

#### Faculty / Organisational entity

In this paper a three dimensional stochastic model for the lay-down of fibers on a moving conveyor belt in the production process of nonwoven materials is derived. The model is based on stochastic diferential equations describing the resulting position of the fiber on the belt under the influence of turbulent air ows. The model presented here is an extension of an existing surrogate model, see [6, 3].

The World Wide Web is a medium through which a manufacturer may allow Internet visitors to customize or compose his products. Due to missing or rapidly changing standards these applications are often restricted to relatively simple CGI or JAVA based scripts. Usually, results like images or movies are stored in a database and are transferred on demand to the web-user. Viper (Visualisierung parametrisch editierbarer Raumkomponenten) is a Toolkit [VIP96] written in C++ and JAVA which provides 3D-modeling and visualization methodsfor developing complex web-based applications. The Toolkit has been designed to built a prototype, which can be used to construct and visualize prefabricated homes on the Internet. Alternative applications are outlined in this paper. Within Viper, all objects are stored in a scene graph (VSSG ), which is the basic data structure of the Toolkit. To show the concept and structure of the Toolkit, functionality, and implementation of the prototype are described.

In this work, we analyze two important and simple models of short rates, namely Vasicek and CIR models. The models are described and then the sensitivity of the models with respect to changes in the parameters are studied. Finally, we give the results for the estimation of the model parameters by using two different ways.

Let \(a_1,\dots,a_n\) be independent random points in \(\mathbb{R}^d\) spherically symmetrically but not necessarily identically distributed. Let \(X\) be the random polytope generated as the convex hull of \(a_1,\dots,a_n\) and for any \(k\)-dimensional subspace \(L\subseteq \mathbb{R}^d\) let \(Vol_L(X) :=\lambda_k(L\cap X)\) be the volume of \(X\cap L\) with respect to the \(k\)-dimensional Lebesgue measure \(\lambda_k, k=1,\dots,d\). Furthermore, let \(F^{(i)}\)(t):= \(\bf{Pr}\) \(\)(\(\Vert a_i \|_2\leq t\)),
\(t \in \mathbb{R}^+_0\) , be the radial distribution function of \(a_i\). We prove that the expectation
functional \(\Phi_L\)(\(F^{(1)}, F^{(2)},\dots, F^{(n)})\) := \(E(Vol_L(X)\)) is strictly decreasing in
each argument, i.e. if \(F^{(i)}(t) \le G^{(i)}(t)t\), \(t \in {R}^+_0\), but \(F^{(i)} \not\equiv G^{(i)}\), we show \(\Phi\) \((\dots, F^{(i)}, \dots\)) > \(\Phi(\dots,G^{(i)},\dots\)). The proof is clone in the more general framework
of continuous and \(f\)- additive polytope functionals.

In this article we give a sufficient condition that a simply connected flexible body does not penetrate itself, if it is subjected to a continuous deformation. It is shown that the deformation map is automatically injective, if it is just locally injective and injective on the boundary of the body. Thereby, it is very remarkable that no higher regularity assumption than continuity for the deformation map is required. The proof exclusively relies on homotopy methods and the Jordan-Brouwer separation theorem.

We propose a constraint-based approach for the two-dimensional rectangular packing problem with orthogonal orientations. This problem is to arrange a set of rectangles that can be rotated by 90 degrees into a rectangle of minimal size such that no two rectangles overlap. It arises in the placement of electronic devices during the layout of 2.5D System-in-Package integrated electronic systems. Moffitt et al. [8] solve the packing without orientations with a branch and bound approach and use constraint propagation. We generalize their propagation techniques to allow orientations. Our approach is compared to a mixed-integer program and we provide results that outperform it.

The notion of Q-Gorenstein smoothings has been introduced by Kollar. ([KoJ], 6.2.3). This notion is essential for formulating Kollar's conjectures on smoothing components for rational surface singularities. He conjectures, loosely speaking, that every smoothing of a rational surface singularity can be obtained by blowing down a deformation of a partial resolution, this partial resolution having the property (among others) that the singularities occuring on it all have qG-smoothings. (For more details and precise statements see [Ko], ch. 6.). It is therefore of interest to construct singularities having qG-smoothings.

The direction splitting approach proposed earlier in [6], aiming at the efficient solution of Navier-Stokes equations, is extended and adopted here to solve the Navier-Stokes-Brinkman equations describing incompressible flows in plain and in porous media. The resulting pressure equation is a perturbation of the
incompressibility constrained using a direction-wise factorized operator as proposed in [6]. We prove that this approach is unconditionally stable for the unsteady Navier-Stokes-Brinkman problem. We also provide numerical illustrations of the method's accuracy and efficiency.

A theory of discrete Cosserat rods is formulated in the language of discrete Lagrangian mechanics. By exploiting Kirchho's kinetic analogy, the potential energy density of a rod is a function on the tangent bundle of the conguration manifold and thus formally corresponds to the Lagrangian function of a dynamical system. The equilibrium equations are derived from a variational principle using a formulation that involves null{space matrices. In this formulation, no Lagrange multipliers are necessary to enforce orthonormality of the directors. Noether's theorem relates rst integrals of the equilibrium equations to Lie group actions on the conguration bundle, so{called symmetries. The symmetries relevant for rod mechanics are frame{indierence, isotropy and uniformity. We show that a completely analogous and self{contained theory of discrete rods can be formulated in which the arc{length is a discrete variable ab initio. In this formulation, the potential energy density is dened directly on pairs of points along the arc{length of the rod, in analogy to Veselov's discrete reformulation of Lagrangian mechanics. A discrete version of Noether's theorem then identies exact rst integrals of the discrete equilibrium equations. These exact conservation properties confer the discrete solutions accuracy and robustness, as demonstrated by selected examples of application. Copyright c 2010 John Wiley & Sons, Ltd.

For the last decade, optimization of beam orientations in intensitymodulated radiation therapy (IMRT) has been shown to be successful in improving the treatment plan. Unfortunately, the quality of a set of beam orientations depends heavily on its corresponding beam intensity proles. Usually, a stochastic selector is used for optimizing beam orientation, and then a single objective inverse treatment planning algorithm is used for the optimization of beam intensity proles. The overall time needed to solve the inverse planning for every random selection of beam orientations becomes excessive. Recently, considerable improvement has been made in optimizing beam intensity proles by using multiple objective inverse treatment planning. Such an approach results in a variety of beam intensity proles for every selection of beam orientations, making the dependence between beam orientations and its intensity proles less important. We take advantage of this property to present a dynamic algorithm for beam orientation in IMRT which is based on multicriteria inverse planning. The algorithm approximates beam intensity proles iteratively instead of doing it for every selection of beam orientation, saving a considerable amount of calculation time. Every iteration goes from an N-beam plan to a plan with N + 1 beams. Beam selection criteria are based on a score function that minimizes the deviation from the prescribed dose, in addition to a reject-accept criterion. To illustrate the eciency of the algorithm it has been applied to an articial example where optimality is trivial and to three real clinical cases: a prostate carcinoma, a tumor in the head and neck region and a paraspinal tumor. In comparison to the standard equally spaced beam plans, improvements are reported in all of the three clinical examples, even, in some cases with a fewer number of beams.

Estelle is an internationally standardized formal description technique (FDT) designed for the specification of distributed systems, in particular communication protocols. An Estelle specification describes a system of communicating components (module instances). The specified system is closed in a topological sense, i.e. it has no ability to interact with some environment. Because of this restriction, open systems can only be specified together with and incorporated with an environment. To overcome this restriction, we introduce a compatible extension of Estelle, called "Open Estelle". It allows the specification of (topologically) open systems, i.e. systems that have the ability to communicate with any environment through a well-defined external interface. We define aformal syntax and a formal semantics for Open Estelle, both based on and extending the syntax and semantics of Estelle. The extension is compatible syntactically and semantically, i.e. Estelle is a subset of Open Estelle. In particular, the formal semantics of Open Estelle reduces to the Estelle semantics in the special case of a closed system. Furthermore, we present a tool for the textual integration of open systems into environments specified in Open Estelle, and a compiler for the automatic generation of implementations directly from Open Estelle specifications.

We present a generalization of Proth's theorem for testing certain large integers for primality. The use of Gauß sums leads to a much simpler approach to these primality criteria as compared to the earlier tests. The running time of the algorithms is bounded by a polynomial in the length of the input string. The applicability of our algorithms is linked to certain diophantine approximations of \(l\)-adic roots of unity.

Territory design and districting may be viewed as the problem of grouping small geographic areas into larger geographic clusters called territories in such a way that the latter are acceptable according to relevant planning criteria. The availability of GIS on computers and the growing interest in Geo-Marketing leads to an increasing importance of this area. Despite the wide range of applications for territory design problems, when taking a closer look at the models proposed in the literature, a lot of similarities can be noticed. Indeed, the models are many times very similar and can often be, more or less directly, carried over to other applications. Therefore, our aim is to provide a generic application-independent model and present efficient solution techniques. We introduce a basic model that covers aspects common to most applications. Moreover, we present a method for solving the general model which is based on ideas from the field of computational geometry. Theoretical as well as computational results underlining the efficiency of the new approach will be given. Finally, we show how to extend the model and solution algorithm to make it applicable for a broader range of applications and how to integrate the presented techniques into a GIS.

Abstract. An efficient approach to the numerical upscaling of thermal conductivities of fibrous media, e.g. insulation materials, is considered. First, standard cell problems for a second order elliptic equation are formulated for a proper piece of random fibrous structure, following homogenization theory. Next, a graph formed by the fibers is considered, and a second order elliptic equation with suitable boundary conditions is solved on this graph only. Replacing the boundary value problem for the full cell with an auxiliary problem with special boundary conditions on a connected subdomain of highly conductive material is justified in a previous work of the authors. A discretization on the graph is presented here, and error estimates are provided. The efficient implementation of the algorithm is discussed. A number of numerical experiments is presented in order to illustrate the performance of the proposed method.

Experience gathered from applying the software process modeling language MVP-L in software development organizations has shown the need for graphical representations of process models. Project members (i.e„ non MVP-L specialists) review models much more easily by using graphical representations. Although several various graphical notations were developed for individual projects in which MVP-L was applied, there was previously no consistent definition of a mapping between textual MVP-L models and graphical representations. This report defines a graphical representation schema for MVP-L
descriptions and combines previous results in a unified form. A basic set of building blocks (i.e., graphical symbols and text fragments) is defined, but because we must first gain experience with the new symbols, only rudimentary guidelines are given for composing basic
symbols into a graphical representation of a model.

In the literature, there are at least two equivalent two-factor Gaussian models for the instantaneous short rate. These are the original two-factor Hull White model (see [3]) and the G2++ one by Brigo and Mercurio (see [1]). Both these models first specify a time homogeneous two-factor short rate dynamics and then by adding a deterministic shift function '(·) fit exactly the initial term structure of interest rates. However, the obtained results are rather clumsy and not intuitive which means that a special care has to be taken for their correct numerical implementation.

In this article, we give an explicit homotopy between the solutions (i.e. stress, strain, displacement) of the quasistatic linear elastic and nonlinear elastoplastic boundary value problem, where we assume a linear kinematic hardening material law. We give error estimates with respect to the homotopy parameter.

A Lattice Boltzmann Method for immiscible multiphase flow simulations using the Level Set Method
(2008)

We consider the lattice Boltzmann method for immiscible multiphase flow simulations. Classical lattice Boltzmann methods for this problem, e.g. the colour gradient method or the free energy approach, can only be applied when density and viscosity ratios are small. Moreover, they use additional fields defined on the whole domain to describe the different phases and model phase separation by special interactions at each node. In contrast, our approach simulates the flow using a single field and separates the fluid phases by a free moving interface. The scheme is based on the lattice Boltzmann method and uses the level set method to compute the evolution of the interface. To couple the fluid phases, we develop new boundary conditions which realise the macroscopic jump conditions at the interface and incorporate surface tension in the lattice Boltzmann framework. Various simulations are presented to validate the numerical scheme, e.g. two-phase channel flows, the Young-Laplace law for a bubble and viscous fingering in a Hele-Shaw cell. The results show that the method is feasible over a wide range of density and viscosity differences.

We present the application of a meshfree method for simulations of interaction between fluids and flexible structures. As a flexible structure we consider a sheet of paper. In a two-dimensional framework this sheet can be modeled as curve by the dynamical Kirchhoff-Love theory. The external forces taken into account are gravitation and the pressure difference between upper and lower surface of the sheet. This pressure difference is computed using the Finite Pointset Method (FPM) for the incompressible Navier-Stokes equations. FPM is a meshfree, Lagrangian particle method. The dynamics of the sheet are computed by a finite difference method. We show the suitability of the meshfree method for simulations of fluid-structure interaction in several applications.

In this article, we consider the problem of planning inspections and other tasks within a software development (SD) project with respect to the objectives quality (no. of defects), project duration, and costs. Based on a discrete-event simulation model of SD processes comprising the phases coding, inspection, test, and rework, we present a simplified formulation of the problem as a multiobjective optimization problem. For solving the problem (i.e. finding an approximation of the efficient set) we develop a multiobjective evolutionary algorithm. Details of the algorithm are discussed as well as results of its application to sample problems.

A method to correct the elastic stress tensor at a fixed point of an elastoplastic body, which is subject to exterior loads, is presented and analysed. In contrast to uniaxial corrections (Neuber or ESED), our method takes multiaxial phenomena like ratchetting or cyclic hardening/softening into account by use of Jiang's model. Our numerical algorithm is designed for the case that the scalar load functions are piecewise linear and can be used in connection with critical plane/multiaxial rainflow methods in high cycle fatigue analysis. In addition, a local existence and uniqueness result of Jiang's equations is given.

The level-set method has been recently introduced in the field of shape optimization, enabling a smooth representation of the boundaries on a fixed mesh and therefore leading to fast numerical algorithms. However, most of these algorithms use a Hamilton-Jacobi equation to connect the evolution of the level-set function with the deformation of the contours, and consequently they cannot create any new holes in the domain (at least in 2D). In this work, we propose an evolution equation for the level-set function based on a generalization of the concept of topological gradient. This results in a new algorithm allowing for all kinds of topology changes.

This paper disscuses the minimal area rectangular packing problem of how to pack a set of specified, non-overlapping rectangels into a rectangular container of minimal area. We investigate different mathematical programming approaches of this and introduce a novel approach based on non-linear optimization and the \\\"tunneling effect\\\" achieved by a relaxation of the non-overlapping constraints.

The problem discussed in this paper is motivated by the new recycling directiveWEEE of the EC. The core of this law is, that each company which sells electrical or electronic equipment in a European country has the obligation to recollect and recycle an amount of returned items which is proportional to its market share. To assign collection stations to companies, in Germany for one product type a territory design approach is planned. However, in contrast to classical territory design, the territories should be geographically as dispersed as possible to avoid that a company, resp. its logistics provider responsible for the recollection, gains a monopoly in some region. First, we identify an appropriate measure for the dispersion of a territory. Afterwards, we present a first mathematical programming model for this new problem as well as a solution method based on the GRASP methodology. Extensive computational results illustrate the suitability of the model and assess the effectiveness of the heuristic.

This work presents the dynamic capillary pressure model (Hassanizadeh, Gray, 1990, 1993a) adapted for the needs of paper manufacturing process simulations. The dynamic capillary pressure-saturation relation is included in a one-dimensional simulation model for the pressing section of a paper machine. The one-dimensional model is derived from a two-dimensional model by averaging with respect to the vertical direction. Then, the model is discretized by the finite volume method and solved by Newton’s method. The numerical experiments are carried out for parameters typical for the paper layer. The dynamic capillary pressure-saturation relation shows significant influence on the distribution of water pressure. The behaviour of the solution agrees with laboratory experiments (Beck, 1983).

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.

In this article, we present an analytic solution for Jiang's constitutive model of elastoplasticity. It is considered in its stress controlled form for proportional stress loading under the assumptions that the one-to-one coupling of the yield surface radius and the memory surface radius is switched off, that the transient hardening is neglected and that the ratchetting exponents are constant.

A number of water flow problems in porous media are modelled by Richards’ equation [1]. There exist a lot of different applications of this model. We are concerned with the simulation of the pressing section of a paper machine. This part of the industrial process provides the dewatering of the paper layer by the use of clothings, i.e. press felts, which absorb the water during pressing [2]. A system of nips are formed in the simplest case by rolls, which increase sheet dryness by pressing against each other (see Figure 1). A lot of theoretical studies were done for Richards’ equation (see [3], [4] and references therein). Most articles consider the case of x-independent coefficients. This simplifies the system considerably since, after Kirchhoff’s transformation of the problem, the elliptic operator becomes linear. In our case this condition is not satisfied and we have to consider nonlinear operator of second order. Moreover, all these articles are concerned with the nonstationary problem, while we are interested in the stationary case. Due to complexity of the physical process our problem has a specific feature. An additional convective term appears in our model because the porous media moves with the constant velocity through the pressing rolls. This term is zero in immobile porous media. We are not aware of papers, which deal with such kind of modified steady Richards’ problem. The goal of this paper is to obtain the stability results, to show the existence of a solution to the discrete problem, to prove the convergence of the approximate solution to the weak solution of the modified steady Richards’ equation, which describes the transport processes in the pressing section. In Section 2 we present the model which we consider. In Section 3 a numerical scheme obtained by the finite volume method is given. The main part of this paper is theoretical studies, which are given in Section 4. Section 5 presents a numerical experiment. The conclusion of this work is given in Section 6.

The main problem in computer graphics is to solve the global illumination problem,
which is given by a Fredholm integral equation of the second kind, called the radiance equation (REQ). In order to achieve realistic images, a very complex kernel
of the integral equation, modelling all physical effects of light, must be considered. Due to this complexity Monte Carlo methods seem to be an appropriate approach to solve the REQ approximately. We show that replacing Monte Carlo by quasi-Monte Carlo in some steps of the algorithm results in a faster convergence.

The modelling of hedge funds poses a difficult problem since the available reported data sets are often small and incomplete. We propose a switching regression model for hedge funds, in which the coefficients are able to switch between different regimes. The coefficients are governed by a Markov chain in discrete time. The different states of the Markov chain represent different states of the economy, which influence the performance of the independent variables. Hedge fund indices are chosen as regressors. The parameter estimation for the switching parameter as well as for the switching error term is done through a filtering technique for hidden Markov models developed by Elliott (1994). Recursive parameter estimates are calculated through a filter-based EM-algorithm, which uses the hidden information of the underlying Markov chain. Our switching regression model is applied on hedge fund series and hedge fund indices from the HFR database.

The first part of this paper studies a Levenberg-Marquardt scheme for nonlinear inverse problems where the corresponding Lagrange (or regularization) parameter is chosen from an inexact Newton strategy. While the convergence analysis of standard implementations based on trust region strategies always requires the invertibility of the Fréchet derivative of the nonlinear operator at the exact solution, the new Levenberg-Marquardt scheme is suitable for ill-posed problems as long as the Taylor remainder is of second order in the interpolating metric between the range and dornain
topologies. Estimates of this type are established in the second part of the paper for ill-posed parameter identification problems arising in inverse groundwater hydrology. Both, transient and steady state data are investigated. Finally, the numerical performance of the new Levenberg-Marquardt scheme is
studied and compared to a usual implementation on a realistic but synthetic 2D model problem from the engineering literature.

Within this paper we review image distortion measures. A distortion measure is a criterion that assigns a "quality number" to an image. We distinguish between mathematical distortion measures and those distortion measures in-cooperating a priori knowledge about the imaging devices ( e.g. satellite images), image processing algorithms or the human physiology. We will consider representative examples of different kinds of distortion measures and are going to discuss them.

Let \(a_1, i:=1,\dots,m\), be an i.i.d. sequence taking values in \(\mathbb{R}^n\), whose convex hull is interpreted as a stochastic polyhedron \(P\). For a special class of random variables, which decompose additively relative to their boundary simplices, eg. the volume of \(P\), simple integral representations of its first two moments are given in case of rotationally symmetric distributions in order to facilitate estimations of variances or to quantify large deviations from the mean.

In this paper we present and investigate a stochastic model for the lay-down of fibers on a conveyor belt in the production process of nonwovens. The model is based on a stochastic differential equation taking into account the motion of the ber under the influence of turbulence. A reformulation as a stochastic Hamiltonian system and an application of the stochastic averaging theorem lead to further simplications of the model. Finally, the model is used to compute the distribution of functionals of the process that might be helpful for the quality assessment of industrial fabrics.

The rapid development of any field of knowledge brings with it unavoidable fragmentation and proliferation of new disciplines. The development of computer science is no exception. Software engineering (SE) and human-computer interaction (HCI) are both relatively new disciplines of computer science. Furthermore, as both names suggest, they each have strong connections with other subjects. SE is concerned with methods and tools for general software development based on engineering principles. This discipline has its roots not only in computer science but also in a number of traditional engineering disciplines. HCI is concerned with methods and tools for the development of human-computer interfaces, assessing the usability of computer systems and with broader issues about how people interact with computers. It is based on theories about how humans process information and interact with computers, other objects and other people in the organizational and social contexts in
which computers are used. HCI draws on knowledge and skills from psychology, anthropology and sociology in addition to computer science. Both disciplines need ways of measuring how well their products and development processes fulfil their intended requirements. Traditionally SE has been concerned with 'how software is constructed' and HCI with 'how people use software'. Given the
different histories of the disciplines and their different objectives, it is not surprising that they take different approaches to measurement. Thus, each has its own distinct 'measurement culture.' In this paper we analyse the differences and the commonalties of the two cultures by examining the measurement approaches used by each. We then argue the need for a common measurement taxonomy and framework, which is derived from our analyses of the two disciplines. Next we demonstrate the usefulness of the taxonomy and framework via specific example studies drawn from our own work and that of others and show that, in fact, the two disciplines have many important similarities as well as differences and that there is some evidence to suggest that they are growing closer. Finally, we discuss the role of the taxonomy as a framework to support: reuse, planning future studies, guiding practice and facilitating communication between the two disciplines.

In this work we propose a set of term-rewriting techniques for modelling object-oriented computation. Based on symbolic variants of explicit substitutions calculi, we show how to deal with imperative statements like assignment and sequence in specifications in a pure declarative style. Under our model, computation with classes and objects becomes simply normal form calculation, exactly as it is the case in term-rewriting based languages (for instance the functional languages). We believe this kind of unification between functions and
objects is important because it provides plausible alternatives for using the term-rewriting theory as an engine for supporting the formal and mechanical reasoning about object-oriented specifications.

The paper production is a problem with significant importance for the society
and it is a challenging topic for scientific investigations. This study is concerned
with the simulations of the pressing section of a paper machine. A two-dimensional
model is developed to account for the water flow within the pressing zone. Richards’
type equation is used to describe the flow in the unsaturated zone. The dynamic capillary
pressure–saturation relation proposed by Hassanizadeh and co-workers (Hassanizadeh
et al., 2002; Hassanizadeh, Gray, 1990, 1993a) is adopted for the paper
production process.
The mathematical model accounts for the co-existence of saturated and unsaturated
zones in a multilayer computational domain. The discretization is performed
by the MPFA-O method. The numerical experiments are carried out for parameters
which are typical for the production process. The static and dynamic capillary
pressure–saturation relations are tested to evaluate the influence of the dynamic
capillary effect.

A unified approach to Credit Default Swaption and Constant Maturity Credit Default Swap valuation
(2006)

In this paper we examine the pricing of arbitrary credit derivatives with the Libor Market Model with Default Risk. We show, how to setup the Monte Carlo-Simulation efficiently and investigate the accuracy of closed-form solutions for Credit Default Swaps, Credit Default Swaptions and Constant Maturity Credit Default Swaps. In addition we derive a new closed-form solution for Credit Default Swaptions which allows for time-dependent volatility and abitrary correlation structure of default intensities.1

Let \(A\):= {\(a_i\mid i= 1,\dots,m\)} be an i.i.d. random sample in (\mathbb{R}^n\), which we consider a random polyhedron, either as the convex hull of the \(a_i\) or as the intersection of halfspaces {\(x \mid a ^T_i x\leq 1\)}. We introduce a class of polyhedral functionals we will call "additive-type functionals", which covers a number of polyhedral functionals discussed in different mathematical fields, where the emphasis in our contribution will be on those, which arise in linear optimization theory. The class of additive-type functionals is a suitable setting in order to unify and to simplify the asymptotic probabilistic analysis of first and second moments of polyhedral functionals. We provide examples of asymptotic results on expectations and on variances.

The problem to interpolate Hermite-type data (i.e. two points with attached tangent vectors) with elastic curves of prescribed tension is known to have multiple solutions. A method is presented that finds all solutions of length not exceeding one period of its curvature function. The algorithm is based on algebraic relations between discrete curvature information which allow to transform the problem into a univariate one. The method operates with curves that by construction partially interpolate the given data. Hereby the objective function of the problem is drastically simplified. A bound on the maximum curvature value is established that provides an interval containing all solutions.

This document introduces the extension of Katja to support position structures and explains the subtleties of their application as well as the design decisions made and problems solved with respect to their implementation. The Katja system was first introduced by Jan Schäfer in the context of his project work and is based on the MAX system developed by Arnd Poetzsch-Heffter.

An easy numerical handling of time-dependent problems with complicated geometries, free moving boundaries and interfaces, or oscillating solutions is of great importance for many applications, e.g., in fluid dynamics (free surface and multiphase flows, fluid-structure interactions [22, 18, 24]), failure mechanics (crack growth and propagation [4]), magnetohydrodynamics (accretion disks, jets and cloud simulation [6]), biophysics and -chemistry. Appropriate discretizations, so-called mesh-less methods, have been developed during the last decades to meet these challenging demands and to relieve the burden of remeshing and successive mesh generation being faced by the conventional mesh-based methods, [16, 10, 3]. The prearranged mesh is an artificial constraint to ensure compatibility of the mesh-based interpolant schemes, that often conflicts with the real physical conditions of the continuum model. Then, remeshing becomes inevitable, which is not only extremely time- and storage consuming but also the source for numerical errors and hence the gradual loss of computational accuracy. Apart from this advantage, mesh-less methods also lead to fundamentally better approximations regarding aspects, such as smoothness, nonlocal interpolation character, flexible connectivity, refinement and enrichment procedures, [16]. The common idea of mesh-less methods is the discretization of the domain of interest by a finite set of independent, randomly distributed particles moving with a characteristic velocity of the problem. Location and distribution of the particles then account for the time-dependent description of the geometry, data and solution. Thereby, the global solution is linearly superposed from the local information carried by the particles. In classical particle methods [20, 21], the respective weight functions are Dirac distributions which yield solutions in a distributional sense.

Algebraic Systems Theory
(2004)

Control systems are usually described by differential equations, but their properties of interest are most naturally expressed in terms of the system trajectories, i.e., the set of all solutions to the equations. This is the central idea behind the so-called "behavioral approach" to systems and control theory. On the other hand, the manipulation of linear systems of differential equations can be formalized using algebra, more precisely, module theory and homological methods ("algebraic analysis"). The relationship between modules and systems is very rich, in fact, it is a categorical duality in many cases of practical interest. This leads to algebraic characterizations of structural systems properties such as autonomy, controllability, and observability. The aim of these lecture notes is to investigate this module-system correspondence. Particular emphasis is put on the application areas of one-dimensional rational systems (linear ODE with rational coefficients), and multi-dimensional constant systems (linear PDE with constant coefficients).

Wireless sensor networks are the driving force behind many popular and interdisciplinary research areas, such as environmental monitoring, building automation, healthcare and assisted living applications. Requirements like compactness, high integration of sensors, flexibility, and power efficiency are often very different and cannot be fulfilled by state-of-the-art node platforms at once. In this paper, we present and analyze AmICA: a flexible, compact, easy-to-program, and low-power node platform. Developed from scratch and including a node, a basic communication protocol, and a debugging toolkit, it assists in an user-friendly rapid application development. The general purpose nature of AmICA was evaluated in two practical applications with diametric requirements. Our analysis shows that AmICA nodes are 67% smaller than BTnodes, have five times more sensors than Mica2Dot and consume 72% less energy than the state-of-the-art TelosB mote in sleep mode.

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.

In this paper, the analysis of one approach for the regularization of pure Neumann problems for second order elliptical equations, e.g., Poisson’s equation and linear elasticity equations, is presented. The main topic under consideration is the behavior of the condition number of the regularized problem. A general framework for the analysis is presented. This allows to determine a form of regularization term which leads to the “natural” asymptotic of the condition number of the regularized problem with respect to mesh parameter. Some numerical results, which support theoretical analysis are presented as well. The main motivation for the presented research is to develop theoretical background for an efficient and robust implementation of the solver for pure Neumann problems for the linear elasticity equations. Such solvers usually are needed in a number of domain decomposition methods, e.g. FETI. Developed approaches are planed to be used in software, developing in ITWM, e.g. KneeMech simulation software.

An efficient approach for calculating the effective heat conductivity for a class of industrial composite materials, such as metal foams, fibrous glass materials, and the like, is discussed. These materials, used in insulation or in advanced heat exchangers, are characterized by a low volume fraction of the highly conductive material (glass or metal) having a complex, network-like structure and by a large volume fraction of the insulator (air). We assume that the composite materials have constant macroscopic thermal conductivity tensors, which in principle can be obtained by standard up-scaling techniques, that use the concept of representative elementary volumes (REV), i.e. the effective heat conductivities of composite media can be computed by post-processing the solutions of some special cell problems for REVs. We propose, theoretically justify, and numerically study an efficient approach for calculating the effective conductivity for media for which the ratio of low and high conductivities satisfies 1. In this case one essentially only needs to solve the heat equation in the region occupied by the highly conductive media. For a class of problems we show, that under certain conditions on the microscale geometry, the proposed approach produces an upscaled conductivity that is O() close to the exact upscaled permeability. A number of numerical experiments are presented in order to illustrate the accuracy and the limitations of the proposed method. Applicability of the presented approach to upscaling other similar problems, e.g. flow in fractured porous media, is also discussed.

Let \(a_1,\dots,a_m\) be i.i .d. vectors uniform on the unit sphere in \(\mathbb{R}^n\), \(m\ge n\ge3\) and let \(X\):= {\(x \in \mathbb{R}^n \mid a ^T_i x\leq 1\)} be the random polyhedron generated by. Furthermore, for linearly independent vectors \(u\), \(\bar u\) in \(\mathbb{R}^n\), let \(S_{u, \bar u}(X)\) be the number of shadow vertices of \(X\) in \(span (u, \bar u\)). The paper provides an asymptotic expansion of the expectation value \(E (S_{u, \bar u})\) for fixed \(n\) and \(m\to\infty\). The first terms of the expansion are given explicitly. Our investigation of \(E (S_{u, \bar u})\) is closely connected to Borgwardt's probabilistic analysis of the shadow vertex algorithm - a parametric variant of the simplex algorithm. We obtain an improved asymptotic upper bound for the number of pivot steps required by the shadow vertex algorithm for uniformly on the sphere distributed data.

In this paper, the model of Köttgen, Barkey and Socie, which corrects the elastic stress and strain tensor histories at notches of a metallic specimen under non-proportional loading, is improved. It can be used in connection with any multiaxial s -e -law of incremental plasticity. For the correction model, we introduce a constraint for the strain components that goes back to the work of Hoffmann and Seeger. Parameter identification for the improved model is performed by Automatic Differentiation and an established least squares algorithm. The results agree accurately both with transient FE computations and notch strain measurements.

This report explains basic notions and concepts of Abstract State Machines (ASM) as well as notation for defining ASM models. The objective here is to provide an intuitive understanding of the formalism; for a rigorous definition of the mathematical foundations of ASM, the reader is referred to [2] and [3]. Further references on ASM-related material can be found on the ASM Web Pages [1].

A natural extension of SLD-resolution is introduced as a goal directed proof procedure
for the full first order implicational fragment of intuitionistic logic. Its intuitionistic semantic fits a procedural interpretation of logic programming. By allowing arbitrary nested implications it can be used for implementing modularity in logic programs. With adequate negation axioms it gives an alternative to negation as failure and leads to a proof procedure for full first order predicate logic.

A general multi-period network redesign problem arising in the context of strategic supply chain planning (SCP) is studied. Several aspects of practical relevance in SCP are captured namely, multiple facility layers with different types of facilities, flows between facilities in the same layer, direct shipments to customers, and facility relocation. An efficient two-phase heuristic approach is proposed for obtaining feasible solutions to the problem, which is initially modeled as a large-scale mixed-integer linear program. In the first stage of the heuristic, a linear programming rounding strategy is applied to second initial values for the binary location variables in the model. The second phase of the heuristic uses local search to correct the initial solution when feasibility is not reached or to improve the solution when its quality does not meet given criteria. The results of an extensive computational study performed on randomly generated instances are reported.

User interfaces for large distributed applications have to handle specific problems: the complexity of the application itself and the integration of online-data into the user interface. A main task of the user interface architecture is to provide powerful tools to design and augment the end-user system easily, hence giving the designer more time to focus on user requirements. Our experiences developing a user interface system for a process control room showed that a lot of time during the development process is wasted for the integration of online-data residing anywhere but not in the user interface itself. Furtheron external data may be kept by different kinds of programs, e.g. C-programs running
a numerical process model or PROLOG-programs running a diagnosis system, both in parallel to the process and in parallel to the user interface. Facing these specific requirements, we developed a user interface architecture following two main goals: 1. integration of external information into high-level graphical objects and 2. the system should be open for any program running as a separate process using its own problem-oriented language. The architecture is based on two approaches: an asynchronous, distributed and language independent communication model and an object model describing the problem domain and the interface using object-oriented techniques. Other areas like rule-based programming are involved, too. With this paper, we will present the XAVIA user interface architecture, the (as far as we know) first user inteface architecture, which is consequently based on a distributed object model.

In this paper we develop monitoring schemes for detecting structural changes
in nonlinear autoregressive models. We approximate the regression function by a
single layer feedforward neural network. We show that CUSUM-type tests based
on cumulative sums of estimated residuals, that have been intensively studied
for linear regression in both an offline as well as online setting, can be extended
to this model. The proposed monitoring schemes reject (asymptotically) the null
hypothesis only with a given probability but will detect a large class of alternatives
with probability one. In order to construct these sequential size tests the limit
distribution under the null hypothesis is obtained.

The local solution problem of multivariate Fredholm integral equations is studied. Recent research proved that for several function classes the complexity of this problem is closely related to the Gelfand numbers of some characterizing operators. The generalization of this approach to the situation of arbitrary Banach spaces is the subject of the present paper.
Furthermore, an iterative algorithm is described which - under some additional conditions - realizes the optimal error rate. The way these general theorems work is demonstrated by applying them to integral equations in a Sobolev space of periodic functions with dominating mixed derivative of various order.

We give an analytical and geometrical treatment of what it means to sepa rate a Gaussian kernel along arbitrary axes in Rn, and we present a separation scheme that allows to efficiently implement anisotropic Gaussian convolution filters in arbitrary dimension. Based on our previous analysis we show that this scheme is optimal with regard to the number of memory accesses and nterpolation operations needed. Our method relies on non-orthogonal convolution axes and works com- pletely in image space. Thus, it avoids the need for an FFT-subroutine. Depending on the accuracy and speed requirements, different interpolation schemes and methods to implement the one-dimensional Gaussian (FIR, IIR) can be integrated. The algorithm is also feasible for hardware that does not contain a floating-point unit. Special emphasis is laid on analyzing the performance and accuracy of our method. In particular, we show that withot any special optimization of the source code, our method can perform anisotropic Gaussian filtering faster than methods relyin on the Fast Fourier Transform.

In this work, some model reduction approaches for performing simulations
with a pseudo-2D model of Li-ion battery are presented. A full pseudo-2D model of processes in Li-ion batteries is presented following
[3], and three methods to reduce the order of the full model are considered. These are: i) directly reduce the model order using proper
orthogonal decomposition, ii) using fractional time step discretization in order to solve the equations in decoupled way, and iii) reformulation
approaches for the diffusion in the solid phase. Combinations of above
methods are also considered. Results from numerical simulations are presented, and the efficiency and the accuracy of the model reduction approaches are discussed.

This paper introduces methods for the detection of anisotropies which are caused by compression of regular three-dimensional point patterns. Isotropy tests based on directional summary statistics and estimators for the compression factor are developed. These allow not only for the detection of anisotropies but also for the estimation of their strength. Using simulated data the power of the methods and the dependence of the power on the intensity, the degree of regularity, and the compression strength are studied. The motivation of this paper is the investigation of anisotropies in the structure of polar ice. Therefore, our methods are applied to the point patterns of centres of air pores extracted from tomographic images of ice cores. This way the presence of anisotropies in the ice caused by the compression of the ice sheet as well as an increase of their strength with increasing depth are shown.

Forderungen nach kürzeren Entwicklungszyklen bei gleichzeitig höherer Produktqualität führen in allen Bereichen der Nutzfahrzeugtechnik und insbesondere auch bei Baumaschinen zum verstärkten Einsatz von Simulationssoftware. Um in diesem Sinne Lebensdauerberechnungen durchführen zu können, sind jedoch genaue Kenntnisse über die im Kundeneinsatz auftretenden Betriebslasten und Beanspruchungen erforderlich. Für deren Ermittlung hat der Baumaschinenhersteller VOLVO Construction Equipment einen Mobilbagger umfassend mit Messtechnik ausgestattet, die neben den mechanischen Belastungen an der Arbeitsausrüstung auch wesentliche Kenndaten des Hydrauliksystems und des Fahrantriebs erfasst. Dieser Messbagger wurde bereits bei unterschiedlichen Kunden in Europa eingesetzt. Der Artikel beschreibt die methodische Vorgehensweise zur Verarbeitung der erfassten Daten und zur Generierung von repräsentativen Nutzungsprofilen am Beispiel der mechanischen Belastungen an der Arbeitseinrichtung, die im Wesentlichen vom Fraunhofer Institut für Techno- und Wirtschaftsmathematik (ITWM) erarbeitet wurde.

We consider a volume maximization problem arising in gemstone cutting industry. The problem is formulated as a general semi-infinite program (GSIP) and solved using an interiorpoint method developed by Stein. It is shown, that the convexity assumption needed for the convergence of the algorithm can be satisfied by appropriate modelling. Clustering techniques are used to reduce the number of container constraints, which is necessary to make the subproblems practically tractable. An iterative process consisting of GSIP optimization and adaptive refinement steps is then employed to obtain an optimal solution which is also feasible for the original problem. Some numerical results based on realworld data are also presented.

During the recent years, multiobjective evolutionary algorithms have matured as a flexible optimization tool which can be used in various areas of reallife applications. Practical experiences showed that typically the algorithms need an essential adaptation to the specific problem for a successful application. Considering these requirements, we discuss various issues of the design and application of multiobjective evolutionary algorithms to real-life optimization problems. In particular, questions on problem-specific data structures and evolutionary operators and the determination of method parameters are treated. As a major issue, the handling of infeasible intermediate solutions is pointed out. Three application examples in the areas of constrained global optimization (electronic circuit design), semi-infinite programming (design centering problems), and discrete optimization (project scheduling) are discussed.

In der CAGD Literatur werden häufig Ableitungen und Graderhöhungen von Bezierkurven und -flächen wiederum in Bezierform angegeben [1][2][3][6]. Meistens werden diese Darstellungen nur für theoretische Betrachtungen verwendet, z.B. geometrischer Deutung von Stetigkeiten zwischen angrenzenden Flächenstücken. Für praktische Anwendungen reicht die Menge der Operationen jedoch nicht aus. Farouki und Rajan [4] zeigten, daß die Resultate arithmetischer Operationen, wie Addition und Multiplikation auf Bezierkurven auch als Bezierkurven darstellbar sind. Hier werden wir die Operationen auf polynomiale und rationale Tensorprodukt Bezierflächen und Flächen über Dreiecken ausdehnen. Eine Erweiterung auf rationale Flächen ermöglicht insbesondere die Ausführung einer Division, wie sie für viele Anwendungen benötigt wird. Das Rechnen mit Flächen hat im Gegensatz zu punktweisen Auswertungen den Vorteil gleichzeitig mit Hilfe von notwendigen Bedingungen an das entstandene Beziernetz sichere Ergebnisabschätungen angeben zu können. Diese lassen sich für adaptive Verfahren nutzen und sind insbesondere dort wichtig, wo es auf exakte Aussagen über das Verhalten von Flächen ankommt, wie z.B. bei der Qualitätsanalyse von Freiformflächen [5]. Mit Hilfe der hier vorgestellten Operationen läßt sich u.a. an Vorzeichenwechseln erkennen, ob eine zu untersuchende Bezierfläche konvex ist oder nicht (siehe Kapitel 4). Außerdem können Fehler, die bei punktweisen Auswertungen auf Gittern mit großer Maschenweite entstehen, vermieden werden. Nachdem in Kapitel 2 die zum Verständnis nötigen Definitionen und Schreibweisen erläutert wurden, werden in Kapitel 3 die grundlegenden Operationen für eine Arithmetik
auf Bezierflächen beschrieben. Dabei werden Formeln angegeben, die die Bezierpunkte und Gewichte der Ergebnisfläche aus denen der Operandenflächen bestimmen. Durch Aneinanderreihung und Verkettung einzelner Operationen lassen sich dann komplexe Berechnungen mit der gesamten Fläche ausführen. Zum Schluß werden in Kapitel 4 einige Beispiele aus dem Bereich der Qualitätsanalyse von Freiformflächen angegeben.

Asymptotic homogenisation technique and two-scale convergence is used for analysis of macro-strength and fatigue durability of composites with a periodic structure under cyclic loading. The linear damage accumulation rule is employed in the phenomenological micro-durability conditions (for each component of the composite) under varying cyclic loading. Both local and non-local strength and durability conditions are analysed. The strong convergence of the strength and fatigue damage measure as the structure period tends to zero is proved and their limiting values are estimated.

This work deals with the modeling and simulation of slender viscous jets exposed to gravity and rotation, as they occur in rotational spinning processes. In terms of slender-body theory we show the asymptotic reduction of a viscous Cosserat rod to a string system for vanishing slenderness parameter. We propose two string models, i.e. inertial and viscous-inertial string models, that differ in the closure conditions and hence yield a boundary value problem and an interface problem, respectively. We investigate the existence regimes of the string models in the four-parametric space of Froude, Rossby, Reynolds numbers and jet length. The convergence regimes where the respective string solution is the asymptotic limit to the rod turn out to be disjoint and to cover nearly the whole parameter space. We explore the transition hyperplane and derive analytically low and high Reynolds number limits. Numerical studies of the stationary jet behavior for different parameter ranges complete the work.

This report presents a generalization of tensor-product B-spline surfaces. The new scheme permits knots whose endpoints lie in the interior of the domain rectangle of a surface. This allows local refinement of the knot structure for approximation purposes as well as modeling surfaces with local tangent or curvature discontinuities. The surfaces are represented in terms of B-spline basis functions, ensuring affine invariance, local control, the convex hull property, and evaluation by de Boor's algorithm. A dimension formula for a class of generalized tensor-product spline spaces is developed.

It is commonly believed that not all degrees of freedom are needed to produce good solutions for the treatment planning problem in intensity modulated radiotherapy treatment (IMRT). However, typical methods to exploit this fact have either increased the complexity of the optimization problem or were heuristic in nature. In this work we introduce a technique based on adaptively refining variable clusters to successively attain better treatment plans. The approach creates approximate solutions based on smaller models that may get arbitrarily close to the optimal solution. Although the method is illustrated using a specific treatment planning model, the components constituting the variable clustering and the adaptive refinement are independent of the particular optimization problem.

In this paper we consider short term storage systems. We analyze presorting strategies to improve the effiency of these storage systems. The presorting task is called Batch PreSorting Problem (BPSP). The BPSP is a variation of an assigment problem, i.e., it has an assigment problem kernel and some additional constraints. We present different types of these presorting problems, introduce mathematical programming formulations and prove the NP-completeness for one type of the BPSP. Experiments are carried out in order to compare the different model formulations and to investigate the behavior of these models.

Im Bereich des Software Engineering werden komplexe Software-Entwicklungsprojekte betrachtet. Im Rahmen dieser Projekte werden große Mengen von Informationen bearbeitet. Diese Informationen werden in Software-Artefakten (z.B. in Projektplänen oder Entwicklungsdokumenten, wie Anforderungsbeschreibungen)
festgehalten. Die Artefakte werden während der Entwicklung und der Wartung eines Softwaresystems häufig geändert. Änderungen einer Information in einem Artefakt haben häufig Änderungen
im selben und in anderen Artefakten zur Folge, da Beziehungen innerhalb und zwischen den in den Artefakten festgehaltenen Informationen bestehen. Die Beziehungen liegen meist nicht explizit vor, so daß die Konsequenzen einer Änderung schwer zu überblicken sind. In dieser Arbeit wurde ein Verfolgbarkeitsansatz ausgewählt, der den Benutzer bei der Durchführung von Änderungen an Artefakten unterstützt. Unterstützung bedeutet hierbei, daß der Aufwand zur Durchführung einer Änderung reduziert wird und weniger Fehler bei der Durchführung gemacht werden.
In der Arbeit wurden Anforderungen an einen auszuwählenden Verfolgbarkeitsansatz gestellt. Eine Anforderung war, daß er auf verschiedene Bereiche des Software Engineering, wie z.B. Systementwurf oder Meßplanung, mit jeweils sehr unterschiedlichen Artefakten, anwendbar sein sollte. Die durchgeführte
Literaturrecherche und die anschließende Bewertung anhand der gestellten Anforderungen ergaben, daß das Prinzip der Metamodellierung in Verbindung mit Wissensbankverwaltungssystemen ein geeigneter Verfolgbarkeitsansatz ist. Eine Evaluation, die sich auf Fallstudien aus den Bereichen
"Objektorientierter Entwurf mit UML" und "Meßplanung mit GQM" bezog, ergab, daß das Wissensbankverwaltungssystem
ConceptBase, das auf der Wissensrepräsentationssprache 0-Telos basiert, ein geeignetes Werkzeug zur Unterstützung des Verfolgbarkeitsansatzes ist.

Best-Fit Pattern Matching
(1994)

This report shows that dispatching of methods in object oriented languages is in principle the same as best fit pattern matching. A general conceptual description of best fit pattern matching is presented. Many object oriented features are modelled by means of the general concept. This shows that simple methods, multi methods, overloading of functions, pattern matching,
dynamic and union types, and extendable records can be combined in a single comprehensive concept.

Efficient algorithms and structural results are presented for median
problems with 2 new facilities including the classical 2-Median problem,
the 2-Median problem with forbidden regions and bicriterial 2-Median
problems. This is the first paper dealing with multi-facility multiobjective location problems. The time complexity of all presented algorithms is O(MlogM), where M is the number of existing facilities.

This publication tries to develop mathematical subjects for school from realistic problems. The center of this report are business planning and decision problems which occur in almost all companies. The main topics are: Calculation of raw material demand for given orders, consumption of existing stock and the lot sizing.

One of the main goals of an organization developing software is to increase the quality of the software while at the same time to decrease the costs and the duration of the development process. To achieve this, various decisions e.ecting this goal before and during the development process have to be made by the managers. One appropriate tool for decision support are simulation models of the software life cycle, which also help to understand the dynamics of the software development process. Building up a simulation model requires a mathematical description of the interactions between di.erent objects involved in the development process. Based on experimental data, techniques from the .eld of knowledge discovery can be used to quantify these interactions and to generate new process knowledge based on the analysis of the determined relationships. In this paper blocked neuronal networks and related relevance measures will be presented as an appropriate tool for quanti.cation and validation of qualitatively known dependencies in the software development process.

Bringing robustness to patient flow management through optimized patient transports in hospitals
(2007)

Intra-hospital transports are often required for diagnostic or therapeutic reasons. Depending on the hospital layout, transportation between nursing wards and service units is either provided by ambulances or by trained personnel who accompany patients on foot. In many large German hospitals, the patient transport service is poorly managed and lacks workflow coordination. This contributes to higher hospital costs (e.g. when a patient is not delivered to the operating room on time) and to patient inconvenience due to longer waiting times. We have designed a computer-based planning system - Opti-TRANS c - that supports all phases of the transportation flow, ranging from travel booking, dispatching transport requests to monitoring and reporting trips in real-time. The methodology developed to solve the underlying optimization problem - a dynamic dial-a-ride problem with hospital-specific constraints - draws on fast heuristic methods to ensure the efficient and timely provision of transports. We illustrate the strong impact of Opti-TRANS c on the daily performance of the patient transportation service of a large German hospital. The major benefits obtained with the new tool include streamlined transportation processes and workflow, significant savings and improved patient satisfaction. Moreover, the new planning system has contributed to increase awareness among hospital staff about the importance of implementing efficient logistics practices.

The composition of Bézier curves and tensor product Bézier surfaces, polynomial as well as rational, is applied to exactly and explicitely represent trim curves of tensor product Bézier surfaces. Trimming curves are assumed to be defined as Bézier curves in surface parameter domain. A Bézier spline approximation of lower polynomial degree is built up as weil which is based on the exact trim curve representation in coordinate space.

For the numerical simulation of a mechanical multibody system (MBS), dynamical loads are needed as input data, such as a road profile. With given input quantities, the equations of motion of the system can be integrated. Output quantities for further investigations are calculated from the integration results. In this paper, we consider the corresponding inverse problem: We assume, that a dynamical system and some reference output signals are given. The general task is to derive an input signal, such that the system simulation produces the desired reference output. We present the state-of-the-art method in industrial applications, the iterative learning control method (ILC) and give an application example from automotive industry. Then, we discuss three alternative methods based on optimal control theory for differential algebraic equations (DAEs) and give an overview of their general scheme.

This report describes the calibration and completion of the volatility cube in the SABR model. The description is based on a project done for Assenagon GmbH in Munich. However, we use fictitious market data which resembles realistic market data. The problem posed by our client is formulated in section 1. Here we also motivate why this is a relevant problem. The SABR model is briefly reviewed in section 2. Section 3 discusses the calibration and completion of the volatility cube. An example is presented in section 4. We conclude by suggesting possible future research in section 5.

The purpose of this paper is the canonical connection of classical global gravity field determination following the concept of Stokes (1849), Bruns (1878), and Neumann (1887) on the one hand and modern locally oriented multiscale computation by use of adaptive locally supported wavelets on the other hand. Essential tools are regularization methods of the Green, Neumann, and Stokes integral representations. The multiscale approximation is guaranteed simply as linear difference scheme by use of Green, Neumann, and Stokes wavelets, respectively. As an application, gravity anomalies caused by plumes are investigated for the Hawaiian and Iceland areas.

In this article, we summarise the rotation-free and quaternionic parametrisation of a rigid body. We derive and explain the close interrelations between both parametrisations. The internal constraints due to the redundancies in the parametrisations, which lead to DAEs, are handled with the null space technique. We treat both single rigid bodies and general multibody systems with joints, which lead to external joint constraints. Several numerical examples compare both formalisms to the index reduced versions of the corresponding standard formulations.

In this article, we consider the quasistatic boundary value problems of linear elasticity and nonlinear elastoplasticity, with linear Hooke’s law in the elastic regime for both problems and with the linear kinematic hardening law for the plastic regime in the latter problem. We derive expressions and estimates for the difference of the solutions of both models, i.e. for the stresses, the strains and the displacements. To this end, we use the stop and play operators of nonlinear functional analysis. Further, we give an explicit example of a homotopy between the solutions of both problems.

We study the complexity of local solution of Fredholm integral equations. This means that we want to compute not the full solution, but rather a functional (weighted mean, value in a point) of it. For certain Sobolev classes of multivariate periodic functions we prove matching upper and lower bounds and construct an algorithm of the optimal order, based on Fourier coefficients and a hyperbolic cross approximation.

In this paper the complexity of the local solution of Fredholm integral equations
is studied. For certain Sobolev classes of multivariate periodic functions with dominating mixed derivative we prove matching lower and upper bounds. The lower bound is shown using relations to s-numbers. The upper bound is proved in a constructive way providing an implementable algorithm of optimal order based on Fourier coefficients and a hyperbolic cross approximation.

Trimming of surfaces and volumes, curve and surface modeling via Bézier's idea of destortion, segmentation, reparametrization, geometric continuity are examples of applications of functional composition. This paper shows how to
compose polynomial and rational tensor product Bézier representations. The problem of composing Bezier splines and B-spline representations will also be addressed in this paper.

Today, test methods for communication protocols assume, among other things, that the protocol design is specified as a single, monolithic finite state machine (FSM). From this specification, test suites that are capable of detecting output and/or transfer faults in the protocol implementation are derived. Limited applicability ofthese methods is mainly because oftheir specific assumptions, and due to the size of the derived test suite and the resulting test effort for realistic protocols. In this work, the compositional test method (C-method), which exploits the available structure of a communication protocol, is proposed. The C-method first tests each protocol component separately for output and/or transfer faults, using one of the traditional test methods, then checks for composability, and finally tests the composite system for composition faults. To check for composability and to derive the test suite for the detection of composition faults, it is not required to construct the global state machine. Instead, all information is derived from the component state machines, which avoids a potential state explosion and lengthy test cases. Furthermore, the test suite checks for composition faults only. This substantially reduces the size of the test suite and thus the overall test effort.

A fully automatic procedure is proposed to rapidly compute the permeability of porous materials from their binarized microstructure. The discretization is a simplified version of Peskin’s Immersed Boundary Method, where the forces are applied at the no-slip grid points. As needed for the computation of permeability, steady flows at zero Reynolds number are considered. Short run-times are achieved by eliminating the pressure and velocity variables using an Fast Fourier Transform-based and 4 Poisson problembased fast inversion approach on rectangular parallelepipeds with periodic boundary conditions. In reference to calling it a fast method using fictitious or artificial forces, the implementation is called FFF-Stokes. Large scale computations on 3d images are quickly and automatically performed to estimate the permeability of some sample materials. A matlab implementation is provided to allow readers to experience the automation and speed of the method for realistic three-dimensional models.

In recent years, Smolyak quadrature rules (also called hyperbolic cross points or sparse grids) have gained interest as a possible competitor to number theoretic quadratures for high dimensional problems. A standard way of comparing the quality of multivariate quadrature formulas
consists in computing their \(L_2\)-discrepancy. Especially for larger dimensions, such computations are a highly complex task. In this paper we develop a fast recursive algorithm for computing the \(L_2\)-discrepancy (and related quality measures) of general Smolyak quadratures. We carry out numerical comparisons between the discrepancies of certain Smolyak rules, Hammersley and Monte Carlo sequences.

A notion of discrepancy is introduced, which represents the integration error on spaces of \(r\)-smooth periodic functions. It generalizes the diaphony and constitutes a periodic counterpart to the classical \(L_2\)-discrepancy as weil as \(r\)-smooth versions of it introduced recently by Paskov [Pas93]. Based on previous work [FH96], we develop an efficient algorithm for computing periodic discrepancies for quadrature formulas possessing certain tensor product structures, in particular, for Smolyak quadrature rules (also called sparse grid methods). Furthermore, fast algorithms of computing periodic discrepancies for lattice rules can easily be derived from well-known properties of lattices. On this basis we carry out numerical comparisons of discrepancies between Smolyak and lattice rules.