Refine
Year of publication
Document Type
- Report (399) (remove)
Language
- English (399) (remove)
Keywords
- numerical upscaling (7)
- hub location (5)
- Elastoplastizität (4)
- Integer programming (4)
- modelling (4)
- poroelasticity (4)
- Darcy’s law (3)
- Dienstgüte (3)
- Elastic BVP (3)
- Elastoplasticity (3)
- Formalisierung (3)
- Heston model (3)
- Hysterese (3)
- Lagrangian mechanics (3)
- Mathematikunterricht (3)
- Modellierung (3)
- effective heat conductivity (3)
- facility location (3)
- non-Newtonian flow in porous media (3)
- polynomial algorithms (3)
- praxisorientiert (3)
- variational inequalities (3)
- virtual material design (3)
- American options (2)
- Bartlett spectrum (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 Algebra (2)
- Logistics (2)
- MAC type grid (2)
- Noether’s theorem (2)
- Nonlinear multigrid (2)
- Portfolio optimisation (2)
- Ratenunabhängigkeit (2)
- Regularisierung (2)
- Rotational spinning process (2)
- Special Cosserat rods (2)
- Supply Chain Management (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)
- free-surface phenomena (2)
- heuristic (2)
- hysteresis (2)
- image analysis (2)
- injection molding (2)
- integer programming (2)
- interface boundary conditions (2)
- linear algebra (2)
- linear elasticity (2)
- mathematical education (2)
- model reduction (2)
- multibody dynamics (2)
- multigrid (2)
- multilayered material (2)
- non-overlapping constraints (2)
- online optimization (2)
- option pricing (2)
- portfolio choice (2)
- power spectrum (2)
- praxis orientated (2)
- rectangular packing (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)
- Abstract linear systems theory (1)
- Ad-hoc-Netz (1)
- AmICA (1)
- Assigment (1)
- Asymptotic Expansion (1)
- Asymptotic homogenization (1)
- Automatic Differentiation (1)
- Automatische Differentiation (1)
- Bayesian Model Averaging (1)
- Bell Number (1)
- Berechnungskomplexität (1)
- Betriebsfestigkeit (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)
- Boundary Value Problem (1)
- Brinkman (1)
- Brinkman equations (1)
- CAD (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)
- Customer distribution (1)
- Decision support systems (1)
- Delaunay Triangulation (1)
- Delaunay mesh generation (1)
- Design (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)
- Equicofactor matrix polynomials (1)
- Euler number (1)
- Eulerian-Lagrangian formulation (1)
- Existence of Solutions (1)
- Extraction (1)
- FETI (1)
- FPM (1)
- FPTAS (1)
- Facility location (1)
- Fault Prediction (1)
- Filippov theory (1)
- Filippov-Theorie (1)
- Filtering (1)
- Financial Mathematics (1)
- Finite rotations (1)
- Flexible multibody dynamics (1)
- Flooding (1)
- FlowLoc (1)
- Fluid Structure Interaction (1)
- Fokker-Planck Equation (1)
- Fokker-Planck equations (1)
- Folgar-Tucker equation (1)
- Folgar-Tucker model (1)
- Formal Semantics (1)
- Front Propagation (1)
- Fräsen (1)
- Funknetz (1)
- G2++ model (1)
- Generalized LBE (1)
- Geographical Information Systems (1)
- Geomagnetic Field Modelling (1)
- Geomagnetismus (1)
- Geomathematik (1)
- Geometric (1)
- Geostrophic flow (1)
- Gradual Covering (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)
- 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)
- Injectivity of mappings (1)
- Injektivität von Abbildungen (1)
- Inkorrekt gestelltes Problem (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)
- Kaktusgraph (1)
- Kalman Filter (1)
- Kirchhoff and Cosserat rods (1)
- Kirchhoff\\\'s geometrically theory (1)
- Knowledge Extraction (1)
- Kommunikationsprotokoll (1)
- Komplexitätsklasse NP (1)
- Kontinuumsmechanik (1)
- Konvexe Mengen (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)
- Level Set method (1)
- Li Ion Batteries (1)
- Linear Programming (1)
- Linear kinematic hardening (1)
- Linear kinematische Verfestigung (1)
- Lineare Optimierung (1)
- Liquid Polymer Moulding (1)
- Load Balancing (1)
- Locational Planning (1)
- MBS simulation (1)
- MILP formulations (1)
- MIP formulations (1)
- Mapping (1)
- Mastoid (1)
- Mastoidektomie (1)
- Mathematical modeling (1)
- Matrix perturbation theory (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)
- NP-hard (1)
- Nash equilibria (1)
- Navier-Stokes (1)
- Navier-Stokes equation (1)
- Navier-Stokes-Brinkmann system of equations (1)
- Network Location (1)
- Network design (1)
- Networks (1)
- Neumann problem (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)
- OCL 2.0 (1)
- Ohrenchirurgie (1)
- One-dimensional systems (1)
- Online Algorithms (1)
- Optimal parameter estimation (1)
- Optimization (1)
- Option pricing (1)
- Ordered Median Function (1)
- Ornstein-Uhlenbeck Process (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 line process (1)
- Poroelastizität (1)
- Preconditioners (1)
- Profiles (1)
- Projection method (1)
- Pseudopolynomial-Time Algorithm (1)
- Quanto option (1)
- RONAF (1)
- Random set (1)
- Rate-independency (1)
- Realization theory (1)
- Recycling (1)
- Regelung (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)
- Schädelchirurgie (1)
- Sensitivitäten (1)
- Shapley Value (1)
- Shapley value (1)
- Shapleywert (1)
- Sheet ofPaper (1)
- Simplex (1)
- Simulation (1)
- Slender body theory (1)
- Solid-Gas Separation (1)
- Solid-Liquid Separation (1)
- Spezifikation (1)
- Spieltheorie (1)
- Sprachprofile (1)
- Standortplanung (1)
- Stationary heat equation (1)
- Stein equation (1)
- Stochastic Differential Equations (1)
- Stokes-Brinkman equations (1)
- Stop- and Play-Operators (1)
- Stop- und Play-Operator (1)
- Stop-und Play-Operator (1)
- Stress-strain correction (1)
- Stücklisten (1)
- Supply Chain Design (1)
- Switching regression model (1)
- System Abstractions (1)
- Theorie schwacher Lösungen (1)
- Thermal Transport (1)
- Train Rearrangement (1)
- Translation Validation (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)
- Vektor-Wavelets (1)
- Vektorkugelfunktionen (1)
- Vektorwavelets (1)
- Viscous Fibers (1)
- Winner Determination Problem (WDP) (1)
- Wireless Communication (1)
- Wireless Sensor Network (1)
- Wireless sensor network (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)
- 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 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)
- continuous optimization (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)
- 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)
- finite-volume method (1)
- flexible fibers (1)
- flow in heterogeneous porous media (1)
- flow in porous media (1)
- flow resistivity (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)
- hydraulics (1)
- hyperealstic (1)
- image processing (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)
- 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)
- 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 kinematic hardening (1)
- linear optimization (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)
- 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)
- 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 problem (1)
- multiscale problems (1)
- multiscale structures (1)
- multivalued fundamental diagram (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 programming (1)
- nonlinear stochastic systems (1)
- nonlinearity (1)
- nonparametric regression (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 (1)
- optimal control theory (1)
- optimal portfolio choice (1)
- optimization (1)
- optimization algorithms (1)
- optimization strategies (1)
- options (1)
- ordered median (1)
- orientation analysis (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)
- 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 media (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)
- sequences (1)
- sequential test (1)
- series-parallel graphs (1)
- shape (1)
- shape optimization (1)
- simplex (1)
- single layer kernel (1)
- singularity (1)
- slender- body theory (1)
- slender-body theory (1)
- slenderbody theory (1)
- smoothness (1)
- software process (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)
- textile quality control (1)
- texture classification (1)
- theorem prover (1)
- thin films (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 propagation (1)
- weak solution theory (1)
- weakly/ strictly pareto optima (1)
- white noise (1)
- wild bootstrap test (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.