Refine
Year of publication
Document Type
- Preprint (1037)
- Doctoral Thesis (940)
- Article (622)
- Report (399)
- Master's Thesis (30)
- Conference Proceeding (28)
- Diploma Thesis (24)
- Periodical Part (21)
- Working Paper (15)
- Lecture (11)
Language
- English (3163) (remove)
Keywords
- AG-RESY (47)
- PARO (25)
- Visualisierung (16)
- SKALP (15)
- Wavelet (13)
- finite element method (12)
- Case-Based Reasoning (11)
- Inverses Problem (11)
- Optimization (11)
- RODEO (11)
- Mehrskalenanalyse (10)
- resonances (10)
- Approximation (9)
- HANDFLEX (9)
- Robotics (9)
- Simulation (9)
- Visualization (9)
- hub location (9)
- integer programming (9)
- Boltzmann Equation (8)
- Finite-Elemente-Methode (8)
- Infrarotspektroskopie (8)
- Quantum mechanics (8)
- Robotik (8)
- Wannier-Stark systems (8)
- lifetimes (8)
- Deep Learning (7)
- Location Theory (7)
- NURBS (7)
- Numerical Simulation (7)
- Regularisierung (7)
- machine learning (7)
- numerical upscaling (7)
- Abstraction (6)
- Algebraische Geometrie (6)
- Case Based Reasoning (6)
- Elastoplastizität (6)
- Finanzmathematik (6)
- Kontinuumsmechanik (6)
- Machine Learning (6)
- Modellierung (6)
- Navier-Stokes-Gleichung (6)
- Numerische Strömungssimulation (6)
- Optimierung (6)
- motion planning (6)
- quantum mechanics (6)
- wavelets (6)
- Artificial Intelligence (5)
- CoMo-Kit (5)
- Computergraphik (5)
- Elastizität (5)
- Elastoplasticity (5)
- Evaluation (5)
- Gravitationsfeld (5)
- Mobilfunk (5)
- Portfolio Selection (5)
- case-based problem solving (5)
- consistency (5)
- domain decomposition (5)
- facets (5)
- haptotaxis (5)
- industrial robots (5)
- isogeometric analysis (5)
- lifetime statistics (5)
- modelling (5)
- nonparametric regression (5)
- numerics (5)
- optimization (5)
- parallel processing (5)
- poroelasticity (5)
- portfolio optimization (5)
- verification (5)
- CFD (4)
- COMOKIT (4)
- Combinatorial Optimization (4)
- Computeralgebra (4)
- Festkörper (4)
- Force-Torque (4)
- Galerkin-Methode (4)
- Gasphase (4)
- Homogenisierung <Mathematik> (4)
- Hysterese (4)
- Integer programming (4)
- Internet (4)
- Knowledge Acquisition (4)
- Kugel (4)
- Multicriteria optimization (4)
- Neural Networks (4)
- Nichtlineare Finite-Elemente-Methode (4)
- Numerische Mathematik (4)
- Partial Differential Equations (4)
- Portfolio-Optimierung (4)
- SDL (4)
- Sphäre (4)
- Stochastische dynamische Optimierung (4)
- anisotropy (4)
- artificial intelligence (4)
- case-based reasoning (4)
- clustering (4)
- computational mechanics (4)
- continuum mechanics (4)
- entropy (4)
- facility location (4)
- finite volume method (4)
- heuristic (4)
- image analysis (4)
- image processing (4)
- localization (4)
- multiscale model (4)
- network flows (4)
- neural network (4)
- optimal control (4)
- resolution (4)
- search algorithms (4)
- sensor fusion (4)
- stability (4)
- time series (4)
- valid inequalities (4)
- visualization (4)
- Analysis (3)
- Assembly (3)
- Asymptotic Expansion (3)
- Automatische Differentiation (3)
- Bewertung (3)
- Brownian motion (3)
- CHAMP <Satellitenmission> (3)
- Cache (3)
- Cauchy-Navier equation (3)
- Cauchy-Navier-Gleichung (3)
- Classification (3)
- Combinatorial optimization (3)
- Computational Fluid Dynamics (3)
- DRAM (3)
- Darcy’s law (3)
- Dataset (3)
- Datenanalyse (3)
- Dienstgüte (3)
- Elastic BVP (3)
- FFT (3)
- Fallbasiertes Schliessen (3)
- Fallbasiertes Schließen (3)
- Finite-Volumen-Methode (3)
- Flüssig-Flüssig-Extraktion (3)
- Formal Verification (3)
- Formalisierung (3)
- Geoinformationssystem (3)
- Geometric Ergodicity (3)
- Gravimetrie (3)
- Gröbner bases (3)
- Harmonische Spline-Funktion (3)
- Heston model (3)
- Hysteresis (3)
- Industrial Robotics (3)
- Intensity modulated radiation therapy (3)
- Ionenfalle (3)
- Isogeometric Analysis (3)
- Java (3)
- Knowledge acquisition (3)
- Kugelflächenfunktion (3)
- LOADBAL (3)
- Lagrangian mechanics (3)
- Lasererzeugtes Plasma (3)
- Layout (3)
- MIMO (3)
- Machine learning (3)
- Manipulation skills (3)
- Mathematikunterricht (3)
- Mehrskalenmodell (3)
- Mikrostruktur (3)
- Model Checking (3)
- Model Predictive Control (3)
- Model checking (3)
- Mosco convergence (3)
- Multicriteria Optimization (3)
- Multiobjective optimization (3)
- Multiresolution Analysis (3)
- Mustererkennung (3)
- OFDM (3)
- Optionspreistheorie (3)
- Optische Zeichenerkennung (3)
- Poisson-Gleichung (3)
- Portfolio Optimization (3)
- Randwertproblem / Schiefe Ableitung (3)
- Ray casting (3)
- Recommender Systems (3)
- Requirements/Specifications (3)
- Risikomanagement (3)
- SRAM (3)
- Scattered-Data-Interpolation (3)
- Scheduling (3)
- Scientific Visualization (3)
- Semantic Web (3)
- Sobolev-Raum (3)
- Spherical Wavelets (3)
- Spline (3)
- Spline-Approximation (3)
- System Identification (3)
- System-on-Chip (3)
- Time Series (3)
- Timetabling (3)
- Transaction Costs (3)
- Tropische Geometrie (3)
- Unsicherheit (3)
- Vektorwavelets (3)
- Verifikation (3)
- Virtual Reality (3)
- Wavelet-Analyse (3)
- autoregressive process (3)
- average density (3)
- biomechanics (3)
- branch and cut (3)
- case-based planning (3)
- cobalt (3)
- combinatorial optimization (3)
- computational fluid dynamics (3)
- computer graphics (3)
- confluence (3)
- consecutive ones property (3)
- convex optimization (3)
- deep learning (3)
- deformable objects (3)
- discretization (3)
- distributed software development (3)
- distributed software development process (3)
- document analysis (3)
- effective heat conductivity (3)
- explanation-based learning (3)
- fatigue (3)
- finite elements (3)
- genetic algorithms (3)
- harmonic density (3)
- injection molding (3)
- interface problem (3)
- iron (3)
- kinetic equations (3)
- lattice Boltzmann method (3)
- low Mach number limit (3)
- model reduction (3)
- multicriteria optimization (3)
- non-Newtonian flow in porous media (3)
- on-line algorithms (3)
- online optimization (3)
- optical character recognition (3)
- optimales Investment (3)
- option pricing (3)
- particle methods (3)
- path planning (3)
- polynomial algorithms (3)
- porous media (3)
- praxisorientiert (3)
- problem solving (3)
- radiotherapy (3)
- regularization (3)
- reproducing kernel (3)
- reuse (3)
- robustness (3)
- tangent measure distributions (3)
- theorem prover (3)
- theorem proving (3)
- thermodynamics (3)
- variational inequalities (3)
- vibration (3)
- virtual material design (3)
- well-posedness (3)
- ADAS (2)
- Activity recognition (2)
- Ad-hoc-Netz (2)
- Algebraic Optimization (2)
- Algebraic dependence of commuting elements (2)
- Algebraische Abhängigkeit der kommutierende Elementen (2)
- Algorithmus (2)
- American options (2)
- Apoptosis (2)
- Approximation Algorithms (2)
- Asymptotic Analysis (2)
- Asymptotik (2)
- Automatic Differentiation (2)
- Automation (2)
- B-Spline (2)
- B-splines (2)
- Bartlett spectrum (2)
- Beam-on time (2)
- Benchmark (2)
- Bildverarbeitung (2)
- Biomechanik (2)
- Biorthogonalisation (2)
- Biot-Savart Operator (2)
- Biot-Savart operator (2)
- Black-Box (2)
- Blattschneiderameisen (2)
- Bottom-up (2)
- Boundary Value Problem (2)
- Brillouin light scattering spectroscopy (2)
- Brinkman (2)
- Bruchmechanik (2)
- CAD (2)
- CAPlan (2)
- CHAMP (2)
- CIM-OSA (2)
- CORBA (2)
- CYP1A1 (2)
- Change analysis (2)
- Chisel (2)
- Cluster-Analyse (2)
- Clusterion (2)
- Code Generation (2)
- Computer Algebra System (2)
- Computeralgebra System (2)
- Cyanobacteria (2)
- Cyanobakterien (2)
- Datenbank (2)
- Decomposition and Reconstruction Schemes (2)
- Decomposition cardinality (2)
- Deduction (2)
- Deformable Objects (2)
- Delay Management (2)
- Diskrete Fourier-Transformation (2)
- Distributed Software Development (2)
- Domain Decomposition (2)
- Domänenumklappen (2)
- Dynamics (2)
- EM algorithm (2)
- Effizienter Algorithmus (2)
- Eingebettetes System (2)
- Elasticity (2)
- Elastische Deformation (2)
- Elastisches RWP (2)
- Elastomer (2)
- Elastoplastisches RWP (2)
- Electronic Design Automation (2)
- Endlicher Automat (2)
- Energy Efficiency (2)
- Erdmagnetismus (2)
- Erwachsenenbildung (2)
- Erwarteter Nutzen (2)
- European Territorial Cooperation (2)
- Europäische Territoriale Zusammenarbeit (2)
- Evolution (2)
- Experimentelle Psychologie (2)
- Extrapolation (2)
- FEM (2)
- FPGA (2)
- FPM (2)
- Fallbasiertes Planen (2)
- Faserkunststoffverbunde (2)
- Field splitting (2)
- Field-programmable gate array (FPGA) (2)
- Filtergesetz (2)
- Filtration (2)
- Finite Pointset Method (2)
- Fließgewässer (2)
- Funktionale Sicherheit (2)
- GOCE <Satellitenmission> (2)
- GPU (2)
- GRACE <Satellitenmission> (2)
- Geometrical Algorithms (2)
- Graph Theory (2)
- Gröbner-Basis (2)
- HJB equation (2)
- HOT (2)
- HTML (2)
- Hardware (2)
- Heuristic (2)
- Heuristics (2)
- Hochskalieren (2)
- Homogenization (2)
- Hub-and-Spoke-System (2)
- Hydrodynamics (2)
- Hydrodynamik (2)
- Hypervolume (2)
- IMRT (2)
- IMRT planning (2)
- IR-MPD (2)
- IRMPD (2)
- Integer-valued time series (2)
- Interaction (2)
- Interaktion (2)
- Interfaces (2)
- Interoperability (2)
- Inverse Problem (2)
- Isogeometrische Analyse (2)
- Jiang's model (2)
- Jiang-Modell (2)
- Kalman filtering (2)
- Kinetic Schemes (2)
- Knowledge Management (2)
- Konvergenz (2)
- Kreditrisiko (2)
- Langevin equation (2)
- Laplace transform (2)
- Laser-produced plasma (2)
- Lattice Boltzmann (2)
- Lattice Boltzmann Method (2)
- Lattice Boltzmann methods (2)
- Lebensversicherung (2)
- Lennard-Jones (2)
- Lernen (2)
- Level-Set-Methode (2)
- Line Planning (2)
- Line Pool Generation (2)
- Lineare Algebra (2)
- Lineare Elastizitätstheorie (2)
- Lineare partielle Differentialgleichung (2)
- Local smoothing (2)
- Logistics (2)
- Lokalisation (2)
- MAC type grid (2)
- MOLTKE-Projekt (2)
- Manipulation (2)
- Markov Chain (2)
- Maschinelles Lernen (2)
- Mathematical Physics (2)
- Mathematik (2)
- Mathematische Modellierung (2)
- Measurement (2)
- Mehrkriterielle Optimierung (2)
- Merkmalsextraktion (2)
- Micro milling (2)
- Microarray (2)
- Mixture Models (2)
- Modellprädiktive Regelung (2)
- Modulraum (2)
- Molekulardynamik (2)
- Molekularstrahl (2)
- Monte Carlo (2)
- Monte-Carlo-Simulation (2)
- Morphologie (2)
- Morphology (2)
- Multileaf collimator sequencing (2)
- Multiobjective programming (2)
- Multiset Multicover (2)
- Multivariate Approximation (2)
- Münzmetall (2)
- Nanocomposites (2)
- Nanopartikel (2)
- Natural Language Processing (2)
- Navier-Stokes (2)
- Network Calculus (2)
- Network Protocols (2)
- Networks (2)
- Neural networks (2)
- Nichtlineare Kontinuumsmechanik (2)
- Noether’s theorem (2)
- Nonlinear Identification (2)
- Nonlinear multigrid (2)
- Numerisches Verfahren (2)
- OME (2)
- Ontology (2)
- Open Source Library (2)
- Optimal Control (2)
- Optimization in Public Transportation (2)
- PIM (2)
- POD (2)
- Palm distributions (2)
- Parallel volume (2)
- Parameter identification (2)
- Parameteridentifikation (2)
- Pareto Optimality (2)
- Partial functions (2)
- Particle Methods (2)
- Pattern Recognition (2)
- Pflanzenschutzmittel (2)
- Phasengleichgewicht (2)
- Photodissoziation (2)
- Piezoelektrizität (2)
- Plasma expansion (2)
- Plastizität (2)
- Polymere (2)
- Populationsbilanzen (2)
- Portfolio optimisation (2)
- Portfoliomanagement (2)
- Poröser Stoff (2)
- Preconditioners (2)
- Privacy (2)
- Protonentransfer (2)
- Public Transport Planning (2)
- Quantization (2)
- RONAF (2)
- ROS (2)
- Rarefied Gas Dynamics (2)
- Ratenunabhängigkeit (2)
- Raumakustik (2)
- Regressionsanalyse (2)
- Regularization (2)
- Representation (2)
- Requirements engineering (2)
- Response Priming (2)
- Risikoanalyse (2)
- Roboter (2)
- Robust Optimization (2)
- Room acoustics (2)
- Rotational spinning process (2)
- Routing (2)
- Räumliche Statistik (2)
- SIMERO (2)
- SOC (2)
- Schnitttheorie (2)
- Singularity theory (2)
- Slender body theory (2)
- Sobolev spaces (2)
- Software Agents (2)
- Software Engineering (2)
- Software Testing (2)
- Software engineering (2)
- Software for Public Transport Planning (2)
- Special Cosserat rods (2)
- Split Operator (2)
- Sprachprofile (2)
- Statistisches Modell (2)
- Stochastic Control (2)
- Stop Location (2)
- Streaming (2)
- Strömungsmechanik (2)
- Subset selection (2)
- Supply Chain Management (2)
- TOVE (2)
- Tantal (2)
- Technische Mechanik (2)
- Teilchen (2)
- Tensorfeld (2)
- Term rewriting systems (2)
- Thermodynamik (2)
- Tool wear (2)
- Topologie (2)
- Topology (2)
- Translation Validation (2)
- Tribology (2)
- Tropenökologie (2)
- UML (2)
- Uncertain Data (2)
- Uncertainty Visualization (2)
- Up Functions (2)
- Upscaling (2)
- Value-at-Risk (2)
- Variability Management (2)
- Variability Realization (2)
- Variationsungleichungen (2)
- Vehicle Scheduling (2)
- Vektorkugelfunktionen (2)
- Verbundwerkstoffe (2)
- Viskoelastizität (2)
- Visual Analytics (2)
- Voronoi diagram (2)
- Wahrscheinlichkeitsfunktion (2)
- Wearable computing (2)
- Weißes Rauschen (2)
- WiFi (2)
- Wills functional (2)
- Wissensakquisition (2)
- Wissenschaftliches Rechnen (2)
- Wissenserwerb (2)
- World Wide Web (2)
- Zedboard (2)
- Zynq (2)
- ab initio (2)
- adaptive refinement (2)
- air interface (2)
- algebraic geometry (2)
- algorithmic game theory (2)
- analogy (2)
- analysis of algorithms (2)
- application (2)
- applied mathematics (2)
- approximate identity (2)
- artificial neural networks (2)
- associations (2)
- asymptotic analysis (2)
- asymptotic behavior (2)
- asymptotic homogenization (2)
- auditory brainstem (2)
- autoencoder (2)
- automated theorem proving (2)
- autonomous driving (2)
- average densities (2)
- benzene (2)
- beyond 3G (2)
- biodiversity (2)
- bottom-up (2)
- building automation (2)
- cancer cell invasion (2)
- case based reasoning (2)
- changepoint test (2)
- chaos (2)
- chaotic dynamics (2)
- classification (2)
- cluster (2)
- combined systems with sha (2)
- competitive analysis (2)
- composite materials (2)
- computational homogenization (2)
- computer algebra (2)
- computer vision (2)
- computer-supported cooperative work (2)
- configurational forces (2)
- configurational mechanics (2)
- connectedness (2)
- conservative extension (2)
- constrained mechanical systems (2)
- convergence (2)
- coset enumeration (2)
- credit risk (2)
- curve singularity (2)
- cyanobacteria (2)
- decision support (2)
- decision support systems (2)
- degenerate diffusion (2)
- delay (2)
- density distribution (2)
- design patterns (2)
- deuteration (2)
- dipeptide (2)
- direct laser writing (2)
- discontinuous coefficients (2)
- discrete element method (2)
- discrete mechanics (2)
- disjoint union (2)
- distributed (2)
- duality (2)
- dynamical systems (2)
- elastomer (2)
- elastoplastic BVP (2)
- elastoplasticity (2)
- enamide (2)
- energy minimization (2)
- equilibrium strategies (2)
- evolutionary spectrum (2)
- experience base (2)
- fast Fourier transform (2)
- fiber orientation (2)
- fiber-fluid interaction (2)
- filling processes (2)
- filtration (2)
- finite deformations (2)
- finite volume methods (2)
- flexible multibody dynamics (2)
- fluid interface (2)
- forest fragmentation (2)
- formal specification (2)
- fractals (2)
- frames (2)
- free surface (2)
- free-surface phenomena (2)
- fuzzy logic (2)
- gas phase (2)
- geomagnetism (2)
- geometric ergodicity (2)
- global existence (2)
- global optimization (2)
- governance (2)
- graph search (2)
- harmonische Dichte (2)
- heat equation (2)
- hidden variables (2)
- higher education (2)
- homogenization (2)
- hub covering (2)
- hysteresis (2)
- ice shelves (2)
- illiquidity (2)
- image denoising (2)
- impedance spectroscopy (2)
- incompressible Navier-Stokes equations (2)
- innermost termination (2)
- interface boundary conditions (2)
- inverse optimization (2)
- inverse problem (2)
- inverse problems (2)
- k-link shortest path (2)
- kernel estimate (2)
- lacunarity distribution (2)
- langfaserverstärkte Thermoplaste (2)
- layout analysis (2)
- learning (2)
- learning system (2)
- level set method (2)
- lichen (2)
- limit and jump relations (2)
- linear algebra (2)
- linear elasticity (2)
- linear kinetics theory (2)
- lineare kinetische Theorie (2)
- load balancing (2)
- localizing basis (2)
- location theory (2)
- many-valued logic (2)
- material forces (2)
- mathematical education (2)
- mathematical modeling (2)
- measurement (2)
- mesh generation (2)
- metal (2)
- metal cluster (2)
- mixture (2)
- mobile robots (2)
- modal derivatives (2)
- modularity (2)
- molecular simulation (2)
- moment realizability (2)
- monotropic programming (2)
- multi-object tracking (2)
- multibody dynamics (2)
- multigrid (2)
- multigrid methods (2)
- multilayered material (2)
- multileaf collimator (2)
- multiplicative noise (2)
- multiscale analysis (2)
- neural networks (2)
- non-overlapping constraints (2)
- nonlinear diffusion (2)
- nonlinear diffusion filtering (2)
- numerical simulation (2)
- numerische Mechanik (2)
- object classification (2)
- occupation measure (2)
- optical lattices (2)
- optimal investment (2)
- order-two densities (2)
- pH-taxis (2)
- parabolic system (2)
- parallel algorithms (2)
- particle method (2)
- phase field model (2)
- phase space (2)
- phase-space (2)
- planning (2)
- portfolio choice (2)
- power spectrum (2)
- praxis orientated (2)
- probabilistic approach (2)
- problem formulation (2)
- public transport (2)
- pyramid scheme (2)
- quantum chaos (2)
- quasienergy (2)
- radiation therapy (2)
- rate of convergence (2)
- rate-dependency (2)
- reactive oxygen species (2)
- real-time (2)
- real-time systems (2)
- rectangular packing (2)
- regression analysis (2)
- regular surface (2)
- regularization wavelets (2)
- reproduzierender Kern (2)
- requirements engineering (2)
- rolling friction (2)
- ruthenium (2)
- safe human robot cooperation (2)
- satellite gravity gradiometry (2)
- satisfiability (2)
- scale-space (2)
- self-organization (2)
- self-regulation (2)
- semantic web (2)
- semiconductor superlattice (2)
- series-parallel graphs (2)
- shape optimization (2)
- simulation (2)
- single molecule magnet (2)
- single phase flow (2)
- singularities (2)
- social media (2)
- software development (2)
- sonotrodes (2)
- spatial planning (2)
- spherical approximation (2)
- spin wave quantization (2)
- splines (2)
- stationarity (2)
- stationary radiative transfer equation (2)
- stochastic control (2)
- stop- and play-operator (2)
- subgroup problem (2)
- supply chain management (2)
- supramolecular chemistry (2)
- tactics (2)
- temporal logic (2)
- termination (2)
- thermophysical properties (2)
- tractor (2)
- trajectory planning (2)
- tribology (2)
- uniqueness (2)
- universal objective function (2)
- urban shrinkage (2)
- variable neighborhood search (2)
- vector spherical harmonics (2)
- vectorial wavelets (2)
- virtual acoustics (2)
- viscoelasticity (2)
- weak solution (2)
- weak termination (2)
- wetting (2)
- work effort (2)
- worst-case scenario (2)
- "Slender-Body"-Theorie (1)
- "Stress-Mentor" (1)
- (Joint) chance constraints (1)
- (dynamic) network flows (1)
- 150 bar loop (1)
- 17beta-Estradiol (1)
- 19-century architecture (1)
- 1D-CFD (1)
- 2-d kernel regression (1)
- 2D-CFD (1)
- 3D (1)
- 3D Gene Expression (1)
- 3D Point Data (1)
- 3D image analysis (1)
- 3D printing (1)
- 3d imaging (1)
- 50CrMo4 (1)
- 5G (1)
- 5G networks (1)
- 90° orientation (1)
- : Navier-Stokes equations (1)
- : Two-phase flow in porous media (1)
- : multiple criteria optimization (1)
- : multiple objective programming (1)
- A-infinity-bimodule (1)
- A-infinity-category (1)
- A-infinity-functor (1)
- A/D conversion (1)
- AC-DC-Wannier-Stark systems (1)
- ADAU 1761 (1)
- ADMM (1)
- AFDX (1)
- ALE-Methode (1)
- AMC225xe (1)
- ANC (1)
- AR-ARCH (1)
- ARM Processor (1)
- ASM (1)
- AUTOSAR (1)
- AXI4-Stream (1)
- Ab-initio-Rechnung (1)
- Abel integral equations (1)
- Abelian groups (1)
- Abgeschlossenheit (1)
- Ableitung höherer Ordnung (1)
- Ableitungsfreie Optimierung (1)
- Ableitungsschätzung (1)
- Abrechnungsmanagement (1)
- Abstandsregeltempomat (1)
- Abstract ODE (1)
- Abstract linear systems theory (1)
- Abstraction-Based Controller Design (1)
- Abstraktion (1)
- Accelerometer (1)
- Access Points (1)
- Accountability (1)
- Accounting Agent (1)
- Achslage (1)
- Acid-mediated tumor invasion (1)
- Active Noice Canceling (1)
- Actor Engagement (1)
- Actor Roles (1)
- Acute toxicity (1)
- Ad-hoc networks (1)
- Ad-hoc workflow (1)
- AdS/CFT (1)
- Adaption (1)
- Adaptive Antennen (1)
- Adaptive Data Structure (1)
- Adaptive Entzerrung (1)
- Adaptive time step (1)
- Additionsreaktion (1)
- Additive Fertigung (1)
- Addukt (1)
- Adhäsion (1)
- Adjazenz-Beziehungen (1)
- Adjoint method (1)
- Adjoint system (1)
- Adsorption (1)
- Adsorptionskinetik (1)
- Adult identity (1)
- Adult learning (1)
- Advanced Encryption Standard (1)
- Aerosol (1)
- Aerosol Particles (1)
- Aerosol Partikeln (1)
- Affine Arithmetic (1)
- Agents (1)
- Aggregation (1)
- Agile Development (1)
- Agriculture Loan (1)
- Ah-Rezeptor (1)
- AhR/ER Crosstalk (1)
- AhRR (1)
- Ahr Knockout Model (1)
- Algebraic Geometry (1)
- Algebraic geometry (1)
- Algebraic groups (1)
- Algebraic optimization (1)
- Algebraischer Funktionenkörper (1)
- Algorithm (1)
- Algorithmic Differentiation (1)
- Algorithmics (1)
- All-ceramic end mills (1)
- All-ceramic micro end mills (1)
- Alter (1)
- AmICA (1)
- Amazonia (1)
- Ambient Intelligence (1)
- Ambulatory Assessment (1)
- Amharic, Attention, Factored Convolutional Neural Network, OCR (1)
- Amination (1)
- Amplitude-Phase Method (1)
- Analogy (1)
- Analytic semigroup (1)
- Analytical Quality Assurance (1)
- Analytical method (1)
- Ananasgewächse (1)
- Aneuploidy, Whole Genome Doubling (1)
- Angewandte Mathematik (1)
- Angular distribution (1)
- Anion recognition (1)
- Anisotropic smoothness classes (1)
- Anisotropie (1)
- Annulus (1)
- Anomaly Detection (1)
- Ansäuerung (1)
- Ant Colony Optimization (1)
- Anthropogener Einfluss (1)
- Anti-diffusion (1)
- Antidiffusion (1)
- Application Framework (1)
- Applications (1)
- Approximationsalgorithmus (1)
- Approximative Identität (1)
- Arbeitsmaschine (1)
- Arc distance (1)
- Archaikum (1)
- Archimedische Kopula (1)
- Architektur des 19. Jahrhunderts (1)
- Arf6 (1)
- Arithmetic data-path (1)
- Arp2/3 (1)
- Arthropods (1)
- Aryl hydrocarbon Receptor (1)
- Ascorbat (1)
- Ascorbinsäure (1)
- Ascorbylradikal (1)
- Ashur Ada (1)
- Ashuradeh (1)
- Asiatische Option (1)
- Assessment (1)
- Asset allocation (1)
- Asset-liability management (1)
- Assigment (1)
- Association (1)
- Associative Memory Problem (1)
- Asympotic Analysis (1)
- Asymptotic homogenization (1)
- Asymptotische Entwicklung (1)
- Atmungskette (1)
- Atom optics (1)
- Atom-Photon-Wechselwirkung (1)
- Atomoptik (1)
- Audio (1)
- Audiodeskription (1)
- Ausfallrisiko (1)
- Austin (1)
- Automat <Automatentheorie> (1)
- Automated Calibration (1)
- Automated Reasoning (1)
- Automated theorem proving (1)
- Automatic Image Captioning (1)
- Automatic Theorem Provi (1)
- Automatic risk assessment (1)
- Automatische Gefahrenanalyse (1)
- Automatische Klassifikation (1)
- Automatische Messung (1)
- Automatische Risikobewertung (1)
- Automatische Spracherkennung (1)
- Automatisches Beweisverfahren (1)
- Automorphismengruppe (1)
- Autonomer Roboter (1)
- Autonomous mobile robots (1)
- Autoregression (1)
- Autoregressive Hilbertian model (1)
- Autoregressive time series (1)
- Autorensystem (1)
- Aversive traits (1)
- Avirulence (1)
- Backlog (1)
- Baeocyte (1)
- Baiturrahman Grand Mosque (1)
- Balance sheet (1)
- Banach lattice (1)
- Banda Aceh old city center (1)
- Barriers (1)
- Basic Scheme (1)
- Basis Risk (1)
- Basisband (1)
- Basket Option (1)
- Bass-ackwards analysis (1)
- Baum <Mathematik> (1)
- Bayes risk (1)
- Bayes-Entscheidungstheorie (1)
- Bayesian Model Averaging (1)
- Beam models (1)
- Beam orientation (1)
- Bearing (1)
- Bearing capacitance (1)
- Bearing current (1)
- Befahrbarkeitsanalyse (1)
- Behavioural Customisation (1)
- Behinderter (1)
- Beleuchtung (1)
- Bell Number (1)
- Benetzung (1)
- Benutzer (1)
- Benutzerfreundlichkeit (1)
- Benzol (1)
- Berechnungskomplexität (1)
- Bernstein Kern (1)
- Bernstein–Gelfand–Gelfand construction (1)
- Bernstejn-Polynom (1)
- Berufliche Entwicklung (1)
- Beschichtungsprozess (1)
- Beschränkte Arithmetik (1)
- Beschränkte Krümmung (1)
- Bessel functions (1)
- Betrachtung des Schlimmstmöglichen Falles (1)
- Betriebsfestigkeit (1)
- Bevolkingsdaling (1)
- Bibligraphic References (1)
- Bibliothekskatalog (1)
- Bifurkation (1)
- Bilanzstrukturmanagement (1)
- Bildsegmentierung (1)
- Bildung (1)
- Bildungsreform (1)
- Bildungsungleichheit (1)
- Binary (1)
- Bingham viscoplastic model (1)
- Binomialbaum (1)
- Bio-inspired (1)
- Biodiversität (1)
- Bioengineering (1)
- Biofuel (1)
- Biofuels (1)
- Biogeographie (1)
- Biogeography (1)
- Bioinformatik (1)
- Biomarker (1)
- Biomimetic (1)
- Bionas (1)
- Bionik (1)
- Biophysics (1)
- Bioplastic-based blend nanocomposites (1)
- Biopropane (1)
- Biot Poroelastizitätgleichung (1)
- Biot poroelasticity system (1)
- Biotrophy (1)
- Bioturbation (1)
- Bipedal Locomotion (1)
- Bisector (1)
- Bitvektor (1)
- Black-Scholes model (1)
- Blackboard architecture (1)
- Black–Scholes approach (1)
- Blocked Neural Networks (1)
- Bluetooth (1)
- Boolean networks (1)
- Boolean polynomials (1)
- Boosting (1)
- Bootstrap (1)
- Bose-Einstein-Kondensation (1)
- Botrytis cinerea (1)
- Boundary Value Problem / Oblique Derivative (1)
- Boundary Value Problems (1)
- Bounded Model Checking (1)
- Box Algorithms (1)
- Box-Algorithm (1)
- Brandenburg-Lubuskie (1)
- Breitbandempfänger (1)
- Bremerhaven (1)
- Brillouin light scattering (1)
- Brinkman equations (1)
- Brownian Diffusion (1)
- Brownsche Bewegung (1)
- Buchstabe (1)
- Buffer (1)
- Buffer Zone Method (1)
- Bundle Methods (1)
- Business Model Innovation (1)
- Business Sustainability (1)
- Büyükçekmece and Mogan Lake (1)
- C (1)
- CAM (1)
- CAQ (1)
- CAx (1)
- CAx Technology (1)
- CBR (1)
- CCT (1)
- CDS (1)
- CDSwaption (1)
- CFD Simulation (1)
- CFK, Epoxidharzmatrix (1)
- CFL type conditions (1)
- CFRP (1)
- CID (1)
- CIR model (1)
- CMOS (1)
- CMOS-Schaltung (1)
- CNC-Maschine (1)
- CODET (1)
- CPDO (1)
- CPLD (1)
- CUDA (1)
- CUSUM statistic (1)
- CWGAN (1)
- CYP1B1 (1)
- Caatinga (1)
- Caching (1)
- Cantor sets (1)
- Capacitated Hub Location (1)
- Capacity (1)
- Capacity decisions (1)
- Capital-at-Risk (1)
- Carbon Capture (1)
- Carbon atomic ion (1)
- Carbon footprint (1)
- Careless Responding (1)
- Carreau law (1)
- Case Study (1)
- Case-Based Classification Algorithms (1)
- Case-Based Reasoning Systems (1)
- Case-Based Representability (1)
- Case-based problem solving (1)
- Caspian Sea (1)
- Castelnuovo Funktion (1)
- Castelnuovo function (1)
- Cauchy-Born Regel (1)
- Cauchy-Born Rule (1)
- Cauchy-Born rule (1)
- Cauchy-Navier scaling function and wavelet (1)
- Cauchy-Navier-Equation (1)
- Causal Ordering (1)
- Causality (1)
- Cell crosstalk (1)
- Cellular Communications (1)
- Cellulose (1)
- Celluloseacetat (1)
- Censoring (1)
- Center Location (1)
- Ceramic tool substrates (1)
- Certifying Compilers (1)
- Chain drives (1)
- Chancen (1)
- Change Point Analysis (1)
- Change Point Test (1)
- Change-point Analysis (1)
- Change-point estimator (1)
- Change-point test (1)
- Channel Hopping (1)
- Channel Scheduling (1)
- Channel estimation (1)
- Channel hopping (1)
- Channel sensing (1)
- Chapman Enskog distributions (1)
- Chi-Quadrat-Test (1)
- Chlamydomonas reinhardii (1)
- Chloride regulation (1)
- Cholesky-Verfahren (1)
- Chorin's projection scheme (1)
- Chow Quotient (1)
- Chromatin (1)
- Chromatographiesäule (1)
- Chromium Browser (1)
- Chroococcales (1)
- Chroococcidiopsis (1)
- Chroococcidiopsis cubana (1)
- Chroococcidiopsis thermalis (1)
- Chroococcidiopsisdaceae (1)
- Circle Location (1)
- City center (1)
- Classical mechanics (1)
- Classification Tasks (1)
- Classification of biomedical signals (1)
- Click chemistry (1)
- Climate change (1)
- Clock and Data Recovery Circuits (1)
- Closure (1)
- Cloud Computing (1)
- Cluster (1)
- Clusterverbindungen (1)
- Coarse graining (1)
- Code Inspection (1)
- Codierung (1)
- Cognitive Amplification (1)
- Cognitive Load (1)
- Cohen-Lenstra heuristic (1)
- Coherent State (1)
- Collaboration (1)
- Collaborative Design (1)
- Collision Avoidance (1)
- Collision Induced Dissociation (1)
- Collision Operator (1)
- Collocation Method plus (1)
- Combinatorial Testing (1)
- Combined IR/UV spectroscopy (1)
- Commodity Index (1)
- Communications (1)
- Compatibility (1)
- Competence (1)
- Competitive Analysis (1)
- Compiler (1)
- Completion (1)
- Complex Structures (1)
- Complexity (1)
- Complexity and performance of numerical algorithms (1)
- Complexity theory (1)
- Component Life Cycle (1)
- Composite Materials (1)
- Composites (1)
- Computational Homogenization (1)
- Computational Mechanics (1)
- Computer Algebra (1)
- Computer Assisted Tomograp (1)
- Computer Graphic (1)
- Computer Science (1)
- Computer Supported Cooperative Work (1)
- Computer algebra (1)
- Computer graphics (1)
- Computer supported cooperative work (1)
- Computer-Aided Diagnosis (1)
- Computerphysik (1)
- Computersimulation (1)
- Computertomographie (1)
- Computerunterstütztes Lernen (1)
- Computervision (1)
- Concept mapping (1)
- Concept maps (1)
- Concepts & Principles (1)
- Concrete experience (1)
- Concurrent data structures (1)
- Conditional Value-at-Risk (1)
- Configuration Knowledge (1)
- Configurational Forces (1)
- Congitive Radio Networks (1)
- Connectivity (1)
- Conservation laws (1)
- Consistencyanalysis (1)
- Consistent Price Processes (1)
- Constant Maturity Credit Default Swap (1)
- Constrained mechanical systems (1)
- Constraint Generation (1)
- Constraint Graphs (1)
- Constraint Programming (1)
- Constraint-Coupled Systems (1)
- Construction of hypersurfaces (1)
- Constructivism (1)
- Container (1)
- Context Awareness (1)
- Context of Use (1)
- Context-sensitive Assistance (1)
- Continuous Location (1)
- Continuous-Time Neural Networks (1)
- Continuum Damage (1)
- Continuum mechanics (1)
- Continuum-Atomistic Multiscale Algorithm (1)
- Continuum-Atomistics (1)
- Contract net (1)
- Control (1)
- Control Design Styles (1)
- Control Engineering (1)
- Controlling (1)
- Convergence Rate (1)
- Convex Analysis (1)
- Convex Optimization (1)
- Convex geometry (1)
- Convex sets (1)
- Convexity (1)
- Cook Wilson (1)
- Cooperative decision making (1)
- Coordination (1)
- Copper (1)
- Copula (1)
- Coq (1)
- Core (1)
- Corporate Environmental Report (CER) (1)
- Correct-by-Design Controller Synthesis (1)
- Correlation (1)
- Correspondence with other notations (1)
- Corridors (1)
- Cosine function (1)
- Cosserat rod (1)
- Coupled PDEs (1)
- Covid-19 (1)
- Coxeter groups (1)
- Coxeter-Freudenthal-Kuhn triangulation (1)
- Crack resistance (1)
- Crane (1)
- Crash (1)
- Crash Hedging (1)
- Crash modelling (1)
- Crash-Charakteristiken (1)
- Crashmodellierung (1)
- Credit Default Swap (1)
- Credit Default Swaption (1)
- Credit Risk (1)
- Crofton's intersection formulae (1)
- Cross-Cultural Product Development (1)
- Cross-border regions (1)
- Cross-border transport (1)
- Crystallization fouling (1)
- Curie temperature (1)
- Curvature (1)
- Curved viscous fibers (1)
- Customer distribution (1)
- Cut (1)
- Cutting and Packing (1)
- Cyanobakterium (1)
- Cyber-Physical Systems (1)
- Cycle Accuracy (1)
- Cycle Decomposition (1)
- Cyphochilus (1)
- Cytochomes P450 (1)
- Cytochrom P-450 (1)
- D factor (1)
- DC/DC Converter (1)
- DCE <Programm> (1)
- DFG (1)
- DFT (1)
- DFT calculation (1)
- DL-PCBs (1)
- DLW (1)
- DNA adducts (1)
- DNA metabarcoding (1)
- DNS-Schädigung (1)
- DOCK (1)
- DOSY (1)
- DPN (1)
- DSM (1)
- DSMC (1)
- Damage (1)
- Damon-Eshbach spin wave modes (1)
- Dark Factor of Personality (1)
- Dark traits (1)
- Dark-state Polariton (1)
- Darstellungstheorie (1)
- Das Urbild von Ideal unter einen Morphismus der Algebren (1)
- Data Modeling (1)
- Data Spreading (1)
- Data path (1)
- Data retention voltage (DRV) (1)
- Data width converter (1)
- Datenfusion (1)
- Datenrückgewinnungsschaltungen (1)
- Datenspreizung (1)
- David Hume (1)
- Decision Support Systems (1)
- Decision Making (1)
- Decision support (1)
- Decision support systems (1)
- Declarative and Procedural Knowledge (1)
- Decomposition of integer matrices (1)
- Defaultable Options (1)
- Defektinteraktion (1)
- Deformationstheorie (1)
- Degenerate Diffusion Semigroups (1)
- Dekonsolidierung (1)
- Delaunay (1)
- Delaunay Triangulation (1)
- Delaunay mesh generation (1)
- Delaunay triangulation (1)
- Delaunay triangulierung (1)
- Delaunay-Triangulierung (1)
- Delay Differential Equations (1)
- Dense gas (1)
- Dependency Factors (1)
- Derivat <Wertpapier> (1)
- Derivative Estimation (1)
- Derivatives (1)
- Desert rivers (1)
- Design (1)
- Design Patterns (1)
- Design Styles (1)
- Design process (1)
- Despoblacion (1)
- Deuterierung (1)
- Diagnosesystem (1)
- Dicarbonsäuren (1)
- Difference Reduction (1)
- Differential Cross-Sections (1)
- Differential forms (1)
- Differentialgleichung mit nacheilendem Argument (1)
- Differentialinklusionen (1)
- Differenzierbare Mannigfaltigkeit (1)
- Differenzmenge (1)
- Diffusion (1)
- Diffusion processes (1)
- Diffusionskoeffizient (1)
- Diffusionsmessung (1)
- Diffusionsmodell (1)
- Diffusionsprozess (1)
- Digital technology (1)
- Digitalmodulation (1)
- Dimensionality reduction (1)
- Dioxin (1)
- Dioxin-like Compounds (1)
- Dipeptide (1)
- Direct Numerical Simulation (1)
- Direct Sampling Receiver (1)
- Dirichlet series (1)
- Dirichlet-Problem (1)
- Discrete Bicriteria Optimization (1)
- Discrete Event Simulation (DES) (1)
- Discrete decision problems (1)
- Discrete linear systems (1)
- Discrete velocity models (1)
- Discriminatory power (1)
- Diskontinuität (1)
- Diskrete Simulation (1)
- Dislocations (1)
- Dispersionsrelation (1)
- Disproportionierung von Ethylbenzol (1)
- Dissertation (1)
- Distortion measure (1)
- Distributed Computation (1)
- Distributed Deb (1)
- Distributed Multimedia Applications (1)
- Distributed Optimization (1)
- Distributed Rendering (1)
- Distributed Software Development Projects (1)
- Distributed System (1)
- Distributed software development support (1)
- Distributed system (1)
- Distributed systems (1)
- Distribution and Combination of Theorem Provers (1)
- Disulfidbrücken-Transfer (1)
- Diversifikation (1)
- DoS (1)
- DoS-Attacke (1)
- Domain decomposition (1)
- Domain switching (1)
- Doppelbarriereoption (1)
- Doppelresonanz (1)
- Double Barrier Option (1)
- Double Dissociation (1)
- Downlink (1)
- Downsizing/Upsizing (1)
- Drahtloses Sensorsystem (1)
- Drahtloses lokales Netz (1)
- Dreidimensionale Bildverarbeitung (1)
- Dreidimensionale Rekonstruktion (1)
- Dreidimensionale Strömung (1)
- Drohne (1)
- Drone (1)
- Droplet breakage (1)
- Droplet coalescence (1)
- Druckabfall (1)
- Druckkorrektur (1)
- Drug delivery systems (1)
- Dsitribution (1)
- Dual Decomposition (1)
- Dual-Fuel (1)
- Dunkelzustandspolariton (1)
- Duplicate Identification (1)
- Duplikaterkennung (1)
- Durchsetzung (1)
- Dynamic Network Flow Problem (1)
- Dynamic Network Flows (1)
- Dynamic capillary pressure (1)
- Dynamic cut (1)
- Dynamical Coupling (1)
- Dynamically reconfigurable analog circuits (1)
- Dynamische Topographie (1)
- Dyslexie (1)
- Dünnfilmapproximation (1)
- E-Fuel (1)
- E-Learning (1)
- EBG (1)
- ECMAScript (1)
- EDA (1)
- EDF observation models (1)
- EEG (1)
- EGM96 (1)
- EGR (1)
- ELMO (1)
- EM algorith (1)
- EPDM (1)
- EPR (1)
- EPR Spectroscopy (1)
- EPR Spektroskopie (1)
- EROD (1)
- ESR (1)
- EXPRESS-G (1)
- Earley-Parser (1)
- Earliest arrival augmenting path (1)
- Earth' (1)
- Earth's disturbing potential (1)
- Earthworms (1)
- Eastern Boundary Upwelling Systems (1)
- Ebullition time-series (1)
- Ecological Economics (1)
- Ecology (1)
- Ecommerce (1)
- Eddy (1)
- Education (1)
- Edwards Model (1)
- Effective Conductivity (1)
- Effects of Design Choices (1)
- Efficiency (1)
- Efficient Reliability Estimation (1)
- Effizienz (1)
- Eigenschwingung (1)
- Eikonal equation (1)
- Eingebettete Systeme (1)
- Einzelmolekülspektroskopie (1)
- Einzelzell-Analyse (1)
- Elastic properties (1)
- Elastoplastic BVP (1)
- Electrical model (1)
- Electricity consumption (1)
- Electroless Plating (1)
- Electron states in low-dimensional structures (1)
- Electronically excited states (1)
- Electrophysiology (1)
- Elektrisch (1)
- Elektrizitätsverbrauch (1)
- Elektrochromes Material (1)
- Elektrohydraulik (1)
- Elektromagnetische Streuung (1)
- Elektronenspinresonanz (1)
- Elektrophysiologie (1)
- Elektroporation (1)
- Eliminationsverfahren (1)
- Elliptic-parabolic equation (1)
- Elliptische Verteilung (1)
- Elliptisches Randwertproblem (1)
- Embedded System (1)
- Embedded Systems (1)
- Embedded software (1)
- Emerging Memories (1)
- Emission (1)
- Emission Reduction (1)
- Emission Reduction Potential (1)
- Emissionsspektroskopie (1)
- Empfangssignalverarbeitung (1)
- Empfehlungssysteme (1)
- Empfängerorientierung (1)
- Enamide (1)
- Endliche Geometrie (1)
- Endliche Gruppe (1)
- Energieeffizienz (1)
- Energieffizienz (1)
- Energiespektrum (1)
- Energietransfer (1)
- Energy markets (1)
- Energy spectra (1)
- Engineering 4.0 (1)
- Ensemble Visualization (1)
- Enskog equation (1)
- Enterprise modeling (1)
- Enterprise modelling (1)
- Entscheidungsbaum (1)
- Entscheidungsproblem (1)
- Entscheidungsunterstützung (1)
- Entwicklungspsychologie (1)
- Entwurf (1)
- Entwurfsautomation (1)
- Enumerative Geometrie (1)
- Environmental Management System (1)
- Environmental Psychology (1)
- Environmental inequality (1)
- Environmental stress cracking resistance (1)
- Epidemiologie (1)
- Epidemiology (1)
- Epiphyten (1)
- Epoxydharz (1)
- Equality reasoning (1)
- Equational Reasoning (1)
- Equicofactor matrix polynomials (1)
- Erdöl Prospektierung (1)
- Erfüllbarke (1)
- Ergodic (1)
- Erhaltungsgleichungen (1)
- Erkenntnistheorie (1)
- Ermüdungsrisse (1)
- Ernergie effiziente Bewegung (1)
- Erreichbarkeit (1)
- Error Correction Codes (1)
- Error correcting coding (ECC) (1)
- Essential m-dissipativity (1)
- Estradiol (1)
- Estradiolrezeptor (1)
- Ethernet (1)
- Etylbenzene disproportionation (1)
- Euler number (1)
- Euler's equation of motion (1)
- Eulerian-Lagrangian formulation (1)
- Eupoecilia ambiguella (1)
- European Groupings of Territorial Cooperation (1)
- European Pollutant Release and Transfer Register (E-PRTR) (1)
- European Spatial Planning (1)
- European Union (1)
- European Union policy-making (1)
- European integration (1)
- Europeanisation (1)
- Europäischer Verbund für Territoriale Zusammenarbeit (1)
- Evacuation Planning (1)
- Event psychology (1)
- Eventpsychologie (1)
- Eventual consistency (1)
- Evolution Equations (1)
- Evolutionary Algorithm (1)
- Evolutionary Integral Equations (1)
- Existence of Solutions (1)
- Exogenous (1)
- Expected shortfall (1)
- Experience Database (1)
- Experiential learning (1)
- Experiment (1)
- Experimental Data (1)
- Experimentation (1)
- Explainability (1)
- Explainable Artificial Intelligence (1)
- Exponential Utility (1)
- Exponentieller Nutzen (1)
- Exposed Datapath Architectures (1)
- Extended Finite-Elemente-Methode (1)
- Extended Kalman Filter (1)
- Extended Mind (1)
- Extensibility (1)
- Extraction (1)
- Extreme Events (1)
- Extreme value theory (1)
- Eye-Tracking (1)
- Eyewear Computing (1)
- FDTD (1)
- FEM-FCT stabilization (1)
- FETI (1)
- FPTAS (1)
- Facility location (1)
- Faden (1)
- Fahrerassistenzsystem (1)
- Fahrtkostenmodelle (1)
- Faltung (1)
- Faltung <Mathematik> (1)
- Families of Probability Measures (1)
- Fast Pseudo Spectral Algorithm (1)
- Fast Wavelet Transform (1)
- Fatigue (1)
- Fattyacids (1)
- Fault Injection (1)
- Fault Prediction (1)
- Fault Tree Analysis (1)
- Feasibility study (1)
- Feature (1)
- Feature Detection (1)
- Feature Extraction (1)
- Feature Technology (1)
- Feature extraction (1)
- Feature selection (1)
- Features (1)
- Federated Learning (1)
- Feed-forward Networks (1)
- Feedfoward Neural Networks (1)
- Fehlerbaumanalyse (1)
- Femtosecond Laser (1)
- Femtosekundenspektroskopie (1)
- Fernerkundung (1)
- Ferromagnetism (1)
- Festkörpergrenzschichten (1)
- Fettsäuren (1)
- Feynman Integrals (1)
- Fiber spinning (1)
- Fiber suspension flow (1)
- Fifth generation (5G) mobile networks (1)
- Filippov theory (1)
- Filippov-Theorie (1)
- Filter-Diagonalization (1)
- Filtering (1)
- Financial Engineering (1)
- Financial Mathematics (1)
- Finanzkrise (1)
- Finanznumerik (1)
- Finite Dominating Sets (1)
- Finite Element Method (1)
- Finite Elemente Methode (1)
- Finite Elementes (1)
- Finite Elements (1)
- Finite element method (1)
- Finite rotations (1)
- Finite-Elemente-Simulation (1)
- Finite-Punktmengen-Methode (1)
- Firmware (1)
- Firmwertmodell (1)
- First Order Optimality System (1)
- First--order optimality system (1)
- Flachwasser (1)
- Flachwassergleichungen (1)
- Flash Memories (1)
- Flechten (1)
- Flexible multibody dynamics (1)
- Fließanalyse (1)
- Flooding (1)
- Flooding Attack (1)
- Flow Visualization (1)
- FlowLoc (1)
- Flugzeitmassenspektrometrie (1)
- Fluid Structure Interaction (1)
- Fluid dynamics (1)
- Fluid-Feststoff-Strömung (1)
- Fluid-Struktur-Kopplung (1)
- Fluid-Struktur-Wechselwirkung (1)
- Foam decay (1)
- Fokker-Planck Equation (1)
- Fokker-Planck equation (1)
- Fokker-Planck equations (1)
- Fokker-Planck-Gleichung (1)
- Folgar-Tucker equation (1)
- Folgar-Tucker model (1)
- Forbidden Regions (1)
- Forecasting (1)
- Forgetting-enabled Information Systems (1)
- Formal Semantics (1)
- Formale Beschreibungstechnik (1)
- Formale Grammatik (1)
- Formale Methode (1)
- Formale Ontologie (1)
- Formale Sprache (1)
- Formaler Beweis (1)
- Fourier filtering (1)
- Fourier-Transformation (1)
- Fourieroptik (1)
- Fracture behavior (1)
- Fragmentierung (1)
- Framework (1)
- Framework <Informatik> (1)
- Fredholm integral equation of the second kind (1)
- Fredholmsche Integralgleichung (1)
- Frequency Averaging (1)
- Frequenzsprungverfahren (1)
- Friction (1)
- Front Propagation (1)
- Fräsen (1)
- Fully Variable Valve Train (1)
- Function of bounded variation (1)
- Functional Programs (1)
- Functional Safety (1)
- Functional autoregression (1)
- Functional time series (1)
- Funknetz (1)
- Funktionalanalysis (1)
- Funktionenkörper (1)
- Fusion (1)
- Future Internet (1)
- Fuzzy Programming (1)
- Fußgängerzone Kaiserslautern (1)
- Füllkörpersäule (1)
- G2++ model (1)
- GARCH (1)
- GARCH Modelle (1)
- GAT-1 (1)
- GAT-3 (1)
- GOCE <satellite mission> (1)
- GPS-satellite-to-satellite tracking (1)
- GRACE (1)
- GRACE <satellite mission> (1)
- GRAPHICS (1)
- Galerkin Verfahren (1)
- Galerkin methods (1)
- Gamification (1)
- Gamma-Konvergenz (1)
- Garantiezins (1)
- Garbentheorie (1)
- Gateway (1)
- Gauge Distances (1)
- Gauss-Manin connection (1)
- Gaussian random noise (1)
- Gauß-Filter (1)
- Gebietszerlegung (1)
- Gebietszerlegungsmethode (1)
- Gebogener viskoser Faden (1)
- Gedächtnis (1)
- Gefahren- und Risikoanalyse (1)
- Gemeinsame Kanalschaetzung (1)
- Gen-Expression (1)
- Gene Expression (1)
- Gene expression programming (1)
- General Knowledge (1)
- Generalisierte Plastizität (1)
- Generalized LBE (1)
- Generative adversarial networks (1)
- Generic Methods (1)
- Generierung (1)
- Genetic Algorithm (1)
- Genome analysis (1)
- Genregulation (1)
- Geo-referenced data (1)
- Geodesie (1)
- Geodäsie (1)
- Geodätischer Satellit (1)
- Geographic Information System (GIS) (1)
- Geographical Information Systems (1)
- Geomagnetic Field Modelling (1)
- Geomagnetismus (1)
- Geomathematik (1)
- Geometric (1)
- Geometrical Nonlinear Thermomechanics (1)
- Geometrical algorithms (1)
- Geometrical nonlinear Reissner–Mindlin shell (1)
- Geometrische Ergodizität (1)
- Geostrophic flow (1)
- Geostrophisches Gleichgewicht (1)
- Geothermal Flow (1)
- Geothermal Systems (1)
- Geovisualization (1)
- German (1)
- German census (1)
- Geschwindigkeitsbegrenzung (1)
- Geschwindigkeitsregelung (1)
- Geschwindigkeitswahrnehmung (1)
- Gewichteter Sobolev-Raum (1)
- Giga bit per second (1)
- Gitterbaufehler (1)
- Gittererzeugung (1)
- Glassy polymers (1)
- Gleichgewichtsstrategien (1)
- Gleichmäßige Approximation (1)
- Gleichspannungswandler (1)
- Gleitverschleiß (1)
- Global Optimization (1)
- Global Predicate Detection (1)
- Global Software Highway (1)
- Global optimization (1)
- Globale nichtlineare Analysis (1)
- GlyHis (1)
- GlyT1 (1)
- Glättung (1)
- Glättungsparameterwahl (1)
- Gold nanoparticles (1)
- Google Earth (1)
- Governance (1)
- Grad expansion (1)
- Gradient based optimization (1)
- Gradual Covering (1)
- Grand challenge (1)
- Granular (1)
- Granular flow (1)
- Granulat (1)
- Graph coloring (1)
- Graphentheorie (1)
- Gravimetry (1)
- Gravitational Field (1)
- Greater Region Saar-Lor-Lux+ (1)
- Greedy Algorithm (1)
- Greedy Heuristic (1)
- Greedy algorithm (1)
- Green Computing (1)
- Green's functions (1)
- Green-Funktion (1)
- Green-IT (1)
- Greenland (1)
- Green’s function (1)
- Grenzfläche (1)
- Grenzflächenspannung (1)
- Grid Generation (1)
- Grid Graphs (1)
- Gromov Witten (1)
- Gromov-Witten-Invariante (1)
- Group and Organizational Learning (1)
- Grouping by similarity (1)
- Große Abweichung (1)
- Großregion Saar-Lor-Lux+ (1)
- Gruppenoperation (1)
- Gruppentheorie (1)
- Gröber basis (1)
- Gröbner base (1)
- Gröbner bases in monoid and group rings (1)
- Gröbner basis (1)
- Grüne Chemie (1)
- Gymnasium (1)
- Gyroscopic (1)
- Güteschaltung (1)
- H/D exchange (1)
- HAZOP Automation (1)
- HAZOP Automatisierung (1)
- HAZOP Digitalization (1)
- HAZOP-Verfahren (1)
- HCL (1)
- HCVL (1)
- HIF-1 (1)
- HJM (1)
- HMC (1)
- HOL (1)
- HPC (1)
- HSF (1)
- HSF1 (1)
- HSP (1)
- HSP70 (1)
- HTE (1)
- HVO (1)
- Hadamard manifold (1)
- Hadamard space (1)
- Hadamard-Mannigfaltigkeit (1)
- Hadamard-Raum (1)
- Hadwiger's recursive de nition of the Euler number (1)
- Hals-Nasen-Ohren-Chirurgie (1)
- Hals-Nasen-Ohren-Heilkunde (1)
- Hamilton-Jacobi-Differentialgleichung (1)
- Hamiltonian (1)
- Hamiltonian Path Integrals (1)
- Hamiltonian groups (1)
- Hamiltonian systems (1)
- Hamming code (1)
- Hand gestures (1)
- Handelsstrategien (1)
- Hankel matrix (1)
- Hardware Description Langauge (HDL) (1)
- Hardware Description Language (HDL) (1)
- Hardware Security (1)
- Hardware-in-the-loop (1)
- Hardware/Software co-verification (1)
- Hardwareverifikation (1)
- Hardy space (1)
- Harmonische Analyse (1)
- Harmonische Dichte (1)
- Harmonische Funktion (1)
- Harold Arthur (1)
- Haustoria (1)
- Hazard Analysis (1)
- Hazard Functions (1)
- Heat stress response (1)
- Heat transfer (1)
- Heavy-tailed Verteilung (1)
- Hedge funds (1)
- Hedging (1)
- Heißes Elektron (1)
- Helmholtz Type Boundary Value Problems (1)
- Helmholtz decomposition (1)
- Helmholtz-Decomposition (1)
- Helmholtz-Zerlegung (1)
- Heston Model (1)
- Heterogene Katalyse (1)
- Heterogeneous (1)
- Heuristik (1)
- Hidden Markov models for Financial Time Series (1)
- Hierarchies (1)
- Hierarchische Matrix (1)
- High Voltage (1)
- High frequency switching (1)
- High viscous fluids (1)
- High-Performance Computing (HPC) (1)
- High-Spin-Komplexe (1)
- High-cycle fatigue (1)
- Higher Order Differentials as Boundary Data (1)
- Higher education (1)
- Hilbert complexes (1)
- Hilbert transform (1)
- Hippocampus (1)
- HisGly (1)
- Hitting families (1)
- Hochleistungsrechnen (1)
- Hochschild homology (1)
- Hochschild-Homologie (1)
- Hochspannung (1)
- Home Health Care (1)
- Homogeneous Relaxation (1)
- Homogeneous deformation (1)
- Homogenisieren (1)
- Homologietheorie (1)
- Homologische Algebra (1)
- Homotopie (1)
- Homotopiehochhebungen (1)
- Homotopy (1)
- Homotopy lifting (1)
- Honduras (1)
- Honesty-Humility (1)
- Horizontal gene transfer (1)
- Hub Location (1)
- Hub Location Problem (1)
- Hugh circle transformation (1)
- Hull White model (1)
- Human Liver Cell Models (1)
- Human Pose (1)
- Human health (1)
- Human resource modeling (1)
- Human satisfaction (1)
- Human-Computer Interaction (1)
- Human-centric lighting (1)
- Human-centric virtual lighting (1)
- Humanism (1)
- Husimi (1)
- Hybrid CBR (1)
- Hybrid Codes (1)
- Hybrid Electric Vehicle (1)
- Hybrid Models (1)
- Hybridregler (1)
- Hydratation (1)
- Hydrological Gravity Variations (1)
- Hydrologie (1)
- Hydrostatischer Druck (1)
- Hyperbolic Conservation (1)
- Hyperelastizität (1)
- Hyperelliptische Kurve (1)
- Hyperflächensingularität (1)
- Hypergraph (1)
- Hypermedia Document (1)
- Hyperspektraler Sensor (1)
- Hypocoercivity (1)
- Härten (1)
- Hörgerät (1)
- ICT (1)
- IEC 61508 (1)
- IEEE 802.15.4 (1)
- IMRT planning on adaptive volume structures – a significant advance of computational complexity (1)
- IMU (1)
- INGARCH (1)
- INRECA (1)
- IP Address (1)
- IP Traffic Accounting (1)
- IP-XACT (1)
- ISO 26262 (1)
- ISO26262 (1)
- ITSM (1)
- IVR (1)
- Idealklassengruppe (1)
- Identifiability (1)
- Identification (1)
- Ileostomy (1)
- Ill-Posed Problems (1)
- Ill-posed Problems (1)
- Ill-posed problem (1)
- Illiquidität (1)
- Image Processing (1)
- Image restoration (1)
- Imatinib mesilat (1)
- Imidacloprid (1)
- Immanuel Kant (1)
- Immiscible lattice BGK (1)
- Immobilienaktie (1)
- Immobilisierung (1)
- Immunoblot (1)
- Implantation (1)
- Implementierung (1)
- Improperly posed problems (1)
- Impulse control (1)
- Incompressible Navier-Stokes (1)
- Incompressible Navier-Stokes equations (1)
- Incremental recomputation (1)
- Index Insurance (1)
- Individual (1)
- Induction heating (1)
- Inductive Theorem Proving (1)
- Induktive logische Programmierung (1)
- Industrial Applications (1)
- Industrial Ecology (1)
- Industrial air pollution (1)
- Infectious Diseases (1)
- Inferior colliculus (1)
- Infiltration (1)
- Inflation (1)
- Influencer (1)
- Influencer Marketing (1)
- Information Extraction (1)
- Information Management (1)
- Information Theory (1)
- Information Visualization (1)
- Informationsübertragung (1)
- Infrared Multi Photon Dissociation (1)
- Infrared Multiphoton Dissociation Spectroscopy (IR-MPD) (1)
- Infrarotspek (1)
- Injectivity of mappings (1)
- Injektivität von Abbildungen (1)
- Inkompressibel Navier-Stokes (1)
- Inkorrekt gestelltes Problem (1)
- Innovation (1)
- Input-To-State Stability (1)
- Insekten (1)
- Instance-based Learning (1)
- Insurance (1)
- Integral Equations (1)
- Integral transform (1)
- Integrative Beleuchtung (1)
- Integrative lighting (1)
- Intel XScale (1)
- Intelligent Agents (1)
- Intelligent Object Fusion (1)
- Intelligent agents (1)
- Intensity estimation (1)
- Intensität (1)
- Intentional Forgetting (1)
- Interacting Magnetic Dots and Wires (1)
- Interactive decision support systems (1)
- Interface Specification (1)
- Interkulturelle Produktentwicklung (1)
- Interleaved Planning (1)
- Intermediate Composition (1)
- Internet Based Software Process Management Environment (1)
- Internet knowledge base (1)
- Internet knowledge reuse (1)
- Interpolation (1)
- Interpolation Algorithm (1)
- Interpolation of rotations (1)
- Interpolation of the Director (1)
- Interregional cooperation (1)
- Inuktitut (1)
- Invariante (1)
- Invariante Momente (1)
- Inverse Problems (1)
- Inverse problems in Banach spaces (1)
- Inverse spin injection (1)
- Investigation (1)
- Ion (1)
- Ion pairs (1)
- Ion source (1)
- Ionenquelle (1)
- Ionensolvatation (1)
- Irreduzibler Charakter (1)
- Isabelle/HOL (1)
- Ising model (1)
- Isomerisierung von n-Decan (1)
- Isotopieeffekt (1)
- Isotropy (1)
- Iterative Methods (1)
- Iterative learning control (1)
- Iterative methods (1)
- Jacobian (1)
- Jacobigruppe (1)
- JavaScript (1)
- Jeffreys' prior (1)
- Jiang's constitutive model (1)
- Jiangsches konstitutives Gesetz (1)
- Jiang’s Model of Elastoplasticity (1)
- Jitter (1)
- John L. (1)
- K-best solution (1)
- K-cardinality trees (1)
- KCC2 (1)
- Kaktusgraph (1)
- Kallianpur-Robbins law (1)
- Kalman Filter (1)
- Kanalcodierung (1)
- Kanalschätzung (1)
- Kardiotoxizität (1)
- Karhunen-Loève expansion (1)
- Katalyse (1)
- Katalytische Hydrierung (1)
- Katastrophe (1)
- Katastrophenschutz (1)
- Kategorientheorie (1)
- Kategorischer Imperativ (1)
- Kausale Inferenz (1)
- Kausalmodell (1)
- Kellerautomat (1)
- Kelvin Transformation (1)
- Kinetic Schems (1)
- Kinetic Theory of Gases (1)
- Kinetic theory (1)
- Kirchhoff and Cosserat rods (1)
- Kirchhoff-Love shell (1)
- Kirchhoff\\\'s geometrically theory (1)
- Klassifikation (1)
- Klima (1)
- Knapsack (1)
- Knapsack problem (1)
- Knochenmetastase (1)
- Knowledge Extraction (1)
- Knowledge Work (1)
- Knowledge transfer (1)
- Knowledge-based Techniques (1)
- Knuth-Bendix completion (1)
- Knuth-Bendix completion algorithm (1)
- Knuth-Bendix-Vervollständigung (1)
- Kognition (1)
- Kognitive Psychologie (1)
- Kognitives Lernen (1)
- Kohlenstoffion (1)
- Kohonen's SOM (1)
- Kohäsive Grenzschichten (1)
- Kollisionserkennung (1)
- Kolonisierung (1)
- Kombinatorik (1)
- Kombinatorische Optimierung (1)
- Kombinierte IR/UV-Spektroskopie (1)
- Kommunikationsprotokoll (1)
- Kommutative Algebra (1)
- Kompakter Träger <Mathematik> (1)
- Kompetenz (1)
- Komplexitätsklasse NP (1)
- Komponente <Software> (1)
- Kompression (1)
- Konfigurationskräfte (1)
- Konfigurationsmechanik (1)
- Konjugierte Dualität (1)
- Konstruktion von Hyperflächen (1)
- Konstruktive Approximation (1)
- Kontextbezogenes System (1)
- Kontinuum <Mathematik> (1)
- Kontinuums-Atomistische Kopplung (1)
- Kontinuumsphysik (1)
- Konvergenzrate (1)
- Konvergenzverhalten (1)
- Konvexe Mengen (1)
- Konvexe Optimierung (1)
- Kooperation (1)
- Kopplungsmethoden (1)
- Kopplungsproblem (1)
- Kopula <Mathematik> (1)
- Korrelationsanalyse (1)
- Kraftregelung (1)
- Kreitderivaten (1)
- Kristallisationsfouling (1)
- Kryptoanalyse (1)
- Kryptologie (1)
- Krümmung (1)
- Kugelfunktion (1)
- Kullback Leibler distance (1)
- Kullback-Leibler divergence (1)
- Kurve (1)
- Kurvenschar (1)
- Künstliche Intelligenz (1)
- L-curve Methode (1)
- L2-Approximation (1)
- LIBOR (1)
- LIBOR market model (1)
- LIDAR (1)
- LIR-Tree (1)
- LV network (1)
- Label correcting algorithm (1)
- Label setting algorithm (1)
- Lagrange formalism (1)
- Lagrangian Functions (1)
- Lagrangian relaxation (1)
- Lambda-cyhalothrin (1)
- Laminare Grenzschicht (1)
- Land Use Planning (1)
- Landwirtschaft (1)
- Language Constructs (1)
- Large Data (1)
- Large Eddy Simulation (1)
- Large High-Resolution Displays (1)
- Large Synchronous Networks (1)
- Large deformations (1)
- Large-Scale Problems (1)
- Laser Wakefield Particle Accelerator (1)
- Laser spectroscopy (1)
- Lateral superior olive (1)
- Lattice Boltzmann method (1)
- Lattice Boltzmann models (1)
- Lattice-BGK (1)
- Lattice-Boltzmann (1)
- Lattice-Boltzmann method (1)
- Lavrentiev regularization (1)
- Lavrentiev regularization for equations with monotone operators (1)
- Lead (1)
- Leading-Order Optimality (1)
- Learnability (1)
- Learning Analytics (1)
- Learning from Nature (1)
- Learning systems (1)
- Least squares approximation (1)
- Least-squares Monte Carlo method (1)
- Leber (1)
- Legendre Wavelets (1)
- Leichtbau (1)
- Leichtbaupotenzial (1)
- Leistungseffizienz (1)
- Leistungsmessung (1)
- Leitfähigkeit (1)
- Lesen (1)
- Lesenlernen (1)
- Lesestörung (1)
- Leukämie (1)
- Level Set method (1)
- Level set methods (1)
- Level sets (1)
- Levy process (1)
- Lexicographic Order (1)
- Lexicographic max-ordering (1)
- Li Ion Batteries (1)
- LiDAR (1)
- Lichtforschung (1)
- Lichtspeicherung (1)
- Lie algebras (1)
- Lie-Typ-Gruppe (1)
- Light Storage (1)
- Lighting (1)
- Lighting Design (1)
- Lighting research (1)
- Limitierungen (1)
- Linear Integral Equations (1)
- Linear Programming (1)
- Linear kinematic hardening (1)
- Linear kinematische Verfestigung (1)
- Linear membership function (1)
- Linear-Quadratic-Regulator (1)
- Lineare Integralgleichung (1)
- Lineare Optimierung (1)
- Link Metric (1)
- Linked Data (1)
- Linking Data Analysis and Visualization (1)
- Linux (1)
- Lippmann-Schwinger Equation (1)
- Lippmann-Schwinger equation (1)
- Liquid Polymer Moulding (1)
- Liquid-Liquid Extraction (1)
- Liquid-liquid dispersion (1)
- Liquid-liquid extraction (1)
- Liquidität (1)
- Literature review (1)
- Liver Toxicity (1)
- Load Balancing (1)
- Lobesia botrana (1)
- Local completeness (1)
- Local continuum (1)
- Local existence uniqueness (1)
- Locally Supported Radial Basis Functions (1)
- Locally Supported Zonal Kernels (1)
- Locally stationary processes (1)
- Location (1)
- Location Awareness (1)
- Location problems (1)
- Location theory (1)
- Locational Planning (1)
- Logic Design (1)
- Logical Time (1)
- Logiksynthese (1)
- Lokalisierung (1)
- Lokalkompakte Kerne (1)
- London-Dispersion (1)
- Low Jitter (1)
- Low Power (1)
- Low Voltage (1)
- Low leakage (1)
- Low-Power (1)
- Low-discrepancy sequences (1)
- Lubricant film thickness (1)
- Lubrication (1)
- Luftschnittstellen (1)
- Lungenkrebs (1)
- Lärmbelastung (1)
- Lärmimmission (1)
- MAC protocols (1)
- MACAO (1)
- MBS (1)
- MBS simulation (1)
- MEGI (1)
- META-AKAD (1)
- MHEG (1)
- MIDI <Musikelektronik> (1)
- MILP formulations (1)
- MIMO Systeme (1)
- MIMO-Antennen (1)
- MIP formulations (1)
- MIP-Emissionsspektroskopie (1)
- MIP-Massenspektrometrie (1)
- MIR (1)
- MKS (1)
- ML-estimation (1)
- MLC (1)
- MLE (1)
- MO-Theorie (1)
- MOCO (1)
- MOO (1)
- MP3 (1)
- Macaulay’s inverse system (1)
- Mach-Zehnder-Interferometer (1)
- Machine Scheduling (1)
- Macroinvertebrates (1)
- Magnetfeldbasierter Lokalisierung (1)
- Magnetfelder (1)
- Magneto-Elastic Coupling (1)
- Magnetoelastic coupling (1)
- Magnetoelasticity (1)
- Magnetometer (1)
- Magnetostriction (1)
- Manufacturing (1)
- Manufacturing Control (1)
- Manufacturing System (1)
- Map Building (1)
- MapReduce (1)
- Mapping (1)
- Marangoni-Effekt (1)
- Market Equilibrium (1)
- Markov Kette (1)
- Markov process (1)
- Markov switching (1)
- Markov-Ketten-Monte-Carlo-Verfahren (1)
- Marktmanipulation (1)
- Marktrisiko (1)
- Martensit (1)
- Martensite transformation (1)
- Martingaloptimalitätsprinzip (1)
- Maschinelle Übersetzung (1)
- Mass transfer (1)
- Massendichte (1)
- Massenspektrometrie (1)
- Mastoid (1)
- Mastoidektomie (1)
- Material Modelling (1)
- Material Properties under Exctreme Conditions (1)
- Material-Force-Method (1)
- Materialermüdung (1)
- Materialmodellierung (1)
- Materialsysteme (1)
- Materielle Kräfte (1)
- Mathematical Epidemiology (1)
- Mathematical Finance (1)
- Mathematical Modeling (1)
- Mathematical modeling (1)
- Mathematics (1)
- Mathematisches Modell (1)
- Matrix Completion (1)
- Matrix perturbation theory (1)
- Matrixkompression (1)
- Matrizenfaktorisierung (1)
- Matrizenzerlegung (1)
- Matroids (1)
- Maturity of Software Engineering (1)
- Max-Ordering (1)
- Maximal Cohen-Macaulay modules (1)
- Maximale Cohen-Macaulay Moduln (1)
- Maximum Intensity Projection (1)
- Maximum Likelihood Estimation (1)
- Maximum-Likelihood-Schätzung (1)
- Maxwell's equations (1)
- McKay conjecture (1)
- Meaningful Work (1)
- Measurement plattform (1)
- Mechanical (1)
- Mechanical Engineering (1)
- Mechanics (1)
- Mechanisch (1)
- Mechenical Engine Desgin (1)
- Medical Image Analysis (1)
- Medical Physics (1)
- Mehrdimensionale Bildverarbeitung (1)
- Mehrdimensionale Spline-Funktion (1)
- Mehrdimensionales Variationsproblem (1)
- Mehrkörpersimulation (1)
- Mehrkörpersystem (1)
- Mehrphasenströmung (1)
- Mehrskalen (1)
- Mehrtraegeruebertragungsverfahren (1)
- Melt spinning (1)
- Memory Architecture (1)
- Memory Consistency (1)
- Memory Theory (1)
- Memristor (1)
- Memristors (1)
- Mena (1)
- Mensch-Maschine-Kommunikation (1)
- Mensch-Roboter-Kooperation (1)
- Menschenmenge (1)
- Merkmalsraum (1)
- Mesh-Free (1)
- Mesh-less methods (1)
- Meshfree Method (1)
- Meshfree method (1)
- Messplatform (1)
- Metabolismus (1)
- Metabolomics (1)
- Metacontrast Masking (1)
- Metaheuristics (1)
- Metal-Free (1)
- Metallcluster (1)
- Metallschicht (1)
- Metaphor (1)
- Metapopulation (1)
- Metaverse (1)
- Metaversum (1)
- Meter (1)
- Methane emissions (1)
- Methode der Fundamentallösungen (1)
- Methode der finiten Elemente (1)
- Methods (1)
- Miankaleh peninsula (1)
- Micro Cutting (1)
- Micro Grinding (1)
- Micro Lead (1)
- Microelectromechanical Systems (1)
- Microstructure (1)
- Microstructure morphology (1)
- Microsystem Technology (1)
- Mie representation (1)
- Mie- and Helmholtz-Representation (1)
- Mie- und Helmholtz-Darstellung (1)
- Mie-Darstellung (1)
- Mie-Representation (1)
- Mikrodrall (1)
- Mikroelektronik (1)
- Mikroklima (1)
- Mikromorphe Kontinua (1)
- Mikroskopie (1)
- Mikrosystemtechnik (1)
- Milne Equation (1)
- Mindfulness (1)
- Minimal Cut Set Visualization (1)
- Minimal spannender Baum (1)
- Minimal training (1)
- Minimum Cost Network Flow Problem (1)
- Minimum Principle (1)
- Minkowski space (1)
- Mischcluster (1)
- Mitochondria (1)
- Mitochondrien (1)
- Mitochondrium (1)
- Mixed Connectivity (1)
- Mixed integer programming (1)
- Mixed method (1)
- Mixed-integer Programming (1)
- Mixing (1)
- Mn-Si-C alloy films (1)
- Mobile Communications (1)
- Mobile Machines (1)
- Mobile Networks (1)
- Mobile Robots (1)
- Mobile Telekommunikation (1)
- Mobile system (1)
- Mobiler Roboter (1)
- Mobilfunksysteme (1)
- Mobility (1)
- Model Based User Interface Development (1)
- Model reduction (1)
- Model-Dynamics (1)
- Model-based Systems Engineering (MBSE) (1)
- Model-driven Engineering (1)
- Modeling (1)
- Modellbasierte Fehlerdiagnose (1)
- Modellbildung (1)
- Modellgetriebene Entwicklung (1)
- Modelling (1)
- Modes of learning (1)
- Modifiziertes Epoxidharz (1)
- Modularisierung (1)
- Modulationsübertragungsfunktion (1)
- Moduli Spaces (1)
- Molecular Dynamics (1)
- Molecular beam (1)
- Molecular dynamics (1)
- Molekularbiologie (1)
- Molekulare Bioinformatik (1)
- Molekülcluster (1)
- Molekülorbital (1)
- Molodensky Problem (1)
- Molodensky problem (1)
- Moment Invariants (1)
- Moment sequence (1)
- Moment-Generating Functions (1)
- Momentum and Mas Transfer (1)
- Monoid and group rings (1)
- Monotone dynamical systems (1)
- Monte Carlo method (1)
- Monte Carlo methods (1)
- Monte-Carlo Modelling (1)
- Monte-Carlo methods (1)
- Mood-based Music Recommendations (1)
- Moreau-Yosida regularization (1)
- Morphismus (1)
- Mortar methods (1)
- Multi Primary and One Second Particle Method (1)
- Multi-Asset Option (1)
- Multi-Edge Graph (1)
- Multi-Field (1)
- Multi-Variant Model (1)
- Multi-Variate Data (1)
- Multi-dimensional systems (1)
- Multi-patch connection (1)
- Multibody (1)
- Multibody simulation (1)
- Multicore Resource Management (1)
- Multicore Scheduling (1)
- Multicriteria Location (1)
- Multicriteria decision making (1)
- Multidisciplinary Optimization (1)
- Multifield Data (1)
- Multileaf Collimator (1)
- Multileaf collimator (1)
- Multiperiod planning (1)
- Multiphase Flows (1)
- Multiple Criteria (1)
- Multiple Jobholding (1)
- Multiple Objective Programs (1)
- Multiple criteria analysis (1)
- Multiple criteria optimization (1)
- Multiple objective combinatorial optimization (1)
- Multiple objective optimization (1)
- Multiplicative Schwarz Algorithm (1)
- Multipoint flux approximation (1)
- Multiresolution analysis (1)
- Multiscale (1)
- Multiscale Methods (1)
- Multiscale model (1)
- Multiscale modelling (1)
- Multiscale problem (1)
- Multiscale problems (1)
- Multiscale structures (1)
- Multiskalen-Entrauschen (1)
- Multispektralaufnahme (1)
- Multispektralfotografie (1)
- Multisresolution Analysis (1)
- Multivariate (1)
- Multivariate Analyse (1)
- Multivariate Wahrscheinlichkeitsverteilung (1)
- Multivariates Verfahren (1)
- Music Information Retrieval (1)
- Musik / Artes liberales (1)
- Mutagenität (1)
- Mutation (1)
- NGO Marketing (1)
- NMR Spectroscopy (1)
- NNK (1)
- NP (1)
- NP-completeness (1)
- NP-hard (1)
- Nachhaltigkeit (1)
- Nahrungsnetz (1)
- Namibia (1)
- Nanocomposite (1)
- Nanofaser (1)
- Nash equilibria (1)
- Natural Neighbor (1)
- Natural Neighbor Interpolation (1)
- Nature as Model (1)
- Naturrecht (1)
- Natürliche Nachbarn (1)
- Navier Stokes equation (1)
- Navier-Stokes equation (1)
- Navier-Stokes equations (1)
- Navier-Stokes-Brinkmann system of equations (1)
- Navigation (1)
- Near Memory Computation (1)
- Nearest-Neighbor Classification (1)
- Nekrose (1)
- Neodym-YAG-Laser (1)
- Neodymium lasers (1)
- Network (1)
- Network Architecture (1)
- Network Location (1)
- Network Slicing (1)
- Network design (1)
- Network flows (1)
- Network inference (1)
- Netzwerk (1)
- Netzwerksynthese (1)
- Neumann problem (1)
- Neumann-Problem (1)
- Neural ADC (1)
- Neural Adaptive Control (1)
- Neural Architecture Search (1)
- Neuronales Netz (1)
- New Towns (1)
- New Venture (1)
- New urban Settlements (1)
- Newtonsches Potenzial (1)
- Nicht-Desarguessche Ebene (1)
- Nichtglatte Optimierung (1)
- Nichtkommutative Algebra (1)
- Nichtkonvexe Optimierung (1)
- Nichtkonvexes Variationsproblem (1)
- Nichtlineare Approximation (1)
- Nichtlineare Diffusion (1)
- Nichtlineare Dynamik (1)
- Nichtlineare Mechanik (1)
- Nichtlineare Optimierung (1)
- Nichtlineare Zeitreihenanalyse (1)
- Nichtlineare partielle Differentialgleichung (1)
- Nichtlineare/große Verformungen (1)
- Nichtlineares Galerkinverfahren (1)
- Nichtpositive Krümmung (1)
- Nichtrauchen (1)
- Niederschlag (1)
- Nilpotent elements (1)
- Ninequilibirum Electron Kinetics (1)
- Nische (1)
- Nitrosamine (1)
- Nitsches method (1)
- No-Arbitrage (1)
- Node Platform Design (1)
- Node-Link Diagram (1)
- Noise control (1)
- Non--local atomistic (1)
- Non-Newtonian (1)
- Non-Newtonian flow (1)
- Non-commutative Computer Algebra (1)
- Non-convex body (1)
- Non-homogeneous Poisson Process (1)
- Non-linear wavelet thresholding (1)
- Nonequilibrium Thermodynamics (1)
- Nonlinear Galerkin Method (1)
- Nonlinear Optimization (1)
- Nonlinear Regression (1)
- Nonlinear dynamics (1)
- Nonlinear energy (1)
- Nonlinear isogeometric analysis (1)
- Nonlinear regression (1)
- Nonlinear time series analysis (1)
- Nonlinear/large deformations (1)
- Nonparametric AR-ARCH (1)
- Nonparametric regression (1)
- Nonparametric time series (1)
- Nonprofit Organizations (1)
- Nonsmooth Optimization (1)
- Nonsmooth contact dynamics (1)
- Nonspecific Adsorption (1)
- Nonstationary processes (1)
- North East Lincolnshire (1)
- North Sea (1)
- Nostocales (1)
- Null Modell (1)
- Nulldimensionale Schemata (1)
- Numerical Analysis (1)
- Numerical Flow Simulation (1)
- Numerical methods (1)
- Numerical modeling (1)
- Numerics (1)
- Numerische Homogenisierung (1)
- Numerische Integration (1)
- Numerische Mathematik / Algorithmus (1)
- Numerische Simulat (1)
- Numerisches Modell (1)
- Nutzerorientierte Produktentwicklung (1)
- Nvidia (1)
- OCL 2.0 (1)
- OCR (1)
- OFDM mobile radio systems (1)
- OFDM-Mobilfunksysteme (1)
- OWL (1)
- Oberflächenmaße (1)
- Oberflächenphysik (1)
- Oberflächenplasmonresonanz (1)
- Oberflächenspannung (1)
- Object-OrientedCase Representation (1)
- Object-Relational DataBase Management Systems (ORDBMS) (1)
- Object-Relational Database Systems (1)
- Objekterkennung (1)
- Off-road Robotics (1)
- Off-road Robotik (1)
- Offene Systeme (1)
- Ohrenchirurgie (1)
- Omics data analysis (1)
- Omics-Thechnologie (1)
- On-line algorithm (1)
- One-dimensional systems (1)
- Online Algorithms (1)
- Online chain partitioning (1)
- Ontolingua (1)
- Ontologie (1)
- Ontologiebasierte Kausalmodelle (1)
- Ontology-based causation model (1)
- Open System Architecture (1)
- Open-Source (1)
- Optimal Prior Distribution (1)
- Optimal control (1)
- Optimal parameter estimation (1)
- Optimal portfolios (1)
- Optimal semiconductor design (1)
- Optimale Kontrolle (1)
- Optimierender Compiler (1)
- Optimization Algorithms (1)
- Option (1)
- Option Valuation (1)
- Option pricing (1)
- Optionsbewertung (1)
- Optische Abbildung (1)
- Optische Fernerkundung (1)
- Optische Spektroskopie (1)
- Orchideen (1)
- Order (1)
- Ordered Median Function (1)
- Organizational structure (1)
- Organizational value (1)
- Ornstein-Uhlenbeck Process (1)
- Orthonormalbasis (1)
- Osteoblast (1)
- Osteomimicry (1)
- Ovibos moschatus (1)
- Oxidant Evolution (1)
- PATDEX (1)
- PC-based robot control (1)
- PCDD/Fs (1)
- PCDD/Fs PCBs (1)
- PCM (1)
- PCS (1)
- PDD (1)
- PDE-Constrained Optimization, Robust Design, Multi-Objective Optimization (1)
- PDF <Dateiformat> (1)
- PECS (1)
- PERA (1)
- PI-Regler (1)
- PLAN Abstraction (1)
- PMMA (1)
- PSPICE (1)
- PT-symmetry (1)
- Packed Columns (1)
- Palm distribution (1)
- Panama (1)
- Panel clustering (1)
- Papiermaschine (1)
- Parabolic regularization (1)
- Paradigm (1)
- Parallel Algorithms (1)
- Parallel Programming (1)
- Paralleler Algorithmus (1)
- Paralleler Hybrid (1)
- Parameter Identification (1)
- Parametric Excitation (1)
- Parametrisation of rotations (1)
- Pareto Points (1)
- Pareto optimality (1)
- Parsimonious Heston Model (1)
- Parteto surface (1)
- Partially ordered sets (1)
- Participant Burden (1)
- Participatory Sensing (1)
- Particle (1)
- Particle scheme (1)
- Partielle Differentialgleichung (1)
- Partikel Methoden (1)
- Passivrauchen (1)
- Patchworking Methode (1)
- Patchworking method (1)
- Pathogen (1)
- Pathwise Optimality (1)
- Pedestrian (1)
- Pedestrian FLow (1)
- Peer-to-Peer-Netz (1)
- Peltier (1)
- Penicillin-resistance (1)
- Peptide synthesis (1)
- Perceptron (1)
- Perceptual grouping (1)
- Performance (1)
- Performance of iterative solvers (1)
- Periodic Homogenization (1)
- Permutationsäquivalenz (1)
- Perona-Malik filter (1)
- Personal Comfort (1)
- Personalisation (1)
- Pervasive health (1)
- Pestizid (1)
- Pestizidbelastung (1)
- Petri nets (1)
- Pflanzenfressende Insekten (1)
- Phase Space (1)
- Phase Transition Effect (1)
- Phase Transition Effekt (1)
- Phase equilibria (1)
- Phase field method (1)
- Phasenfeld (1)
- Phasmatodea (1)
- Philosophy (1)
- Philosophy of Nature (1)
- Philosophy of Technology (1)
- Photoelektron (1)
- Photon-Photon-Wechselwirkung (1)
- Photonic structures (1)
- Photonische Kristalle (1)
- Photonischer Kristall (1)
- PhySCo (1)
- Phylogenie (1)
- Phylogeny (1)
- Physical activity monitoring (1)
- Physical spaces (1)
- Physics Education Research (1)
- Physikdidaktik (1)
- Physiologische Psychologie (1)
- Piezoelectric Materials (1)
- Piezoelectricity (1)
- Piezokeramik (1)
- Planar Pressure (1)
- Planares Polynom (1)
- Planning Support Systems (1)
- Planning and Verification (1)
- Plasmadynamik (1)
- Plasmaexpansion (1)
- Plasmon (1)
- Plastizitätstheorie (1)
- Plate heat exchanger (1)
- Plattenextrusion (1)
- Plattenwärmeübertrager (1)
- Pleated Filter (1)
- Pleurocapsales (1)
- Poisson autoregression (1)
- Poisson line process (1)
- Poisson noise (1)
- Poisson regression (1)
- Polariton (1)
- Policy implementation (1)
- Poly(butylene adipate-co-terephthalate) (PBAT) (1)
- Poly(lactic acid) (PLA) (1)
- PolyBoRi (1)
- Polyhedral Gauges (1)
- Polyhedron (1)
- Polymer (1)
- Polymer nanocomposites (1)
- Polymers (1)
- Polynomapproximation (1)
- Polynomial Eigenfunctions (1)
- Polypropylen (1)
- Pontrjagin (1)
- Population Balance Equation (1)
- Population balance (1)
- Population balances (1)
- Populationsbilanzmodelle (1)
- Populationswachstum (1)
- Poroelastizität (1)
- Porous flow (1)
- Portfolio Optimierung (1)
- Portfoliooptimierung (1)
- Position Sensitive Device (1)
- Position- and Orientation Estimation (1)
- Potential transform (1)
- Power Efficiency (1)
- Pragmatism (1)
- Preimage of an ideal under a morphism of algebras (1)
- Pressure Drop (1)
- Prichard (1)
- Primary human Hepatocytes (1)
- Prior knowledge (1)
- Probabilistic (1)
- Problem Solvers (1)
- Probleme (1)
- Probust optimization (1)
- Process Chain (1)
- Process Data (1)
- Process Management (1)
- Process configuration (1)
- Process creation (1)
- Process support (1)
- Process-Structure-Property relationships (1)
- Processing-in-Memory (1)
- Processor Architecture (1)
- Processor Architectures (1)
- Processors (1)
- Produktentwicklung (1)
- Produktionsdesign (1)
- Professional development (1)
- Profiles (1)
- Programmverifikation (1)
- Project Finance (1)
- Project Management (1)
- Project prioritization (1)
- Project selection (1)
- Projection method (1)
- Projektionsoperator (1)
- Projektive Fläche (1)
- Propagator (1)
- Propeller (1)
- Property checking (1)
- Property-Driven Design (1)
- Prostatakrebs (1)
- Protein-Tyrosin-Kinasen (1)
- Protein/detergent complexes (1)
- Proteine (1)
- Proteintransport (1)
- Protistan Plankton (1)
- Protocol Compliance (1)
- Protocol Composition (1)
- Protonentransf (1)
- Prototyp (1)
- Prototype (1)
- Prox-Regularisierung (1)
- Prozessvisualisierung (1)
- Pseudopolynomial-Time Algorithm (1)
- Psychologie (1)
- Psychology of Perception (1)
- Psychosocial theory (1)
- Pullen Edmonds system (1)
- Pump Intake Flows (1)
- Punktdefekte (1)
- Punktprozess (1)
- QMC (1)
- QVIs (1)
- QoS (1)
- Quadratic Approximation (1)
- Quality Assurance (1)
- Quality Improvement Paradigm (QIP) (1)
- Quantenchemie (1)
- Quantencomputer (1)
- Quanteninformatik (1)
- Quantenwell (1)
- Quantile autoregression (1)
- Quantitative Bildanalyse (1)
- Quanto option (1)
- Quantum Chaos (1)
- Quartz (1)
- Quasi-Newton Methods (1)
- Quasi-Variational Inequalities (1)
- Quasi-identities (1)
- Quenched and tempered steel (1)
- Quicksort (1)
- RCGAN (1)
- RCWGAN (1)
- REMPI (1)
- RH795 (1)
- RKHS (1)
- RNA interaction (1)
- RNS-Interferenz (1)
- RTL (1)
- Rac (1)
- Radial Basis Functions (1)
- Radiation Therapy (1)
- Radiative Cooling (1)
- Radiative Heat Trasfer (1)
- Radiative heat transfer (1)
- Radio Resource Managements (1)
- Radiotherapy (1)
- Rainflow (1)
- Raman-Spektroskopie (1)
- Random Errors (1)
- Random body (1)
- Random differential equations (1)
- Random number generation (1)
- Random set (1)
- Random testing (1)
- Randwertproblem (1)
- Rank test (1)
- Rapid-Chase Theory (1)
- Rarefied Gas Flows (1)
- Rarefied Gsa Dynamics (1)
- Rarefied Polyatomic Gases (1)
- Rarefied gas (1)
- Rate Gyro (1)
- Rate-independency (1)
- Ratenabhängigkeit (1)
- Rauchen (1)
- Raucherentwöhnung (1)
- Raumplanung (1)
- Ray tracing (1)
- Ray-Knight Theorem (1)
- Rayleigh Number (1)
- Reachability (1)
- Reaction-diffusion equations (1)
- Reactive Absorption (1)
- Reactive extraction (1)
- Reaktive Sauerstoff Spezies (1)
- Reaktive Sauerstoffspezies (1)
- Reaktivextraktion (1)
- Real-Time (1)
- Real-Time Systems (1)
- Realization theory (1)
- ReasoningSystems (1)
- Receptor design (1)
- Rechtecksgitter (1)
- Recognition (1)
- Recombination (1)
- Rectifiability (1)
- Rectilinear Grid (1)
- Recurrent Networks (1)
- Recurrent neural networks (1)
- Recycling (1)
- Red Sea (1)
- Redundanzvermeidung (1)
- Reflection (1)
- Reflexionsspektroskopie (1)
- Regelung (1)
- Regenwurm (1)
- Regime Shifts (1)
- Regime-Shift Modell (1)
- Regionalplanung (1)
- Regler (1)
- Reglerentwurf (1)
- Regularisierung / Stoppkriterium (1)
- Regularität (1)
- Regularization / Stop criterion (1)
- Regularization Wavelets (1)
- Regularization methods (1)
- Regulatorgen (1)
- Regulatory gene search (1)
- Rehabilitation clinics (1)
- Reibung (1)
- Reinforcement Learning (1)
- Reissner-Mindlin Shell (1)
- Rekollektion (1)
- Rekombination (1)
- Relative effect potencies (REPs) (1)
- Reliability Prediction (1)
- Renewables (1)
- Repositories (1)
- Representation Theory (1)
- Research Methodology (1)
- Reservierungsprotokoll (1)
- Resilience (1)
- Resolvent Estimate (1)
- Resonant tunneling diode (1)
- Restricted Regions (1)
- Restricted Shortest Path (1)
- Reuse (1)
- Reverse Engineering (1)
- Rhabdomyolyse (1)
- Richtungsableitung (1)
- Riemann-Siegel formula (1)
- Riemannian manifolds (1)
- Riemannsche Mannigfaltigkeiten (1)
- Riesz Transform (1)
- Rigid Body Motion (1)
- Ripley’s K function (1)
- Risikobewertung (1)
- Risikomaße (1)
- Risikotheorie (1)
- Risk Assessment (1)
- Risk Management (1)
- Risk Measures (1)
- Risk Sharing (1)
- Risk assessment (1)
- Rissausbreitung (1)
- Robot Calibration (1)
- Robot Control (1)
- Robot control (1)
- Robotic Manipulators (1)
- Robots (1)
- Robust reliability (1)
- Robust smoothing (1)
- Rogue AP (1)
- Rohstoffhandel (1)
- Rohstoffindex (1)
- Rolling bearing (1)
- Rollreibung (1)
- Rollreibung und -verschleiß (1)
- Rombopak (1)
- Rosenbrock methods (1)
- Rotational Fiber Spinning (1)
- Rounding (1)
- Route Planning (1)
- Rust effector (1)
- Ruthenium (1)
- Ruthenium-Vinyliden (1)
- Rydberg molecule (1)
- SAHARA (1)
- SARS-CoV-2 (1)
- SAW filters (1)
- SCAD (1)
- SDL extensions (1)
- SDL-2000 (1)
- SDL-pattern a (1)
- SDR (1)
- SECDED (1)
- SFB-EB (1)
- SGG (1)
- SIMD architectures (1)
- SIMPLE (1)
- SM-SQMOM (1)
- SOEP (1)
- SPARQL (1)
- SPARQL query learning (1)
- SPn-approximation (1)
- SQMOM (1)
- SQUID magnetometry (1)
- SST (1)
- STEM laboratories (1)
- STEP (1)
- STT-MRAM (1)
- SWARM (1)
- SWEEPING (1)
- Saddle Points (1)
- Safety (1)
- Safety Analysis (1)
- Sagnac-Effekt (1)
- Salinity (1)
- Sandercock-type multipath tandem Fabry-Perot interferometer (1)
- Sandwich Algorithm (1)
- Sandwiching algorithm (1)
- Satellitendaten (1)
- Satellitenfernerkundung (1)
- Satellitengeodäsie (1)
- Satellitengradiogravimetrie (1)
- Satellitengradiometrie (1)
- Sauerstoff (1)
- Sauerstoffverbrauch (1)
- Sauter mean diameter (1)
- Scalar (1)
- Scalar type operator (1)
- Scalar-type operator (1)
- Scale function (1)
- Scanning Electron Microscope (1)
- Schadensmechanik (1)
- Schaltwerk (1)
- Schaum (1)
- Schaumzerfall (1)
- Scheduler (1)
- Schema <Informatik> (1)
- Schematisation (1)
- Schematisierung (1)
- Schiefe Ableitung (1)
- Schlagfrequenz (1)
- Schnelle Fourier-Transformation (1)
- Schnitt <Mathematik> (1)
- Schnittstelle (1)
- Schrumpfung (1)
- Schule (1)
- Schwache Formulierung (1)
- Schwache Konvergenz (1)
- Schwache Lösu (1)
- Schwingungsisolierung (1)
- Schädelchirurgie (1)
- Schädigung (1)
- Scientific Community Analysis (1)
- Scientific Computing (1)
- Second Order Conditions (1)
- Secondary Encoders (1)
- Sediment gas storage (1)
- See (1)
- Seismic Modeling (1)
- Seismische Tomographie (1)
- Seismische Welle (1)
- Selbstschutz (1)
- Self-Referencing (1)
- Self-X (1)
- Self-directed learning (1)
- Self-organization (1)
- Self-splitting objects (1)
- Self-supervised Learning (1)
- Semantic Communications (1)
- Semantic Desktop (1)
- Semantic Index (1)
- Semantic Wikis (1)
- Semantics of Programming Languages (1)
- Semantik (1)
- Semantische Modellierung (1)
- Semantische Reasoner (1)
- Semantisches Datenmodell (1)
- Semi-infinite optimization (1)
- Semiclassics (1)
- Semigroups (1)
- Sendesignalverarbeitung (1)
- Sensing (1)
- Sensitivitäten (1)
- Sensor (1)
- Sensor Fusion (1)
- Sensors (1)
- Sequential test (1)
- Sequenzieller Algorithmus (1)
- Serre functor (1)
- Serumalbumine (1)
- Service-oriented Architecture (1)
- Settlement Appropriateness and Thresholds (1)
- Shallow Water Equations (1)
- Shannon capacity (1)
- Shannon optimal priors (1)
- Shannon-Capacity (1)
- Shape Memory Alloy Hybrid Composite (1)
- Shape optimization (1)
- Shapley Value (1)
- Shapley value (1)
- Shapleywert (1)
- Shared Resource Modeling (1)
- Shearlets (1)
- Sheaves (1)
- Sheet extrusion (1)
- Sheet ofPaper (1)
- Shell not requiring drilling rotation stabilization (1)
- Shock Wave Problem (1)
- Shortest path problem (1)
- Shrinking smart (1)
- Sicherheitsanalyse (1)
- Sicherheitstechnik (1)
- Signalanalyse (1)
- Silanisierung (1)
- Silanization (1)
- Silberkomplexe (1)
- Siliciumdioxid (1)
- Silicon dioxide nanoparticles (1)
- Similarity Assessment (1)
- Similarity Join (1)
- Similarity Joins (1)
- Similarity measures (1)
- Simplex (1)
- Simulation acceleration (1)
- Simultaneous quantifier elimination (1)
- Single Cell Analysis (1)
- Singly Occupied Molecular Orbital (SOMO) (1)
- Singular <Programm> (1)
- Singularität (1)
- Singularitätentheorie (1)
- Skalar (1)
- Skalierbarkeit (1)
- Skalierungsfunktion (1)
- Skelettmuskel (1)
- Slender-Body Approximations (1)
- Smalltalk (1)
- Smart City (1)
- Smart Device (1)
- Smart Grid (1)
- Smart Memory Cube (1)
- Smart Mobile Device (1)
- Smart Textile (1)
- SmartFactory (1)
- Smartphone (1)
- Smartwatch (1)
- Smoothed Particle Hydrodynamics (1)
- Sobolevräume (1)
- Social Media (1)
- Social movement (1)
- Socio-Semantic Web (1)
- Soft Spaces (1)
- Software (1)
- Software Comprehension (1)
- Software Defined Radio (1)
- Software Dependencies (1)
- Software Evolution (1)
- Software Maintenance (1)
- Software Measurement (1)
- Software Process Support (1)
- Software Product Line Engineering (1)
- Software Product Line Engineering (SPLE) (1)
- Software Visualization (1)
- Software development (1)
- Software development environment (1)
- Software transactional memory (1)
- Software-Architektur (1)
- Software-Defined Radio (1)
- Softwareentwicklung (1)
- Softwaremetrie (1)
- Softwareproduktionsumgebung (1)
- Softwarewartung (1)
- Solid-Gas Separation (1)
- Solid-Liquid Separation (1)
- Solvency II (1)
- Solvency-II-Richtlinie (1)
- Sound Simulation (1)
- Soziale Ungleichheit (1)
- Spannungs-Dehn (1)
- Spannungsregelung (1)
- Sparse linear equations (1)
- Spatial Binary Images (1)
- Spatial Statistics (1)
- Spatial regression models (1)
- Species sensitivity distribution (1)
- Spectral Analysis (1)
- Spectral Method (1)
- Spectral theory (1)
- Speech recognition (1)
- Speed (1)
- Speed management (1)
- Spektralanalyse <Stochastik> (1)
- Spezifikation (1)
- Spherical (1)
- Spherical Fast Wavelet Transform (1)
- Spherical Harmonics (1)
- Spherical Location Problem (1)
- Spherical Multiresolution Analysis (1)
- Sphärische Approximation (1)
- Sphärische Wavelets (1)
- Spiders (1)
- Spieltheorie (1)
- Spiking Neural ADC (1)
- Spin Orbit Torque Memory (1)
- Spinnen (1)
- Spiritual leadership (1)
- Spirituality (1)
- Spline-Interpolation (1)
- Spline-Wavelets (1)
- Splines (1)
- Split-Operator (1)
- Splitoperator (1)
- Sprachdefinition (1)
- Spritzgusstechnologie (1)
- Sprödbru (1)
- Square-mean Convergence (1)
- Stabile Vektorbundle (1)
- Stable vector bundles (1)
- Stadtplanung (1)
- Standard basis (1)
- Standortplanung (1)
- Standortprobleme (1)
- Standorttheorie (1)
- Stark systems (1)
- State Machines (1)
- State of the Art IT (1)
- Statecharts (1)
- Static Program Analysis (1)
- Static light scattering (1)
- Statine (1)
- Stationary Light (1)
- Stationary heat equation (1)
- Stationäres Licht (1)
- Statistical Experiments (1)
- Statistical Independence (1)
- Statistics (1)
- Steady state (1)
- Stein equation (1)
- Step-Scan FTIR-Technik (1)
- Stereovision (1)
- Steuer (1)
- Stickstoff (1)
- Stickstoffaktivierung (1)
- Stieltjes transform (1)
- Stimmungsbasierte Musikempfehlungen (1)
- Stochastic Dependence (1)
- Stochastic Differential Equations (1)
- Stochastic Impulse Control (1)
- Stochastic Network Calculus (1)
- Stochastic Processes (1)
- Stochastic Volatility (1)
- Stochastic optimization (1)
- Stochastische Differentialgleichung (1)
- Stochastische Inhomogenitäten (1)
- Stochastische Processe (1)
- Stochastische Volatilität (1)
- Stochastische optimale Kontrolle (1)
- Stochastischer Prozess (1)
- Stochastisches Feld (1)
- Stochastisches Modell (1)
- Stoffaustausch (1)
- Stokes Equations (1)
- Stokes Flow (1)
- Stokes-Brinkman equations (1)
- Stokes-Gleichung (1)
- Stoner-like magnetic particles (1)
- Stop- and Play-Operators (1)
- Stop- und Play-Operator (1)
- Stop- und Spieloperator (1)
- Stop-und Play-Operator (1)
- Storage Class Memories (1)
- Stornierung (1)
- Stoßdämpfer (1)
- Strahlentherapie (1)
- Strahlungstransport (1)
- Strain-Life Approach (1)
- Stratifaltigkeiten (1)
- Streptococcus (1)
- Streptococcus pneumoniae (1)
- Streptomyces (1)
- Stress management (1)
- Stress-strain correction (1)
- Structural Adaptation (1)
- Structural Reliability (1)
- Structure Theory (1)
- Structure-property relationships (1)
- Structuring Approach (1)
- Strukturiertes Finanzprodukt (1)
- Strukturiertes Gitter (1)
- Strukturoptimierung (1)
- Strömung (1)
- Strömungsdynamik (1)
- Student types (1)
- Stücklisten (1)
- Sub-Saharan Africa (1)
- Subgradient (1)
- Sublimation (1)
- Subset Simulationen (1)
- Supercomputer (1)
- Superior olivary complex (1)
- Supply Chain Design (1)
- Supramolecular chemistry (1)
- Surface Reconstruction (1)
- Survival Analysis (1)
- Susceptor (1)
- Sustainability (1)
- Swakopmund (1)
- Swift Heavy Ion (1)
- Switched Linear System (1)
- Switching regression model (1)
- Symbolic execution (1)
- Symmetrie (1)
- Symmetriebrechung (1)
- Symmetry (1)
- Synchronnetze (1)
- Synchronous Control Asynchronous Dataflow (1)
- Synthetic data generation (1)
- SysMD (1)
- System Abstractions (1)
- SystemC (1)
- Systemarchitektur (1)
- Systematics (1)
- Systematik (1)
- Systemdesign (1)
- Systemic Constructivist Approach (1)
- Systemidentifikation (1)
- Systemische Konstruktivistischen Ansatz (1)
- Systems Engineering (1)
- Systems Modeling Language (SysML) (1)
- Systems of Systems Engineering (SoSE) (1)
- Sägezahneffekt (1)
- TCDD (1)
- TD-CDMA (1)
- TIPARP (1)
- TPC Bauteile (1)
- TTEthernet (1)
- TVET teachers’ education (1)
- Tactics (1)
- Tail Dependence Koeffizient (1)
- Taktrückgewinnungsschaltungen (1)
- Tantalion (1)
- Tantalum (1)
- Tantalum atomic ion (1)
- Tantalum ions (1)
- Task and Trajectory Planning (1)
- Task-based (1)
- Tcl (1)
- Technology combination (1)
- Technology decision (1)
- Technology selection (1)
- Temporal Decoupling (1)
- Temporal Variational Autoencoders (1)
- Temporal data processing (1)
- Tensor (1)
- Tensor Spherical Harmonics (1)
- Termination (1)
- Tesselation (1)
- Test for Changepoint (1)
- Tethered Machines (1)
- Tetrachlordibenzodioxine (1)
- Tetraeder (1)
- Tetraedergi (1)
- Tetrahedral Grid (1)
- Tetrahedral Mesh (1)
- Textual CBR (1)
- Texture Orientation (1)
- Texturrichtung (1)
- Thecla (1)
- Thekla (1)
- Thematic analysis (1)
- Themenbasierte Empfehlungen von Ressourcen (1)
- Theorem of Plemelj-Privalov (1)
- Theorie schwacher Lösungen (1)
- Thermal Comfort (1)
- Thermal Management of Exhaust Aftertreatment (1)
- Thermal Transport (1)
- Thermal conductive polymer composites (1)
- Thermisch leitfähige Polymerkomposite (1)
- Thermodynamics (1)
- Thermomechanische Behandlung (1)
- Thermophoresis (1)
- Thermoplast (1)
- Thermoset (1)
- Thin film approximation (1)
- Three Field Agile (1)
- Three-layer Web (1)
- Thylakoid (1)
- Tichonov-Regularisierung (1)
- Time series classification (1)
- Time series data (1)
- Time-Series (1)
- Time-Space Multiresolution Analysis (1)
- Time-Triggered (1)
- Time-delay-Netz (1)
- Time-slotted (1)
- TimeGAN (1)
- Tip60 (1)
- Tire-soil interaction (1)
- ToF (1)
- Toleranz (1)
- Tonsignal (1)
- Tool development (1)
- Top-down (1)
- Topic-based Resource Recommendations (1)
- Topologieoptimierung (1)
- Topology Preserving Networks (1)
- Topology optimization (1)
- Topology visualization (1)
- Total hip arthroplasty (1)
- Toxizität (1)
- Tracking (1)
- Traffic flow (1)
- Train Rearrangement (1)
- Trajectory Planning (1)
- Trajektorienplanung (1)
- Trans-European Transport Networks (1)
- Transaction Level Modeling (TLM) (1)
- Transaction costs (1)
- Transaktionskosten (1)
- Transeuropäische Verkehrsnetze (1)
- Transfektion (1)
- Transferred proteins (1)
- Transformation (1)
- Transient modeling (1)
- Transient state (1)
- Transkription (1)
- Translation planes (1)
- Transnational cooperation (1)
- Transport (1)
- Transport Protocol (1)
- Transportation Problem (1)
- Traversability Analysis (1)
- Treatment of kinks (1)
- Tree (1)
- Trennschärfe <Statistik> (1)
- Triangular fuzzy number (1)
- Tribologie (1)
- Triplettzustand (1)
- Tropfenkoaleszenz (1)
- Tropfenzerfall (1)
- Tropical Grassmannian (1)
- Tropical Intersection Theory (1)
- Tropical dry forest (1)
- Tube Drawing (1)
- Tunneling (1)
- Turnover <Ökologie> (1)
- Two-Scale Convergence (1)
- Two-phase flow (1)
- Type building (1)
- UCP2 (1)
- UML 2 (1)
- UML Activity (1)
- UML Profile (1)
- UV-VIS-Spektroskopie (1)
- Ubiquitous system (1)
- Ultra small micro end mills (1)
- Ultraviolettspektroskopie (1)
- Umsetzung (1)
- Umweltgerechtigkeit (1)
- Umweltpsychologie (1)
- Uncertainty Estimation (1)
- Undergraduate Students (1)
- Uniform matroids (1)
- Universal Control Device (1)
- Universal objective function (1)
- Unobtrusive instrumentations (1)
- Unorganized Data (1)
- Unreinheitsfunktion (1)
- Unschärferelation (1)
- Unspezifische Adsorption (1)
- Unstructured Grid (1)
- Unstrukturiertes Gitter (1)
- Unsupervised learning (1)
- Untermannigfaltigkeit (1)
- Upper bound (1)
- Upwind-Verfahren (1)
- Urban Flooding (1)
- Urban Water Supply (1)
- Urban design (1)
- Urban sprawl (1)
- UrbanSim (1)
- Usability (1)
- Usage Control (1)
- Usage modeling (1)
- User Model (1)
- User-Centred Product Development (1)
- User-Experience (1)
- Utility (1)
- VALBM (1)
- VCG payment scheme (1)
- VHCF (1)
- VHDL (1)
- VIROP (1)
- VITAL (1)
- VMEbus (1)
- VOF Model (1)
- VOF Modell (1)
- VSCPT (1)
- Validation (1)
- Validierung (1)
- Value at Risk (1)
- Value at risk (1)
- Values in Action (VIA) (1)
- Van Neumann-Kakutani transformation (1)
- Variability (1)
- Variability Analysis (1)
- Variational autoencoders (1)
- Variational inequalities (1)
- Variationsrechnung (1)
- Variationsungleichugen (1)
- Vasicek model (1)
- Vector (1)
- Vector Field (1)
- Vector Spherical Harmonics (1)
- Vector Time (1)
- Vector-valued holomorphic function (1)
- Vectorfield approximation (1)
- Vectorial Wavelets (1)
- Vegetable Oil (1)
- Vegetationsentwicklung (1)
- Vektor (1)
- Vektor-Wavelets (1)
- Vektorfeld (1)
- Vektorfeldapproximation (1)
- Vektorfelder (1)
- Verdampfung (1)
- Vergütungsstahl (1)
- Verification (1)
- Verkehrspolitik (1)
- Verkehrssicherheit (1)
- Verkehsplanung (1)
- Verschwindungsatz (1)
- Versicherung (1)
- Vertrautheit (1)
- Verzerrungstensor (1)
- Verzweigung <Mathematik> (1)
- Vetor optimization (1)
- Virtual Corporation (1)
- Virtual Environments (1)
- Virtual Software Projects (1)
- Virtual spaces (1)
- Virtuelle Realität (1)
- Virulence (1)
- Virus Variants (1)
- Viscosity Adaptive Lattice Boltzmann Method (1)
- Viscous Fibers (1)
- Vision (1)
- Viskoelastische Flüssigkeiten (1)
- Viskose Transportschemata (1)
- Viskosität (1)
- Visual Queries (1)
- Visualization Theory (1)
- Vitamin C (1)
- Vitamin C-Derivate (1)
- Vocational education and training (1)
- Volatilität (1)
- Vollständigkeit (1)
- Voltage Control (1)
- Volume rendering (1)
- Volumen-Rendering (1)
- Vorkonditionierer (1)
- Vorlesungsskript (1)
- Voronoi-Diagramm (1)
- Vorverarbeitung (1)
- WCET (1)
- WETICE 98 (1)
- Wahrnehmungspsychologie (1)
- Waldfragmentierung (1)
- Waldökosystem (1)
- Walkability (1)
- Wannier-Bloch resonance states (1)
- Wannier-Bloch states (1)
- Wannier-Stark ladders (1)
- Wannier-Stark states (1)
- Wasserstoffbrückenbindungen (1)
- Water (1)
- Water reservoir management (1)
- Water resources (1)
- Wave Based Method (1)
- Wavelet Analysis auf regulären Flächen (1)
- Wavelet-Theorie (1)
- Wavelet-Theory (1)
- Wavelet-Transformation (1)
- Wavelets auf der Kugel und der Sphäre (1)
- Weak Memory Model (1)
- Weak substitution method (1)
- Weakest-link model (1)
- Wearable Computing (1)
- Wedderburn number (1)
- Wellengeschwindigkeit (1)
- Wetland Conservation (1)
- Wetting (1)
- White Noise (1)
- White Noise Analysis (1)
- Wi-Fi (1)
- Wide Area Multimedia Group Interaction (1)
- Wide-column stores (1)
- Wideband (1)
- Winkelverteilung (1)
- Winner Determination Problem (WDP) (1)
- Wirbelabtrennung (1)
- Wirbelströmung (1)
- Wireless Communication (1)
- Wireless Networks (1)
- Wireless Sensor Network (1)
- Wireless sensor network (1)
- Wirtsspezifität (1)
- Wissen (1)
- Wissensbasiertes System (1)
- Wissensrepräsentation (1)
- Word problem (1)
- Workflow Replication (1)
- World-Wide Web (1)
- Worst-Case (1)
- Wälzlager (1)
- Wärmeleitfähigkeit (1)
- Wärmeleitung (1)
- Wärmeübertragung (1)
- XDBMS (1)
- XFEM (1)
- XMCD (1)
- XML (1)
- XML query estimation (1)
- XML summary (1)
- Y-TZP (1)
- Yaglom limits (1)
- Yaroslavskiy-Bentley-Bloch Quicksort (1)
- Zeitabhängigkeit (1)
- Zeitintegrale Modelle (1)
- Zeitliche Veränderungen (1)
- Zeitreihe (1)
- Zentrenprobleme (1)
- Zeolite MCM-71 (1)
- Zeolite SSZ-53 (1)
- Zeolite UTD-1 (1)
- Zeolith (1)
- Zeolith ITQ-21 (1)
- Zeolith MCM-71 (1)
- Zeolith SSZ-53 (1)
- Zeolith UTD-1 (1)
- Zero-dimensional schemes (1)
- Zielverfolgung (1)
- Zigarettenrauchen (1)
- Zigarrenrauchen (1)
- Zivilschutz (1)
- Zonal Kernel Functions (1)
- Zufälliges Feld (1)
- Zugesicherte Eigenschaft (1)
- Zustandsgleichung (1)
- Zweiphasenströmung (1)
- Zweiphotonenspektroskopie (1)
- Zwischenmolekulare Kraft (1)
- Zyklische Homologie (1)
- a posteriori error estimates (1)
- a-priori domain decomposition (1)
- absorption spectrum (1)
- abstract description (1)
- access rights (1)
- acetate (1)
- acetylcholine receptor (1)
- acid-mediated tumor invasion (1)
- acidification (1)
- acoustic absorption (1)
- acoustic modeling (1)
- active damping (1)
- active inference (1)
- actively steered implement (1)
- activity-based model (1)
- adaption (1)
- adaptive algorithm (1)
- adaptive estimation (1)
- adaptive grid generation (1)
- adaptive local refinement (1)
- adaptive triangulation (1)
- additive Gaussian noise (1)
- additive outlier (1)
- adhesion (1)
- adhesive joints in concrete (1)
- adjacency (1)
- adjacency relations (1)
- adjoint approach (1)
- adjoints (1)
- adolescents (1)
- adult education (1)
- adulthood (1)
- aerodynamic drag (1)
- affective user interface (1)
- affine arithmetic (1)
- aggressive space mapping (1)
- aging (1)
- air drag (1)
- algebraic attack (1)
- algebraic constraints (1)
- algebraic correspondence (1)
- algebraic cryptoanalysis (1)
- algebraic function fields (1)
- algebraic number fields (1)
- algebraic topology (1)
- algebraische Korrespondenzen (1)
- algebraische Topologie (1)
- algebroid curve (1)
- algorithm (1)
- algorithm by Bortfeld and Boyer (1)
- aliasing (1)
- alkali (1)
- alkin (1)
- alkyne (1)
- alpha shape method (1)
- alternating minimization (1)
- alternating optimization (1)
- amid (1)
- amide (1)
- amino acids (1)
- analoge Mikroelektronik (1)
- analogical reasoning (1)
- analysis (1)
- angewandte Mathematik (1)
- angewandte Topologie (1)
- anharmonic CH modes (1)
- anharmonic vibrations (1)
- anionic receptors (1)
- anisotropen Viskositätsmodell (1)
- anisotropic cicosity (1)
- anisotropic coupling between magnetic i (1)
- anisotropic coupling mechanism (1)
- anisotropic diffusion (1)
- anisotropic plasticity (1)
- anisotropic viscosity (1)
- anoxia (1)
- anserine (1)
- anthropogenic effects (1)
- antibiotics (1)
- apoptosis (1)
- apprehension (1)
- approximation methods (1)
- approximative Identität (1)
- aquatic (1)
- aqueous coating; cyclooxygenase-2; interleukins; reactive oxygen species; single emulsion solvent evaporation; tumor necrosis factor-alpha (1)
- arbitrary Lagrangian-Eulerian methods (ALE) (1)
- arbitrary function (1)
- archimedean copula (1)
- architecture (1)
- area loss (1)
- arrays of magnetic dots and wires (1)
- artial differential algebraic equations (1)
- artificial neural network (1)
- aryl hydrocarbon receptor (1)
- ascorbate (1)
- ascorbic acid (1)
- ascorbyl radical (1)
- asian option (1)
- aspartam (1)
- aspartame (1)
- assembly sequence design (1)
- assembly tasks (1)
- associated Legendre functions (1)
- assymmetric carboxylate stretch vibrations (1)
- asymptotic (1)
- asymptotic Cosserat models (1)
- asymptotic expansions (1)
- asymptotic limits (1)
- asymptotic preserving numerical scheme (1)
- asymptotic-preserving (1)
- asynchronous circuits (1)
- athletic performance; physical exertion; dietary supplements (1)
- authentication (1)
- auto-pruning (1)
- automated analog circuit design (1)
- automated code generation (1)
- automated computer learning (1)
- automated proof planner (1)
- automated synchronization (1)
- automatic differentiation (1)
- automotive (1)
- autonomes Lernen (1)
- autonomous learning (1)
- autonomous networking (1)
- autonomous systems (1)
- autonomous systems object classification (1)
- average-case analysis (1)
- axis orientation (1)
- back muscles (1)
- ball (1)
- bankability (1)
- basalt fibre reinforced polymer (1)
- basic carboxylates (1)
- basic systems theoretic properties (1)
- basket option (1)
- batch presorting problem (1)
- battery modeling (1)
- bcc-Fe(001) (1)
- beam refocusing (1)
- beating rate (1)
- bedingte Aktionen (1)
- behavioral modeling (1)
- behaviour-based system (1)
- belief updating (1)
- benchmark (1)
- benders decomposition (1)
- bending strip method (1)
- benzo[a]pyrene (1)
- benzol (1)
- ber dynamics (1)
- best basis (1)
- bi-directional search (1)
- bicriteria shortest path problem (1)
- bicriterion path problems (1)
- bidirectional search (1)
- bifurcation (1)
- big triangle small triangle method (1)
- billiards (1)
- bills of materials (1)
- bin coloring (1)
- binarization (1)
- binary analysis (1)
- binary countdown protocol (1)
- binomial tree (1)
- bioactive metabolites (1)
- bioavailability (1)
- biochemical characterisation (1)
- biofertilizer (1)
- biofilm (1)
- biological motivated (1)
- biological soil crusts (1)
- biologisch motiviert (1)
- biology of knowledge (1)
- biomarker (1)
- biomimetics (1)
- biorthogonal bases of L^2 (1)
- biosensors (1)
- bipolar quantum drift diffusion model (1)
- biquadratic interlayer coupling (1)
- bitvector (1)
- black bursts (1)
- blackout period (1)
- bocses (1)
- body wave velocity (1)
- body-IMU calibration (1)
- bootstrap (1)
- bottleneck (1)
- boudary condistions (1)
- bounce-back rule (1)
- boundary conditions (1)
- boundary value problem (1)
- boundary value problems (1)
- boundary-value problems of potent (1)
- bounded model checking (1)
- bounds (1)
- branch-and-bound (1)
- branching process (1)
- brillouin light scattering (1)
- brittle fracture (1)
- building simulation (1)
- buildroot (1)
- bursting disk (1)
- bus bunching (1)
- bus controller (1)
- business process modelling (1)
- business process reengineering (1)
- butterfly molecule (1)
- byte code (1)
- c-Abl (1)
- cactus graph (1)
- calibration (1)
- calls (1)
- calving (1)
- cancer (1)
- cancer radiation therapy (1)
- canonical ideal (1)
- canonical module (1)
- capital-budgeting (1)
- carboxylate bridge (1)
- carboxylates (1)
- cardinality constraint combinatorial optimization (1)
- carnosine (1)
- carrier-grade point-to-point radio networks (1)
- case-based planner (1)
- cash management (1)
- catalysis (1)
- categorical imperative (1)
- cell volume (1)
- cells on chips (1)
- center and median problems (1)
- center hyperplane (1)
- centrally symmetric polytope (1)
- challenges (1)
- chances (1)
- change analysis (1)
- change detection (1)
- change point (1)
- changing market coefficients (1)
- changing urbanisation patterns (1)
- character strengths (1)
- characteristic polynomial (1)
- characterization of Structures (1)
- charged fluids (1)
- chemical effect prediction (1)
- chemoprevention (1)
- chemotaxis (1)
- chemotherapy (1)
- child-directed speech (1)
- chromium (1)
- circuit sizing (1)
- civil protection (1)
- classical solutions (1)
- client/server-architecture (1)
- climate (1)
- climate change (1)
- cliquet options (1)
- clo (1)
- closure approximation (1)
- cloud computing (1)
- clustering and disaggregation techniques (1)
- clustering methods (1)
- co-culture (1)
- co-learning (1)
- coatings (friction-reducing) (1)
- coatings (wear-resistant) (1)
- code coverage analysis (1)
- coffee (1)
- cognition (1)
- cognitive biases (1)
- cognitive load (1)
- coherent power gain (1)
- cohesive cracks (1)
- cohesive elements (1)
- cohesive interface (1)
- cold gas-dynamic spray (1)
- collaborative information visualization (1)
- collaborative mobile sensing (1)
- collective intelligence (1)
- collision avoidance (1)
- collision detection (1)
- collision induced dissociation (1)
- colonization (1)
- colorectal carcinogenesis (1)
- combination band (1)
- combinatorial algorithms (1)
- combinatorial procurement (1)
- combinatorics (1)
- common transversal (1)
- communication architectures (1)
- communication protocols (1)
- communication subsystem (1)
- community assembly (1)
- compact operator equation (1)
- compartment model (1)
- competetive analysis (1)
- compilation (1)
- compiler (1)
- complete presentations (1)
- completeness (1)
- complex System Development (1)
- complex energ (1)
- complex energy resonances (1)
- complex phase space (1)
- complexity (1)
- component-based (1)
- composite (1)
- composites (1)
- comprehensive reuse (1)
- compressible Navier Stokes equations (1)
- computation (1)
- computational biology (1)
- computational complexity (1)
- computational dynamics (1)
- computational finance (1)
- computational modelling (1)
- computer aided planning (1)
- computer control (1)
- computer program (1)
- computer-based systems (1)
- computeralgebra (1)
- concentrated electrolyte (1)
- concept representation (1)
- conceptual design (1)
- conceptual process design (1)
- conceptual representation (1)
- concrete composite structures (1)
- concrete sandwich panels (1)
- concurrent (1)
- concurrent software (1)
- condensation (1)
- condensation on structured surfaces (1)
- condition number (1)
- conditional quantile (1)
- conditional quantiles (1)
- conflict (1)
- conformal partial wave analysis (1)
- consecutive ones matrix (1)
- consecutive ones polytopes (1)
- conserving time integration (1)
- consistent integration (1)
- constrained systems (1)
- constraint exploration (1)
- constraint propagation (1)
- constraint satisfaction problem (CSP) (1)
- constraint-based reasoning (1)
- constructive approximation (1)
- consumption (1)
- contact problems (1)
- content-and-structure summary (1)
- context awareness (1)
- context management (1)
- context-aware topology control (1)
- continuous master theorem (1)
- continuous media (1)
- continuous optimization (1)
- continuum damage (1)
- continuum damage mechanics (1)
- continuum fracture mechanics (1)
- control theory (1)
- controller (1)
- controlling (1)
- convergence behaviour (1)
- convergence of approximate solution (1)
- convex (1)
- convex constraints (1)
- convex distance funtion (1)
- convex models (1)
- convex operator (1)
- cooling processes (1)
- cooperative game (1)
- cooperative problem solving (1)
- coordinated backhaul networks in rural areas (1)
- coordinative flexibility (1)
- core (1)
- core strengths (1)
- corre- lation (1)
- correlated errors (1)
- correlation (1)
- cortactin (1)
- count data (1)
- coupled flow in plain and porous media (1)
- coupled problems (1)
- coupling methods (1)
- coverage (1)
- coverage error (1)
- crack diagnosis (1)
- crack path tracking (1)
- crash (1)
- crash application (1)
- crash hedging (1)
- crash modelling (1)
- crashworthiness (1)
- credit spread (1)
- critical thickness (1)
- cross section (1)
- cross-correlation (1)
- crossphase modulation (1)
- crowd condition estimation (1)
- crowd density estimation (1)
- crowd scanning (1)
- crowd sensing (1)
- crowdsourcing (1)
- crystallization (1)
- cuboidal lattice (1)
- cumulative IRMPD (1)
- curvature (1)
- curved viscous fibers (1)
- curved viscous fibers with surface tension (1)
- curves and surfaces (1)
- cusp forms (1)
- customization of communication protocols (1)
- cut (1)
- cut basis problem (1)
- cuts (1)
- cutting edges (1)
- cutting simulation (1)
- cyclic homology (1)
- cyclic indentation tests (1)
- cyclic load (1)
- cyclic peptides (1)
- cyclic pseudopeptides (1)
- cyclopeptides (1)
- cytotoxicity (1)
- da (1)
- damage diagnosis (1)
- damage tolerance (1)
- data annotation (1)
- data mining (1)
- data race (1)
- data sets (1)
- data structure (1)
- data-adaptive bandwidth choice (1)
- data-flow (1)
- dataset (1)
- deadlock (1)
- decay rate (1)
- decentralized heating and cooling systems (1)
- decidability (1)
- decision (1)
- decision-making (1)
- decisions (1)
- decoding (1)
- decomposition (1)
- decrease direction (1)
- default time (1)
- defect detection (1)
- defect interaction (1)
- deficiency (1)
- deflections of the vertical (1)
- deformable bodies (1)
- deformable object (1)
- deformable porous media (1)
- degenerations of an elliptic curve (1)
- delay management (1)
- delay management problem (1)
- denoising (1)
- dense univariate rational interpolation (1)
- density gradient equation (1)
- density gradient theory (1)
- dependable systems (1)
- dependency management (1)
- deposition temperature (1)
- depth sensing (1)
- derivative-free iterative method (1)
- descent algorithm (1)
- description of reactive systems (1)
- design (1)
- design automation (1)
- design centering (1)
- design optimization (1)
- design processes (1)
- determinant (1)
- deterministic arbitration (1)
- deterministic technical systems (1)
- deuterierung (1)
- deutsche (1)
- development (1)
- diagnostic problems (1)
- dial-a-ride (1)
- diamond (1)
- diatoms (1)
- dielectric elastomers (1)
- dif (1)
- differential algebraic equations (1)
- differential inclusions (1)
- differential measurement (1)
- differentialalgebraic equations (1)
- diffusion coefficient (1)
- diffusion measurement (1)
- diffusion model (1)
- diffusion models (1)
- diffusive scaling (1)
- digital design (1)
- digital integrated circuit (1)
- digital methodologies (1)
- digital signal processing (1)
- digitale Methodik (1)
- digitaler Entwurf (1)
- dioxin-like compounds (1)
- dipole-exchange surface (1)
- direct product (1)
- directed graphs (1)
- directional derivative (1)
- disaster (1)
- dischargeable mass flow rate (1)
- discontinuous finite elements (1)
- discosat (1)
- discrepancy (1)
- discrete equilibrium distributions (1)
- discrete facility location (1)
- discrete location (1)
- discrete measure (1)
- discrete optimization (1)
- discrete time setting (1)
- discrete variational mechanics (1)
- discrete velocity models (1)
- discretisation of control problems (1)
- discriminant analysis (1)
- dislocation arrangements (1)
- dispersal (1)
- displacement problem (1)
- display algorithms (1)
- distributed and parallel processing (1)
- distributed c (1)
- distributed compliant control (1)
- distributed computing (1)
- distributed control system (1)
- distributed deduction (1)
- distributed document management (1)
- distributed enterprise (1)
- distributed groupware environment (1)
- distributed model predictive control (1)
- distributed multi-platform software development (1)
- distributed multi-platform software development projects (1)
- distributed processing (1)
- distributed real-time systems (1)
- distributed software configuration management (1)
- distributed softwaredevelopment tools (1)
- distributed tasks (1)
- distributedknowledge-based systems (1)
- distribution (1)
- distribution system (1)
- disulfide bond transfer (1)
- diurnal cycle (1)
- diusion limits (1)
- diversification (1)
- diversity (1)
- dividend discount model (1)
- dividends (1)
- domain decomposition methods (1)
- domain parametrization (1)
- domain switching (1)
- domains (1)
- double exponential distribution (1)
- downward continuation (1)
- drag models (1)
- drainage (1)
- drift diffusion (1)
- drift due to noise (1)
- drift-diffusion limit (1)
- driver assistance (1)
- driver status and intention prediction (1)
- droplet size distribution (1)
- drowsiness detection (1)
- durability (1)
- dynamic (1)
- dynamic calibration (1)
- dynamic capillary pressure (1)
- dynamic combinatorial chemistry (1)
- dynamic fracture mechanics (1)
- dynamic holding (1)
- dynamic mode (1)
- dynamic model (1)
- dynamic network flows (1)
- dynamical topography (1)
- dysprosium (1)
- eDNA (1)
- earliest arrival flow (1)
- earliest arrival flows (1)
- echtzeitsystem (1)
- ecological context (1)
- ecology (1)
- economic development (1)
- ecosystem function (1)
- edge computing (1)
- effective elastic moduli (1)
- effective refractive index (1)
- effective thermal conductivity (1)
- efficiency (1)
- efficiency loss (1)
- efficient set (1)
- efficient solution (1)
- eigenvalue problems (1)
- eigenvalues (1)
- elasticity problem (1)
- electrical (1)
- electrical conductivity (1)
- electro-hydraulic systems (1)
- electrochemical diusive processes (1)
- electrochemical simulation (1)
- electrochromic device (1)
- electrolyte solutions (1)
- electronic circuit design (1)
- electronically excited states (1)
- elektronisch angeregte Zustände (1)
- elliptic equation (1)
- elliptical distribution (1)
- embedded (1)
- embedded mixed-criticality systems (1)
- embedding (1)
- emergent aquatic insects (1)
- emotion visualization (1)
- empirical review (1)
- enamid (1)
- encapsulation (1)
- end-to-end learning (1)
- endolithic (1)
- endomorphism ring (1)
- energie efficiency (1)
- energy conservation (1)
- energy consumption (1)
- energy transport (1)
- engineering (1)
- enhanced coercivity (1)
- enrichment (1)
- ensemble (1)
- entrepreneurial orientation (1)
- entrepreneurship (1)
- enumerative geometry (1)
- environment perception (1)
- environmental noise (1)
- environmental risk assessment (1)
- epiphytes (1)
- epitaxial Ni80Fe20/Fe50Mn50 bilayers (1)
- epitaxial growth (1)
- epoxy (1)
- epsilon-constraint method (1)
- equation of state (1)
- equilibrium state (1)
- equisingular families (1)
- ernergy effcient motion (1)
- error estimates (1)
- esterases (1)
- estimation (1)
- estimation of compression (1)
- event segmentation (1)
- evolutionary algorithm (1)
- evolutionary algorithms (1)
- exact fully discrete vectorial wavelet transform (1)
- exact solution (1)
- exchange coupling (1)
- exchange rate (1)
- exchange-bias bilayer Fe/MnPd (1)
- exchange-coupled rare-earth (1)
- executive compensation (1)
- executive stockholder (1)
- experience management (1)
- experimental software engineering (1)
- expert system (1)
- explainability (1)
- explainable artificial intelligence (1)
- explicit jump (1)
- explicit jump immersed interface method (1)
- explicit representation (1)
- explicit representations (1)
- explizite Darstellung (1)
- exponential rate (1)
- exponential utility (1)
- extreme equilibria (1)
- extreme solutions (1)
- f-dissimilarity (1)
- face value (1)
- facilitating (1)
- fallbasiertes Schliessen (1)
- fallbasiertes planen (1)
- fallible knowledge (1)
- fast approximation (1)
- fault-tolerant control (1)
- fehlertolerante Regelung (1)
- fermi resonance (1)
- ferroelectric fatigue (1)
- ferroelektrische Ermüdung (1)
- ferroelektrischer Perowskit (1)
- fiber dynamics (1)
- fiber model (1)
- fiber reinforced silicon carbide (1)
- fiber-fluid interactions (1)
- fiber-turbulence interaction scales (1)
- fibre lay-down dynamics (1)
- fibre-reinforced polymer connectors (1)
- fibrous insulation materials (1)
- fibrous materials (1)
- fictitious configurations (1)
- film casting (1)
- film casting process (1)
- filter (1)
- final prediction error (1)
- financial decisions (1)
- financial mathematics (1)
- finite Elasto-Plastizität (1)
- finite biodiversity (1)
- finite difference discretization (1)
- finite difference method (1)
- finite differences (1)
- finite elasto-plasticity (1)
- finite groups of Lie type (1)
- finite pointset method (1)
- finite sample breakdown point (1)
- finite size scaling (1)
- finite spin group (1)
- finite volume discretization (1)
- finite volume discretization discretization (1)
- finite volume discretizations (1)
- finite-difference methods (1)
- finite-volume method (1)
- fire resistance (1)
- fire test (1)
- fire wall (1)
- firewall (1)
- first hitting time (1)
- first language acquisition (1)
- fish (1)
- fixpoint theorem (1)
- flexible fibers (1)
- flexible workflows (1)
- flexible-link (1)
- flexible-link robot (1)
- float glass (1)
- flood risk (1)
- flow cytometry (1)
- flow in heterogeneous porous media (1)
- flow in porous media (1)
- flow resistivity (1)
- flow visualization (1)
- fluid dynamic equations (1)
- fluid interfaces (1)
- fluid structure (1)
- fluid structure interaction (1)
- fluid-fiber interactions (1)
- fluid-structure interaction (1)
- fluid-structure interaction (FSI) (1)
- folding rocks (1)
- force control (1)
- force following (1)
- force-based simulation (1)
- forest management (1)
- formal (1)
- formal analysis (1)
- formal description technique (1)
- formal description techniques (1)
- formal method (1)
- formal reasoning (1)
- formal verification (1)
- formaldehyde (1)
- formale Analyse (1)
- formants (1)
- formate (1)
- formulation as integral equation (1)
- forward starting options (1)
- forward-shooting grid (1)
- foundational translation validation (1)
- fourier transformation (1)
- fptas (1)
- fracture mechanics (1)
- fragmentation channel (1)
- frame buffer operations (1)
- frameindifference (1)
- framework (1)
- free boundary (1)
- free boundary value problem (1)
- free surface Stokes flow (1)
- free-living (1)
- freie Oberfläche (1)
- frequency bands (1)
- frequency splitting betwe (1)
- freqzency bands (1)
- freshwater lentic systems (1)
- front loader (1)
- full vehicle model (1)
- function of bounded variation (1)
- functional Hilbert space (1)
- functional data (1)
- functional safety (1)
- functional time series (1)
- fundamental cut (1)
- fundamental systems (1)
- fuzzy Q-learning (1)
- gas bearing, aerostatic, porous, theoretical model (1)
- gas dynamics (1)
- gas phase reaction (1)
- gas transfer at the water-atmosphere interface (1)
- gasphase (1)
- gauge (1)
- gaussian filter (1)
- gebietszerlegung (1)
- gelonin (1)
- general multidimensional moment problem (1)
- general semi-infinite optimization (1)
- generalized Gummel itera (1)
- generalized Pareto distribution (1)
- generalized inverse Gaussian diffusion (1)
- generalized plasticity (1)
- generic character table (1)
- generic design of a customized communication subsystem (1)
- generic self-x sensor systems (1)
- generic sensor interface (1)
- genotoxicity (1)
- geodetic (1)
- geographic information systems (1)
- geographical information systems (1)
- geology (1)
- geomagnetic field modelling from MAGSAT data (1)
- geomathematics (1)
- geometric measure theory (1)
- geometrical algorithms (1)
- geometrically exact beams (1)
- geometrically exact rod models (1)
- geometrically exact rods (1)
- geometry of measures (1)
- geopotential determination (1)
- gitter (1)
- glass processing (1)
- glioblastoma (1)
- global pressure (1)
- global robustness (1)
- global tracking (1)
- glycine neurotransmission (1)
- go-or-grow (1)
- go-or-grow dichotomy (1)
- goal oriented completion (1)
- good semigroup (1)
- governance; experimental governance; shrinking cities; civic involvement (1)
- gradient descent reprojection (1)
- granular flow (1)
- grape berry moth (1)
- grapevine moth (1)
- graph and network algorithm (1)
- graph drawing algorithm (1)
- graph embedding (1)
- graph laplacian (1)
- graph layout (1)
- graph neural networks (1)
- graph p-Laplacian (1)
- graphic processors (1)
- gravimetry (1)
- gravitation (1)
- gravitational field recovery (1)
- greases (1)
- greenhouse gases (1)
- grid forming (1)
- grinding wheel (1)
- group action (1)
- groups of Lie type (1)
- growing sub-quadratically (1)
- growth and remodelling (1)
- growth optimal portfolios (1)
- großer Investor (1)
- guarded actions (1)
- half-selected cell (1)
- hand pose, hand shape, depth image, convolutional neural networks (1)
- handover optimzaiion (1)
- hardware (1)
- hardware verification (1)
- harmonic WFT (1)
- harmonic balance (1)
- harmonic scaling functions and wavelets (1)
- harmonic wavelets (1)
- head-on collisions (1)
- headway prediction (1)
- heat radiation (1)
- hedging (1)
- heme oxygenase-1 (1)
- heterogeneous access management (1)
- heterogeneous large-scale distributed DBMS (1)
- heterogeneous porous media (1)
- heterogenous catalysis (1)
- heuristics (1)
- hexadiendiale (1)
- hidden Markov (1)
- hierarchical matrix (1)
- hierarchical shape functions (1)
- hierarchical structure (1)
- high-level caching of potentially shared networked documents (1)
- higher order (1)
- higher order accurate conserving time integrators (1)
- higher order logic (1)
- higher order tableau (1)
- higher-order anisotropies (1)
- higher-order calculi (1)
- higher-order continuum (1)
- higher-order moments (1)
- higher-order tableaux calculus (1)
- higher-order theorem prover (1)
- historical documents (1)
- host preference (1)
- host-range (1)
- human body motion tracking (1)
- human factors (1)
- human robot cooperation (1)
- human visual system (1)
- humanoid robot (1)
- humanoide Roboter (1)
- hybrid control (1)
- hybrid knowledge representation (1)
- hybrid lightweight structures (1)
- hybrid material (1)
- hybrid materials (1)
- hybrid method (1)
- hybrid structure (1)
- hybride Leichtbaustrukturen (1)
- hydraulics (1)
- hydrogen bonds (1)
- hydrogen embrittlement (1)
- hydrogen enhanced localized plasticity (HELP) (1)
- hydrogenation (1)
- hyper-quasi-identities (1)
- hyperbolic conservation laws (1)
- hyperbolic systems (1)
- hyperbolic systems of conservation laws (1)
- hypercubes (1)
- hyperealstic (1)
- hyperelliptic function field (1)
- hyperelliptische Funktionenkörper (1)
- hypergeometric functions (1)
- hypergraph (1)
- hyperplane transversal (1)
- hyperquasivarieties (1)
- hyperspectal unmixing (1)
- hypocoercivity (1)
- hypolithic (1)
- hypoxia (1)
- iB2C (1)
- idealclass group (1)
- identity (1)
- idle times (1)
- image enhancement (1)
- image restoration (1)
- image segmentation (1)
- image-based probe (1)
- imaging (1)
- immobilization (1)
- immunotoxins (1)
- impinging jets (1)
- implement (1)
- implementation (1)
- improving and feasible directions (1)
- impulse control (1)
- impurity functions (1)
- in-house hospital transportation (1)
- incident wave (1)
- incompressible Euler equation (1)
- incompressible elasticity (1)
- incompressible flow (1)
- incompressible limit (1)
- industrial supervision (1)
- inelastic light scattering (1)
- inelastic multibody systems (1)
- inelastische Mehrkörpersysteme (1)
- inertial and viscous-inertial fiber regimes (1)
- inertial measurement unit (1)
- inertial sensors (1)
- infinite-dimensional analysis (1)
- infinite-dimensional manifold (1)
- inflation-linked product (1)
- information (1)
- information systems (1)
- information systems engineering (1)
- infrared spectroscopy (1)
- infrared thermography (1)
- infrarot (1)
- inhibition (1)
- inhibitory synaptic transmission (1)
- initial temperature (1)
- initial temperature reconstruction (1)
- initial value representation (1)
- inline probe (1)
- innovation outlier (1)
- insecticide tolerance (1)
- instantaneous phase (1)
- instanton method (1)
- integer GARCH (1)
- integer-valued time series (1)
- integrable systems (1)
- integral constitutive equation (1)
- integral constitutive equations (1)
- intellectual disability (1)
- intelligent agents (1)
- intensity (1)
- intensity map segmentation (1)
- intensity maps (1)
- intensity modulated (1)
- intensity modulated radiotherapy planning (1)
- interaction graphs (1)
- interaction networks (1)
- interactive multi-objective optimization (1)
- interactive navigation (1)
- interband tunneling (1)
- interest oriented portfolios (1)
- interfa (1)
- interface (1)
- interface problems (1)
- interference (1)
- intermediate stops (1)
- internal approximation (1)
- internal seiche (1)
- internet event synchronizer (1)
- interpolation (1)
- interpretation (1)
- interpreter (1)
- intersection local time (1)
- interval arithmetic (1)
- interval graphs (1)
- intra- and extracellular proton dynamics (1)
- intrusion detection (1)
- invariant (1)
- invariant theory (1)
- invariants (1)
- inverse Fourier transform (1)
- inverse coordination (1)
- inverse mathematical models (1)
- inversion method (1)
- ion transport (1)
- ion-sensitive field-effect transistor (1)
- ionization (1)
- isochronous streams (1)
- isogeometric analysis (IGA) (1)
- isotropy test (1)
- iterative bandwidth choice (1)
- jenseits der dritten Generation (1)
- jet loop reactor (1)
- joint channel estimation (1)
- jump diffusion (1)
- jump table analysis (1)
- jump-diffusion process (1)
- junction (1)
- k-cardinality minimum cut (1)
- k-max (1)
- kalman (1)
- kernel (1)
- kernel estimates (1)
- kernel function (1)
- kinematic (1)
- kinematic model (1)
- kinetic approach (1)
- kinetic derivation (1)
- kinetic isotope effect (1)
- kinetic models (1)
- kinetic semiconductor equations (1)
- kinetic theory (1)
- kinetischer Isotopeneffekt (1)
- knapsack (1)
- knowledge management (1)
- knowledge processing (1)
- knowledge representation (1)
- knowledge space (1)
- konsistente Integration (1)
- kontinuumsatomistischer Ansatz (1)
- konvexe Analysis (1)
- kooperative Spieltheorie (1)
- kraftbasiertes Führen (1)
- label setting algorithm (1)
- laboratory experiments (1)
- lake classification (1)
- lake modeling (1)
- landsat (1)
- language definition (1)
- language modeling (1)
- language profiles (1)
- lanthanide (1)
- large deviations (1)
- large investor (1)
- large neighborhood search (1)
- large scale integer programming (1)
- large scale optimization (1)
- laser-produced plasma (1)
- lattice Boltzmann (1)
- lattice Boltzmann equation (1)
- layered magnetic systems (1)
- layout (1)
- leaf-cutting ants (1)
- learning curve (1)
- letter (1)
- leukemia (1)
- level K-algebras (1)
- level splitting (1)
- level-set (1)
- lid-driven flow in a (1)
- life insurance (1)
- life-history (1)
- life-strategy (1)
- light scattering optimization (1)
- limit models (1)
- limit theorems (1)
- limitations (1)
- linear code (1)
- linear elasticity equations (1)
- linear kinematic hardening (1)
- linear optimization (1)
- linear programming (1)
- linear systems (1)
- linear transport equation (1)
- linked abstraction workflows (1)
- linked data (1)
- lipases (1)
- lipid content (1)
- liquid composite moulding (1)
- liquid film (1)
- liquid-liquid (1)
- liquid-liquid extraction (1)
- lithium-ion battery (1)
- load sharing (1)
- loader (1)
- local approximation of sea surface topography (1)
- local bandwidths (1)
- local communication (1)
- local multiscale (1)
- local orientation (1)
- local robustness (1)
- local search algorithm (1)
- local stationarity (1)
- local support (1)
- local trigonometric packets (1)
- local-global conjectures (1)
- locally compact (1)
- locally compact kernels (1)
- locally maximal clone (1)
- locally stationary process (1)
- locally supported (Green's) vector wavelets (1)
- locally supported (Green’s) vector wavelets (1)
- locally supported wavelets (1)
- location (1)
- location problem (1)
- location tracking (1)
- locational analysis (1)
- log averaging methods (1)
- log utility (1)
- log-utility (1)
- logarithmic average (1)
- logarithmic averages (1)
- logarithmic utility (1)
- logic synthesis (1)
- logical analysis (1)
- logische Analyse (1)
- logistic regression (1)
- logistics (1)
- lokal kompakt (1)
- lokaler Träger (1)
- lokalisierende Basis (1)
- lokalisierende Kerne (1)
- long short-term memory (1)
- long slender fibers (1)
- long tail (1)
- longevity bonds (1)
- loss analysis (1)
- loss coefficient (1)
- low discrepancy (1)
- low voltage grid (1)
- low-rank approximation (1)
- lung cancer (1)
- mHealth (1)
- machine code analysis (1)
- machine-checkable proof (1)
- macro derivative (1)
- macro modeling (1)
- macroinvertebrate community (1)
- macroinvertebrates (1)
- macrophytes (1)
- macroscopic equations (1)
- macroscopic quantum coherence (1)
- magnetic Ni80Fe20 wires (1)
- magnetic anisotropies (1)
- magnetic field (1)
- magnetic field based localization (1)
- magnetism (1)
- magnetization reversal process (1)
- magneto-optical Kerr effect (1)
- magnetometer calibration (1)
- magnetostatic surface spin waves (1)
- maneuver prediction (1)
- manganese (1)
- manipulation (1)
- marine bacteria (1)
- market crash (1)
- market manipulation (1)
- martingale measu (1)
- martingale optimality principle (1)
- mass & spring (1)
- mass difference (1)
- mass spectrometry (1)
- massive neutrinos (1)
- mastoid (1)
- mastoidectomy (1)
- material characterisation (1)
- materielle Kräfte (1)
- mathematical concept (1)
- mathematical modelling (1)
- mathematical morphology (1)
- matrix decomposition (1)
- matrix problems (1)
- matrix visualization (1)
- matroid flows (1)
- maximal dynamic flow (1)
- maximum a posteriori estimation (1)
- maximum capacity path (1)
- maximum entropy (1)
- maximum entropy moment (1)
- maximum flows (1)
- maximum likelihood estimation (1)
- maximum-entropy (1)
- mechanism design (1)
- mehreren Uebertragungszweigen (1)
- mesh deformation (1)
- mesh-free method (1)
- mesoporous (1)
- message-passing (1)
- meta-analysis (1)
- metabolism (1)
- metadata (1)
- metaheuristics (1)
- metal fibre (1)
- metal foams (1)
- metal organic frameworks (1)
- metals (1)
- metastable Pd(001) (1)
- metastable states (1)
- method of fundamental solutions (1)
- miRNA (1)
- micro lead (1)
- micro-structure analysis (1)
- microdefect (1)
- microelectronics ontology (1)
- microgrooved surface (1)
- micromechanics (1)
- micromorphic continua (1)
- microstructure simulatio (1)
- microstructure simulation (1)
- microstructures (1)
- middleware (1)
- migration (1)
- minimal paths (1)
- minimal polynomial (1)
- minimal spanning tree (1)
- minimaler Schnittbaum (1)
- minimax estimation (1)
- minimax rate (1)
- minimax risk (1)
- minimum cost flows (1)
- minimum cut (1)
- minimum cut tree (1)
- minimum fundamental cut basis (1)
- mixed convection (1)
- mixed methods (1)
- mixed multiscale finite element methods (1)
- mixed-signal (1)
- mixing (1)
- mixture models (1)
- mixture of quantum fluids and classical fluids (1)
- mobile agents (1)
- mobile agents approach (1)
- mobile radio (1)
- mobile radio systems (1)
- mobile scale (1)
- mobility robustness optimization (1)
- modal analysis (1)
- model (1)
- model identification (1)
- model order reduction (1)
- model-based fault diagnosis (1)
- modelling time (1)
- models (1)
- modified gradient projection method (1)
- modularisation (1)
- moduli space (1)
- moduli spaces (1)
- molecular capsules (1)
- molecular dynamics (1)
- molecular dynamics simulation (1)
- molecular recognition (1)
- molecular simulations (1)
- molekulare Simulation (1)
- moment (1)
- moment matching (1)
- moment methods (1)
- momentum distributions (1)
- monitoring and managing distributed development processes (1)
- monlinear vibration (1)
- monodromy (1)
- monogenic signals (1)
- monoid- and group-presentations (1)
- monotone Konvergenz (1)
- monotone consecutive arrangement (1)
- morphism (1)
- morphological simplification (1)
- motion control (1)
- moving contact line (1)
- muconaldehyde (1)
- multi scale (1)
- multi-agent architecture (1)
- multi-asset (1)
- multi-asset option (1)
- multi-carrier (1)
- multi-class image segmentation (1)
- multi-core processors (1)
- multi-domain modeling and evaluation methodology (1)
- multi-hypothesis diagnosis (1)
- multi-language (1)
- multi-level Monte Carlo (1)
- multi-material-design (1)
- multi-period planning (1)
- multi-phase flow (1)
- multi-scale model (1)
- multi-stage stochastic programming (1)
- multi-terminal HVDC (1)
- multi-user (1)
- multibody system simulation (1)
- multicategory (1)
- multicore (1)
- multicriteria minimal path problem is presented (1)
- multidimensional Kohonen algorithm (1)
- multidimensional datasets (1)
- multifilament superconductor (1)
- multifluid (1)
- multifunctionality (1)
- multigrid method (1)
- multileaf collimator sequencing (1)
- multiliead collimator sequencing (1)
- multimedia (1)
- multinomial regression (1)
- multiobjective evolutionary algorithms (1)
- multiobjective optimization (1)
- multipatch (1)
- multiphase flow (1)
- multiphase mixture model (1)
- multiple collision frequencies (1)
- multiple context free grammar (1)
- multiple objective (1)
- multiple objective linear programming problem (1)
- multiple objective optimization (1)
- multiple robotic manipulators (1)
- multiple-view product modeling (1)
- multiplicative decomposition (1)
- multiplikative Zerlegung (1)
- multiresolution analysis (1)
- multiscale approximation on regular telluroidal surfaces (1)
- multiscale denoising (1)
- multiscale methods (1)
- multiscale modeling (1)
- multiscale models (1)
- multiscale problem (1)
- multiscale problems (1)
- multiscale structures (1)
- multitemporal (1)
- multithreading (1)
- multitrait–multimethod analysis (1)
- multitype code coupling (1)
- multiuser detection (1)
- multiuser transmission (1)
- multivalued fundamental diagram (1)
- multivariate chi-square-test (1)
- multiway partitioning (1)
- muscle fatigue (1)
- muscle soreness (1)
- mutants (1)
- mutiresolution (1)
- myasthenia gravis (1)
- n-Decane hydroconversion (1)
- naive diversification (1)
- nanocomposites (1)
- nanofiber (1)
- nanoindentation (1)
- nanoparticle (1)
- narrowing (1)
- natural language semantics (1)
- natural law (1)
- natural products (1)
- navigation (1)
- nearest neighbour distance (1)
- necrosis (1)
- negative bit line (1)
- negative refraction (1)
- negotiation (1)
- neighborhod relationships (1)
- neighborhood search (1)
- nematodes (1)
- neonatal rat ventricular cardiomyocytes (1)
- neonatale ventrikuläre Kardiomyozyten der Ratte (1)
- nestable tangibles (1)
- network congestion game (1)
- network flow (1)
- network location (1)
- network synthesis (1)
- netzgenerierung (1)
- neurite outgrowth (1)
- neurodegenerative disease (1)
- neurotrophin 3 (1)
- never-meet property (1)
- nicht-newtonsche Strömungen (1)
- nichtlineare Druckkorrektor (1)
- nichtlineare Modellreduktion (1)
- nichtlineare Netzwerke (1)
- nickel (1)
- niob (1)
- nitrogen fixation (1)
- nominalization (1)
- non square linear system solving (1)
- non-Gaussia non-i.i.d. errors (1)
- non-Newtonian fluids (1)
- non-commutative geometry (1)
- non-conventional (1)
- non-convex body (1)
- non-convex optimization (1)
- non-desarguesian plane (1)
- non-equilibrium thermodynamics (1)
- non-linear dynamics (1)
- non-linear optimization (1)
- non-linear wavelet thresholding (1)
- non-linear wealth dynamics (1)
- non-local conditions (1)
- non-local filtering (1)
- non-newtonian flow (1)
- non-stationary time series (1)
- non-woven (1)
- nonconvex optimization (1)
- nonhermitian perturbation theory (1)
- noninformative prior (1)
- nonlinear circuits (1)
- nonlinear elasticity (1)
- nonlinear elastodynamics (1)
- nonlinear finite element method (1)
- nonlinear heat equation (1)
- nonlinear inverse problem (1)
- nonlinear model reduction (1)
- nonlinear pressure correction (1)
- nonlinear programming (1)
- nonlinear stochastic systems (1)
- nonlinear term structure dependence (1)
- nonlinear thresholding (1)
- nonlinear vibration analysis (1)
- nonlinear wavelet thresholding (1)
- nonlinearity (1)
- nonlocal filtering (1)
- nonlocal sample dependence (1)
- nonnegative matrix factorization (1)
- nonparametric regression and (spectral) density estimation (1)
- nonwovens (1)
- norm (1)
- normal cone (1)
- normal mode (1)
- normality (1)
- normalization (1)
- normed residuum (1)
- noun incorporation (1)
- nucleofection (1)
- null model (1)
- number fields (1)
- number of objectives (1)
- numeraire portfolios (1)
- numerical computation (1)
- numerical integration (1)
- numerical irreducible decomposition (1)
- numerical methods (1)
- numerical methods for stiff equations (1)
- numerical solution (1)
- numerical time integration (1)
- numerics for pdes (1)
- numerische Dynamik (1)
- numerische Strömungssimulation (1)
- numerisches Verfahren (1)
- object frameworks (1)
- object-orientation (1)
- object-oriented software modeling (1)
- oblique derivative (1)
- occupational choice (1)
- off-line programming (1)
- office chair with heating and cooling function (1)
- oil filters (1)
- on-board simulation (1)
- one-dimensional model (1)
- one-dimensional self-organization (1)
- open cell foam (1)
- open dissipative quantum systems (1)
- open systems (1)
- operations research (1)
- operator splitting (1)
- operator-dependent prolongation (1)
- optical code multiplex (1)
- optical imaging (1)
- optimal (1)
- optimal capital structure (1)
- optimal consumption and investment (1)
- optimal control theory (1)
- optimal portfolio choice (1)
- optimal portfolios (1)
- optimal rate of convergence (1)
- optiman stopping (1)
- optimization algorithms (1)
- optimization correctness (1)
- optimization strategies (1)
- option valuation (1)
- options (1)
- orbit (1)
- order selection (1)
- order-sorted logic (1)
- order-three density (1)
- order-two density (1)
- ordered median (1)
- organic micropollutants (1)
- orientation analysis (1)
- orthogonal bandlimited and non-bandlimited wavelets (1)
- orthogonal orientations (1)
- oscillating coefficients (1)
- oscillating magnetic fields (1)
- oscillation (1)
- otorhinolaryngological surgery (1)
- out-of-order (1)
- output feedback approximation (1)
- overtone (1)
- ovoids (1)
- ownership (1)
- oxidative DNA Damage (1)
- oxidative DNA Schäden (1)
- oxo centered transition metal complexes (1)
- oxygen consumption (1)
- p300 (1)
- p53 (1)
- pH-sensitive microelectrodes (1)
- paper machine (1)
- parallel (1)
- parallel computing (1)
- parallel implementation (1)
- parallel numerical algorithms (1)
- parallelism and concurrency (1)
- parameter choice (1)
- parameter identification (1)
- parametric design (1)
- paramodulation (1)
- paramtrisches Design (1)
- partial differential equations (1)
- partial differential-algebraic equations (1)
- partial hydrolysis (1)
- partial information (1)
- participatory sensing (1)
- particle collision (1)
- particle dynamics (1)
- particle finite element method (1)
- particle size distribution (1)
- partition of unity (1)
- path (1)
- path cost models (1)
- path relinking (1)
- path tracking (1)
- path-connected sublevelsets (1)
- path-dependent options (1)
- pattern (1)
- pattern recognition (1)
- patterned magnetic permalloy films (1)
- penalization (1)
- penalty methods (1)
- penalty-free formulation (1)
- peripheral blood mononuclear cells (1)
- permeability of fractured porous media (1)
- persistence (1)
- personnel scheduling (1)
- pesticides (1)
- pesticides and wastewater (1)
- petroleum exploration (1)
- phase equilibria (1)
- phase equilibrium (1)
- phase field modeling (1)
- phase transformation (1)
- phase transitions (1)
- phenothiazine (1)
- photobioreactor (1)
- photon Bose-Einstein condensate (1)
- photon-photon interaction (1)
- photonic crystals (1)
- photonic crystals filter (1)
- photonic structures (1)
- photonics (1)
- photosynthesis (1)
- physical modelling (1)
- physicians (1)
- piezoelectric periodic surface acoustic wave filters (1)
- piezoelectricity (1)
- pivot sampling (1)
- plan enactment (1)
- planar Brownian motion (1)
- planar location (1)
- planar polynomial (1)
- planning systems (1)
- planning theory (1)
- plant pathogen (1)
- plant-herbivore interactions (1)
- plants (1)
- plasticity (1)
- platin (1)
- platinum (1)
- point cloud (1)
- point defects (1)
- point-to-point (1)
- polar ice (1)
- political districting (1)
- political ecology (1)
- polycyclic group rings (1)
- polyhedral analysis (1)
- polyhedral norm (1)
- polymer blends (1)
- polymer compound (1)
- polymer morphology (1)
- polymer nanocomposites (1)
- polynomial weight functions (1)
- polyphenol (1)
- polysynthesis (1)
- population balance modelling (1)
- population genetics (1)
- porous media flow (1)
- porous microstructure (1)
- portfolio (1)
- portfolio decision (1)
- portfolio optimisation (1)
- portfolio-optimization (1)
- poröse Medien (1)
- position detection (1)
- positivity preserving time integration (1)
- posterior collapse (1)
- posture (1)
- potential (1)
- potential operators (1)
- power (1)
- power electronics (1)
- power utility (1)
- preconditioner (1)
- preconditioners (1)
- predictive control (1)
- predictive processing (1)
- prefix reduction (1)
- prefix string rewriting (1)
- prefix-rewriting (1)
- preprocessing (1)
- preservation of relations (1)
- pressing section of a paper machine (1)
- pressure correction (1)
- pressure drop (1)
- pressure relief (1)
- preventive maintenance (1)
- price of anarchy (1)
- price of stability (1)
- primal-dual algorithm (1)
- probabilistic modeling (1)
- probability distribution (1)
- probability of dangerous failure on demand (1)
- probe pruning (1)
- problem solvers (1)
- problems (1)
- process model (1)
- process modelling (1)
- process support system (PROSYT) (1)
- process-centred environments (1)
- processing (1)
- processing gain (1)
- productivity (1)
- profiles (1)
- programmable client-server systems (1)
- programming by demonstration (1)
- progress feedback (1)
- project coordination (1)
- project management and scheduling (1)
- projected quasi-gradient method (1)
- projection method (1)
- projection-type splitting (1)
- projective surfaces (1)
- proof generating optimizer (1)
- proof plans (1)
- proof presentation (1)
- propagating discontinuities (1)
- properly efficient solution (1)
- property cheking (1)
- protein adducts (1)
- protein analysis (1)
- protein conjugate (1)
- protocol (1)
- proximation (1)
- proxy modeling (1)
- pseudo-compressibility method (1)
- pseudo-plastic fluids (1)
- pseudospectral methods (1)
- public transit (1)
- public transportation (1)
- pulsed and stirred columns (1)
- pulsierte und gerührte Kolonen (1)
- puts (1)
- pyramid schemes (1)
- pyramids (1)
- pyrrolizidine alkaloids (1)
- qauntum mechanis (1)
- quadratic assignment problem (1)
- quadratic forms (1)
- quadrinomial tree (1)
- qualitative threshold model (1)
- quality assurance (1)
- quantile autoregression (1)
- quantile estimation (1)
- quantitative analysis (1)
- quantum gas (1)
- quantum tunneling (1)
- quasi-Monte Carlo (1)
- quasi-P (1)
- quasi-SH (1)
- quasi-SV (1)
- quasi-one-dimensional spin wave envelope solitons (1)
- quasi-variational inequalities (1)
- quasihomogeneity (1)
- quasiregular group (1)
- quasireguläre Gruppe (1)
- quasistatic deformations (1)
- quasivarieties (1)
- quickest path (1)
- radar (1)
- radiation therapy planning (1)
- radiative heat transfer (1)
- radiotherapy planning (1)
- rainfall rate (1)
- rainflow (1)
- random -Gaussian aerodynamic force (1)
- random finite sets (1)
- random noise (1)
- random set (1)
- random system of fibers (1)
- rank-one convexity (1)
- rapid authoring (1)
- rare disasters (1)
- rarefied gas flows (1)
- raster graphics (1)
- rat liver cell systems (1)
- rate control (1)
- rate-independency (1)
- rate-indepenhysteresis (1)
- rating scale (1)
- ratio ergodic theorem (1)
- raum-zeitliche Analyse (1)
- ray casting (1)
- ray tracing (1)
- reaction coordinate (1)
- reaction kinetics (1)
- reaction-diffusion-taxis equations (1)
- reaction-diffusion-transport equations (1)
- reactive multiphase flow (1)
- reactive systems (1)
- read assist (1)
- readout system (1)
- reaktionskinetik (1)
- real quadratic number fields (1)
- real time (1)
- real-life applications. (1)
- real-tiem (1)
- real-time scheduling (1)
- real-time simulation (1)
- real-time tasks (1)
- real-time temporal logic (1)
- real-world accident data (1)
- reasoning (1)
- receiver orientation (1)
- receptive safety properties (1)
- receptors for anions (1)
- reconstruction (1)
- reconstruction formula (1)
- reconstructions (1)
- recurrent neural networks (1)
- redundancy (1)
- redundant constraint (1)
- redundant robots (1)
- reference prior (1)
- reflectionless boundary condition (1)
- reflexionslose Randbedingung (1)
- refraction (1)
- refugees (1)
- regime-shift model (1)
- regional planning (1)
- regularity (1)
- regularization by wavelets (1)
- regularization methods (1)
- regularized models (1)
- regulation (1)
- reguläre Fläche (1)
- reinforced concrete (1)
- reinforcement learning (1)
- reinitialization (1)
- rela (1)
- relative effect potencies (1)
- relative toxic potencies (1)
- relaxed memory models (1)
- reliability (1)
- remote sensing (1)
- renormalization group (1)
- representative systems (1)
- representative systems of Pareto solutions (1)
- requirements (1)
- residual based error formula (1)
- resilience (1)
- resource constrained shortest path problem (1)
- respiratory chain (1)
- reuse repositories (1)
- reverse (1)
- reverse logistics (1)
- review (1)
- rewriting (1)
- rhabdomyolysis (1)
- rheology (1)
- ribosome-inactivating proteins (1)
- rings (1)
- riparian food web (1)
- risk (1)
- risk analysis (1)
- risk management (1)
- risk measures (1)
- risk reduction (1)
- river typology system (1)
- robot (1)
- robot calibration (1)
- robot control (1)
- robot control architectures (1)
- robot kinematics (1)
- robot motion planning (1)
- robotic manipulators (1)
- robotics (1)
- robust network flows (1)
- roles (1)
- rostering (1)
- rotating machinery (1)
- rotational spinning processes (1)
- roughening transition (1)
- routine outcome monitoring (1)
- rule-based reasoning (1)
- runtime monitoring (1)
- rupture disk (1)
- ruthenium-vinylidene (1)
- s external gravitational field (1)
- safety and security (1)
- safety critical components (1)
- safety function (1)
- safety-critical (1)
- safety-related systems (1)
- sales territory alignment (1)
- sampling (1)
- satellite gradiometry (1)
- satellite-to-satellite tracking (1)
- sawtooth effect (1)
- scalar and vectorial wavelets (1)
- scalar conservation laws (1)
- scalar field (1)
- scalarization (1)
- scale discrete spherical vector wavelets (1)
- scaled boundary isogeometric analysis (1)
- scaled boundary parametrizations (1)
- scaled translates (1)
- scaling functions (1)
- scene flow (1)
- scheduling (1)
- scheduling theory (1)
- schlecht gestellt (1)
- schnelle Approximation (1)
- school (1)
- sdr (1)
- search algorithm (1)
- search alogorithms (1)
- search-space-problem (1)
- seasonal variability (1)
- second class group (1)
- second order logic (1)
- second order upwind discretization (1)
- secondary metabolites (1)
- secondary structure prediction (1)
- security domain (1)
- seed filling (1)
- seismic tomography (1)
- seismic wave (1)
- selbstgesteuertes (1)
- self calibration (1)
- self-directed (1)
- self-localization (1)
- self-optimizing networks (1)
- selfish routing (1)
- semi-classical limits (1)
- semi-infinite programming (1)
- semiclassical (1)
- semiclassical quantisation (1)
- semigroup of values (1)
- semiring parsing (1)
- semisprays (1)
- sensitivities (1)
- sensitivity analysis (1)
- sensitization effect (1)
- separation problem (1)
- sequences (1)
- sequent calculus (1)
- sequential circuit (1)
- sequential test (1)
- serum albumin (1)
- service area (1)
- set covering (1)
- severely ill-posed inverse problems (1)
- shape (1)
- shape aniso-tropies (1)
- sheaf theory (1)
- shear flow (1)
- shock wave (1)
- short magnetic fieldpulses (1)
- short scales (1)
- short-time periodogram (1)
- shortest path problem (1)
- shortest sequence (1)
- shrinking cities (1)
- sieve estimate (1)
- silica (1)
- silicon nanowire (1)
- similarity measure (1)
- similarity measures (1)
- simplex (1)
- single domain uniaxial magnetic particles (1)
- single layer kernel (1)
- singular fluxes (1)
- singular optimal control (1)
- singular spaces (1)
- singularity (1)
- singuläre Räume (1)
- sink location (1)
- skeletal muscle cells (1)
- skolemization (1)
- slender- body theory (1)
- slender-body theory (1)
- slenderbody theory (1)
- sliding wear (1)
- slope limiter (1)
- small-multiples node-link visualization (1)
- smart decline (1)
- smoothing (1)
- smoothness (1)
- sniffing (1)
- social cohesion (1)
- social-ecological systems (1)
- software (1)
- software agents (1)
- software comprehension (1)
- software engineering (1)
- software engineering task (1)
- software process (1)
- software project (1)
- software project management (1)
- software reuse (1)
- solar neutrinos (1)
- solid interfaces (1)
- solid-solid phase transition (1)
- solution formula (1)
- solvation (1)
- sorted logic (1)
- soundness (1)
- sparse interpolation of multivariate rational functions (1)
- sparse multivariate polynomial interpolation (1)
- sparse-to-dense (1)
- sparsity (1)
- spatial optical filtering (1)
- spatial statistics (1)
- special entropies (1)
- spectrogram (1)
- spectroscopy (1)
- speech recognition (1)
- sphere (1)
- spherical decomposition (1)
- spherical splines (1)
- spin (1)
- spin flip (1)
- spin wave excitations (1)
- spine (1)
- spinning processes (1)
- spinwaves (1)
- spline (1)
- spline and wavelet based determination of the geoid and the gravitational potential (1)
- spline-wavelets (1)
- split-attention effect (1)
- splitting function (1)
- sputtering process (1)
- squares (1)
- srtm (1)
- stability uniformly in the mean free path (1)
- stabilization (1)
- star-shaped domain (1)
- state-based formalism (1)
- static instrumentation (1)
- static load balancing (1)
- static software structure (1)
- statin (1)
- stationary sensing (1)
- stationary solutions (1)
- stationär (1)
- statistical experiment (1)
- statistical modeling (1)
- statistics (1)
- steady Boltzmann equation (1)
- steady Richards’ equation (1)
- steady modified Richards’ equation (1)
- steel fibre (1)
- stimulus response data (1)
- stochastic Hamiltonian system (1)
- stochastic averaging. (1)
- stochastic coefficient (1)
- stochastic context free grammar (1)
- stochastic dif (1)
- stochastic differential equations (1)
- stochastic interest rate (1)
- stochastic optimal control (1)
- stochastic processes (1)
- stochastic stability (1)
- stochastic volatility (1)
- stokes (1)
- stop and go waves (1)
- stop location (1)
- stop- and play-operators (1)
- strain localization (1)
- strategic (1)
- stratifolds (1)
- stream pollution (1)
- streams (1)
- strength (1)
- strengthening (1)
- strictly quasi-convex functions (1)
- strong equilibria (1)
- strong theorems (1)
- strongly polynomial-time algorithm (1)
- structural summary (1)
- structural synaptic plasticity (1)
- structural tensors (1)
- structure tensor (1)
- structured permalloy films (1)
- strut thickness (1)
- students (1)
- subgradient (1)
- subgrid approach (1)
- subgrid approximation (1)
- subgroup presentation problem (1)
- subjective evaluation (1)
- subjectivity (1)
- sulfonic (1)
- superposed fluids (1)
- superstep cycles (1)
- surface (1)
- surface measures (1)
- surface protection (1)
- surface tension (1)
- surrender options (1)
- surrogate algorithm (1)
- surveillance (1)
- suspension (1)
- sustainability policies (1)
- suzuki coupling (1)
- swap (1)
- switching properties (1)
- symbolic analysis (1)
- symbolic simulation (1)
- symmetrc carboxylate stretch vibrations (1)
- symmetry (1)
- synchrone Sprachen (1)
- synchronization (1)
- synchronous (1)
- synchronous languages (1)
- synthetic receptors (1)
- system architecture (1)
- system behaviour (1)
- system simulation (1)
- systems (1)
- syzygies (1)
- tableau (1)
- tabletop (1)
- tabu search (1)
- tail dependence coefficient (1)
- tailored disorder (1)
- target sensitivity (1)
- task sequence (1)
- tax (1)
- technische und berufliche Aus- und Weiterbildung Lehrer lernen (1)
- technology (1)
- technology mapping (1)
- temperature dependence (1)
- tension problems (1)
- tensions (1)
- tensor (1)
- tensor product basis (1)
- tensorfield (1)
- terrain rendering (1)
- territory desgin (1)
- test (1)
- test feeder (1)
- tetrachlorodibenzo-p-dioxin (1)
- textile quality control (1)
- texture (1)
- texture classification (1)
- texture orientation (1)
- theory of materials (1)
- thermal analysis (1)
- thermal comfort (1)
- thermal equilibrium state (1)
- thermal sensation (1)
- thermodynamic model (1)
- thermoelectric movable cooling partition (1)
- thermoplastische Verbundwerkstoffe (1)
- thiazolium (1)
- thin films (1)
- thin h-BN films (1)
- thiol-disulfide exchange (1)
- threshold choice (1)
- time delays (1)
- time utility functions (1)
- time-delayed carrying capacities (1)
- time-dependent (1)
- time-dependent shortest path problem (1)
- time-frequency plan (1)
- time-varying autoregression (1)
- time-varying covariance (1)
- time-varying flow fields (1)
- timeliness (1)
- tipping points (1)
- tolerance (1)
- top-down (1)
- topological asymptotic expansion (1)
- topological insulator (1)
- topological sensitivity (1)
- topology optimization (1)
- topology preserving maps (1)
- tori (1)
- toric geometry (1)
- torische Geometrie (1)
- total latency (1)
- total suspended solids (1)
- total variation (1)
- total variation spatial regularization (1)
- touch surfaces (1)
- toxic equivalency factor (TEF) concept (1)
- toxicity (1)
- tr (1)
- trace stability (1)
- traceability (1)
- tracking (1)
- trade-off (1)
- traffic flow (1)
- traffic planning (1)
- traffic safety (1)
- training (1)
- trajectory optimization (1)
- transfer film (1)
- transfer hydrogenation (1)
- transfer quality (1)
- transient (1)
- transit operations (1)
- transition metal (1)
- transition metal complexes (1)
- transition metals (1)
- transition rates (1)
- transition-metal (1)
- translation (1)
- translation contract (1)
- translation invariant spaces (1)
- translation validation (1)
- translinear circuits (1)
- translineare Schaltungen (1)
- transmission conditions (1)
- transport (1)
- transportation (1)
- transverse bias field (1)
- traveling salesman problem (1)
- treatment planning (1)
- tree method (1)
- trial systems (1)
- triclinic medium (1)
- triple layer stacks (1)
- tropical ecology (1)
- tropical geometry (1)
- tropical mountain reservoirs (1)
- tropical rainforest (1)
- tropischer Regenwald (1)
- trunk muscles (1)
- tumor acidity (1)
- tumor cell invasion (1)
- tumor cell migration (1)
- tundra (1)
- turbulence modeling (1)
- turbulence modelling (1)
- two-dimensional (1)
- two-dimensional self-focused spin wave packets (1)
- two-fold symmetric (1)
- two-grid algorithm (1)
- two-scale expansion (1)
- two-way coupling (1)
- types (1)
- typical examples (1)
- typical instance (1)
- ultrasonic processes (1)
- ultrasonic welding (1)
- ultrasound signals (1)
- uncapacitated facility location (1)
- uncertainty principle (1)
- unidirectional uniaxial and four-fold anisotropy contribution (1)
- uniform central limit theorem (1)
- uniform consistency (1)
- uniform ergodicity (1)
- unimodular certification (1)
- unimodularity (1)
- unstructured grid (1)
- upscaling (1)
- urban elevation (1)
- urban planning (1)
- urban policy (1)
- urban stormwater quality (1)
- user-centered design (1)
- validity (1)
- value preserving portfolios (1)
- value semigroup (1)
- value-at-risk (1)
- valuing contracts (1)
- variable aggregation method (1)
- variable cardinality case (1)
- variable selection (1)
- variation sets (1)
- variational formulation (1)
- variational integrators (1)
- variational methods (1)
- variational model (1)
- various formulations (1)
- vector bundles (1)
- vector field visualization (1)
- vector measure (1)
- vector wavelets (1)
- vectorfield (1)
- vectorial multiresolution analysis (1)
- vehicle routing (1)
- vehicular traffic (1)
- verication theorem (1)
- vertical velocity (1)
- vertikale Geschwindigkeiten (1)
- vetreilte nachgiebige Regelung (1)
- virtual building controller (1)
- virtual grinding wheel model (1)
- virtual market place (1)
- virtual programming (1)
- virtual reality (1)
- virtual synchronous machine (1)
- virtual training (1)
- viscoelastic fluids (1)
- viscoelastic modeling (1)
- viscosity model (1)
- viscosity solutions (1)
- viscous thermal jets (1)
- visual (1)
- visual analytics (1)
- visual analytics, machine learning, interaction, user experience, assistive technologies (1)
- visual interfaces (1)
- visual process modelling environment (1)
- visual structure (1)
- volatility (1)
- voltage sensitive dye (1)
- volume of fluid method (1)
- vortex seperation (1)
- wall energy (1)
- wall thickness (1)
- wave propagation (1)
- waveguides (1)
- wavelength multiplex (1)
- wavelet estimators (1)
- wavelet packets (1)
- wavelet thresholding (1)
- wavelet transform (1)
- weak dependence (1)
- weak localization (1)
- weak solution theory (1)
- weak solutions (1)
- weakly/ strictly pareto optima (1)
- wear (1)
- wear/failure testing devices (1)
- wearable systems (1)
- web tracking (1)
- weighing (1)
- weight optimization (1)
- weighted finite-state transducers (1)
- wheel side-slip estimation (1)
- white beetles (1)
- white noise (1)
- whole genome microarray analysis (1)
- wild bootstrap test (1)
- windowed Fourier transform (1)
- windowing (1)
- wine industry (1)
- winner definition (1)
- wireless communications system (1)
- wireless networks (1)
- wireless sensor network (1)
- wireless signal (1)
- wordline underdrive (1)
- work coordination (1)
- worker assistance (1)
- world modelling (1)
- world-modelling (1)
- worst-case (1)
- write assist (1)
- write margin (1)
- xai (1)
- yield (1)
- yttrium-iron garnet (YIG) fi (1)
- zeitabhängige Strömungen (1)
- zinc (1)
- Ähnlichkeit (1)
- Äquisingularität (1)
- Ökodesign (1)
- Ökologie (1)
- Ökosystem (1)
- Ökotoxizität (1)
- Überflutung (1)
- Überflutungsrisiko (1)
- Übergangsbedingungen (1)
- Übergangsmetall (1)
- Übersetzung (1)
- Ашур-Ада (1)
Faculty / Organisational entity
- Kaiserslautern - Fachbereich Mathematik (1054)
- Kaiserslautern - Fachbereich Informatik (753)
- Kaiserslautern - Fachbereich Maschinenbau und Verfahrenstechnik (305)
- Kaiserslautern - Fachbereich Physik (294)
- Fraunhofer (ITWM) (205)
- Kaiserslautern - Fachbereich Chemie (119)
- Kaiserslautern - Fachbereich Elektrotechnik und Informationstechnik (115)
- Kaiserslautern - Fachbereich Biologie (102)
- Kaiserslautern - Fachbereich Sozialwissenschaften (76)
- Kaiserslautern - Fachbereich Wirtschaftswissenschaften (37)
- Kaiserslautern - Fachbereich Bauingenieurwesen (29)
- Landau - Fachbereich Natur- und Umweltwissenschaften (26)
- Distance and Independent Studies Center (DISC) (15)
- Kaiserslautern - Fachbereich Raum- und Umweltplanung (15)
- Kaiserslautern - Fachbereich ARUBI (9)
- Landau - Fachbereich Psychologie (7)
- Kaiserslautern - Fachbereich Architektur (2)
- Landau - Fachbereich Erziehungswissenschaften (2)
Synapses are the fundamental structures that regulate the functionality of the neural circuit. The ability of the synapse to modulate its structure and function at a fast rate due to various sensory inputs provides the strength to the nervous system to incorporate new adaptations and behaviors in the animal. The synapses are very dynamic throughout the life of the animal starting from early development. Continuous events of formation and elimination of synapse, activation and inhibition of synaptic function are observed in almost all synapses. These processes occur at a high speed and require controlled cellular mechanisms. Imbalance in these processes results in defective nervous system and has been reported in many neurological disorders. Thus, it is important to understand the mechanisms that regulate process of synapse development maintenance and function.
Kinases and phosphatases are the key regulators of cellular mechanisms. Understanding the function of these molecules in the neuron will shed light on the molecular mechanisms of synaptic plasticity. Using Drosophila melanogaster larval neuromuscular junction as a model, Bulat et al. (2014) performed a large RNAi based screen targeting kinome and phosphatome of Drosophila to identify the essential kinases and phosphatases and found Myeloid leukemia factor-1 adaptor molecule (Madm) and Protein phosphatase 4 (PP4) as novel regulators of synapse development and maintenance. The function of these molecules in the nervous system has not been reported and hence I investigated on the role of Madm and PP4 in the regulation of synapse development, maintenance and function.
Myeloid leukemia factor-1 adaptor molecule (Madm), a ubiquitously expressing psuedokinase essentially functions to regulate synaptic growth, stability and function. Using a combination of genetic and high throughput imaging, I could demonstrate that Madm functions to regulate the synaptic growth and stability from the presynapse and synaptic organization form the postsynapse. Also, I could demonstrate that Madm functions in association with mTOR pathway to regulate synapse growth acting downstream of 4E-BP. In addition, using electrophysiology, we could demonstrate that Madm is essential for the basic synaptic transmission with an additive function of retrograde synaptic potentiation. In summary, I could demonstrate that Madm is a novel regulator of synaptic development, maintenance and function.
Protein phosphatase 4 (PP4), a ubiquitously expressing protein phosphatase is involved in the regulation of multiple aspects of the nervous system. I could demonstrate that PP4 is essential for the development of nervous system and the metamorphosis. Using genetics and imaging analysis, I could demonstrate that loss of PP4 results in the abnormal morphology of cell organelles. In addition, I could show that loss of PP4 results in defective brain development with poorly developed structures.
Altogether, in this study, I could demonstrate the importance of novel molecules, a pesudokinase Madm and protein phosphatases PP4 in the nervous system to regulate distinct aspects of the neuron.
The number of sensors used in modern devices is rapidly increasing, and the interaction with sensors demands analog-to-digital data conversion (ADC). A conventional ADC in leading-edge technologies faces
many issues due to signal swings, manufacturing deviations, noise, etc. Designers of ADCs are moving to the
time domain and digital designs techniques to deal with these issues. This work pursues a novel self-adaptive
spiking neural ADC (SN-ADC) design with promising features, e.g., technology scaling issues, low-voltage
operation, low power, and noise-robust conditioning. The SN-ADC uses spike time to carry the information.
Therefore, it can be effectively translated to aggressive new technologies to implement reliable advanced sensory electronic systems. The SN-ADC supports self-x (self-calibration, self-optimization, and self-healing) and
machine learning required for the internet of things (IoT) and Industry 4.0. We have designed the main part of
SN-ADC, which is an adaptive spike-to-digital converter (ASDC). The ASDC is based on a self-adaptive complementary metal–oxide–semiconductor (CMOS) memristor. It mimics the functionality of biological synapses,
long-term plasticity, and short-term plasticity. The key advantage of our design is the entirely local unsupervised
adaptation scheme. The adaptation scheme consists of two hierarchical layers; the first layer is self-adapted, and
the second layer is manually treated in this work. In our previous work, the adaptation process is based on 96 variables. Therefore, it requires considerable adaptation time to correct the synapses’ weight. This paper proposes a
novel self-adaptive scheme to reduce the number of variables to only four and has better adaptation capability
with less delay time than our previous implementation. The maximum adaptation times of our previous work
and this work are 15 h and 27 min vs. 1 min and 47.3 s. The current winner-take-all (WTA) circuits have issues, a
high-cost design, and no identifying the close spikes. Therefore, a novel WTA circuit with memory is proposed.
It used 352 transistors for 16 inputs and can process spikes with a minimum time difference of 3 ns. The ASDC
has been tested under static and dynamic variations. The nominal values of the SN-ADC parameters’ number
of missing codes (NOMCs), integral non-linearity (INL), and differential non-linearity (DNL) are no missing
code, 0.4 and 0.22 LSB, respectively, where LSB stands for the least significant bit. However, these values are
degraded due to the dynamic and static deviation with maximum simulated change equal to 0.88 and 4 LSB and
6 codes for DNL, INL, and NOMC, respectively. The adaptation resets the SN-ADC parameters to the nominal
values. The proposed ASDC is designed using X-FAB 0.35 µm CMOS technology and Cadence tools.
A potential fucoidan-based PEGylated PLGA nanoparticles (NPs) offering a proper delivery of N-methyl anthranilic acid (MA, a model of hydrophobic anti-inflammatory drug) have been
developed via the formation of fucoidan aqueous coating surrounding PEGylated PLGA NPs. The optimum formulation (FuP2) composed of fucoidan:m-PEG-PLGA (1:0.5 w/w) with particle size(365 ± 20.76 nm), zeta potential (-22.30 ± 2.56 mV), % entrapment efficiency (85.45 ± 7.41), drug loading (51.36 ± 4.75 µg/mg of NPs), % initial burst (47.91 ± 5.89), and % cumulative release
(102.79 ± 6.89) has been further investigated for the anti-inflammatory in vivo study. This effect of
FuP2 was assessed in rats’ carrageenan-induced acute inflammation model. The average weight of the
paw edema was significantly lowered (p ≤ 0.05) by treatment with FuP2. Moreover, cyclooxygenase-2 and tumor necrosis factor-alpha immunostaining were decreased in FuP2 treated group compared to the other groups. The levels of prostaglandin E2, nitric oxide, and malondialdehyde were significantly
reduced (p ≤ 0.05) in the FuP2-treated group. A significant reduction (p ≤ 0.05) in the expression
of interleukins (IL-1b and IL-6) with an improvement of the histological findings of the paw tissues was observed in the FuP2-treated group. Thus, fucoidan-based PEGylated PLGA–MA NPs are a promising anti-inflammatory delivery system that can be applied for other similar drugs potentiating their pharmacological and pharmacokinetic properties.
With the burgeoning computing power available, multiscale modelling and simulation has these days become increasingly capable of capturing the details of physical processes on different scales. The mechanical behavior of solids is oftentimes the result of interaction between multiple spatial and temporal scales at different levels and hence it is a typical phenomena of interest exhibiting multiscale characteristic. At the most basic level, properties of solids can be attributed to atomic interactions and crystal structure that can be described on nano scale. Mechanical properties at the macro scale are modeled using continuum mechanics for which we mention stresses and strains. Continuum models, however they offer an efficient way of studying material properties they are not accurate enough and lack microstructural information behind the microscopic mechanics that cause the material to behave in a way it does. Atomistic models are concerned with phenomenon at the level of lattice thereby allowing investigation of detailed crystalline and defect structures, and yet the length scales of interest are inevitably far beyond the reach of full atomistic computation and is rohibitively expensive. This makes it necessary the need for multiscale models. The bottom line and a possible avenue to this end is, coupling different length scales, the continuum and the atomistics in accordance with standard procedures. This is done by recourse to the Cauchy-Born rule and in so doing, we aim at a model that is efficient and reasonably accurate in mimicking physical behaviors observed in nature or laboratory. In this work, we focus on concurrent coupling based on energetic formulations that links the continuum to atomistics. At the atomic scale, we describe deformation of the solid by the displaced positions of atoms that make up the solid and at the continuum level deformation of the solid is described by the displacement field that minimize the total energy. In the coupled model, continuum-atomistic, a continuum formulation is retained as the overall framework of the problem and the atomistic feature is introduced by way of constitutive description, with the Cauchy-Born rule establishing the point of contact. The entire formulation is made in the framework of nonlinear elasticity and all the simulations are carried out within the confines of quasistatic settings. The model gives direct account to measurable features of microstructures developed by crystals through sequential lamination.
Understanding human crowd behaviour has been an intriguing topic of interdisciplinary research in recent decades. Modelling of crowd dynamics using differential equations is an indispensable approach to unraveling the various complex dynamics involved in such interacting particle systems. Numerical simulation of pedestrian crowd via these mathematical models allows us to study different realistic scenarios beyond the limitations of studies via controlled experiments.
In this thesis, the main objective is to understand and analyse the dynamics in a domain shared by both pedestrians and moving obstacles. We model pedestrian motion by combining the social force concept with the idea of optimal path computation. This leads to a system of ordinary differential equations governing the dynamics of individual pedestrians via the interaction forces (social forces) between them. Additionally, a non-local force term involving the optimal path and desired velocity governs the pedestrian trajectory. The optimal path computation involves solving a time-independent Eikonal equation, which is coupled to the system of ODEs. A hydrodynamic model is developed from this microscopic model via the mean-field limit.
To consider the interaction with moving obstacles in the domain, we model a set of kinematic equations for the obstacle motion. Two kinds of obstacles are considered - "passive", which move in their predefined trajectories and have only a one-way interaction with pedestrians, and "dynamic", which have a feedback interaction with pedestrians and have their trajectories changing dynamically. The coupled model of pedestrians and obstacles is used to discern pedestrian collision avoidance behaviour in different computational scenarios in a long rectangular domain. We observe that pedestrians avoid collisions through route choice strategies that involve changes in speed and path. We extend this model to consider the interaction between pedestrians and vehicular traffic. We appropriately model the interactions of vehicles, following lane traffic, based on the car-following approach. We observe how the deceleration and braking mechanism of vehicles is executed at pedestrian crossings depending on the right of way on the roads.
As a second objective, we study the disease contagion in moving crowds. We consider the influence of the crowd motion in a complex dynamical environment on the course of infection of pedestrians. A hydrodynamic model for multi-group pedestrian flow is derived from the kinetic equations based on a social force model. It is coupled along with an Eikonal equation to a non-local SEIS contagion model for disease spread. Here, apart from the description of local contacts, the influence of contact times has also been modelled. We observe that the nature of the flow and the geometry of the domain lead to changes in density which affect the contact time and, consequently, the rate of spread of infection.
Finally, the social force model is compared to a variable speed based rational behaviour pedestrian model. We derive a hierarchy of the heuristics-based model from microscopic to macroscopic scales and numerically investigate these models in different density scenarios. Various numerical test cases are considered, including uni- and bi-directional flows and scenarios with and without obstacles. We observe that in low-density scenarios, collision avoidance forces arising from the behavioural heuristics give valid results. Whereas in high-density scenarios, repulsive force terms are essential.
The numerical simulations of all the models are carried out using a mesh-free particle method based on least square approximations. The meshfree numerical framework provides an efficient and elegant way to handle complex geometric situations involving boundaries and stationary or moving obstacles.
This Dissertation tried to provide insights into the influences of individual and contextual factors on Technical and Vocational Education and Training (TVET) teachers’ learning and professional development in Ethiopia. Specifically, this research focused on identifying and determining the influences of teachers’ self perception as learners and professionals, and investigates the impact of the context, process and content of their learning and experiences on their professional development. The knowledge of these factors and their impacts help in improving the learning and professional development of the TVET teachers and their professionalization. This research tried to provide answers for the following five research questions. (1) How do TVET teachers perceive themselves as active learners and as professionals? And what are the implications of their perceptions on their learning and development? (2) How do TVET teachers engage themselves in learning and professional development activities? (3) What contextual factors facilitated or hindered the TVET Teachers’ learning and professional development? (4) Which competencies are found critical for the TVET teachers’ learning and professional development? (5) What actions need to be considered to enhance and sustain TVET teachers learning and professional development in their context? It is believed that the research results are significant not only to the TVET teachers, but also to schools leaders, TVET Teacher Training Institutions, education experts and policy makers, researchers and others stakeholders in the TVET sector. The theoretical perspectives adopted in this research are based on the systemic constructivist approach to professional development. An integrated approach to professional development requires that the teachers’ learning and development activities to be taken as an adult education based on the principles of constructivism. Professional development is considered as context - specific and long-term process in which teachers are trusted, respected and empowered as professionals. Teachers’ development activities are sought as more of collaborative activities portraying the social nature of learning. Schools that facilitate the learning and development of teachers exhibit characteristics of a learning organisation culture where, professional collaboration, collegiality and shared leadership are practiced. This research has drawn also relevant point of views from studies and reports on vocational education and TVET teacher education programs and practices at international, continental and national levels. The research objectives and the types of research questions in this study implied the use of a qualitative inductive research approach as a research strategy. Primary data were collected from TVET teachers in four schools using a one-on-one qualitative in-depth interview method. These data were analyzed using a Qualitative Content Analysis method based on the inductive category development procedure. ATLAS.ti software was used for supporting the coding and categorization process. The research findings showed that most of the TVET teachers neither perceive themselves as professionals nor as active learners. These perceptions are found to be one of the major barriers to their learning and development. Professional collaborations in the schools are minimal and teaching is sought as an isolated individual activity; a secluded task for the teacher. Self-directed learning initiatives and individual learning projects are not strongly evident. The predominantly teacher-centered approach used in TVET teacher education and professional development programs put emphasis mainly to the development of technical competences and has limited the development of a range of competences essential to teachers’ professional development. Moreover, factors such as the TVET school culture, the society’s perception of the teaching profession, economic conditions, and weak links with industries and business sectors are among the major contextual factors that hindered the TVET teachers’ learning and professional development. A number of recommendations are forwarded to improve the professional development of the TVET teachers. These include change in the TVET schools culture, a paradigm shift in TVET teacher education approach and practice, and development of educational policies that support the professionalization of TVET teachers. Areas for further theoretical research and empirical enquiry are also suggested to support the learning and professional development of the TVET teachers in Ethiopia.
Manipulating deformable linear objects - Vision-based recognition of contact state transitions -
(1999)
A new and systematic approach to machine vision-based robot manipulation of deformable (non-rigid) linear objects is introduced. This approach reduces the computational needs by using a simple state-oriented model of the objects. These states describe the relation of the object with respect to an obstacle and are derived from the object image and its features. Therefore, the object is segmented from a standard video frame using a fast segmentation algorithm. Several object features are presented which allow the state recognition of the object while being manipulated by the robot.
A new and systematic basic approach to force- and vision-based robot manipulation of deformable (non-rigid) linear objects is introduced. This approach reduces the computational needs by using a simple state-oriented model of the objects. These states describe the relation between the deformable and rigid obstacles, and are derived from the object image and its features. We give an enumeration of possible contact states and discuss the main characteristics of each state. We investigate the performance of robust transitions between the contact states and derive criteria and conditions for each of the states and for two sensor systems, i.e. a vision sensor and a force/torque sensor. This results in a new and task-independent approach in regarding the handling of deformable objects and in a sensor-based implementation of manipulation primitives for industrial robots. Thus, the usage of sensor processing is an appropriate solution for our problem. Finally, we apply the concept of contact states and state transitions to the description of a typical assembly task. Experimental results show the feasibility of our approach: A robot performs several contact state transitions which can be combined for solving a more complex task.
A geoscientifically relevant wavelet approach is established for the classical (inner) displacement problem corresponding to a regular surface (such as sphere, ellipsoid, actual earth's surface). Basic tools are the limit and jump relations of (linear) elastostatics. Scaling functions and wavelets are formulated within the framework of the vectorial Cauchy-Navier equation. Based on appropriate numerical integration rules a pyramid scheme is developed providing fast wavelet transform (FWT). Finally multiscale deformation analysis is investigated numerically for the case of a spherical boundary.
The focus of this work has been to develop two families of wavelet solvers for the inner displacement boundary-value problem of elastostatics. Our methods are particularly suitable for the deformation analysis corresponding to geoscientifically relevant (regular) boundaries like sphere, ellipsoid or the actual Earth's surface. The first method, a spatial approach to wavelets on a regular (boundary) surface, is established for the classical (inner) displacement problem. Starting from the limit and jump relations of elastostatics we formulate scaling functions and wavelets within the framework of the Cauchy-Navier equation. Based on numerical integration rules a tree algorithm is constructed for fast wavelet computation. This method can be viewed as a first attempt to "short-wavelength modelling", i.e. high resolution of the fine structure of displacement fields. The second technique aims at a suitable wavelet approximation associated to Green's integral representation for the displacement boundary-value problem of elastostatics. The starting points are tensor product kernels defined on Cauchy-Navier vector fields. We come to scaling functions and a spectral approach to wavelets for the boundary-value problems of elastostatics associated to spherical boundaries. Again a tree algorithm which uses a numerical integration rule on bandlimited functions is established to reduce the computational effort. For numerical realization for both methods, multiscale deformation analysis is investigated for the geoscientifically relevant case of a spherical boundary using test examples. Finally, the applicability of our wavelet concepts is shown by considering the deformation analysis of a particular region of the Earth, viz. Nevada, using surface displacements provided by satellite observations. This represents the first step towards practical applications.
In this work the investigation of a (Ti, Al, Si) N system was done. The main point of investigation was to study the possibility of getting the nanocomposite coatings structures by deposition of multilayer films from TiN, AlSiN, . This tries to understand the relation between the mechanical properties (hardness, Young s modulus), and the microstructure (nanocrystalline with individual phases). Particularly special attention was given to the temperature effects on microstructural changes in annealing at 600 °C for the coatings. The surface hardness, elastic modulus, and the multilayers diffusion and compositions were the test tools for the comparison between the different coated samples with and without annealing at 600 °C. To achieve this object a rectangular aluminum vacuum chamber with three unbalanced sputtering magnetrons for the deposition of thin film coatings from different materials was constructed The chamber consists mainly of two chambers, the pre-vacuum chamber to load the workpiece, and the main vacuum chamber where the sputtering deposition of the thin film coatings take place. The workpiece is moving on a car travel on a railway between the two chambers to the position of the magnetrons by step motors. The chambers are divided by a self constructed rectangular gate controlled manually from outside the chamber. The chamber was sealed for vacuum use using glue and screws. Therefore, different types of glue were tested not only for its ability to develop an uniform thin layer in the gap between the aluminum plates to seal the chamber for vacuum use, but also low outgassing rates which made it suitable for vacuum use. A epoxy was able to fulfill this tasks. The evacuation characteristics of the constructed chamber was improved by minimizing the inner surface outgassing rate. Therefore, the throughput outgassing rate test method was used in the comparisons between the selected two aluminum materials (A2017 and A5353) samples short time period (one hour) outgassing rates. Different machining methods and treatments for the inner surface of the vacuum chamber were tested. The machining of the surface of material A (A2017) with ethanol as coolant fluid was able to reduce its outgassing rate a factor of 6 compared with a non-machined sample surface of the same material. The reduction of the surface porous oxide layer on the top of the aluminum surface by the pickling process with HNO3 acid, and the protection of it by producing another passive non-porous oxides layer using anodizing process will protect the surface for longer time and will minimize the outgassing rates even under humid atmosphere The residual gas analyzer (RGA) 6. Summary test shows that more than 85% of the gases inside the test chamber were water vapour (H2O) and the rests are (N2, H2, CO), so liquid nitrogen water vapor trap can enhance the chamber pumping down process. As a result it was possible to construct a chamber that can be pumped down using a turbo molecular pump (450 L/s) to the range of 1x10-6 mbar within one hour of evacuations where the chamber volume is 160 Litters and the inner surface area is 1.6 m2. This is a good base pressure for the process of sputtering deposition of hard thin film coatings. Multilayer thin film coating was deposited to demonstrate that nanostructured thin film within the (Ti, Al, Si) N system could be prepared by reactive magnetron sputtering of multi thin film layers of TiN, AlSiN. The (SNMS) spectrometry of the test samples show that a complete diffusion between the different deposited thin film coating layers in each sample takes place, even at low substrate deposition temperature. The high magnetic flux of the unbalanced magnetrons and the high sputtering power were able to produce a high ion-toatom flux, which give high mobility to the coated atoms. The interactions between the high mobility of the coated atoms and the ion-to-atom flux were sufficient to enhance the diffusion between the different deposited thin layers. It was shown from the XRD patterns for this system that the structure of the formed mixture consists of two phases. One phase is noted as TiN bulk and another detected unknown amorphous phase, which can be SiNx or AlN or a combination of Ti-Al-Si-N. As a result we where able to deposit a nanocomposite coatings by the deposition of multilayers from TiN, AlSiN thin film coatings using the constructed vacuum chamber
Self-adaptation allows software systems to autonomously adjust their behavior during run-time by handling all possible
operating states that violate the requirements of the managed system. This requires an adaptation engine that receives adaptation
requests during the monitoring process of the managed system and responds with an automated and appropriate adaptation
response. During the last decade, several engineering methods have been introduced to enable self-adaptation in software systems.
However, these methods lack addressing (1) run-time uncertainty that hinders the adaptation process and (2) the performance
impacts resulted from the complexity and the large number of the adaptation space. This paper presents CRATER, a framework
that builds an external adaptation engine for self-adaptive software systems. The adaptation engine, which is built on Case-based
Reasoning, handles the aforementioned challenges together. This paper is braced with an experiment illustrating the benefits of
this framework. The experimental results shows the potential of CRATER in terms handling run-time uncertainty and adaptation
remembrance that enhances the performance for large number of adaptation space.
Postmortem Analysis of Decayed Online Social Communities: Cascade Pattern Analysis and Prediction
(2018)
Recently, many online social networks, such as MySpace, Orkut, and Friendster, have faced inactivity decay of their members, which contributed to the collapse of these networks. The reasons, mechanics, and prevention mechanisms of such inactivity decay are not fully understood. In this work, we analyze decayed and alive subwebsites from the Stack Exchange platform. The analysis mainly focuses on the inactivity cascades that occur among the members of these communities. We provide measures to understand the decay process and statistical analysis to extract the patterns that accompany the inactivity decay. Additionally, we predict cascade size and cascade virality using machine learning. The results of this work include a statistically significant difference of the decay patterns between the decayed and the alive subwebsites. These patterns are mainly cascade size, cascade virality, cascade duration, and cascade similarity. Additionally, the contributed prediction framework showed satisfactorily prediction results compared to a baseline predictor. Supported by empirical evidence, the main findings of this work are (1) there are significantly different decay patterns in the alive and the decayed subwebsites of the Stack Exchange; (2) the cascade’s node degrees contribute more to the decay process than the cascade’s virality, which indicates that the expert members of the Stack Exchange subwebsites were mainly responsible for the activity or inactivity of the Stack Exchange subwebsites; (3) the Statistics subwebsite is going through decay dynamics that may lead to it becoming fully-decayed; (4) the decay process is not governed by only one network measure, it is better described using multiple measures; (5) decayed subwebsites were originally less resilient to inactivity decay, unlike the alive subwebsites; and (6) network’s structure in the early stages of its evolution dictates the activity/inactivity characteristics of the network.
Learning From Networked-data: Methods and Models for Understanding Online Social Networks Dynamics
(2020)
Abstract
Nowadays, people and systems created by people are generating an unprecedented amount of
data. This data has brought us data-driven services with a variety of applications that affect
people’s behavior. One of these applications is the emergent online social networks as a method
for communicating with each other, getting and sharing information, looking for jobs, and many
other things. However, the tremendous growth of these online social networks has also led to many
new challenges that need to be addressed. In this context, the goal of this thesis is to better understand
the dynamics between the members of online social networks from two perspectives. The
first perspective is to better understand the process and the motives underlying link formation in
online social networks. We utilize external information to predict whether two members of an online
social network are friends or not. Also, we contribute a framework for assessing the strength of
friendship ties. The second perspective is to better understand the decay dynamics of online social
networks resulting from the inactivity of their members. Hence, we contribute a model, methods,
and frameworks for understanding the decay mechanics among the members, for predicting members’
inactivity, and for understanding and analyzing inactivity cascades occurring during the decay.
The results of this thesis are: (1) The link formation process is at least partly driven by interactions
among members that take place outside the social network itself; (2) external interactions might
help reduce the noise in social networks and for ranking the strength of the ties in these networks;
(3) inactivity dynamics can be modeled, predicted, and controlled using the models contributed in
this thesis, which are based on network measures. The contributions and the results of this thesis
can be beneficial in many respects. For example, improving the quality of a social network by introducing
new meaningful links and removing noisy ones help to improve the quality of the services
provided by the social network, which, e.g., enables better friend recommendations and helps to
eliminate fake accounts. Moreover, understanding the decay processes involved in the interaction
among the members of a social network can help to prolong the engagement of these members. This
is useful in designing more resilient social networks and can assist in finding influential members
whose inactivity may trigger an inactivity cascade resulting in a potential decay of a network.
Building interoperation among separately developed software units requires checking their conceptual assumptions and constraints. However, eliciting such assumptions and constraints is time consuming and is a challenging task as it requires analyzing each of the interoperating software units. To address this issue we proposed a new conceptual interoperability analysis approach which aims at decreasing the analysis cost and the conceptual mismatches between the interoperating software units. In this report we present the design of a planned controlled experiment for evaluating the effectiveness, efficiency, and acceptance of our proposed conceptual interoperability analysis approach. The design includes the study objectives, research questions, statistical hypotheses, and experimental design. It also provides the materials that will be used in the execution phase of the planned experiment.
Tracking waterborne microplastic (MP) in urban areas is a challenging task because of the various sources and transport pathways involved. Since MP occurs in low concentrations in most wastewater and stormwater streams, large sample volumes need to be captured, prepared, and carefully analyzed. The recent research in urban areas focused mainly on MP emissions at wastewater treatment plants (WWTPs), as obvious entry points into receiving waters. However, important transport pathways under wet-weather conditions are yet not been investigated thoroughly. In addition, the lack of comprehensive and comparable sampling strategies complicated the attempts for a deeper understanding of occurrence and sources. The goal of this paper is to (i) introduce and describe sampling strategies for MP at different locations in a municipal catchment area under dry and wet-weather conditions, (ii) quantify MP emissions from the entire catchment and two other smaller ones within the bigger catchment, and (iii) compare the emissions under dry and wet-weather conditions. WWTP has a high removal rate of MP (>96%), with an estimated emission rate of 189 kg/a or 0.94 g/[population equivalents (PEQ · a)], and polyethylene (PE) as the most abundant MP. The specific dry-weather emissions at a subcatchment were ≈30 g/(PEQ · a) higher than in the influent of WWTP with 23 g/(PEQ · a). Specific wet-weather emissions from large sub-catchment with higher traffic and population densities were 1952 g/(ha · a) higher than the emissions from smaller catchment (796 g/[ha · a]) with less population and traffic. The results suggest that wet-weather transport pathways are likely responsible for 2–4 times more MP emissions into receiving waters compared to dry-weather ones due to tire abrasion entered from streets through gullies. However, more investigations of wet-weather MP need to be carried out considering additional catchment attributes and storm event characteristics.
Typically software engineers implement their software according to the design of the software
structure. Relations between classes and interfaces such as method-call relations and inheritance
relations are essential parts of a software structure. Accordingly, analyzing several types of
relations will benefit the static analysis process of the software structure. The tasks of this
analysis include but not limited to: understanding of (legacy) software, checking guidelines,
improving product lines, finding structure, or re-engineering of existing software. Graphs with
multi-type edges are possible representation for these relations considering them as edges, while
nodes represent classes and interfaces of software. Then, this multiple type edges graph can
be mapped to visualizations. However, the visualizations should deal with the multiplicity of
relations types and scalability, and they should enable the software engineers to recognize visual
patterns at the same time.
To advance the usage of visualizations for analyzing the static structure of software systems,
I tracked difierent development phases of the interactive multi-matrix visualization (IMMV)
showing an extended user study at the end. Visual structures were determined and classified
systematically using IMMV compared to PNLV in the extended user study as four categories:
High degree, Within-package edges, Cross-package edges, No edges. In addition to these structures
that were found in these handy tools, other structures that look interesting for software
engineers such as cycles and hierarchical structures need additional visualizations to display
them and to investigate them. Therefore, an extended approach for graph layout was presented
that improves the quality of the decomposition and the drawing of directed graphs
according to their topology based on rigorous definitions. The extension involves describing
and analyzing the algorithms for decomposition and drawing in detail giving polynomial time
complexity and space complexity. Finally, I handled visualizing graphs with multi-type edges
using small-multiples, where each tile is dedicated to one edge-type utilizing the topological
graph layout to highlight non-trivial cycles, trees, and DAGs for showing and analyzing the
static structure of software. Finally, I applied this approach to four software systems to show
its usefulness.
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 thesis, we have dealt with two modeling approaches of the credit risk, namely the structural (firm value) and the reduced form. In the former one, the firm value is modeled by a stochastic process and the first hitting time of this stochastic process to a given boundary defines the default time of the firm. In the existing literature, the stochastic process, triggering the firm value, has been generally chosen as a diffusion process. Therefore, on one hand it is possible to obtain closed form solutions for the pricing problems of credit derivatives and on the other hand the optimal capital structure of a firm can be analysed by obtaining closed form solutions of firm's corporate securities such as; equity value, debt value and total firm value, see Leland(1994). We have extended this approach by modeling the firm value as a jump-diffusion process. The choice of the jump-diffusion process was a crucial step to obtain closed form solutions for corporate securities. As a result, we have chosen a jump-diffusion process with double exponentially distributed jump heights, which enabled us to analyse the effects of jump on the optimal capital structure of a firm. In the second part of the thesis, by following the reduced form models, we have assumed that the default is triggered by the first jump of a Cox process. Further, by following Schönbucher(2005), we have modeled the forward default intensity of a firm as a geometric Brownian motion and derived pricing formulas for credit default swap options in a more general setup than the ones in Schönbucher(2005).
This paper deals with the handling of deformable linear objects (DLOs), such as hoses, wires, or leaf springs. It investigates usable features for the vision-based detection of a changing contact situation between a DLO and a rigid polyhedral obstacle and a classification of such contact state transitions. The result is a complete classification of contact state transitions and of the most significant features for each class. This knowledge enables reliable detection of changes in the DLO contact situation, facilitating implementation of sensor-based manipulation skills for all possible contact changes.
In this paper we study the possibilities of sharing profit in combinatorial procurement auctions and exchanges. Bundles of heterogeneous items are offered by the sellers, and the buyers can then place bundle bids on sets of these items. That way, both sellers and buyers can express synergies between items and avoid the well-known risk of exposure (see, e.g., [3]). The reassignment of items to participants is known as the Winner Determination Problem (WDP). We propose solving the WDP by using a Set Covering formulation, because profits are potentially higher than with the usual Set Partitioning formulation, and subsidies are unnecessary. The achieved benefit is then to be distributed amongst the participants of the auction, a process which is known as profit sharing. The literature on profit sharing provides various desirable criteria. We focus on three main properties we would like to guarantee: Budget balance, meaning that no more money is distributed than profit was generated, individual rationality, which guarantees to each player that participation does not lead to a loss, and the core property, which provides every subcoalition with enough money to keep them from separating. We characterize all profit sharing schemes that satisfy these three conditions by a monetary flow network and state necessary conditions on the solution of the WDP for the existence of such a profit sharing. Finally, we establish a connection to the famous VCG payment scheme [2, 8, 19], and the Shapley Value [17].
In 2006 Jeffrey Achter proved that the distribution of divisor class groups of degree 0 of function fields with a fixed genus and the distribution of eigenspaces in symplectic similitude groups are closely related to each other. Gunter Malle proposed that there should be a similar correspondence between the distribution of class groups of number fields and the distribution of eigenspaces in ceratin matrix groups. Motivated by these results and suggestions we study the distribution of eigenspaces corresponding to the eigenvalue one in some special subgroups of the general linear group over factor rings of rings of integers of number fields and derive some conjectural statements about the distribution of \(p\)-parts of class groups of number fields over a base field \(K_{0}\). Where our main interest lies in the case that \(K_{0}\) contains the \(p\)th roots of unity, because in this situation the \(p\)-parts of class groups seem to behave in an other way like predicted by the popular conjectures of Henri Cohen and Jacques Martinet. In 2010 based on computational data Malle has succeeded in formulating a conjecture in the spirit of Cohen and Martinet for this case. Here using our investigations about the distribution in matrixgroups we generalize the conjecture of Malle to a more abstract level and establish a theoretical backup for these statements.
Acidic zeolites like H-Y, H-ZSM-5, H-MCM-22 and H-MOR zeolites were found to be the selective adsorbents for the removal of thiophene from toluene or n-heptane as solvent. The competitive adsorption of toluene is found to influence the adsorption capacity for thiophene and is more predominant when high-alumina zeolites are used as adsorbents. This behaviour is also reflected by the results of the adsorption of thiophene on H-ZSM-5 zeolites with varied nSi/nAl ratios (viz. 13, 19 and 36) from toluene and n-heptane as solvents, respectively. UV-Vis spectroscopic results show that the oligomerization of thiophene leads to the formation of dimers and trimers on these zeolites. The oligomerization in acid zeolites is regarded to be dependent on the geometry of the pore system of the zeolites. The sulphur-containing compounds with more than one ring viz. benzothiophene, which are also present in substantial amounts in certain hydrocarbon fractions, are not adsorbed on H-ZSM-5 zeolites. This is obvious, as the diameter of the pore aperture of zeolite H-ZSM-5 is smaller than the molecular size of benzothiophene. Metal ion-exchanged FAU-type zeolites are found to be promising adsorbents for the removal of sulphur-containing compounds from model solutions. The introduction of Cu+-, Ni2+-, Ce3+-, La3+- and Y3+- ions into zeolite Na+-Y by aqueous ion-exchange substantially improves the adsorption capacity for thiophene from toluene or n-heptane as solvent. More than the absolute content of Cu+-ions, the presence of Cu+-ions at the sites exposed to supercages is believed to influence the adsorption of thiophene on Cu+-Y zeolite. It was shown experimentally for the case of Cu+-Y and Ce3+-Y that the supercages present in the FAU zeolite allow for an access of bulkier sulphur-containing compounds (viz. benzothiophene, dibenzothiophene and dimethyl dibenzothiophene). The presence of these bulkier compounds compete with thiophene and are preferentially adsorbed on Cu+-Y zeolite. IR spectroscopic results revealed that the adsorption of thiophene on Na+-Y, Cu+-Y and Ni2+-Y is primarily a result of the interaction of thiophene via pi-complexation between C=C double bond (of thiophene) and metal ions (in the zeolite framework). A different mode of interaction of thiophene with Ce3+-, La3+- and Y3+-metal ions was observed in the IR spectra of thiophene adsorbed on Ce3+-Y, La3+-Y and Y3+-Y zeolites, respectively. On these adsorbents, thiophene is believed to interact via a lone electron pair of the sulphur atom with metal ions present in the adsorbent (M-S interaction). The experimental results show that there is a large difference in the thiophene adsorption capacities of pi-complexation adsorbents (like Cu+-Y, Ni2+-Y) between the model solution with toluene as solvent and the model solution with n-heptane as solvent. The lower capacity of these zeolites for the adsorption of thiophene from toluene than from n-heptane as solvent is the clear indication of competition of toluene in interating with adsorbent in a way similar to thiophene. The difference in thiophene adsorption capacities is very low in the case of adsorbents Ce3+-Y, La3+-Y and Y3+-Y, which are believed to interact with thiophene predominantly by direct M3+-S bond (thiophene interacting with metal ion via a lone pair of electrons). TG-DTA analysis was used to study the regeneration behaviour of the adsorbents. Acid zeolites can be regenerated by simply heating at 400 °C in a flow of nitrogen whereas thiophene is chemically adsorbed on the metal ion. By contrast, it is not possible to regenerate by heating under idle inert gas flow. The only way to regenerate these adsorbents is to burn off the adsorbate, which eventually brings about an undesired emission of SOx. The exothermic peaks appeared at different temperatures in the heat flow profiles of Cu+-Y, Ce3+-Y, La3+-Y and Y3+-Y are also indicating that two different types of interaction are present as revealed by IR spectroscopy, too. One major difficulty in reducing the sulphur content in fuels to value below 10 ppm is the inability in removing alkyl dibenzothiophenes, viz. 4,6 dimethyl dibenzothiophene, by the existing catalytic hydrodesulphurization technique. Cu+-Y and Ce3+-Y were found in the present study to adsorb this compound from toluene to a certain extent. To meet the stringent regulations on sulphur content, selective adsorption by zeolites could be a valuable post-purification method after the catalytic hydrodesulphurization unit.
Highly Automated Driving (HAD) vehicles represent complex and safety critical systems. They are deployed in an open context i.e., an intricate environment which undergoes continual changes. The complexity of these systems and insufficiencies in sensing and understanding the open context may result in unsafe and uncertain behaviour. The safety critical nature of the HAD vehicles requires modelling of root causes for unsafe behaviour and their mitigation to argue sufficient reduction of residual risk.
Standardization activities such as ISO 21448 provide guidelines on the Safety Of The Intended Functionality (SOTIF) and focus on the analysis of performance limitations under the influence of triggering conditions that can lead to hazardous behaviour. SOTIF references traditional safety analyses methods e.g., Failure Mode and Effect Analysis (FMEA) and Fault Tree Analysis (FTA) to perform safety analysis. These analyses methods are based on certain assumptions e.g., single point failure in FMEA and independence of basic events in FTA. Moreover, these analyses are generally based on expert knowledge i.e., data-based models or hybrid approaches (expert and data) are seldom practised. The resulting safety model is fixed i.e., it is generally seen as a one-time artefact. Open context environment may contain triggering conditions which may not be evident to the expert. Open context also evolves over time and new phenomena may emerge.
This thesis explores the applicability of the traditional safety analyses techniques to provide safety models for HAD vehicles operating in the open context, under the light of modelling assumptions taken by traditional safety analyses techniques. Moreover, incorporating uncertainties into safety analyses models is also explored. An explicit distinction between the inherent uncertainty of a probabilistic event (aleatory) and uncertainty due to lack of knowledge (epistemic) is made to formalize models to perform SOTIF analysis. A further distinction is made for conditions of complete ignorance and termed as ontological uncertainty. The distinction is important as for HAD vehicles operating in open context the ontological uncertainty can never be completely disregarded.
This thesis proposes a novel framework of SOTIF to model, estimate and dis cover triggering conditions relevant to performance limitations. The framework provides the ability to model uncertainties while also providing a hybrid approach i.e., supporting inclusion of expert knowledge as well as data driven engineering processes. Two representative algorithms are provided to support the framework. Bayesian Network (BN) and p-value hypothesis testing are utilised in this regard. The framework is implemented on a real-world case study in which LIDARs based perception systems are used as vehicle detection system.
Dealing with information in modern times involves users to cope with hundreds of thousands of documents, such as articles, emails, Web pages, or News feeds.
Above all information sources, the World Wide Web presents information seekers with great challenges.
It offers more text in natural language than one is capable to read.
The key idea for this research intends to provide users with adaptable filtering techniques, supporting them in filtering out the specific information items they need.
Its realization focuses on developing an Information Extraction system,
which adapts to a domain of concern, by interpreting the contained formalized knowledge.
Utilizing the Resource Description Framework (RDF), which is the Semantic Web's formal language for exchanging information,
allows extending information extractors to incorporate the given domain knowledge.
Because of this, formal information items from the RDF source can be recognized in the text.
The application of RDF allows a further investigation of operations on recognized information items, such as disambiguating and rating the relevance of these.
Switching between different RDF sources allows changing the application scope of the Information Extraction system from one domain of concern to another.
An RDF-based Information Extraction system can be triggered to extract specific kinds of information entities by providing it with formal RDF queries in terms of the SPARQL query language.
Representing extracted information in RDF extends the coverage of the Semantic Web's information degree and provides a formal view on a text from the perspective of the RDF source.
In detail, this work presents the extension of existing Information Extraction approaches by incorporating the graph-based nature of RDF.
Hereby, the pre-processing of RDF sources allows extracting statistical information models dedicated to support specific information extractors.
These information extractors refine standard extraction tasks, such as the Named Entity Recognition, by using the information provided by the pre-processed models.
The post-processing of extracted information items enables representing these results in RDF format or lists, which can now be ranked or filtered by relevance.
Post-processing also comprises the enrichment of originating natural language text sources with extracted information items by using annotations in RDFa format.
The results of this research extend the state-of-the-art of the Semantic Web.
This work contributes approaches for computing customizable and adaptable RDF views on the natural language content of Web pages.
Finally, due to the formal nature of RDF, machines can interpret these views allowing developers to process the contained information in a variety of applications.
Dynamics of Excited Electrons in Copper and Ferromagnetic Transition Metals: Theory and Experiment
(2000)
Both theoretical and experimental results for the dynamics of photoexcited electrons at surfaces of Cu and the ferromagnetic transition metals Fe, Co, and Ni are presented. A model for the dynamics of excited electrons is developed, which is based on the Boltzmann equation and includes effects of photoexcitation, electron-electron scattering, secondary electrons (cascade and Auger electrons), and transport of excited carriers out of the detection region. From this we determine the time-resolved two-photon photoemission (TR-2PPE). Thus a direct comparison of calculated relaxation times with experimental results by means of TR-2PPE becomes possible. The comparison indicates that the magnitudes of the spin-averaged relaxation time t and of the ratio t_up/t_down of majority and minority relaxation times for the different ferromagnetic transition metals result not only from density-of-states effects, but also from different Coulomb matrix elements M. Taking M_Fe > M_Cu > M_Ni = M_Co we get reasonable agreement with experiments.
Hardware Contention-Aware Real-Time Scheduling on Multi-Core Platforms in Safety-Critical Systems
(2019)
While the computing industry has shifted from single-core to multi-core processors for performance gain, safety-critical systems (SCSs) still require solutions that enable their transition while guaranteeing safety, requiring no source-code modifications and substantially reducing re-development and re-certification costs, especially for legacy applications that are typically substantial. This dissertation considers the problem of worst-case execution time (WCET) analysis under contentions when deadline-constrained tasks in independent partitioned task set execute on a homogeneous multi-core processor with dynamic time-triggered shared memory bandwidth partitioning in SCSs.
Memory bandwidth in multi-core processors is shared across cores and is a significant cause of performance bottleneck and temporal variability of multiple-orders in task’s execution times due to contentions in memory sub-system. Further, the circular dependency is not only between WCET and CPU scheduling of others cores, but also between WCET and memory bandwidth assignments over time to cores. Thus, there is need of solutions that allow tailoring memory bandwidth assignments to workloads over time and computing safe WCET. It is pragmatically infeasible to obtain WCET estimates from static WCET analysis tools for multi-core processors due to the sheer computational complexity involved.
We use synchronized periodic memory servers on all cores that regulate each core’s maximum memory bandwidth based on allocated bandwidth over time. First, we present a workload schedulability test for known even-memory-bandwidth-assignment-to-active-cores over time, where the number of active cores represents the cores with non-zero memory bandwidth assignment. Its computational complexity is similar to merge-sort. Second, we demonstrate using a real avionics certified safety-critical application how our method’s use can preserve an existing application’s single-core CPU schedule under contentions on a multi-core processor. It enables incremental certification using composability and requires no-source code modification.
Next, we provide a general framework to perform WCET analysis under dynamic memory bandwidth partitioning when changes in memory bandwidth to cores assignment are time-triggered and known. It provides a stall maximization algorithm that has a complexity similar to a concave optimization problem and efficiently implements the WCET analysis. Last, we demonstrate dynamic memory assignments and WCET analysis using our method significantly improves schedulability compared to the stateof-the-art using an Integrated Modular Avionics scenario.
In this paper we consider the stochastic primitive equation for geophysical flows subject to transport noise and turbulent pressure. Admitting very rough noise terms, the global existence and uniqueness of solutions to this stochastic partial differential equation are proven using stochastic maximal
-regularity, the theory of critical spaces for stochastic evolution equations, and global a priori bounds. Compared to other results in this direction, we do not need any smallness assumption on the transport noise which acts directly on the velocity field and we also allow rougher noise terms. The adaptation to Stratonovich type noise and, more generally, to variable viscosity and/or conductivity are discussed as well.
Abstract
The main theme of this thesis is about Graph Coloring Applications and Defining Sets in Graph Theory.
As in the case of block designs, finding defining sets seems to be difficult problem, and there is not a general conclusion. Hence we confine us here to some special types of graphs like bipartite graphs, complete graphs, etc.
In this work, four new concepts of defining sets are introduced:
• Defining sets for perfect (maximum) matchings
• Defining sets for independent sets
• Defining sets for edge colorings
• Defining set for maximal (maximum) clique
Furthermore, some algorithms to find and construct the defining sets are introduced. A review on some known kinds of defining sets in graph theory is also incorporated, in chapter 2 the basic definitions and some relevant notations used in this work are introduced.
chapter 3 discusses the maximum and perfect matchings and a new concept for a defining set for perfect matching.
Different kinds of graph colorings and their applications are the subject of chapter 4.
Chapter 5 deals with defining sets in graph coloring. New results are discussed along with already existing research results, an algorithm is introduced, which enables to determine a defining set of a graph coloring.
In chapter 6, cliques are discussed. An algorithm for the determination of cliques using their defining sets. Several examples are included.
Hydrogels are known to be covalently or ionic cross-linked, hydrophilic three-dimensional
polymer networks, which exist in our bodies in a biological gel form such as the vitreous
humour that fills the interior of the eyes. Poly(N-isopropylacrylamide) (poly(NIPAAm))
hydrogels are attracting more interest in biomedical applications because, besides others, they
exhibit a well-defined lower critical solution temperature (LCST) in water, around 31–34°C,
which is close to the body temperature. This is considered to be of great interest in drug
delivery, cell encapsulation, and tissue engineering applications. In this work, the
poly(NIPAAm) hydrogel is synthesized by free radical polymerization. Hydrogel properties
and the dimensional changes accompanied with the volume phase transition of the
thermosensitive poly(NIPAAm) hydrogel were investigated in terms of Raman spectra,
swelling ratio, and hydration. The thermal swelling/deswelling changes that occur at different
equilibrium temperatures and different solutions (phenol, ethanol, propanol, and sodium
chloride) based on Raman spectrum were investigated. In addition, Raman spectroscopy has
been employed to evaluate the diffusion aspects of bovine serum albumin (BSA) and phenol
through the poly(NIPAAm) network. The determination of the mutual diffusion coefficient,
\(D_{mut}\) for hydrogels/solvent system was achieved successfully using Raman spectroscopy at
different solute concentrations. Moreover, the mechanical properties of the hydrogel, which
were investigated by uniaxial compression tests, were used to characterize the hydrogel and to
determine the collective diffusion coefficient through the hydrogel. The solute release coupled
with shrinking of the hydrogel particles was modelled with a bi-dimensional diffusion model
with moving boundary conditions. The influence of the variable diffusion coefficient is
observed and leads to a better description of the kinetic curve in the case of important
deformation around the LCST. A good accordance between experimental and calculated data
was obtained.
Optical Character Recognition (OCR) system plays an important role in digitization of data acquired as images from a variety of sources. Although the area is very well explored for Latin languages, some of the languages based on Arabic cursive script are not yet explored. It is due to many factors: Most importantly are the unavailability of proper data sets and complexities posed by cursive scripts. The Pashto language is one of such languages which needs considerable exploration towards OCR. In order to develop such an OCR system, this thesis provides a pioneering study that explores deep learning for the Pashto language in the field of OCR.
The Pashto language is spoken by more than $50$ million people across the world, and it is an active medium both for oral as well as written communication. It is associated with rich literary heritage and contains huge written collection. These written materials present contents of simple to complex nature, and layouts from hand-scribed to printed text. The Pashto language presents mainly two types of complexities (i) generic w.r.t. cursive script, (ii) specific w.r.t. Pashto language. Generic complexities are cursiveness, context dependency, and breaker character anomalies, as well as space anomalies. Pashto specific complexities are variations in shape for a single character and shape similarity for some of the additional Pashto characters. Existing research in the area of Arabic OCR did not lead to an end-to-end solution for the mentioned complexities and therefore could not be generalized to build a sophisticated OCR system for Pashto.
The contribution of this thesis spans in three levels, conceptual level, data level, and practical level. In the conceptual level, we have deeply explored the Pashto language and identified those characters, which are responsible for the challenges mentioned above. In the data level, a comprehensive dataset is introduced containing real images of hand-scribed contents. The dataset is manually transcribed and has the most frequent layout patterns associated with the Pashto language. The practical level contribution provides a bridge, in the form of a complete Pashto OCR system, and connects the outcomes of the conceptual and data levels contributions. The practical contribution comprises of skew detection, text-line segmentation, feature extraction, classification, and post-processing. The OCR module is more strengthened by using deep learning paradigm to recognize Pashto cursive script by the framework of Recursive Neural Networks (RNN). Proposed Pashto text recognition is based on Long Short-Term Memory Network (LSTM) and realizes a character recognition rate of $90.78\%$ on Pashto real hand-scribed images. All these contributions are integrated into an application to provide a flexible and generic End-to-End Pashto OCR system.
The impact of this thesis is not only specific to the Pashto language, but it is also beneficial to other cursive languages like Arabic, Urdu, and Persian e.t.c. The main reason is the Pashto character set, which is a superset of Arabic, Persian, and Urdu languages. Therefore, the conceptual contribution of this thesis provides insight and proposes solutions to almost all generic complexities associated with Arabic, Persian, and Urdu languages. For example, an anomaly caused by breaker characters is deeply analyzed, which is shared among 70 languages, mainly use Arabic script. This thesis presents a solution to this issue and is equally beneficial to almost all Arabic like languages.
The scope of this thesis has two important aspects. First, a social impact, i.e., how a society may benefit from it. The main advantages are to bring the historical and almost vanished document to life and to ensure the opportunities to explore, analyze, translate, share, and understand the contents of Pashto language globally. Second, the advancement and exploration of the technical aspects. Because, this thesis empirically explores the recognition and challenges which are solely related to the Pashto language, both regarding character-set and the materials which present such complexities. Furthermore, the conceptual and practical background of this thesis regarding complexities of Pashto language is very beneficial regarding OCR for other cursive languages.
This thesis presents a novel, generic framework for information segmentation in document images.
A document image contains different types of information, for instance, text (machine printed/handwritten), graphics, signatures, and stamps.
It is necessary to segment information in documents so that to process such segmented information only when required in automatic document processing workflows.
The main contribution of this thesis is the conceptualization and implementation of an information segmentation framework that is based on part-based features.
The generic nature of the presented framework makes it applicable to a variety of documents (technical drawings, magazines, administrative, scientific, and academic documents) digitized using different methods (scanners, RGB cameras, and hyper-spectral imaging (HSI) devices).
A highlight of the presented framework is that it does not require large training sets, rather a few training samples (for instance, four pages) lead to high performance, i.e., better than previously existing methods.
In addition, the presented framework is simple and can be adapted quickly to new problem domains.
This thesis is divided into three major parts on the basis of document digitization method (scanned, hyper-spectral imaging, and camera captured) used.
In the area of scanned document images, three specific contributions have been realized.
The first of them is in the domain of signature segmentation in administrative documents.
In some workflows, it is very important to check the document authenticity before processing the actual content.
This can be done based on the available seal of authenticity, e.g., signatures.
However, signature verification systems expect pre-segmented signature image, while signatures are usually a part of document.
To use signature verification systems on document images, it is necessary to first segment signatures in documents.
This thesis shows that the presented framework can be used to segment signatures in administrative documents.
The system based on the presented framework is tested on a publicly available dataset where it outperforms the state-of-the-art methods and successfully segmented all signatures, while less than half of the found signatures are false positives.
This shows that it can be applied for practical use.
The second contribution in the area of scanned document images is segmentation of stamps in administrative documents.
A stamp also serves as a seal for documents authenticity.
However, the location of stamp on the document can be more arbitrary than a signature depending on the person sealing the document.
This thesis shows that a system based on our generic framework is able to extract stamps of any arbitrary shape and color.
The evaluation of the presented system on a publicly available dataset shows that it is also able to segment black stamps (that were not addressed in the past) with a recall and precision of 83% and 73%, respectively.
%Furthermore, to segment colored stamps, this thesis presents a novel feature set which is based on intensity gradient, is able to extract unseen, colored, arbitrary shaped, textual as well as graphical stamps, and outperforms the state-of-the-art methods.
The third contribution in the scanned document images is in the domain of information segmentation in technical drawings (architectural floorplans, maps, circuit diagrams, etc.) containing usually a large amount of graphics and comparatively less textual components. Further, as in technical drawings, text is overlapping with graphics.
Thus, automatic analysis of technical drawings uses text/graphics segmentation as a pre-processing step.
This thesis presents a method based on our generic information segmentation framework that is able to detect the text, which is touching graphical components in architectural floorplans and maps.
Evaluation of the method on a publicly available dataset of architectural floorplans shows that it is able to extract almost all touching text components with precision and recall of 71% and 95%, respectively.
This means that almost all of the touching text components are successfully extracted.
In the area of hyper-spectral document images, two contributions have been realized.
Unlike normal three channels RGB images, hyper-spectral images usually have multiple channels that range from ultraviolet to infrared regions including the visible region.
First, this thesis presents a novel automatic method for signature segmentation from hyper-spectral document images (240 spectral bands between 400 - 900 nm).
The presented method is based on a part-based key point detection technique, which does not use any structural information, but relies only on the spectral response of the document regardless of ink color and intensity.
The presented method is capable of segmenting (overlapping and non-overlapping) signatures from varying backgrounds like, printed text, tables, stamps, logos, etc.
Importantly, the presented method can extract signature pixels and not just the bounding boxes.
This is substantial when signatures are overlapping with text and/or other objects in image. Second, this thesis presents a new dataset comprising of 300 documents scanned using a high-resolution hyper-spectral scanner. Evaluation of the presented signature segmentation method on this hyper-spectral dataset shows that it is able to extract signature pixels with the precision and recall of 100% and 79%, respectively.
Further contributions have been made in the area of camera captured document images. A major problem in the development of Optical Character Recognition (OCR) systems for camera captured document images is the lack of labeled camera captured document images datasets. In the first place, this thesis presents a novel, generic, method for automatic ground truth generation/labeling of document images. The presented method builds large-scale (i.e., millions of images) datasets of labeled camera captured / scanned documents without any human intervention. The method is generic and can be used for automatic ground truth generation of (scanned and/or camera captured) documents in any language, e.g., English, Russian, Arabic, Urdu. The evaluation of the presented method, on two different datasets in English and Russian, shows that 99.98% of the images are correctly labeled in every case.
Another important contribution in the area of camera captured document images is the compilation of a large dataset comprising 1 million word images (10 million character images), captured in a real camera-based acquisition environment, along with the word and character level ground truth. The dataset can be used for training as well as testing of character recognition systems for camera-captured documents. Various benchmark tests are performed to analyze the behavior of different open source OCR systems on camera captured document images. Evaluation results show that the existing OCRs, which already get very high accuracies on scanned documents, fail on camera captured document images.
Using the presented camera-captured dataset, a novel character recognition system is developed which is based on a variant of recurrent neural networks, i.e., Long Short Term Memory (LSTM) that outperforms all of the existing OCR engines on camera captured document images with an accuracy of more than 95%.
Finally, this thesis provides details on various tasks that have been performed in the area closely related to information segmentation. This includes automatic analysis and sketch based retrieval of architectural floor plan images, a novel scheme for online signature verification, and a part-based approach for signature verification. With these contributions, it has been shown that part-based methods can be successfully applied to document image analysis.
The advent of heterogeneous many-core systems has increased the spectrum
of achievable performance from multi-threaded programming. As the processor components become more distributed, the cost of synchronization and
communication needed to access the shared resources increases. Concurrent
linearizable access to shared objects can be prohibitively expensive in a high
contention workload. Though there are various mechanisms (e.g., lock-free
data structures) to circumvent the synchronization overhead in linearizable
objects, it still incurs performance overhead for many concurrent data types.
Moreover, many applications do not require linearizable objects and apply
ad-hoc techniques to eliminate synchronous atomic updates.
In this thesis, we propose the Global-Local View Model. This programming model exploits the heterogeneous access latencies in many-core systems.
In this model, each thread maintains different views on the shared object: a
thread-local view and a global view. As the thread-local view is not shared,
it can be updated without incurring synchronization costs. The local updates
become visible to other threads only after the thread-local view is merged
with the global view. This scheme improves the performance at the expense
of linearizability.
Besides the weak operations on the local view, the model also allows strong
operations on the global view. Combining operations on the global and the
local views, we can build data types with customizable consistency semantics
on the spectrum between sequential and purely mergeable data types. Thus
the model provides a framework that captures the semantics of Multi-View
Data Types. We discuss a formal operational semantics of the model. We
also introduce a verification method to verify the correctness of the implementation of several multi-view data types.
Frequently, applications require updating shared objects in an “all-or-nothing” manner. Therefore, the mechanisms to synchronize access to individual objects are not sufficient. Software Transactional Memory (STM)
is a mechanism that helps the programmer to correctly synchronize access to
multiple mutable shared data by serializing the transactional reads and writes.
But under high contention, serializable transactions incur frequent aborts and
limit parallelism, which can lead to severe performance degradation.
Mergeable Transactional Memory (MTM), proposed in this thesis, allows accessing multi-view data types within a transaction. Instead of aborting
and re-executing the transaction, MTM merges its changes using the data-type
specific merge semantics. Thus it provides a consistency semantics that allows
for more scalability even under contention. The evaluation of our prototype
implementation in Haskell shows that mergeable transactions outperform serializable transactions even under low contention while providing a structured
and type-safe interface.
Towards A Non-tracking Web
(2016)
Today, many publishers (e.g., websites, mobile application developers) commonly use third-party analytics services and social widgets. Unfortunately, this scheme allows these third parties to track individual users across the web, creating privacy concerns and leading to reactions to prevent tracking via blocking, legislation and standards. While improving user privacy, these efforts do not consider the functionality third-party tracking enables publishers to use: to obtain aggregate statistics about their users and increase their exposure to other users via online social networks. Simply preventing third-party tracking without replacing the functionality it provides cannot be a viable solution; leaving publishers without essential services will hurt the sustainability of the entire ecosystem.
In this thesis, we present alternative approaches to bridge this gap between privacy for users and functionality for publishers and other entities. We first propose a general and interaction-based third-party cookie policy that prevents third-party tracking via cookies, yet enables social networking features for users when wanted, and does not interfere with non-tracking services for analytics and advertisements. We then present a system that enables publishers to obtain rich web analytics information (e.g., user demographics, other sites visited) without tracking the users across the web. While this system requires no new organizational players and is practical to deploy, it necessitates the publishers to pre-define answer values for the queries, which may not be feasible for many analytics scenarios (e.g., search phrases used, free-text photo labels). Our second system complements the first system by enabling publishers to discover previously unknown string values to be used as potential answers in a privacy-preserving fashion and with low computation overhead for clients as well as servers. These systems suggest that it is possible to provide non-tracking services with (at least) the same functionality as today’s tracking services.
We present a constructive theory for locally supported approximate identities on the unit ball in \(\mathbb{R}^3\). The uniform convergence of the convolutions of the derived kernels with an arbitrary continuous function \(f\) to \(f\), i.e. the defining property of an approximate identity, is proved. Moreover, an explicit representation for a class of such kernels is given. The original publication is available at www.springerlink.com
We consider a linearized kinetic BGK equation and the associated acoustic system on a network.
Coupling conditions for the macroscopic equations are derived from the kinetic conditions via an asymptotic analysis near the nodes of the network.
This analysis leads to the consideration of a fixpoint problem involving the solutions of kinetic half-space problems.
This work extends the procedure developed in [13], where coupling conditions for a simplified BGK model have been derived.
Numerical comparisons between different coupling conditions
confirm the accuracy of the proposed approximation.
This research work focuses on the generation of a high resolution digital surface model featuring complex urban surface characteristics in order to enrich the database for runoff simulations of urban drainage systems. The discussion of global climate change and its possible consequences have taken centre stage over the last decade. Global climate change has triggered more erratic weather patterns by causing severe and unpredictable rainfall events in many parts of the world. The incidence of more frequent rainfall has led to the problem of increased flooding in urban areas. The increased property values of urban structures and threats to people's personal safety have hastened the demand for a detailed urban drainage simulation model for accurate flood prediction. Although the use of 2D hydraulic modelling approach in rural floodplains is in practice for quite a long time, the use of the same approach in urban floodplains is still in its infancy. The reason is mainly due to the lack of a high resolution topographic model describing urban surface characteristics properly.
High resolution surface data describing hydrologic and hydraulic properties of complex urban areas are the prerequisite to more accurately describing and simulating the flood water movement and thereby taking adequate measures against urban flooding. Airborne LiDAR (Light detection and ranging) is an efficient way of generating a high resolution Digital Surface Model (DSM) of any study area. The processing of high-density and large volume of unstructured LiDAR data is a difficult and time-consuming task towards generating fine resolution spatial databases when considering only human intervention. The application of robust algorithms in terms of processing this massive volume of data can significantly reduce the data processing time and thereby increase the degree of automation as well as accuracy.
This research work presents a number of techniques pertaining to processing, filtering and classification of LiDAR point data in order to achieve higher degree of automation and accuracy towards generating a high resolution urban surface model. This research work also describes the use of ancillary datasets such as aerial images and topographic maps in combination with LiDAR data for feature detection and surface characterization. The integration of various data sources facilitates detailed modelling of street networks and accurate detection of various urban surface types (e.g. grasslands, bare soil and impervious surfaces).
While the accurate characterization of various surface types contributes to the better modelling of rainfall runoff processes, the application of LiDAR-derived fine resolution DSM serves as input to 2D hydraulic models and capable of simulating surface flooding scenarios in cases the sewer systems are surcharged.
Thus, this research work develops high resolution spatial databases aiming at improving the accuracy of hydrologic and hydraulic databases of urban drainage systems. Later, these databases are given as input to a standard flood simulation software in order to: 1) test the suitability of the databases for running the simulation; 2) assess the performance of the hydraulic capacity of urban drainage systems and 3) predict and visualize the surface flooding scenarios in order to take necessary flood protection measures.
The goal of this work is to develop statistical natural language models and processing techniques
based on Recurrent Neural Networks (RNN), especially the recently introduced Long Short-
Term Memory (LSTM). Due to their adapting and predicting abilities, these methods are more
robust, and easier to train than traditional methods, i.e., words list and rule-based models. They
improve the output of recognition systems and make them more accessible to users for browsing
and reading. These techniques are required, especially for historical books which might take
years of effort and huge costs to manually transcribe them.
The contributions of this thesis are several new methods which have high-performance computing and accuracy. First, an error model for improving recognition results is designed. As
a second contribution, a hyphenation model for difficult transcription for alignment purposes
is suggested. Third, a dehyphenation model is used to classify the hyphens in noisy transcription. The fourth contribution is using LSTM networks for normalizing historical orthography.
A size normalization alignment is implemented to equal the size of strings, before the training
phase. Using the LSTM networks as a language model to improve the recognition results is
the fifth contribution. Finally, the sixth contribution is a combination of Weighted Finite-State
Transducers (WFSTs), and LSTM applied on multiple recognition systems. These contributions
will be elaborated in more detail.
Context-dependent confusion rules is a new technique to build an error model for Optical
Character Recognition (OCR) corrections. The rules are extracted from the OCR confusions
which appear in the recognition outputs and are translated into edit operations, e.g., insertions,
deletions, and substitutions using the Levenshtein edit distance algorithm. The edit operations
are extracted in a form of rules with respect to the context of the incorrect string to build an
error model using WFSTs. The context-dependent rules assist the language model to find the
best candidate corrections. They avoid the calculations that occur in searching the language
model and they also make the language model able to correct incorrect words by using context-
dependent confusion rules. The context-dependent error model is applied on the university of
Washington (UWIII) dataset and the Nastaleeq script in Urdu dataset. It improves the OCR
results from an error rate of 1.14% to an error rate of 0.68%. It performs better than the
state-of-the-art single rule-based which returns an error rate of 1.0%.
This thesis describes a new, simple, fast, and accurate system for generating correspondences
between real scanned historical books and their transcriptions. The alignment has many challenges, first, the transcriptions might have different modifications, and layout variations than the
original book. Second, the recognition of the historical books have misrecognition, and segmentation errors, which make the alignment more difficult especially the line breaks, and pages will
not have the same correspondences. Adapted WFSTs are designed to represent the transcription. The WFSTs process Fraktur ligatures and adapt the transcription with a hyphenations
model that allows the alignment with respect to the varieties of the hyphenated words in the line
breaks of the OCR documents. In this work, several approaches are implemented to be used for
the alignment such as: text-segments, page-wise, and book-wise approaches. The approaches
are evaluated on German calligraphic (Fraktur) script historical documents dataset from “Wan-
derungen durch die Mark Brandenburg” volumes (1862-1889). The text-segmentation approach
returns an error rate of 2.33% without using a hyphenation model and an error rate of 2.0%
using a hyphenation model. Dehyphenation methods are presented to remove the hyphen from
the transcription. They provide the transcription in a readable and reflowable format to be used
for alignment purposes. We consider the task as classification problem and classify the hyphens
from the given patterns as hyphens for line breaks, combined words, or noise. The methods are
applied on clean and noisy transcription for different languages. The Decision Trees classifier
returns better performance on UWIII dataset and returns an accuracy of 98%. It returns 97%
on Fraktur script.
A new method for normalizing historical OCRed text using LSTM is implemented for different texts, ranging from Early New High German 14th - 16th centuries to modern forms in New
High German applied on the Luther bible. It performed better than the rule-based word-list
approaches. It provides a transcription for various purposes such as part-of-speech tagging and
n-grams. Also two new techniques are presented for aligning the OCR results and normalize the
size by using adding Character-Epsilons or Appending-Epsilons. They allow deletion and insertion in the appropriate position in the string. In normalizing historical wordforms to modern
wordforms, the accuracy of LSTM on seen data is around 94%, while the state-of-the-art combined rule-based method returns 93%. On unseen data, LSTM returns 88% and the combined
rule-based method returns 76%. In normalizing modern wordforms to historical wordforms, the
LSTM delivers the best performance and returns 93.4% on seen data and 89.17% on unknown
data.
In this thesis, a deep investigation has been done on constructing high-performance language
modeling for improving the recognition systems. A new method to construct a language model
using LSTM is designed to correct OCR results. The method is applied on UWIII and Urdu
script. The LSTM approach outperforms the state-of-the-art, especially for unseen tokens
during training. On the UWIII dataset, the LSTM returns reduction in OCR error rates from
1.14% to 0.48%. On the Nastaleeq script in Urdu dataset, the LSTM reduces the error rate
from 6.9% to 1.58%.
Finally, the integration of multiple recognition outputs can give higher performance than a
single recognition system. Therefore, a new method for combining the results of OCR systems is
explored using WFSTs and LSTM. It uses multiple OCR outputs and votes for the best output
to improve the OCR results. It performs better than the ISRI tool, Pairwise of Multiple Sequence and it helps to improve the OCR results. The purpose is to provide correct transcription
so that it can be used for digitizing books, linguistics purposes, N-grams, and part-of-speech
tagging. The method consists of two alignment steps. First, two recognition systems are aligned
using WFSTs. The transducers are designed to be more flexible and compatible with the different symbols in line and page breaks to avoid the segmentation and misrecognition errors.
The LSTM model then is used to vote the best candidate correction of the two systems and
improve the incorrect tokens which are produced during the first alignment. The approaches
are evaluated on OCRs output from the English UWIII and historical German Fraktur dataset
which are obtained from state-of-the-art OCR systems. The Experiments show that the error
rate of ISRI-Voting is 1.45%, the error rate of the Pairwise of Multiple Sequence is 1.32%, the
error rate of the Line-to-Page alignment is 1.26% and the error rate of the LSTM approach has
the best performance with 0.40%.
The purpose of this thesis is to contribute methods providing correct transcriptions corresponding to the original book. This is considered to be the first step towards an accurate and
more effective use of the documents in digital libraries.
One of the biggest social issues in mature societies such as Europe and Japan
is the aging population and declining birth rate. These societies have a serious
problem with the retirement of the expert workers, doctors, and engineers etc.
Especially in the sectors that require long time to make experts in fields like medicine and industry; the retirement and injuries of the experts, is a serious problem. The technology to support the training and assessment of skilled workers (like doctors, manufacturing
workers) is strongly required for the society. Although there are some solutions for
this problem, most of them are video-based which violates the privacy of the subjects.
Furthermore, they are not easy to deploy due to the need for large training data.
This thesis provides a novel framework to recognize, analyze, and assess human
skills with minimum customization cost. The presented framework tackles this problem
in two different domains, industrial setup and medical operations of catheter-based
cardiovascular interventions (CBCVI).
In particular, the contributions of this thesis are four-fold. First, it proposes an
easy-to-deploy framework for human activity recognition based on zero-shot learning
approach, which is based on learning basic actions and objects. The model recognizes
unseen activities by combinations of basic actions learned in a preliminary way and involved objects. Therefore, it is completely configurable by the user and can be used to detect completely new activities.
Second, a novel gaze-estimation model for attention driven object detection task is
presented. The key features of the model are: (i) usage of the deformable convolutional
layers to better incorporate spatial dependencies of different shapes of objects and
backgrounds, (ii) formulation of the gaze-estimation problem in two different way, as a
classification as well as a regression problem. We combine both formulations using a
joint loss that incorporates both the cross-entropy as well as the mean-squared error in
order to train our model. This enhanced the accuracy of the model from 6.8 by using only
the cross-entropy loss to 6.4 for the joint loss.
The third contribution of this thesis targets the area of quantification of quality of
i
actions using wearable sensor. To address the variety of scenarios, we have targeted two
possibilities: a) both expert and novice data is available , b) only expert data is available,
a quite common case in safety critical scenarios.
Both of the developed methods from these scenarios are deep learning based. In the
first one, we use autoencoders with OneClass SVM, and in the second one we use the
Siamese Networks. These methods allow us to encode the expert’s expertise and to learn
the differences between novice and expert workers. This enables quantification of the
performance of the novice in comparison to the expert worker.
The fourth contribution, explicitly targets medical practitioners and provides a
methodology for novel gaze-based temporal spatial analysis of CBCVI data. The developed
methodology allows continuous registration and analysis of gaze data for analysis
of the visual X-ray image processing (XRIP) strategies of expert operators in live-cases scenarios and may assist in transferring experts’ reading skills to novices.
Numerical Algorithms in Algebraic Geometry with Implementation in Computer Algebra System SINGULAR
(2011)
Polynomial systems arise in many applications: robotics, kinematics, chemical kinetics,
computer vision, truss design, geometric modeling, and many others. Many polynomial
systems have solutions sets, called algebraic varieties, having several irreducible
components. A fundamental problem of the numerical algebraic geometry is to decompose
such an algebraic variety into its irreducible components. The witness point sets are
the natural numerical data structure to encode irreducible algebraic varieties.
Sommese, Verschelde and Wampler represented the irreducible algebraic decomposition of
an affine algebraic variety \(X\) as a union of finite disjoint sets \(\cup_{i=0}^{d}W_i=\cup_{i=0}^{d}\left(\cup_{j=1}^{d_i}W_{ij}\right)\) called numerical irreducible decomposition. The \(W_i\) correspond to the pure i-dimensional components, and the \(W_{ij}\) represent the i-dimensional irreducible components. The numerical irreducible decomposition is implemented in BERTINI.
We modify this concept using partially Gröbner bases, triangular sets, local dimension, and
the so-called zero sum relation. We present in the second chapter the corresponding
algorithms and their implementations in SINGULAR. We give some examples and timings,
which show that the modified algorithms are more efficient if the number of variables is not
too large. For a large number of variables BERTINI is more efficient.
Leykin presented an algorithm to compute the embedded components of an algebraic variety
based on the concept of the deflation of an algebraic variety.
Depending on the modified algorithm mentioned above, we will present in the third chapter an
algorithm and its implementation in SINGULAR to compute the embedded components.
The irreducible decomposition of algebraic varieties allows us to formulate in the fourth
chapter some numerical algebraic algorithms.
In the last chapter we present two SINGULAR libraries. The first library is used to compute
the numerical irreducible decomposition and the embedded components of an algebraic variety.
The second library contains the procedures of the algorithms in the last Chapter to test
inclusion, equality of two algebraic varieties, to compute the degree of a pure i-dimensional
component, and the local dimension.
The Context and Its Importance: In safety and reliability analysis, the information generated by Minimal Cut Set (MCS) analysis is large.
The Top Level event (TLE) that is the root of the fault tree (FT) represents a hazardous state of the system being analyzed.
MCS analysis helps in analyzing the fault tree (FT) qualitatively-and quantitatively when accompanied with quantitative measures.
The information shows the bottlenecks in the fault tree design leading to identifying weaknesses of the system being examined.
Safety analysis (containing the MCS analysis) is especially important for critical systems, where harm can be done to the environment or human causing injuries, or even death during the system usage.
Minimal Cut Set (MCS) analysis is performed using computers and generating a lot of information.
This phase is called MCS analysis I in this thesis.
The information is then analyzed by the analysts to determine possible issues and to improve the design of the system regarding its safety as early as possible.
This phase is called MCS analysis II in this thesis.
The goal of my thesis was developing interactive visualizations to support MCS analysis II of one fault tree (FT).
The Methodology: As safety visualization-in this thesis, Minimal Cut Set analysis II visualization-is an emerging field and no complete checklist regarding Minimal Cut Set analysis II requirements and gaps were available from the perspective of visualization and interaction capabilities,
I have conducted multiple studies using different methods with different data sources (i.e., triangulation of methods and data) for determining these requirements and gaps before developing and evaluating visualizations and interactions supporting Minimal Cut Set analysis II.
Thus, the following approach was taken in my thesis:
1- First, a triangulation of mixed methods and data sources was conducted.
2- Then, four novel interactive visualizations and one novel interaction widget were developed.
3- Finally, these interactive visualizations were evaluated both objectively and subjectively (compared to multiple safety tools)
from the point of view of users and developers of the safety tools that perform MCS analysis I with respect to their degree in supporting MCS analysis II and from the point of non-domain people using empirical strategies.
The Spiral tool supports analysts with different visions, i.e., full vision, color deficiency protanopia, deuteranopia, and tritanopia. It supports 100 out of 103 (97%) requirements obtained from the triangulation and it fills 37 out of 39 (95%) gaps. Its usability was rated high (better than their best currently used tools) by the users of the safety and reliability tools (RiskSpectrum, ESSaRel, FaultTree+, and a self-developed tool) and at least similar to the best currently used tools from the point of view of the CAFTA tool developers. Its quality was higher regarding its degree of supporting MCS analysis II compared to the FaultTree+ tool. The time spent for discovering the critical MCSs from a problem size of 540 MCSs (with a worst case of all equal order) was less than a minute while achieving 99.5% accuracy. The scalability of the Spiral visualization was above 4000 MCSs for a comparison task. The Dynamic Slider reduces the interaction movements up to 85.71% of the previous sliders and solves the overlapping thumb issues by the sliders provides the 3D model view of the system being analyzed provides the ability to change the coloring of MCSs according to the color vision of the user provides selecting a BE (i.e., multi-selection of MCSs), thus, can observe the BEs' NoO and provides its quality provides two interaction speeds for panning and zooming in the MCS, BE, and model views provide a MCS, a BE, and a physical tab for supporting the analysis starting by the MCSs, the BEs, or the physical parts. It combines MCS analysis results and the model of an embedded system enabling the analysts to directly relate safety information with the corresponding parts of the system being analyzed and provides an interactive mapping between the textual information of the BEs and MCSs and the parts related to the BEs.
Verifications and Assessments: I have evaluated all visualizations and the interaction widget both objectively and subjectively, and finally evaluated the final Spiral visualization tool also both objectively and subjectively regarding its perceived quality and regarding its degree of supporting MCS analysis II.
This research explores the development of web based reference software for
characterisation of surface roughness for two-dimensional surface data. The reference software used for verification of surface characteristics makes the evaluation methods easier for clients. The algorithms used in this software
are based on International ISO standards. Most software used in industrial measuring
instruments may give variations in the parameters calculated due to numerical changes in
calculation. Such variations can be verified using the proposed reference software.
The evaluation of surface roughness is carried out in four major steps: data capture, data
align, data filtering and parameter calculation. This work walks through each of these steps
explaining how surface profiles are evaluated by pre-processing steps called fitting and
filtering. The analysis process is then followed by parameter evaluation according to DIN EN
ISO 4287 and DIN EN ISO 13565-2 standards to extract important information from the
profile to characterise surface roughness.
Aflatoxins, a group of mycotoxins produced by various mold species within the genus Aspergillus, have been extensively investigated for their potential to contaminate food and feed, rendering them unfit for consumption. Nevertheless, the role of aflatoxins as environmental contaminants in soil, which represents their natural habitat, remains a relatively unexplored area in aflatoxin research. This knowledge gap can be attributed, in part, to the methodological challenges associated with detecting aflatoxins in soil. The main objective of this PhD project was to develop and validate an analytical method that allows monitoring of aflatoxins in soil, and scrutinize the mechanisms and extent of occurrence of aflatoxins in soil, the processes governing their dissipation, and their impact on the soil microbiome and associated soil functions. By utilizing an efficient extraction solvent mixture comprising acetonitrile and water, coupled with an ultrasonication step, recoveries of 78% to 92% were achieved, enabling reliable determination of trace levels in soil ranging from 0.5 to 20 µg kg-1. However, in a field trial conducted in a high-risk model region for aflatoxin contamination in Sub-Saharan Africa, no aflatoxins were detected using this procedure, underscoring the complexities of field monitoring. These challenges encompassed rapid degradation, spatial heterogeneity, and seasonal fluctuations in aflatoxin occurrence. Degradation experiments revealed the importance of microbial and photochemical processes in the dissipation of aflatoxins in soil with half-lives of 20 - 65 days. The rate of dissipation was found to be influenced by soil properties, most notably soil texture and the initial concentration of aflatoxins in the soil. An exposure study provided evidence that aflatoxins do not pose a substantial threat to the soil microbiome, encompassing microbial biomass, activity, and catabolic functionality. This was particularly evident in clayey soils, where the toxicity of aflatoxins diminished significantly due to their strong binding to clay minerals. However, several critical questions remain unanswered, emphasizing the necessity for further research to attain a more comprehensive understanding of the ecological importance of aflatoxins. Future research should prioritize the challenges associated with field monitoring of aflatoxins, elucidate the mechanisms responsible for the dissipation of aflatoxins in soil during microbial and photochemical degradation, and investigate the ecological consequences of aflatoxins in regions heavily affected by aflatoxins, taking into account the interactions between aflatoxins and environmental and anthropogenic stressors. Addressing these questions contributes to a comprehensive understanding of the environmental impact of aflatoxins in soil, ultimately contributing to more effective strategies for aflatoxin management in agriculture.
LinTim is a scientific software toolbox that has been under development since 2007, giving the possibility to solve the various planning steps in public transportation. Although the name originally derives from "Lineplanning and Timetabling", the available functions have grown far beyond this scope.
This document is the documentation for version 2020.02.
For more information, see https://www.lintim.net
Simulation of Particle Interaction with Surface Microdefects during Cold Gas-Dynamic Spraying
(2022)
The cold gas-dynamic spray (CGDS) technique is utilized for repairing processes of a
large number of metallic components in mechanical and process engineering, such as bridges or
vehicles. Fine particles impacting on the component surface can be severely deformed and penetrate
into the defects, filling and coating them, resulting in possible protection against corrosion or crack
propagation. This work focuses on the investigation of the impact behavior of cold sprayed particles
with the wall surface having microdefects in the form of cavities. The collision of fine single particles
with the substrate, both made from AISI 1045 steel, was simulated with the finite element method
(FEM) using the Johnson–Cook failure model. The impact phenomena of particles on different
microdefect geometries were obtained and compared with the collision on a smooth surface. The
particle diameter and defect were varied to investigate the influence of the size on the deformation
behaviour. The different impact scenarios result in different temperature and stress distributions in
the contact zone, penetration and deformation behavior during the collision.
In these notes we will discuss some aspects of a problem arising in carindustry. For the sake of clarity we will set the problem into an extremely simplified scheme. Suppose that we have a body which is emitting sound, and that the sound is measured at a finite number of points around the body. We wish to determine the intensity of the sound at an observation point which is moving.
Using molecular dynamics simulation, we study the cutting of an Fe single crystal using
tools with various rake angles α. We focus on the (110)[001] cut system, since here, the crystal
plasticity is governed by a simple mechanism for not too strongly negative rake angles. In this
case, the evolution of the chip is driven by the generation of edge dislocations with the Burgers
vector b = 1
2
[111], such that a fixed shear angle of φ = 54.7◦
is established. It is independent of
the rake angle of the tool. The chip form is rectangular, and the chip thickness agrees with the
theoretical result calculated for this shear angle from the law of mass conservation. We find that the
force angle χ between the direction of the force and the cutting direction is independent of the rake
angle; however, it does not obey the predictions of macroscopic cutting theories, nor the correlations
observed in experiments of (polycrystalline) cutting of mild steel. Only for (strongly) negative rake
angles, the mechanism of plasticity changes, leading to a complex chip shape or even suppressing the
formation of a chip. In these cases, the force angle strongly increases while the friction angle tends
to zero.
A growing share of all software development project work is being done by geographically distributed teams. To satisfy shorter product design cycles, expert team members for a development project may need to be r ecruited globally. Yet to avoid extensive travelling or r eplacement costs, distributed project work is preferred. Current-generation software engineering tools and ass ociated systems, processes, and methods were for the most part developed to be used within a single enterprise. Major innovations have lately been introduced to enable groupware applications on the Internet to support global collaboration. However, their deployment for distributed software projects requires further research. In partic ular, groupware methods must seamlessly be integrated with project and product management systems to make them attractive for industry. In this position paper we outline the major challenges concerning distributed (virtual) software projects. Based on our experiences with software process modeling and enactment environments, we then propose approaches to solve those challenges.
This doctoral dissertation is comprised of nine published articles covering different
methods for ‘Fast, Robust Rigid and Non-Rigid Registration for Globally Consistent
3D Scene and Shape Reconstruction’. Overall the contributing articles are separated
and discussed in three stages – The first part of the thesis i.e., chapter 2 explains
three novel method classes of rigid point set registration namely Gravitational Approach (GA), Fast Gravitational Approach (FGA), and RPSRNet. GA was introduced as the first physics-based rigid point set registration. It includes elegant modeling of rigid by dynamics using Newtonian mechanics. The method proposed many new avenues for other types of pattern matching tasks thank point set registration. Next, FGA method, published 4 years after GA presented as an extension that breaks the algorithmic complexity of GA from O(M N ) to O(M log N ) using Barnes-Hut tree representation of point cloud. It also eliminates the requirement of heuristic optimization parameter settings by GA, and achieve state-of-the-art alignment accuracy on LiDAR odometry. Finally, RPSRNet presents deep learning version of FGA, with custom convolution layers for hierarchical point feature embedding. RPSRNet is robust and the fastest among SoA methods for LiDAR data registration. The second part, i.e., chapter 3, of the thesis introduces NRGA as the fist physics-based non-rigid point set
registration method which is computationally slow but robust against noisy and partial inputs. NRGA preserves structural consistency as it coherently regularize motion of deformable vertices. For articulated hand shape reconstruction, a tailored version of NRGA -- Articulated-NRGA -- is effective to refine final hand shape. Collision and penetration avoidance between source and target surfaces are tackled by constrained optimization in NRGA. This setting has improved hand and object interaction reconstruction. Next contribution FoldMatch method remodels the shape deformation by introducing wrinkle vector field (WVF) for capturing complex clothing and garment details while fitting body models onto 3D Scans. Quantitative evaluation of FoldMatch and NRGA shows their effectiveness in geometrically consistent surface modeling and reconstruction tasks. Finally, the third part of the thesis explains globally consistent outdoor scene reconstruciton, odometry estimation, and uncertainty guided pose-graph optimization in a novel LiDAR-based localization and map building method, called Deep Evidential LiDAR Odometry (DELO). This is the first Odometry method to use predictive uncertainty modeling for sensor pose prediction network.
Tropical intersection theory
(2010)
This thesis consists of five chapters: Chapter 1 contains the basics of the theory and is essential for the rest of the thesis. Chapters 2-5 are to a large extent independent of each other and can be read separately. - Chapter 1: Foundations of tropical intersection theory In this first chapter we set up the foundations of a tropical intersection theory covering many concepts and tools of its counterpart in algebraic geometry such as affine tropical cycles, Cartier divisors, morphisms of tropical cycles, pull-backs of Cartier divisors, push-forwards of cycles and an intersection product of Cartier divisors and cycles. Afterwards, we generalize these concepts to abstract tropical cycles and introduce a concept of rational equivalence. Finally, we set up an intersection product of cycles and prove that every cycle is rationally equivalent to some affine cycle in the special case that our ambient cycle is R^n. We use this result to show that rational and numerical equivalence agree in this case and prove a tropical Bézout's theorem. - Chapter 2: Tropical cycles with real slopes and numerical equivalence In this chapter we generalize our definitions of tropical cycles to polyhedral complexes with non-rational slopes. We use this new definition to show that if our ambient cycle is a fan then every subcycle is numerically equivalent to some affine cycle. Finally, we restrict ourselves to cycles in R^n that are "generic" in some sense and study the concept of numerical equivalence in more detail. - Chapter 3: Tropical intersection products on smooth varieties We define an intersection product of tropical cycles on tropical linear spaces L^n_k and on other, related fans. Then, we use this result to obtain an intersection product of cycles on any "smooth" tropical variety. Finally, we use the intersection product to introduce a concept of pull-backs of cycles along morphisms of smooth tropical varieties and prove that this pull-back has all expected properties. - Chapter 4: Weil and Cartier divisors under tropical modifications First, we introduce "modifications" and "contractions" and study their basic properties. After that, we prove that under some further assumptions a one-to-one correspondence of Weil and Cartier divisors is preserved by modifications. In particular we can prove that on any smooth tropical variety we have a one-to-one correspondence of Weil and Cartier divisors. - Chapter 5: Chern classes of tropical vector bundles We give definitions of tropical vector bundles and rational sections of tropical vector bundles. We use these rational sections to define the Chern classes of such a tropical vector bundle. Moreover, we prove that these Chern classes have all expected properties. Finally, we classify all tropical vector bundles on an elliptic curve up to isomorphisms.
Determination of interaction between MCT1 and CAII via a mathematical and physiological approach
(2008)
The enzyme carbonic anhydrase isoform II (CAII), catalysing the hydration and dehydration of CO2, enhances transport activity of the monocarboxylate transporter isoform I (MCT1, SLC16A1) expressed in Xenopus oocytes by a mechanism that does not require CAII catalytic activity (Becker et al. (2005) J. Biol. Chem., 280). In the present study, we have investigated the mechanism of the CAII induced increase in transport activity by using electrophysiological techniques and a mathematical model of the MCT1 transport cycle. The model consists of six states arranged in cyclic fashion and features an ordered, mirror-symmetric, binding mechanism were binding and unbinding of the proton to the transport protein is considered to be the rate limiting step under physiological conditions. An explicit rate expression for the substrate °ux is derived using model reduction techniques. By treating the pools of intra- and extracellular MCT1 substrates as dynamic states, the time dependent kinetics are obtained by integration using the derived expression for the substrate °ux. The simulations were compared with experimental data obtained from MCT1-expressing oocytes injected with di®erent amounts of CAII. The model suggests that CAII increases the e®ective rate constants of the proton reactions, possibly by working as a proton antenna.
Information Visualization (InfoVis) and Human-Computer Interaction (HCI) have strong ties with each other. Visualization supports the human cognitive system by providing interactive and meaningful images of the underlying data. On the other side, the HCI domain cares about the usability of the designed visualization from the human perspectives. Thus, designing a visualization system requires considering many factors in order to achieve the desired functionality and the system usability. Achieving these goals will help these people in understanding the inside behavior of complex data sets in less time.
Graphs are widely used data structures to represent the relations between the data elements in complex applications. Due to the diversity of this data type, graphs have been applied in numerous information visualization applications (e.g., state transition diagrams, social networks, etc.). Therefore, many graph layout algorithms have been proposed in the literature to help in visualizing this rich data type. Some of these algorithms are used to visualize large graphs, while others handle the medium sized graphs. Regardless of the graph size, the resulting layout should be understandable from the users’ perspective and at the same time it should fulfill a list of aesthetic criteria to increase the representation readability. Respecting these two principles leads to produce a resulting graph visualization that helps the users in understanding and exploring the complex behavior of critical systems.
In this thesis, we utilize the graph visualization techniques in modeling the structural and behavioral aspects of embedded systems. Furthermore, we focus on evaluating the resulting representations from the users’ perspectives.
The core contribution of this thesis is a framework, called ESSAVis (Embedded Systems Safety Aspect Visualizer). This framework visualizes not only some of the safety aspects (e.g. CFT models) of embedded systems, but also helps the engineers and experts in analyzing the system safety critical situations. For this, the framework provides a 2Dplus3D environment in which the 2D represents the graph representation of the abstract data about the safety aspects of the underlying embedded system while the 3D represents the underlying system 3D model. Both views are integrated smoothly together in the 3D world fashion. In order to check the effectiveness and feasibility of the framework and its sub-components, we conducted many studies with real end users as well as with general users. Results of the main study that targeted the overall ESSAVis framework show high acceptance ratio and higher accuracy with better performance using the provided visual support of the framework.
The ESSAVis framework has been designed to be compatible with different 3D technologies. This enabled us to use the 3D stereoscopic depth of such technologies to encode nodes attributes in node-link diagrams. In this regard, we conducted an evaluation study to measure the usability of the stereoscopic depth cue approach, called the stereoscopic highlighting technique, against other selected visual cues (i.e., color, shape, and sizes). Based on the results, the thesis proposes the Reflection Layer extension to the stereoscopic highlighting technique, which was also evaluated from the users’ perspectives. Additionally, we present a new technique, called ExpanD (Expand in Depth), that utilizes the depth cue to show the structural relations between different levels of details in node-link diagrams. Results of this part opens a promising direction of the research in which visualization designers can get benefits from the richness of the 3D technologies in visualizing abstract data in the information visualization domain.
Finally, this thesis proposes the application of the ESSAVis frame- work as a visual tool in the educational training process of engineers for understanding the complex concepts. In this regard, we conducted an evaluation study with computer engineering students in which we used the visual representations produced by ESSAVis to teach the principle of the fault detection and the failure scenarios in embedded systems. Our work opens the directions to investigate many challenges about the design of visualization for educational purposes.
The various uses of fiber-reinforced composites, for example in the enclosures of planes, boats and cars, generates the demand for a detailed analysis of these materials. The final goal is to optimize fibrous materials by the means of “virtual material design”. New fibrous materials are virtually created as realizations of a stochastic model and evaluated with physical simulations. In that way, materials can be optimized for specific use cases, without constructing expensive prototypes or performing mechanical experiments. In order to design a practically fabricable material, the stochastic model is first adapted to an existing material and then slightly modified. The virtual reconstruction of the existing material requires a precise knowledge of the geometry of its microstructure. The first part of this thesis describes a fiber quantification method by the means of local measurements of the fiber radius and orientation. The combination of a sparse chord length transform and inertia moments leads to an efficient and precise new algorithm. It outperforms existing approaches with the possibility to treat different fiber radii within one sample, with high precision in continuous space and comparably fast computing time. This local quantification method can be directly applied on gray value images by adapting the directional distance transforms on gray values. In this work, several approaches of this kind are developed and evaluated. Further characterization of the fiber system requires a segmentation of each single fiber. Using basic morphological operators with specific structuring elements, it is possible to derive a probability for each pixel describing if the pixel belongs to a fiber core in a region without overlapping fibers. Tracking high probabilities leads to a partly reconstruction of the fiber cores in non crossing regions. These core parts are then reconnected over critical regions, if they fulfill certain conditions ensuring the affiliation to the same fiber. In the second part of this work, we develop a new stochastic model for dense systems of non overlapping fibers with a controllable level of bending. Existing approaches in the literature have at least one weakness in either achieving high volume fractions, producing non overlapping fibers, or controlling the bending or the orientation distribution. This gap can be bridged by our stochastic model, which operates in two steps. Firstly, a random walk with the multivariate von Mises-Fisher orientation distribution defines bent fibers. Secondly, a force-biased packing approach arranges them in a non overlapping configuration. Furthermore, we provide the estimation of all parameters needed for the fitting of this model to a real microstructure. Finally, we simulate the macroscopic behavior of different microstructures to derive their mechanical and thermal properties. This part is mostly supported by existing software and serves as a summary of physical simulation applied to random fiber systems. The application on a glass fiber reinforced polymer proves the quality of the reconstruction by our stochastic model, as the effective properties match for both the real microstructure and the realizations of the fitted model. This thesis includes all steps to successfully perform virtual material design on various data sets. With novel and efficient algorithms it contributes to the science of analysis and modeling of fiber reinforced materials.
More than ten years ago, ER-ANT1 was shown to act as an ATP/ADP antiporter and to exist in the endoplasmic reticulum (ER) of higher plants. Because structurally different transporters generally mediate energy provision to the ER, the physiological function of ER-ANT1 was not directly evident.
Interestingly, mutant plants lacking ER-ANT1 exhibit a photorespiratory phenotype. Although many research efforts were undertaken, the possible connection between the transporter and photorespiration also remained elusive. Here, a forward genetic approach was used to decipher the role of ER-ANT1 in the plant context and its association to photorespiration.
This strategy identified that additional absence of a putative HAD-type phosphatase partially restored the photorespiratory phenotype. Localisation studies revealed that the corresponding protein is targeted to the chloroplast. Moreover, biochemical analyses demonstrate that the HAD-type phosphatase is specific for pyridoxal phosphate. These observations, together with transcriptional and metabolic data of corresponding single (ER-ANT1) and double (ER-ANT1, phosphatase) loss-of-function mutant plants revealed an unexpected connection of ER-ANT1 to vitamin B6 metabolism.
Finally, a scenario is proposed, which explains how ER-ANT1 may influence B6 vitamer phosphorylation, by this affects photorespiration and causes several other physiological alterations observed in the corresponding loss-of-function mutant plants.
Evaluation is an important issue for every scientific field and a necessity for an emerging soft-ware technology like case- based reasoning. This paper is a supplementation to the review of industrial case-based reasoning tools by K.-D. Althoff, E. Auriol, R. Barletta and M. Manago which describes the most detailed evaluation of commercial case-based reasoning tools currently available. The author focuses on some important aspects that correspond to the evaluation ofcase-based reasoning systems and gives links to ongoing research.
We present two techniques for reasoning from cases to solve classification tasks: Induction and case-based reasoning. We contrast the two technologies (that are often confused) and show how they complement each other. Based on this, we describe how they are integrated in one single platform for reasoning from cases: The Inreca system.
Case-Based Reasoning for Decision Support and Diagnostic Problem Solving: The INRECA Approach
(1995)
INRECA offers tools and methods for developing, validating, and maintaining decision support systems. INRECA's basic technologies are inductive and case-based reasoning, namely KATE -INDUCTION (cf., e.g., Manago, 1989; Manago, 1990) and S3-CASE, a software product based on PATDEX (cf., e.g., Wess,1991; Richter & Wess, 1991; Althoff & Wess, 1991). Induction extracts decision knowledge from case databases. It brings to light patterns among cases and helps monitoring trends over time. Case-based rea -soning relates the engineer's current problem to past experiences.
MOLTKE is a research project dealing with a complex technical application. After describing the domain of CNCmachining centers and the applied KA methods, we summarize the concrete KA problems which we have to handle. Then we describe a KA mechanism which supports an engineer in developing a diagnosis system. In chapter 6 weintroduce learning techniques operating on diagnostic cases and domain knowledge for improving the diagnostic procedure of MOLTKE. In the last section of this chapter we outline some essential aspects of organizationalknowledge which is heavily applied by engineers for analysing such technical systems (Qualitative Engineering). Finally we give a short overview of the actual state of realization and our future plans.
In this paper we will present a design model (in the sense of KADS) for the domain of technical diagnosis. Based on this we will describe the fully implemented expert system shell MOLTKE 3.0, which integrates common knowledge acquisition methods with techniques developed in the fields of Model-Based Diagnosis and Machine Learning, especially Case-Based Reasoning.
We present an approach to systematically describing case-based reasoning systems bydifferent kinds of criteria. One main requirement was the practical relevance of these criteria and their usability for real-life applications. We report on the results we achieved from a case study carried out in the INRECA1 Esprit project.
Case-based knowledge acquisition, learning and problem solving for diagnostic real world tasks
(1999)
Within this paper we focus on both the solution of real, complex problems using expert system technology and the acquisition of the necessary knowledge from a case-based reasoning point of view. The development of systems which can be applied to real world problems has to meet certain requirements. E.g., all available information sources have to be identified and utilized. Normally, this involves different types of knowledge for which several knowledge representation schemes are needed, because no scheme is equally natural for all sources. Facing empirical knowledge it is important to complement the use of manually compiled, statistic and otherwise induced knowledge by the exploitation of the intuitive understandability of case-based mechanisms. Thus, an integration of case-based and alternative knowledge acquisition and problem solving mechanisms is necessary. For this, the basis is to define the "role" which case-based inference can "play" within a knowledge acquisition workbench. We will discuss a concrete casebased architecture, which has been applied to technical diagnosis problems, and its integration into a knowledge acquisition workbench which includes compiled knowledge and explicit deep models, additionally.
Retrieval of cases is one important step within the case-based reasoning paradigm. We propose an improvement of this stage in the process model for finding most similar cases with an average effort of O[log2n], n number of cases. The basic idea of the algorithm is to use the heterogeneity of the search space for a density-based structuring and to employ this precomputed structure, a k-d tree, for efficient case retrieval according to a given similarity measure sim. In addition to illustrating the basic idea, we present the expe- rimental results of a comparison of four different k-d tree generating strategies as well as introduce the notion of virtual bounds as a new one that significantly reduces the retrieval effort from a more pragmatic perspective. The presented approach is fully implemented within the (Patdex) system, a case-based reasoning system for diagnostic applications in engineering domains.
The growing computational power enables the establishment of the Population Balance Equation (PBE)
to model the steady state and dynamic behavior of multiphase flow unit operations. Accordingly, the twophase
flow
behavior inside liquid-liquid extraction equipment is characterized by different factors. These
factors include: interactions among droplets (breakage and coalescence), different time scales due to the
size distribution of the dispersed phase, and micro time scales of the interphase diffusional mass transfer
process. As a result of this, the general PBE has no well known analytical solution and therefore robust
numerical solution methods with low computational cost are highly admired.
In this work, the Sectional Quadrature Method of Moments (SQMOM) (Attarakih, M. M., Drumm, C.,
Bart, H.-J. (2009). Solution of the population balance equation using the Sectional Quadrature Method of
Moments (SQMOM). Chem. Eng. Sci. 64, 742-752) is extended to take into account the continuous flow
systems in spatial domain. In this regard, the SQMOM is extended to solve the spatially distributed
nonhomogeneous bivariate PBE to model the hydrodynamics and physical/reactive mass transfer
behavior of liquid-liquid extraction equipment. Based on the extended SQMOM, two different steady
state and dynamic simulation algorithms for hydrodynamics and mass transfer behavior of liquid-liquid
extraction equipment are developed and efficiently implemented. At the steady state modeling level, a
Spatially-Mixed SQMOM (SM-SQMOM) algorithm is developed and successfully implemented in a onedimensional
physical spatial domain. The integral spatial numerical flux is closed using the mean mass
droplet diameter based on the One Primary and One Secondary Particle Method (OPOSPM which is the
simplest case of the SQMOM). On the other hand the hydrodynamics integral source terms are closed
using the analytical Two-Equal Weight Quadrature (TEqWQ). To avoid the numerical solution of the
droplet rise velocity, an analytical solution based on the algebraic velocity model is derived for the
particular case of unit velocity exponent appearing in the droplet swarm model. In addition to this, the
source term due to mass transport is closed using OPOSPM. The resulting system of ordinary differential
equations with respect to space is solved using the MATLAB adaptive Runge–Kutta method (ODE45). At
the dynamic modeling level, the SQMOM is extended to a one-dimensional physical spatial domain and
resolved using the finite volume method. To close the mathematical model, the required quadrature nodes
and weights are calculated using the analytical solution based on the Two Unequal Weights Quadrature
(TUEWQ) formula. By applying the finite volume method to the spatial domain, a semi-discreet ordinary
differential equation system is obtained and solved. Both steady state and dynamic algorithms are
extensively validated at analytical, numerical, and experimental levels. At the numerical level, the
predictions of both algorithms are validated using the extended fixed pivot technique as implemented in
PPBLab software (Attarakih, M., Alzyod, S., Abu-Khader, M., Bart, H.-J. (2012). PPBLAB: A new
multivariate population balance environment for particulate system modeling and simulation. Procedia
Eng. 42, pp. 144-562). At the experimental validation level, the extended SQMOM is successfully used
to model the steady state hydrodynamics and physical and reactive mass transfer behavior of agitated
liquid-liquid extraction columns under different operating conditions. In this regard, both models are
found efficient and able to follow liquid extraction column behavior during column scale-up, where three
column diameters were investigated (DN32, DN80, and DN150). To shed more light on the local
interactions among the contacted phases, a reduced coupled PBE and CFD framework is used to model
the hydrodynamic behavior of pulsed sieve plate columns. In this regard, OPOSPM is utilized and
implemented in FLUENT 18.2 commercial software as a special case of the SQMOM. The dropletdroplet
interactions
(breakage
and
coalescence)
are
taken
into
account
using
OPOSPM,
while
the
required
information
about
the
velocity
field
and
energy
dissipation
is
calculated
by
the
CFD
model.
In
addition
to
this,
the proposed coupled OPOSPM-CFD framework is extended to include the mass transfer. The
proposed framework is numerically tested and the results are compared with the published experimental
data. The required breakage and coalescence parameters to perform the 2D-CFD simulation are estimated
using PPBLab software, where a 1D-CFD simulation using a multi-sectional gird is performed. A very
good agreement is obtained at the experimental and the numerical validation levels.
In DS-CDMA, spreading sequences are allocated to users to separate different
links namely, the base-station to user in the downlink or the user to base station in the uplink. These sequences are designed for optimum periodic correlation properties. Sequences with good periodic auto-correlation properties help in frame synchronisation at the receiver while sequences with good periodic cross-
correlation property reduce cross-talk among users and hence reduce the interference among them. In addition, they are designed to have reduced implementation complexity so that they are easy to generate. In current systems, spreading sequences are allocated to users irrespective of their channel condition. In this thesis,
the method of allocating spreading sequences based on users’ channel condition
is investigated in order to improve the performance of the downlink. Different
methods of dynamically allocating the sequences are investigated including; optimum allocation through a simulation model, fast sub-optimum allocation through
a mathematical model, and a proof-of-concept model using real-world channel
measurements. Each model is evaluated to validate, improvements in the gain
achieved per link, computational complexity of the allocation scheme, and its impact on the capacity of the network.
In cryptography, secret keys are used to ensure confidentiality of communication between the legitimate nodes of a network. In a wireless ad-hoc network, the
broadcast nature of the channel necessitates robust key management systems for
secure functioning of the network. Physical layer security is a novel method of
profitably utilising the random and reciprocal variations of the wireless channel to
extract secret key. By measuring the characteristics of the wireless channel within
its coherence time, reciprocal variations of the channel can be observed between
a pair of nodes. Using these reciprocal characteristics of
common shared secret key is extracted between a pair of the nodes. The process
of key extraction consists of four steps namely; channel measurement, quantisation, information reconciliation, and privacy amplification. The reciprocal channel
variations are measured and quantised to obtain a preliminary key of vector bits (0; 1). Due to errors in measurement, quantisation, and additive Gaussian noise,
disagreement in the bits of preliminary keys exists. These errors are corrected
by using, error detection and correction methods to obtain a synchronised key at
both the nodes. Further, by the method of secure hashing, the entropy of the key
is enhanced in the privacy amplification stage. The efficiency of the key generation process depends on the method of channel measurement and quantisation.
Instead of quantising the channel measurements directly, if their reciprocity is enhanced and then quantised appropriately, the key generation process can be made efficient and fast. In this thesis, four methods of enhancing reciprocity are presented namely; l1-norm minimisation, Hierarchical clustering, Kalman filtering,
and Polynomial regression. They are appropriately quantised by binary and adaptive quantisation. Then, the entire process of key generation, from measuring the channel profile to obtaining a secure key is validated by using real-world channel measurements. The performance evaluation is done by comparing their performance in terms of bit disagreement rate, key generation rate, test of randomness,
robustness test, and eavesdropper test. An architecture, KeyBunch, for effectively
deploying the physical layer security in mobile and vehicular ad-hoc networks is
also proposed. Finally, as an use-case, KeyBunch is deployed in a secure vehicular communication architecture, to highlight the advantages offered by physical layer security.
DeepKAF: A Knowledge Intensive Framework for Heterogeneous Case-Based Reasoning in Textual Domains
(2021)
Business-relevant domain knowledge can be found in plain text across message exchanges
among customer support tickets, employee message exchanges and other business transactions.
Decoding text-based domain knowledge can be a very demanding task since traditional
methods focus on a comprehensive representation of the business and its relevant paths. Such
a process can be highly complex, time-costly and of high maintenance effort, especially in
environments that change dynamically.
In this thesis, a novel approach is presented for developing hybrid case-based reasoning
(CBR) systems that bring together the benefits of deep learning approaches with CBR advantages.
Deep Knowledge Acquisition Framework (DeepKAF) is a domain-independent
framework that features the usage of deep neural networks and big data technologies to decode
the domain knowledge with the minimum involvement from the domain experts. While
this thesis is focusing more on the textual data because of the availability of the datasets, the
target CBR systems based on DeepKAF are able to deal with heterogeneous data where a
case can be represented by different attribute types and automatically extract the necessary
domain knowledge while keeping the ability to provide an adequate level of explainability.
The main focus within this thesis are automatic knowledge acquisition, building similarity
measures and cases retrieval.
Throughout the progress of this research, several sets of experiments have been conducted
and validated by domain experts. Past textual data produced over around 15 years have
been used for the needs of the conducted experiments. The text produced is a mixture
between English and German texts that were used to describe specific domain problems
with a lot of abbreviations. Based on these, the necessary knowledge repositories were built
and used afterwards in order to evaluate the suggested approach towards effective monitoring
and diagnosis of business workflows. Another public dataset has been used, the CaseLaw
dataset, to validate DeepKAF when dealing with longer text and cases with more attributes.
The CaseLaw dataset represents around 22 million cases from different US states.
Further work motivated by this thesis could investigate how different deep learning models
can be used within the CBR paradigm to solve some of the chronic CBR challenges and be
of benefit to large-scale multi-dimensional enterprises.
The main aim of this work was to obtain an approximate solution of the seismic traveltime tomography problems with the help of splines based on reproducing kernel Sobolev spaces. In order to be able to apply the spline approximation concept to surface wave as well as to body wave tomography problems, the spherical spline approximation concept was extended for the case where the domain of the function to be approximated is an arbitrary compact set in R^n and a finite number of discontinuity points is allowed. We present applications of such spline method to seismic surface wave as well as body wave tomography, and discuss the theoretical and numerical aspects of such applications. Moreover, we run numerous numerical tests that justify the theoretical considerations.
In this paper we construct spline functions based on a reproducing kernel Hilbert space to interpolate/approximate the velocity field of earthquake waves inside the Earth based on traveltime data for an inhomogeneous grid of sources (hypocenters) and receivers (seismic stations). Theoretical aspects including error estimates and convergence results as well as numerical results are demonstrated.
Biological clocks exist across all life forms and serve to coordinate organismal physiology with periodic environmental changes. The underlying mechanism of these clocks is predominantly based on cellular transcription-translation feedback loops in which clock proteins mediate the periodic expression of numerous genes. However, recent studies point to the existence of a conserved timekeeping mechanism independent of cellular transcription and translation, but based on cellular metabolism. These metabolic clocks were concluded based upon the observation of circadian and ultradian oscillations in the level of hyperoxidized peroxiredoxin proteins. Peroxiredoxins are enzymes found almost ubiquitously throughout life. Originally identified as H2O2 scavengers, recent studies show that peroxiredoxins can transfer oxidation to, and thereby regulate, a wide range of cellular proteins. Thus, it is conceivable that peroxiredoxins, using H2O2 as the primary signaling molecule, have the potential to integrate and coordinate much of cellular physiology and behavior with metabolic changes. Nonetheless, it remained unclear if peroxiredoxins are passive reporters of metabolic clock activity or active determinants of cellular timekeeping. Budding yeast possess an ultradian metabolic clock termed the Yeast Metabolic Cycle (YMC). The most obvious feature of the YMC is a high amplitude oscillation in oxygen consumption. Like circadian clocks, the YMC temporally compartmentalizes cellular processes (e.g. metabolism) and coordinates cellular programs such as gene expression and cell division. The YMC also exhibits oscillations in the level of hyperoxidized peroxiredoxin proteins.
In this study, I used the YMC clock model to investigate the role of peroxiredoxins in cellular timekeeping, as well as the coordination of cell division with the metabolic clock. I observed that cytosolic 2-Cys peroxiredoxins are essential for robust metabolic clock function. I provide direct evidence for oscillations in cytosolic H2O2 levels, as well as cyclical changes in oxidation state of a peroxiredoxin and a model peroxiredoxin target protein during the YMC. I noted two distinct metabolic states during the YMC: low oxygen consumption (LOC) and high oxygen consumption (HOC). I demonstrate that thiol-disulfide oxidation and reduction are necessary for switching between LOC and HOC. Specifically, a thiol reductant promotes switching to HOC, whilst a thiol oxidant prevents switching to HOC, forcing cells to remain in LOC. Transient peroxiredoxin inactivation triggered rapid and premature switching from LOC to HOC. Furthermore, I show that cell division is normally synchronized with the YMC and that deletion of typical 2-Cys peroxiredoxins leads to complete uncoupling of cell division from metabolic cycling. Moreover, metabolic oscillations are crucial for regulating cell cycle entry and exit. Intriguingly, switching to HOC is crucial for initiating cell cycle entry whilst switching to LOC is crucial for cell cycle completion and exit. Consequently, forcing cells to remain in HOC by application of a thiol reductant leads to multiple rounds of cell cycle entry despite failure to complete the preceding cell cycle. On the other hand, forcing cells to remain in LOC by treating with a thiol oxidant prevents initiation of cell cycle entry.
In conclusion, I propose that peroxiredoxins – by controlling metabolic cycles, which are in turn crucial for regulating the progression through cell cycle – play a central role in the coordination of cellular metabolism with cell division. This proposition, thus, positions peroxiredoxins as active players in the cellular timekeeping mechanism.
In this paper we study the space-time asymptotic behavior of the solutions and derivatives to th incompressible Navier-Stokes equations. Using moment estimates we obtain that strong solutions to the Navier-Stokes equations which decay in \(L^2\) at the rate of \(||u(t)||_2 \leq C(t+1)^{-\mu}\) will have the following pointwise space-time decay \[|D^{\alpha}u(x,t)| \leq C_{k,m} \frac{1}{(t+1)^{ \rho_o}(1+|x|^2)^{k/2}} \]
where \( \rho_o = (1-2k/n)( m/2 + \mu) + 3/4(1-2k/n)\), and \(|a |= m\). The dimension n is \(2 \leq n \leq 5\) and \(0\leq k\leq n\) and \(\mu \geq n/4\)
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.
We investigate the long-term behaviour of diffusions on the non-negative real numbers under killing at some random time. Killing can occur at zero as well as in the interior of the state space. The diffusion follows a stochastic differential equation driven by a Brownian motion. The diffusions we are working with will almost surely be killed. In large parts of this thesis we only assume the drift coefficient to be continuous. Further, we suppose that zero is regular and that infinity is natural. We condition the diffusion on survival up to time t and let t tend to infinity looking for a limiting behaviour.
This study presents an energy-efficient ultra-low voltage standard-cell based memory in 28nm FD-SOI. The storage element (standard-cell latch) is replaced with a full- custom designed latch with 50 % less area. Error-free operation is demonstrated down to 450mV @ 9MHz. By utilizing body bias (BB) @ VDD = 0.5 V performance spans from 20 MHz @ BB=0V to 110MHz @ BB=1V.
An autoregressive-ARCH model with possible exogeneous variables is treated. We estimate the conditional volatility of the model by applying feedforward networks to the residuals and prove consistency and asymptotic normality for the estimates under the rate of feedforward networks complexity. Recurrent neural networks estimates of GARCH and value-at-risk is studied. We prove consistency and asymptotic normality for the recurrent neural networks ARMA estimator under the rate of recurrent networks complexity. We also overcome the estimation problem in stochastic variance models in discrete time by feedforward networks and the introduction of a new distributions on the innovations. We use the method to calculate market risk such as expected shortfall and Value-at risk. We tested this distribution together with other new distributions on the GARCH family models against other common distributions on the financial market such as Normal Inverse Gaussian, normal and the Student's t- distributions. As an application of the models, some German stocks are studied and the different approaches are compared together with the most common method of GARCH(1,1) fit.
A prime motivation for using XML to directly represent pieces of information is the ability of supporting ad-hoc or 'schema-later' settings. In such scenarios, modeling data under loose data constraints is essential. Of course, the flexibility of XML comes at a price: the absence of a rigid, regular, and homogeneous structure makes many aspects of data management more challenging. Such malleable data formats can also lead to severe information quality problems, because the risk of storing inconsistent and incorrect data is greatly increased. A prominent example of such problems is the appearance of the so-called fuzzy duplicates, i.e., multiple and non-identical representations of a real-world entity. Similarity joins correlating XML document fragments that are similar can be used as core operators to support the identification of fuzzy duplicates. However, similarity assessment is especially difficult on XML datasets because structure, besides textual information, may exhibit variations in document fragments representing the same real-world entity. Moreover, similarity computation is substantially more expensive for tree-structured objects and, thus, is a serious performance concern. This thesis describes the design and implementation of an effective, flexible, and high-performance XML-based similarity join framework. As main contributions, we present novel structure-conscious similarity functions for XML trees - either considering XML structure in isolation or combined with textual information -, mechanisms to support the selection of relevant information from XML trees and organization of this information into a suitable format for similarity calculation, and efficient algorithms for large-scale identification of similar, set-represented objects. Finally, we validate the applicability of our techniques by integrating our framework into a native XML database management system; in this context we address several issues around the integration of similarity operations into traditional database architectures.
Buses not arriving on time and then arriving all at once - this phenomenon is known from
busy bus routes and is called bus bunching.
This thesis combines the well studied but so far separate areas of bus-bunching prediction
and dynamic holding strategies, which allow to modulate buses’ dwell times at stops to
eliminate bus bunching. We look at real data of the Dublin Bus route 46A and present
a headway-based predictive-control framework considering all components like data
acquisition, prediction and control strategies. We formulate time headways as time series
and compare several prediction methods for those. Furthermore we present an analytical
model of an artificial bus route and discuss stability properties and dynamic holding
strategies using both data available at the time and predicted headway data. In a numerical
simulation we illustrate the advantages of the presented predictive-control framework
compared to the classical approaches which only use directly available data.
Laser-induced interstitial thermotherapy (LITT) is a minimally invasive procedure to destroy liver
tumors through thermal ablation. Mathematical models are the basis for computer simulations
of LITT, which support the practitioner in planning and monitoring the therapy.
In this thesis, we propose three potential extensions of an established mathematical model of
LITT, which is based on two nonlinearly coupled partial differential equations (PDEs) modeling
the distribution of the temperature and the laser radiation in the liver.
First, we introduce the Cattaneo–LITT model for delayed heat transfer in this context, prove its
well-posedness and study the effect of an inherent delay parameter numerically.
Second, we model the influence of large blood vessels in the heat-transfer model by means
of a spatially varying blood-perfusion rate. This parameter is unknown at the beginning of
each therapy because it depends on the individual patient and the placement of the LITT
applicator relative to the liver. We propose a PDE-constrained optimal-control problem for the
identification of the blood-perfusion rate, prove the existence of an optimal control and prove
necessary first-order optimality conditions. Furthermore, we introduce a numerical example
based on which we demonstrate the algorithmic solution of this problem.
Third, we propose a reformulation of the well-known PN model hierarchy with Marshak
boundary conditions as a coupled system of second-order PDEs to approximate the radiative-transfer
equation. The new model hierarchy is derived in a general context and is applicable
to a wide range of applications other than LITT. It can be generated in an automated way by
means of algebraic transformations and allows the solution with standard finite-element tools.
We validate our formulation in a general context by means of various numerical experiments.
Finally, we investigate the coupling of this new model hierarchy with the LITT model numerically.
This report discusses two approaches for a posteriori error indication in the linear elasticity solver DDFEM: An indicator based on the Richardson extrapolation and Zienkiewicz-Zhu-type indicator. The solver handles 3D linear elasticity steady-state problems. It uses own input language to describe the mesh and the boundary conditions. Finite element discretization over tetrahedral meshes with first or second order shape functions (hierarchical basis) has been used to resolve the model. The parallelization of the numerical method is based on the domain decomposition approach. DDFEM is highly portable over a set of parallel computer architectures supporting the MPI-standard.
In recent years, there has been a growing need for accurate 3D scene reconstruction. Recent developments in the automotive industry have led to the increased use of ADAS where 3D reconstruction techniques are used, for example, as part of a collision detection system. For such applications, scene geometry reconstruction is usually performed in the form of depth estimation, where distances to scene objects are obtained.
In general, depth estimation systems can be divided into active and passive. Both systems have their advantages and disadvantages, but passive systems are usually cheaper to produce and easier to assemble and integrate than active systems. Passive systems can be stereo- or multiple-view based. Up to a certain limit, increasing the number of views in multi-view systems usually results in improved depth estimation accuracy.
One potential problem for ensuring the reliability of multi-view systems is the need to accurately estimate the orientation of their optical sensors. One way to ensure sensor placement for multi-view systems is to rigidly fix the sensors at the manufacturing stage. Unlike arbitrary sensor placement, using of a simplified and known sensor placement geometry further simplifies the depth estimation.
We meet with the concept of light field, which parameterizes all visible light passing through all viewpoints by their intersection with angular and spatial planes. When applied to computer vision, this gives us a 2D set of 2D images, where the physical distances between each image are fixed and proportional to each other.
Existing light field depth estimation methods provide good accuracy, which is suitable for industrial applications. However, the main problems of these methods are related to their running time and resource requirements. Most of the algorithms presented in the literature are typically sharpened for accuracy, can only be run on high-performance machines and often require a significant amount of time to process and obtain results.
Real-world applications often have running time requirements. Also, often there is a power-consumption limitation. In this dissertation, we investigate the problem of building a depth estimation system with an light field camera that satisfies the operating time and power consumption constraints without significant loss of estimation accuracy.
First, an algorithm for calibrating light field cameras is proposed, together with an algorithm for automatic calibration refinement, that works on arbitrary captured scenes. An algorithm for classical geometric depth estimation using light field cameras is proposed. Ways to optimize the algorithm for real-time use without significant loss of accuracy are presented. Finally, the ways how the presented depth estimation methods can be extended using modern deep learning paradigms under the two previously mentioned constraints are shown.
Interactions between flow hydrodynamics and biofilm attributes and functioning in stream ecosystems
(2023)
Biofilms constitute an integral part of freshwater ecosystems and are central to regulating essential stream biogeochemical functions, such as nutrient uptake and metabolism. Under-standing the environmental factors that dictate the composition of biofilm communities and their role in whole-system nutrient cycling remains challenging, given the large spatial and temporal variability of biofilm communities. Pristine mountain streams exhibit a heteroge-neous streambed ranging from boulders to sand, provoking high spatiotemporal flow varia-bility. Our current knowledge of the interactions between flow hydrodynamics and biofilm attributes stems from mesocosm studies, which are inherently limited in environmental real-ism. Moreover, the mechanism linking flow hydrodynamics to microbial biodiversity and ecosystem functioning is currently not studied. My thesis aims to link streambed heteroge-neity and the associated development of the flow field to biofilm attributes and nitrogen uptake based on a multidisciplinary field approach. It integrates several spatial and temporal scales ranging from millimeter-sized spots to stream reaches and from milliseconds to minutes (i.e., the hydraulic scale of velocity fluctuations), up to days, months and years (i.e., the hydrological scale of flow fluctuations). I demonstrate that the spatial niche variability of flow hydrodynamics was an essential driver of biofilm community composition, diversity and morphology, in line with the habitat heterogeneity hypothesis initially formulated for terrestrial ecosystems. Furthermore, hydraulic mass transfer associated to flow diversity and biofilm biomass determined biofilm areal nitrogen uptake at scales ranging from spots to the stream reach. At the whole-ecosystem level, flow diversity determined the quantitative role of biofilms compared to other nitrogen uptake compartments by sorting them according to prevailing flow conditions. The magnitude of effects depended on ambient nutrient back-ground and season, suggesting a hierarchy of the environmental controls on biofilms. In summary, my interdisciplinary research provided a mechanistic understanding of how hy-dromorphological diversity determines the diversity, morphology, and the functional role of biofilms in streams. By improving the understanding of these relationships, my research improves our ability to predict and scale measurements of important stream biogeochemical functions. Moreover, it helps to face the challenges imposed by environmental changes and biodiversity loss.
The paper presents some adaptive load balance techniques for the simulation of rarefied gas flows on parallel computers. It is shown that a static load balance is insufficient to obtain a scalable parallel efficiency. Hence, two adaptive techniques are investigated which are based on simple algorithms. Numerical results show that using heuristic techniques one can achieve a sufficiently high efficiency over a wide range of different hardware platforms.
The wireless spectrum is already a scarce good, shared by multiple competing technologies such as Bluetooth, ZigBee and Wi-Fi, and the hunger for traffic is only increasing. Due to the heterogeneity of the existing wireless technologies and the real threat that interference poses to network performance, sophisticated techniques must be developed to ensure acceptable levels of quality of service.
In this thesis, we present a passive channel sensing scheme based on both energy and signal detection, that primarily considers the spectrum occupation of foreign traffic while allowing for additional complementary information such as the signal-to-noise ratio. The resulting channel quality metric is first corrected for the spectrum occupation of internal transmissions and later aggregated with help of a moving average followed by an exponential weighted moving average. This aggregation keeps the metric both sufficiently stable and adaptive to significant changes in channel usage. Moreover, the channel quality metric is made volatility-aware by penalizing qualities proportionally to their downward volatility. This yields a conservative metric and allows to differentiate channels with similar aggregated qualities but different volatility behavior.
Our second main contribution is in the form of a schedule-based channel sensing protocol, in which nodes possess two network interfaces, one for communication and one for channel sensing. Channel sensing schedules are derived from communication schedules, i.e. channel hopping sequences used for communication, with help of a stochastic local search-based heuristic that attempts to minimize channel sensing bias, the channel overlap between both schedules and to maximize overlap fairness. This minimizes the effect of internal transmissions in the resulting channel quality metric, allowing nodes to derive channel quality primarily based on foreign traffic in an unbiased manner.
Finally, we propose and implement a stabilization protocol for keeping nodes in an ad-hoc network tick-synchronized and schedule-consistent w.r.t. a communication schedule. This stabilization protocol makes use of special messages, namely tick frames for synchronization, channel quality reports for sharing local views of channel conditions and schedule reports for disseminating the global communication hopping sequence. The communication schedules are computed by a master node based on an aggregation of local channel quality views and the re-computation of these schedules is triggered by significant changes in channel conditions. The resulting protocol is robust against changes in topology and channel conditions.
The transfer of substrates between to enzymes within a biosynthesis pathway is an effective way to synthesize the specific product and a good way to avoid metabolic interference. This process is called metabolic channeling and it describes the (in-)direct transfer of an intermediate molecule between the active sites of two enzymes. By forming multi-enzyme cascades the efficiency of product formation and the flux is elevated and intermediate products are transferred and converted in a correct manner by the enzymes.
During tetrapyrrole biosynthesis several substrate transfer events occur and are prerequisite for an optimal pigment synthesis. In this project the metabolic channeling process during the pink pigment phycoerythrobilin (PEB) was investigated. The responsible ferredoxin-dependent bilin reductases (FDBR) for PEB formation are PebA and PebB. During the pigment synthesis the intermediate molecule 15,16-dihydrobiliverdin (DHBV) is formed and transferred from PebA to PebB. While in earlier studies a metabolic channeling of DHBV was postulated, this work revealed new insights into the requirements of this protein-protein interaction. It became clear, that the most important requirement for the PebA/PebB interaction is based on the affinity to their substrate/product DHBV. The already high affinity of both enzymes to each other is enhanced in the presence of DHBV in the binding pocket of PebA which leads to a rapid transfer to the subsequent enzyme PebB. DHBV is a labile molecule and needs to be rapidly channeled in order to get correctly further reduced to PEB. Fluorescence titration experiments and transfer assays confirmed the enhancement effect of DHBV for its own transfer.
More insights became clear by creating an active fusion protein of PebA and PebB and comparing its reaction mechanism with standard FDBRs. This fusion protein was able to convert biliverdin IXα (BV IXα) to PEB similar to the PebS activity, which also can convert BV IXα via DHBV to PEB as a single enzyme. The product and intermediate of the reaction were identified via HPLC and UV-Vis spectroscopy.
The results of this work revealed that PebA and PebB interact via a proximity channeling process where the intermediate DHBV plays an important role for the interaction. It also highlights the importance of substrate channeling in the synthesis of PEB to optimize the flux of intermediates through this metabolic pathway.
Substrate channeling is a widespread mechanism in metabolic pathways to avoid decomposition of unstable intermediates, competing reactions, and to accelerate catalytic turnover. During the biosynthesis of light-harvesting phycobilins in cyanobacteria, two members of the ferredoxin-dependent bilin reductases are involved in the reduction of the open-chain tetrapyrrole biliverdin IXα to the pink pigment phycoerythrobilin. The first reaction is catalyzed by 15,16-dihydrobiliverdin:ferredoxin oxidoreductase and produces the unstable intermediate 15,16-dihydrobiliverdin (DHBV). This intermediate is subsequently converted by phycoerythrobilin:ferredoxin oxidoreductase to the final product phycoerythrobilin. Although substrate channeling has been postulated already a decade ago, detailed experimental evidence was missing. Using a new on-column assay employing immobilized enzyme in combination with UV-Vis and fluorescence spectroscopy revealed that both enzymes transiently interact and that transfer of the intermediate is facilitated by a significantly higher binding affinity of DHBV toward phycoerythrobilin:ferredoxin oxidoreductase. Concluding from the presented data, the intermediate DHBV is transferred via proximity channeling.
Mixed Isogeometric Methods for Hodge–Laplace Problems induced by Second-Order Hilbert Complexes
(2024)
Partial differential equations (PDEs) play a crucial role in mathematics and physics to describe numerous physical processes. In numerical computations within the scope of PDE problems, the transition from classical to weak solutions is often meaningful. The latter may not precisely satisfy the original PDE, but they fulfill a weak variational formulation, which, in turn, is suitable for the discretization concept of Finite Elements (FE). A central concept in this context is the
well-posed problem. A class of PDE problems for which not only well-posedness statements but also suitable weak formulations are known are the so-called abstract Hodge–Laplace problems. These can be derived from Hilbert complexes and constitute a central aspect of the Finite Element Exterior Calculus (FEEC).
This thesis addresses the discretization of mixed formulations of Hodge-Laplace problems, focusing on two key aspects. Firstly, we utilize Isogeometric Analysis (IGA) as a specific paradigm for discretization, combining geometric representations with Non-Uniform Rational B-Splines (NURBS) and Finite Element discretizations.
Secondly, we primarily concentrate on mixed formulations exhibiting a saddle-point structure and generated from Hilbert complexes with second-order derivative operators. We go beyond the well-known case of the classical de Rham
complex, considering complexes such as the Hessian or elasticity complex. The BGG (Bernstein–Gelfand–Gelfand) method is employed to define and examine these second-order complexes. The main results include proofs of discrete well-posedness and a priori error estimates for two different discretization approaches. One approach demonstrates, through the introduction of a Lagrange multiplier, how the so-called isogeometric discrete differential forms can be reused.
A second method addresses the question of how standard NURBS basis functions, through a modification of the mixed formulation, can also lead to convergent procedures. Numerical tests and examples, conducted using MATLAB and the open-source software GeoPDEs, illustrate the theoretical findings. Our primary application extends to linear elasticity theory, extensively
discussing mixed methods with and without strong symmetry of the stress tensor.
The work demonstrates the potential of IGA in numerical computations, particularly in the challenging scenario of second-order Hilbert complexes. It also provides insights into how IGA and FEEC can be meaningfully combined, even for non-de Rham complexes.
Scaled boundary isogeometric analysis (SB-IGA) describes the computational domain by proper boundary NURBS together with a well-defined scaling center; see [5]. More precisely, we consider star convex domains whose domain boundaries correspond to a sequence of NURBS curves and the interior is determined by a scaling of the boundary segments with respect to a chosen scaling center. However, providing a decomposition into star shaped blocks one can utilize SB-IGA also for more general shapes. Even though several geometries can be described by a single patch, in applications frequently there appear multipatch structures. Whereas a C0 continuous patch coupling can be achieved relatively easily, the situation becomes more complicated if higher regularity is required. Consequently, a suitable coupling method is inevitably needed for analyses that require global C1 continuity.In this contribution we apply the concept of analysis-suitable G1 parametrizations [2] to the framework of SB-IGA for the C1 coupling of planar domains with a special consideration of the scaling center. We obtain globally C1 regular basis functions and this enables us to handle problems such as the Kirchhoff-Love plate and shell, where smooth coupling is an issue. Furthermore, the boundary representation within SB-IGA makes the method suitable for the concept of trimming. In particular, we see the possibility to extend the coupling procedure to study trimmed plates and shells.The approach was implemented using the GeoPDEs package [1] and its performance was tested on several numerical examples. Finally, we discuss the advantages and disadvantages of the proposed method and outline future perspectives.
In this thesis, we present the basic concepts of isogeometric analysis (IGA) and we consider Poisson's equation as model problem. Since in IGA the physical domain is parametrized via a geometry function that goes from a parameter domain, e.g. the unit square or unit cube, to the physical one, we present a class of parametrizations that can be viewed as a generalization of polar coordinates, known as the scaled boundary parametrizations (SB-parametrizations). These are easy to construct and are particularly attractive when only the boundary of a domain is available. We then present an IGA approach based on these parametrizations, that we call scaled boundary isogeometric analysis (SB-IGA). The SB-IGA derives the weak form of partial differential equations in a different way from the standard IGA. For the discretization projection
on a finite-dimensional space, we choose in both cases Galerkin's method. Thanks to this technique, we state an equivalence theorem for linear elliptic boundary value problems between the standard IGA, when it makes use of an SB-parametrization,
and the SB-IGA. We solve Poisson's equation with Dirichlet boundary conditions on different geometries and with different SB-parametrizations.
Since their invention in the 1980s, behaviour-based systems have become very popular among roboticists. Their component-based nature facilitates the distributed implementation of systems, fosters reuse, and allows for early testing and integration. However, the distributed approach necessitates the interconnection of many components into a network in order to realise complex functionalities. This network is crucial to the correct operation of the robotic system. There are few sound design techniques for behaviour networks, especially if the systems shall realise task sequences. Therefore, the quality of the resulting behaviour-based systems is often highly dependant on the experience of their developers.
This dissertation presents a novel integrated concept for the design and verification of behaviour-based systems that realise task sequences. Part of this concept is a technique for encoding task sequences in behaviour networks. Furthermore, the concept provides guidance to developers of such networks. Based on a thorough analysis of methods for defining sequences, Moore machines have been selected for representing complex tasks. With the help of the structured workflow proposed in this work and the developed accompanying tool support, Moore machines defining task sequences can be transferred automatically into corresponding behaviour networks, resulting in less work for the developer and a lower risk of failure.
Due to the common integration of automatically and manually created behaviour-based components, a formal analysis of the final behaviour network is reasonable. For this purpose, the dissertation at hand presents two verification techniques and justifies the selection of model checking. A novel concept for applying model checking to behaviour-based systems is proposed according to which behaviour networks are modelled as synchronised automata. Based on such automata, properties of behaviour networks that realise task sequences can be verified or falsified. Extensive graphical tool support has been developed in order to assist the developer during the verification process.
Several examples are provided in order to illustrate the soundness of the presented design and verification techniques. The applicability of the integrated overall concept to real-world tasks is demonstrated using the control system of an autonomous bucket excavator. It can be shown that the proposed design concept is suitable for developing complex sophisticated behaviour networks and that the presented verification technique allows for verifying real-world behaviour-based systems.
When designing autonomous mobile robotic systems, there usually is a trade-off between the three opposing goals of safety, low-cost and performance.
If one of these design goals is approached further, it usually leads to a recession of one or even both of the other goals.
If for example the performance of a mobile robot is increased by making use of higher vehicle speeds, then the safety of the system is usually decreased, as, under the same circumstances, faster robots are often also more dangerous robots.
This decrease of safety can be mitigated by installing better sensors on the robot, which ensure the safety of the system, even at high speeds.
However, this solution is accompanied by an increase of system cost.
In parallel to mobile robotics, there is a growing amount of ambient and aware technology installations in today's environments - no matter whether in private homes, offices or factory environments.
Part of this technology are sensors that are suitable to assess the state of an environment.
For example, motion detectors that are used to automate lighting can be used to detect the presence of people.
This work constitutes a meeting point between the two fields of robotics and aware environment research.
It shows how data from aware environments can be used to approach the abovementioned goal of establishing safe, performant and additionally low-cost robotic systems.
Sensor data from aware technology, which is often unreliable due to its low-cost nature, is fed to probabilistic methods for estimating the environment's state.
Together with models, these methods cope with the uncertainty and unreliability associated with the sensor data, gathered from an aware environment.
The estimated state includes positions of people in the environment and is used as an input to the local and global path planners of a mobile robot, enabling safe, cost-efficient and performant mobile robot navigation during local obstacle avoidance as well as on a global scale, when planning paths between different locations.
The probabilistic algorithms enable graceful degradation of the whole system.
Even if, in the extreme case, all aware technology fails, the robots will continue to operate, by sacrificing performance while maintaining safety.
All the presented methods of this work have been validated using simulation experiments as well as using experiments with real hardware.
The rotational spinning of viscous jets is of interest in many industrial applications, including pellet manufacturing [4, 14, 19, 20] and drawing, tapering and spinning of glass and polymer fibers [8, 12, 13], see also [15, 21] and references within. In [12] an asymptotic model for the dynamics of curved viscous inertial fiber jets emerging from a rotating orifice under surface tension and gravity was deduced from the three-dimensional free boundary value problem given by the incompressible Navier-Stokes equations for a Newtonian fluid. In the terminology of [1], it is a string model consisting of balance equations for mass and linear momentum. Accounting for inner viscous transport, surface tension and placing no restrictions on either the motion or the shape of the jet’s center-line, it generalizes the previously developed string models for straight [3, 5, 6] and curved center-lines [4, 13, 19]. Moreover, the numerical results investigating the effects of viscosity, surface tension, gravity and rotation on the jet behavior coincide well with the experiments of Wong et.al. [20].
The optimal design of rotational production processes for glass wool manufacturing poses severe computational challenges to mathematicians, natural scientists and engineers. In this paper we focus exclusively on the spinning regime where thousands of viscous thermal glass jets are formed by fast air streams. Homogeneity and slenderness of the spun fibers are the quality features of the final fabric. Their prediction requires the computation of the fuidber-interactions which involves the solving of a complex three-dimensional multiphase problem with appropriate interface conditions. But this is practically impossible due to the needed high resolution and adaptive grid refinement. Therefore, we propose an asymptotic coupling concept. Treating the glass jets as viscous thermal Cosserat rods, we tackle the multiscale problem by help of momentum (drag) and heat exchange models that are derived on basis of slender-body theory and homogenization. A weak iterative coupling algorithm that is based on the combination of commercial software and self-implemented code for ow and rod solvers, respectively, makes then the simulation of the industrial process possible. For the boundary value problem of the rod we particularly suggest an adapted collocation-continuation method. Consequently, this work establishes a promising basis for future optimization strategies.
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.
The detection and characterisation of undesired lead structures on shaft surfaces is a concern in production and quality control of rotary shaft lip-type sealing systems. The potential lead structures are generally divided into macro and micro lead based on their characteristics and formation. Macro lead measurement methods exist and are widely applied. This work describes a method to characterise micro lead on ground shaft surfaces. Micro lead is known as the deviation of main orientation of the ground micro texture from circumferential direction. Assessing the orientation of microscopic structures with arc minute accuracy with regard to circumferential direction requires exact knowledge of both the shaft’s orientation and the direction of surface texture. The shaft’s circumferential direction is found by calibration. Measuring systems and calibration procedures capable of calibrating shaft axis orientation with high accuracy and low uncertainty are described. The measuring systems employ areal-topographic measuring instruments suited for evaluating texture orientation. A dedicated evaluation scheme for texture orientation is based on the Radon transform of these topographies and parametrised for the application. Combining the calibration of circumferential direction with the evaluation of texture orientation the method enables the measurement of micro lead on ground shaft surfaces.
The increasing parallelisation of development processes as well as the ongoing trends towards virtual product development and outsourcing of development activities strengthen the need for 3D co-operative design via communication networks. Regarding the field of CAx, none of the existing systems meets all the requirements of very complex process chain. This leads to a tremendous need for the integration of heterogeneous CAx systems. Therefore, MACAO, a platform-independent client for a distributed CAx component system, the so-called ANICA CAx object bus, is presented. The MACAO client is able to access objects and functions provided by different CAx servers distributed over a communication network. Thus, MACAO is a new solution for engineering design and visualisation in shared distributed virtual environments. This paper describes the underlying concepts, the actual prototype implementation, as well as possible application scenarios in the area of co-operative design and visualisation.
Interoperability between different CAx systems involved in the development process of cars is presently one of the most critical issues in the automotive industry. None of the existing CAx systems meets all requirements of the very complex process network of the lifecycle of a car. With this background, industrial engineers have to use various CAx systems to get an optimal support for their daily work. Today, the communication between different CAx systems is done via data files using special direct converters or neutral system independent standards like IGES, VDAFS, and recently STEP, the international standard for product data description. To reduce the dependency on individual CAx s ystem vendors, the German automotive industry developed an open CAx system architecture based on STEP as guiding principle for CAx system development. The central component of this architecture is a common, system-independent access interface to CAx functions and data of all involved CAx systems, which is under development in the project ANICA. Within this project, a CAx object bus has been developed based on a STEP data description using CORBA as an integration platform. This new approach allows a transparent access to data and functions of the integrated CAx systems without file-based data exchange. The product development process with various CAx systems concerns objects from different CAx systems. Thus, mechanisms are needed to handle the persistent storage of the CAx objects distributed over the CAx object bus to give the developing engineers a consistent view of the data model of their product. The following paper discusses several possibilities to guarantee consistent data management and storage of distributed CAx models. One of the most promising approaches is the enhancement of the CAx object bus by a STEP-based object-oriented data server to realise a central data management.