Kaiserslautern - Fachbereich Informatik
Refine
Year of publication
- 1999 (228)
- 1994 (33)
- 1996 (32)
- 1998 (32)
- 1995 (31)
- 1997 (26)
- 2021 (25)
- 2022 (24)
- 2016 (23)
- 2019 (23)
- 2015 (22)
- 2023 (22)
- 2001 (20)
- 2020 (19)
- 2007 (18)
- 2018 (18)
- 2013 (17)
- 2014 (15)
- 1993 (14)
- 2009 (11)
- 2012 (11)
- 2000 (10)
- 2002 (10)
- 2003 (7)
- 2004 (7)
- 2006 (7)
- 2008 (7)
- 2017 (7)
- 2024 (7)
- 2010 (6)
- 2005 (5)
- 1991 (4)
- 1992 (4)
- 2011 (4)
- 1979 (2)
- 1980 (1)
- 1990 (1)
Document Type
- Preprint (290)
- Doctoral Thesis (218)
- Report (111)
- Article (107)
- Conference Proceeding (8)
- Master's Thesis (7)
- Study Thesis (5)
- Bachelor Thesis (4)
- Habilitation (2)
- Part of a Book (1)
Language
- English (753) (remove)
Has Fulltext
- yes (753)
Keywords
- AG-RESY (47)
- PARO (25)
- Visualisierung (16)
- SKALP (15)
- Case-Based Reasoning (11)
- RODEO (11)
- HANDFLEX (9)
- Visualization (8)
- Deep Learning (7)
- Robotics (7)
- Abstraction (6)
- Case Based Reasoning (6)
- Robotik (6)
- motion planning (6)
- CoMo-Kit (5)
- Computergraphik (5)
- Evaluation (5)
- case-based problem solving (5)
- industrial robots (5)
- parallel processing (5)
- COMOKIT (4)
- Force-Torque (4)
- Knowledge Acquisition (4)
- SDL (4)
- case-based reasoning (4)
- resolution (4)
- search algorithms (4)
- Artificial Intelligence (3)
- Assembly (3)
- Dienstgüte (3)
- Fallbasiertes Schliessen (3)
- Fallbasiertes Schließen (3)
- Formalisierung (3)
- Geoinformationssystem (3)
- Internet (3)
- Knowledge acquisition (3)
- LOADBAL (3)
- Machine Learning (3)
- Manipulation skills (3)
- Model Checking (3)
- Mustererkennung (3)
- Optische Zeichenerkennung (3)
- Ray casting (3)
- Recommender Systems (3)
- Requirements/Specifications (3)
- Scientific Visualization (3)
- Semantic Web (3)
- Unsicherheit (3)
- artificial intelligence (3)
- case-based planning (3)
- computer graphics (3)
- deformable objects (3)
- distributed software development (3)
- distributed software development process (3)
- document analysis (3)
- explanation-based learning (3)
- machine learning (3)
- on-line algorithms (3)
- optical character recognition (3)
- path planning (3)
- problem solving (3)
- reuse (3)
- theorem prover (3)
- theorem proving (3)
- verification (3)
- vibration (3)
- visualization (3)
- Activity recognition (2)
- Ad-hoc-Netz (2)
- Algorithmus (2)
- Automatische Differentiation (2)
- Bildverarbeitung (2)
- CAPlan (2)
- CIM-OSA (2)
- Code Generation (2)
- Computational Fluid Dynamics (2)
- Datenanalyse (2)
- Datenbank (2)
- Deduction (2)
- Deformable Objects (2)
- Distributed Software Development (2)
- Endlicher Automat (2)
- Fallbasiertes Planen (2)
- GPU (2)
- HOT (2)
- Interaction (2)
- Interaktion (2)
- Java (2)
- Layout (2)
- MOLTKE-Projekt (2)
- Machine learning (2)
- Manipulation (2)
- Merkmalsextraktion (2)
- Natural Language Processing (2)
- Network Calculus (2)
- Network Protocols (2)
- Optimierung (2)
- Partial functions (2)
- Pattern Recognition (2)
- RONAF (2)
- Raumakustik (2)
- Roboter (2)
- Room acoustics (2)
- Routing (2)
- SIMERO (2)
- Scattered-Data-Interpolation (2)
- Simulation (2)
- Software Agents (2)
- Software engineering (2)
- Sprachprofile (2)
- TOVE (2)
- Term rewriting systems (2)
- Topology (2)
- Translation Validation (2)
- Uncertain Data (2)
- Uncertainty Visualization (2)
- Visual Analytics (2)
- Wearable computing (2)
- WiFi (2)
- Wissensakquisition (2)
- World Wide Web (2)
- analogy (2)
- analysis of algorithms (2)
- application (2)
- artificial neural networks (2)
- automated theorem proving (2)
- building automation (2)
- case based reasoning (2)
- combined systems with sha (2)
- computer vision (2)
- computer-supported cooperative work (2)
- confluence (2)
- conservative extension (2)
- consistency (2)
- deep learning (2)
- design patterns (2)
- discretization (2)
- disjoint union (2)
- distributed (2)
- experience base (2)
- formal specification (2)
- frames (2)
- genetic algorithms (2)
- graph search (2)
- image processing (2)
- innermost termination (2)
- layout analysis (2)
- learning system (2)
- load balancing (2)
- many-valued logic (2)
- mobile robots (2)
- modularity (2)
- parallel algorithms (2)
- problem formulation (2)
- requirements engineering (2)
- safe human robot cooperation (2)
- self-organization (2)
- semantic web (2)
- sensor fusion (2)
- tactics (2)
- temporal logic (2)
- termination (2)
- trajectory planning (2)
- virtual acoustics (2)
- weak termination (2)
- 3D Gene Expression (1)
- 3D Point Data (1)
- ASM (1)
- AUTOSAR (1)
- Ableitungsschätzung (1)
- Abrechnungsmanagement (1)
- Abstandsregeltempomat (1)
- Abstraction-Based Controller Design (1)
- Abstraktion (1)
- Accelerometer (1)
- Access Points (1)
- Accounting Agent (1)
- Ad-hoc networks (1)
- Ad-hoc workflow (1)
- Adaption (1)
- Adaptive Data Structure (1)
- Affine Arithmetic (1)
- Agents (1)
- Algorithm (1)
- Algorithmic Differentiation (1)
- Ambient Intelligence (1)
- Amharic, Attention, Factored Convolutional Neural Network, OCR (1)
- Anomaly Detection (1)
- Application Framework (1)
- Association (1)
- Audiodeskription (1)
- Automat <Automatentheorie> (1)
- Automated Calibration (1)
- Automated Reasoning (1)
- Automated theorem proving (1)
- Automatic Differentiation (1)
- Automatic Image Captioning (1)
- Automatic Theorem Provi (1)
- Automatische Klassifikation (1)
- Automatische Messung (1)
- Automatisches Beweisverfahren (1)
- Autonomer Roboter (1)
- Autonomous mobile robots (1)
- Autorensystem (1)
- Befahrbarkeitsanalyse (1)
- Benutzer (1)
- Beschränkte Arithmetik (1)
- Bibligraphic References (1)
- Bibliothekskatalog (1)
- Bio-inspired (1)
- Bioinformatik (1)
- Bipedal Locomotion (1)
- Blackboard architecture (1)
- Bluetooth (1)
- Boosting (1)
- C (1)
- CBR (1)
- CNC-Maschine (1)
- CODET (1)
- CUDA (1)
- Caching (1)
- Carbon footprint (1)
- Case Study (1)
- Case-Based Classification Algorithms (1)
- Case-Based Reasoning Systems (1)
- Case-Based Representability (1)
- Case-based problem solving (1)
- Causal Ordering (1)
- Causality (1)
- Certifying Compilers (1)
- Channel Hopping (1)
- Channel Scheduling (1)
- Channel hopping (1)
- Channel sensing (1)
- Chromium Browser (1)
- Classification (1)
- Classification Tasks (1)
- Classification of biomedical signals (1)
- Cluster-Analyse (1)
- Cognitive Amplification (1)
- Collaboration (1)
- Combinatorial Testing (1)
- Compiler (1)
- Completion (1)
- Computer Graphic (1)
- Computer Science (1)
- Computer Supported Cooperative Work (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)
- Concurrent data structures (1)
- Congitive Radio Networks (1)
- Constraint Graphs (1)
- Context of Use (1)
- Context-sensitive Assistance (1)
- Contract net (1)
- Cooperative decision making (1)
- Coq (1)
- Correct-by-Design Controller Synthesis (1)
- Correlation (1)
- Cyber-Physical Systems (1)
- Cycle Accuracy (1)
- DCE <Programm> (1)
- DFG (1)
- DPN (1)
- Data Modeling (1)
- Dataset (1)
- Datenfusion (1)
- Decision Support Systems (1)
- Declarative and Procedural Knowledge (1)
- Delaunay-Triangulierung (1)
- Dependency Factors (1)
- Derivative Estimation (1)
- Diagnosesystem (1)
- Difference Reduction (1)
- Direct Numerical Simulation (1)
- Discrete Event Simulation (DES) (1)
- Distributed Computation (1)
- Distributed Deb (1)
- Distributed Multimedia Applications (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)
- DoS (1)
- DoS-Attacke (1)
- Drahtloses lokales Netz (1)
- Dreidimensionale Bildverarbeitung (1)
- Dreidimensionale Rekonstruktion (1)
- Dreidimensionale Strömung (1)
- Duplicate Identification (1)
- Duplikaterkennung (1)
- E-Learning (1)
- EBG (1)
- ECMAScript (1)
- Earley-Parser (1)
- Ecommerce (1)
- Effizienter Algorithmus (1)
- Eingebettete Systeme (1)
- Eingebettetes System (1)
- Elektrizitätsverbrauch (1)
- Embedded software (1)
- Empfehlungssysteme (1)
- Engineering 4.0 (1)
- Ensemble Visualization (1)
- Enterprise modeling (1)
- Enterprise modelling (1)
- Entwurf (1)
- Equality reasoning (1)
- Equational Reasoning (1)
- Ernergie effiziente Bewegung (1)
- Eventual consistency (1)
- Evolutionary Algorithm (1)
- Experience Database (1)
- Experiment (1)
- Experimentation (1)
- Explainability (1)
- Explainable Artificial Intelligence (1)
- Exposed Datapath Architectures (1)
- Extensibility (1)
- Extraction (1)
- Extrapolation (1)
- Eyewear Computing (1)
- Fahrtkostenmodelle (1)
- Fault Tree Analysis (1)
- Feasibility study (1)
- Feature (1)
- Feature Detection (1)
- Feature Extraction (1)
- Fehlerbaumanalyse (1)
- Fließanalyse (1)
- Flooding Attack (1)
- Flow Visualization (1)
- Forgetting-enabled Information Systems (1)
- Formal Semantics (1)
- Formale Grammatik (1)
- Formale Sprache (1)
- Formaler Beweis (1)
- Framework (1)
- Framework <Informatik> (1)
- Frequenzsprungverfahren (1)
- Fräsen (1)
- Functional Programs (1)
- Functional Safety (1)
- Funknetz (1)
- Funktionale Sicherheit (1)
- Fusion (1)
- Future Internet (1)
- GRAPHICS (1)
- Gateway (1)
- Gauß-Filter (1)
- Gefahren- und Risikoanalyse (1)
- Gene expression programming (1)
- General Knowledge (1)
- Generic Methods (1)
- Generierung (1)
- Genetic Algorithm (1)
- Geovisualization (1)
- Global Predicate Detection (1)
- Global Software Highway (1)
- Google Earth (1)
- HOL (1)
- HPC (1)
- HTE (1)
- HTML (1)
- Hals-Nasen-Ohren-Chirurgie (1)
- Hals-Nasen-Ohren-Heilkunde (1)
- Hazard Analysis (1)
- Heterogeneous (1)
- Hitting families (1)
- Hub-and-Spoke-System (1)
- Human Pose (1)
- Human-Computer Interaction (1)
- Hybrid CBR (1)
- Hybridregler (1)
- Hypergraph (1)
- Hörgerät (1)
- IEEE 802.15.4 (1)
- IMU (1)
- INRECA (1)
- IP Address (1)
- IP Traffic Accounting (1)
- IP-XACT (1)
- ISO 26262 (1)
- ISO26262 (1)
- Image Processing (1)
- Implantation (1)
- Implementierung (1)
- Incremental recomputation (1)
- Inductive Theorem Proving (1)
- Induktive logische Programmierung (1)
- Information Extraction (1)
- Information Management (1)
- Information Visualization (1)
- Instance-based Learning (1)
- Intel XScale (1)
- Intelligent Agents (1)
- Intelligent Object Fusion (1)
- Intelligent agents (1)
- Intensity estimation (1)
- Intentional Forgetting (1)
- Interleaved Planning (1)
- Intermediate Composition (1)
- Internet Based Software Process Management Environment (1)
- Internet knowledge base (1)
- Internet knowledge reuse (1)
- Interpolation (1)
- Invariante (1)
- Invariante Momente (1)
- Isabelle/HOL (1)
- Jacobian (1)
- JavaScript (1)
- Kellerautomat (1)
- Klassifikation (1)
- Klima (1)
- Knowledge Management (1)
- Knowledge Work (1)
- Knowledge-based Techniques (1)
- Knuth-Bendix completion (1)
- Knuth-Bendix completion algorithm (1)
- Knuth-Bendix-Vervollständigung (1)
- Kollisionserkennung (1)
- Kommunikationsprotokoll (1)
- Komplexitätsklasse NP (1)
- Komponente <Software> (1)
- Kompression (1)
- Kontextbezogenes System (1)
- Kooperation (1)
- Korrelationsanalyse (1)
- Kraftregelung (1)
- Kurve (1)
- Künstliche Intelligenz (1)
- LIDAR (1)
- LIR-Tree (1)
- Language Constructs (1)
- Large Data (1)
- Large High-Resolution Displays (1)
- Laser Wakefield Particle Accelerator (1)
- Learning Analytics (1)
- Leistungsmessung (1)
- Link Metric (1)
- Linked Data (1)
- Linking Data Analysis and Visualization (1)
- Location Awareness (1)
- Logical Time (1)
- Lokalisierung (1)
- Lärmbelastung (1)
- Lärmimmission (1)
- MAC protocols (1)
- MEGI (1)
- META-AKAD (1)
- MHEG (1)
- MIDI <Musikelektronik> (1)
- MIP-Emissionsspektroskopie (1)
- MIP-Massenspektrometrie (1)
- MIR (1)
- MOO (1)
- MP3 (1)
- Magnetfeldbasierter Lokalisierung (1)
- Magnetfelder (1)
- Magnetometer (1)
- Manufacturing (1)
- Map Building (1)
- MapReduce (1)
- Mapping (1)
- Maschinelle Übersetzung (1)
- Maschinelles Lernen (1)
- Mastoid (1)
- Mastoidektomie (1)
- Matrix Completion (1)
- Maturity of Software Engineering (1)
- Maximum Intensity Projection (1)
- Medical Image Analysis (1)
- Memory Architecture (1)
- Memory Consistency (1)
- Mensch-Maschine-Kommunikation (1)
- Mensch-Roboter-Kooperation (1)
- Menschenmenge (1)
- Merkmalsraum (1)
- Mesh-Free (1)
- Meter (1)
- Methods (1)
- Microelectromechanical Systems (1)
- Mikroskopie (1)
- Minimal Cut Set Visualization (1)
- Minimal training (1)
- Mobile system (1)
- Mobiler Roboter (1)
- Model Based User Interface Development (1)
- Modellgetriebene Entwicklung (1)
- Modellierung (1)
- Modularisierung (1)
- Molekulare Bioinformatik (1)
- Moment Invariants (1)
- Moment-Generating Functions (1)
- Mood-based Music Recommendations (1)
- Multi-Edge Graph (1)
- Multi-Field (1)
- Multi-Variate Data (1)
- Multidisciplinary Optimization (1)
- Multifield Data (1)
- Music Information Retrieval (1)
- Musik / Artes liberales (1)
- NP-hard (1)
- Nachhaltigkeit (1)
- Natural Neighbor (1)
- Natural Neighbor Interpolation (1)
- Natürliche Nachbarn (1)
- Navigation (1)
- Nearest-Neighbor Classification (1)
- Network Architecture (1)
- Netzwerk (1)
- Neural Architecture Search (1)
- Neural Networks (1)
- Node-Link Diagram (1)
- Numerische Strömungssimulation (1)
- Nvidia (1)
- OCL 2.0 (1)
- OCR (1)
- OWL (1)
- Object-OrientedCase Representation (1)
- Object-Relational DataBase Management Systems (ORDBMS) (1)
- Object-Relational Database Systems (1)
- Off-road Robotics (1)
- Off-road Robotik (1)
- Ohrenchirurgie (1)
- Online chain partitioning (1)
- Ontolingua (1)
- Ontology (1)
- Open-Source (1)
- Optimierender Compiler (1)
- Optimization (1)
- PATDEX (1)
- PC-based robot control (1)
- PDF <Dateiformat> (1)
- PERA (1)
- PI-Regler (1)
- PLAN Abstraction (1)
- Paralleler Hybrid (1)
- Pareto Optimality (1)
- Partial Differential Equations (1)
- Partially ordered sets (1)
- Participatory Sensing (1)
- Peer-to-Peer-Netz (1)
- Performance (1)
- Personalisation (1)
- Pervasive health (1)
- Physical activity monitoring (1)
- Planar Pressure (1)
- Planning and Verification (1)
- Position Sensitive Device (1)
- Position- and Orientation Estimation (1)
- Privacy (1)
- Problem Solvers (1)
- Process Data (1)
- Process Management (1)
- Process configuration (1)
- Process creation (1)
- Process support (1)
- Processor Architecture (1)
- Processor Architectures (1)
- Produktionsdesign (1)
- Profiles (1)
- Project Management (1)
- Protocol Composition (1)
- Prototyp (1)
- Prototype (1)
- Prozessvisualisierung (1)
- Quality Improvement Paradigm (QIP) (1)
- Quantitative Bildanalyse (1)
- Quartz (1)
- Quicksort (1)
- RNA interaction (1)
- Random testing (1)
- Rate Gyro (1)
- Ray tracing (1)
- ReasoningSystems (1)
- Rechtecksgitter (1)
- Rectilinear Grid (1)
- Redundanzvermeidung (1)
- Regelung (1)
- Regler (1)
- Reglerentwurf (1)
- Reinforcement Learning (1)
- Repositories (1)
- Representation (1)
- Requirements engineering (1)
- Reservierungsprotokoll (1)
- Reuse (1)
- Risikobewertung (1)
- Risk Assessment (1)
- Robot Calibration (1)
- Rogue AP (1)
- Räumliche Statistik (1)
- SAHARA (1)
- SCAD (1)
- SDL extensions (1)
- SDL-2000 (1)
- SDL-pattern a (1)
- SFB-EB (1)
- SIMD architectures (1)
- SPARQL (1)
- SPARQL query learning (1)
- SWEEPING (1)
- Safety Analysis (1)
- Scalar (1)
- Schema <Informatik> (1)
- Schematisation (1)
- Schematisierung (1)
- Schädelchirurgie (1)
- Scientific Community Analysis (1)
- Scientific Computing (1)
- Self-Referencing (1)
- Self-organization (1)
- Self-supervised Learning (1)
- Semantic Desktop (1)
- Semantic Index (1)
- Semantic Wikis (1)
- Semantics of Programming Languages (1)
- Semantische Modellierung (1)
- Semantisches Datenmodell (1)
- Sensing (1)
- Sensor (1)
- Sensor Fusion (1)
- Sensors (1)
- Shared Resource Modeling (1)
- Sicherheitsanalyse (1)
- Similarity Assessment (1)
- Similarity Join (1)
- Similarity Joins (1)
- Simultaneous quantifier elimination (1)
- Skalar (1)
- Skalierbarkeit (1)
- Smalltalk (1)
- Smart City (1)
- Smart Device (1)
- Smart Mobile Device (1)
- Smart Textile (1)
- SmartFactory (1)
- Smartphone (1)
- Smartwatch (1)
- Socio-Semantic Web (1)
- Software (1)
- Software Comprehension (1)
- Software Dependencies (1)
- Software Engineering (1)
- Software Evolution (1)
- Software Maintenance (1)
- Software Measurement (1)
- Software Process Support (1)
- Software Testing (1)
- Software Visualization (1)
- Software development (1)
- Software development environment (1)
- Software transactional memory (1)
- Software-Architektur (1)
- Softwareentwicklung (1)
- Softwaremetrie (1)
- Softwarewartung (1)
- Spezifikation (1)
- Sprachdefinition (1)
- Statistical Independence (1)
- Stereovision (1)
- Stimmungsbasierte Musikempfehlungen (1)
- Stochastic Dependence (1)
- Stochastic Network Calculus (1)
- Stokes Equations (1)
- Streaming (1)
- Structural Adaptation (1)
- Structuring Approach (1)
- Strukturiertes Gitter (1)
- Strömung (1)
- Surface Reconstruction (1)
- Synchronous Control Asynchronous Dataflow (1)
- System Abstractions (1)
- SystemC (1)
- Systemarchitektur (1)
- Systemdesign (1)
- Tactics (1)
- Task-based (1)
- Tcl (1)
- Technology combination (1)
- Technology decision (1)
- Technology selection (1)
- Temporal Decoupling (1)
- Temporal data processing (1)
- Tensor (1)
- Tensorfeld (1)
- Termination (1)
- Tesselation (1)
- Tetraeder (1)
- Tetraedergi (1)
- Tetrahedral Grid (1)
- Tetrahedral Mesh (1)
- Textual CBR (1)
- Themenbasierte Empfehlungen von Ressourcen (1)
- Time Series (1)
- Time series classification (1)
- Time-slotted (1)
- Tonsignal (1)
- Topic-based Resource Recommendations (1)
- Topologie (1)
- Topology Preserving Networks (1)
- Topology visualization (1)
- Transaction Level Modeling (TLM) (1)
- Transport Protocol (1)
- Traversability Analysis (1)
- UML (1)
- UML 2 (1)
- UML Activity (1)
- UML Profile (1)
- Ubiquitous system (1)
- Uncertainty Estimation (1)
- Universal Control Device (1)
- Unobtrusive instrumentations (1)
- Unorganized Data (1)
- Unstrukturiertes Gitter (1)
- Urban sprawl (1)
- UrbanSim (1)
- Usage Control (1)
- User Model (1)
- VIROP (1)
- Validierung (1)
- Vector (1)
- Vector Field (1)
- Vector Time (1)
- Vektor (1)
- Vektorfelder (1)
- Verifikation (1)
- Verzerrungstensor (1)
- Virtual Corporation (1)
- Virtual Software Projects (1)
- Vision (1)
- Visual Queries (1)
- Visualization Theory (1)
- Volume rendering (1)
- Volumen-Rendering (1)
- Voronoi diagram (1)
- Voronoi-Diagramm (1)
- WETICE 98 (1)
- Weak Memory Model (1)
- Wearable Computing (1)
- Wi-Fi (1)
- Wide Area Multimedia Group Interaction (1)
- Wide-column stores (1)
- Wireless Networks (1)
- Wissenschaftliches Rechnen (1)
- Wissenserwerb (1)
- Workflow Replication (1)
- World-Wide Web (1)
- XDBMS (1)
- XML (1)
- XML query estimation (1)
- XML summary (1)
- Yaroslavskiy-Bentley-Bloch Quicksort (1)
- Zielverfolgung (1)
- abstract description (1)
- access rights (1)
- acoustic modeling (1)
- active damping (1)
- adaption (1)
- affective user interface (1)
- affine arithmetic (1)
- aliasing (1)
- analogical reasoning (1)
- architecture (1)
- artificial neural network (1)
- assembly sequence design (1)
- associations (1)
- authentication (1)
- autoencoder (1)
- automated code generation (1)
- automated computer learning (1)
- automated proof planner (1)
- automated synchronization (1)
- automotive (1)
- autonomes Lernen (1)
- autonomous learning (1)
- autonomous systems (1)
- average-case analysis (1)
- bedingte Aktionen (1)
- behaviour-based system (1)
- bi-directional search (1)
- bidirectional search (1)
- binary countdown protocol (1)
- biological motivated (1)
- biologisch motiviert (1)
- black bursts (1)
- body-IMU calibration (1)
- branch-and-bound (1)
- buildroot (1)
- business process modelling (1)
- business process reengineering (1)
- byte code (1)
- case-based planner (1)
- classification (1)
- client/server-architecture (1)
- climate (1)
- clustering (1)
- co-learning (1)
- collaborative information visualization (1)
- collaborative mobile sensing (1)
- collective intelligence (1)
- collision detection (1)
- combinatorial algorithms (1)
- communication architectures (1)
- communication protocols (1)
- communication subsystem (1)
- compilation (1)
- compiler (1)
- completeness (1)
- complex System Development (1)
- component-based (1)
- comprehensive reuse (1)
- computational biology (1)
- computational fluid dynamics (1)
- computer aided planning (1)
- concept representation (1)
- conceptual design (1)
- conceptual representation (1)
- concurrent (1)
- concurrent software (1)
- constraint exploration (1)
- constraint satisfaction problem (CSP) (1)
- constraint-based reasoning (1)
- content-and-structure summary (1)
- continuous master theorem (1)
- continuous media (1)
- cooperative problem solving (1)
- crowd condition estimation (1)
- crowd density estimation (1)
- crowd scanning (1)
- crowd sensing (1)
- crowdsourcing (1)
- curves and surfaces (1)
- customization of communication protocols (1)
- data race (1)
- data sets (1)
- data-flow (1)
- dataset (1)
- decidability (1)
- decision support (1)
- deformable object (1)
- dependable systems (1)
- dependency management (1)
- description of reactive systems (1)
- design (1)
- design processes (1)
- deterministic arbitration (1)
- diagnostic problems (1)
- directed graphs (1)
- discosat (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 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)
- domains (1)
- efficiency (1)
- embedded (1)
- embedding (1)
- emotion visualization (1)
- encapsulation (1)
- end-to-end learning (1)
- energy consumption (1)
- ensemble (1)
- environmental noise (1)
- ernergy effcient motion (1)
- evolutionary algorithm (1)
- experience management (1)
- experimental software engineering (1)
- explainability (1)
- fallbasiertes Schliessen (1)
- fallbasiertes planen (1)
- firewall (1)
- flexible workflows (1)
- flexible-link (1)
- flexible-link robot (1)
- flow visualization (1)
- force control (1)
- force following (1)
- formal description techniques (1)
- formal reasoning (1)
- foundational translation validation (1)
- frame buffer operations (1)
- framework (1)
- gaussian filter (1)
- generic design of a customized communication subsystem (1)
- geographic information systems (1)
- geology (1)
- goal oriented completion (1)
- graph drawing algorithm (1)
- graph embedding (1)
- graph layout (1)
- graphic processors (1)
- guarded actions (1)
- hand pose, hand shape, depth image, convolutional neural networks (1)
- heterogeneous large-scale distributed DBMS (1)
- high-level caching of potentially shared networked documents (1)
- higher order logic (1)
- higher order tableau (1)
- higher-order calculi (1)
- higher-order tableaux calculus (1)
- higher-order theorem prover (1)
- historical documents (1)
- hub location (1)
- human body motion tracking (1)
- human robot cooperation (1)
- humanoid robot (1)
- humanoide Roboter (1)
- hybrid control (1)
- hybrid knowledge representation (1)
- hypercubes (1)
- hypergraph (1)
- iB2C (1)
- idle times (1)
- image analysis (1)
- implementation (1)
- industrial supervision (1)
- inertial sensors (1)
- information systems (1)
- information systems engineering (1)
- intelligent agents (1)
- interference (1)
- internet event synchronizer (1)
- interpolation (1)
- interpreter (1)
- interval arithmetic (1)
- invariant (1)
- isochronous streams (1)
- knowledge processing (1)
- knowledge space (1)
- kraftbasiertes Führen (1)
- language definition (1)
- language modeling (1)
- language profiles (1)
- learning (1)
- linked abstraction workflows (1)
- linked data (1)
- load sharing (1)
- local communication (1)
- long short-term memory (1)
- long tail (1)
- machine-checkable proof (1)
- magnetic field based localization (1)
- magnetometer calibration (1)
- manipulation (1)
- mastoid (1)
- mastoidectomy (1)
- mathematical concept (1)
- matrix visualization (1)
- measurement (1)
- message-passing (1)
- metadata (1)
- microelectronics ontology (1)
- middleware (1)
- migration (1)
- mixed-signal (1)
- mobile agents (1)
- mobile agents approach (1)
- modelling time (1)
- modularisation (1)
- moment (1)
- monitoring and managing distributed development processes (1)
- morphism (1)
- multi-agent architecture (1)
- multi-language (1)
- multicore (1)
- multidimensional datasets (1)
- multimedia (1)
- multinomial regression (1)
- multiple context free grammar (1)
- multiple-view product modeling (1)
- multithreading (1)
- multitype code coupling (1)
- multiway partitioning (1)
- narrowing (1)
- natural language semantics (1)
- navigation (1)
- negotiation (1)
- nestable tangibles (1)
- object frameworks (1)
- object-orientation (1)
- object-oriented software modeling (1)
- off-line programming (1)
- operations research (1)
- optimization (1)
- optimization correctness (1)
- order-sorted logic (1)
- oscillating magnetic fields (1)
- oscillation (1)
- otorhinolaryngological surgery (1)
- out-of-order (1)
- ownership (1)
- parallel (1)
- parallelism and concurrency (1)
- paramodulation (1)
- participatory sensing (1)
- path cost models (1)
- pattern recognition (1)
- persistence (1)
- pivot sampling (1)
- plan enactment (1)
- planning (1)
- point cloud (1)
- point-to-point (1)
- problem solvers (1)
- process model (1)
- process modelling (1)
- process support system (PROSYT) (1)
- process-centred environments (1)
- profiles (1)
- programmable client-server systems (1)
- programming by demonstration (1)
- project coordination (1)
- proof generating optimizer (1)
- proof plans (1)
- proof presentation (1)
- protocol (1)
- quality assurance (1)
- rapid authoring (1)
- raster graphics (1)
- rate control (1)
- ray casting (1)
- ray tracing (1)
- reactive systems (1)
- real time (1)
- real-time (1)
- real-time tasks (1)
- real-time temporal logic (1)
- reasoning (1)
- receptive safety properties (1)
- redundancy (1)
- redundant robots (1)
- relaxed memory models (1)
- reliability (1)
- requirements (1)
- reuse repositories (1)
- review (1)
- rings (1)
- risk management (1)
- robot (1)
- robot calibration (1)
- robot control (1)
- robot control architectures (1)
- robot kinematics (1)
- robot motion planning (1)
- robotics (1)
- robustness (1)
- roles (1)
- rule-based reasoning (1)
- scalar field (1)
- scene flow (1)
- sdr (1)
- search algorithm (1)
- search alogorithms (1)
- search-space-problem (1)
- second order logic (1)
- secondary structure prediction (1)
- security domain (1)
- seed filling (1)
- self-localization (1)
- semiring parsing (1)
- sequent calculus (1)
- shortest sequence (1)
- similarity measure (1)
- skolemization (1)
- small-multiples node-link visualization (1)
- sniffing (1)
- social media (1)
- software agents (1)
- software comprehension (1)
- software engineering (1)
- software engineering task (1)
- software project (1)
- software project management (1)
- software reuse (1)
- sorted logic (1)
- soundness (1)
- sparse-to-dense (1)
- spatial statistics (1)
- state-based formalism (1)
- static load balancing (1)
- static software structure (1)
- stationary sensing (1)
- statistics (1)
- stochastic context free grammar (1)
- structural summary (1)
- subjective evaluation (1)
- symbolic simulation (1)
- synchrone Sprachen (1)
- synchronous (1)
- synchronous languages (1)
- system architecture (1)
- system behaviour (1)
- tableau (1)
- tabletop (1)
- task sequence (1)
- tensor (1)
- tensorfield (1)
- terrain rendering (1)
- time-dependent (1)
- time-varying flow fields (1)
- topology preserving maps (1)
- tori (1)
- touch surfaces (1)
- traceability (1)
- trajectory optimization (1)
- translation (1)
- translation contract (1)
- translation validation (1)
- traveling salesman problem (1)
- types (1)
- typical examples (1)
- typical instance (1)
- ultrasound signals (1)
- urban planning (1)
- user-centered design (1)
- vector field visualization (1)
- vectorfield (1)
- vetreilte nachgiebige Regelung (1)
- virtual market place (1)
- virtual programming (1)
- virtual reality (1)
- visual analytics (1)
- visual analytics, machine learning, interaction, user experience, assistive technologies (1)
- visual process modelling environment (1)
- visual structure (1)
- wearable systems (1)
- weighted finite-state transducers (1)
- wireless signal (1)
- work coordination (1)
- world modelling (1)
- world-modelling (1)
- xai (1)
- zeitabhängige Strömungen (1)
- Ähnlichkeit (1)
- Übersetzung (1)
Faculty / Organisational entity
We present a convenient notation for positive/negativeADconditional equations. Theidea is to merge rules specifying the same function by using caseAD, ifAD, matchAD, and letADexpressions.Based on the presented macroADruleADconstruct, positive/negativeADconditional equational specifiADcations can be written on a higher level. A rewrite system translates the macroADruleADconstructsinto positive/negativeADconditional equations.
Distributed systems are omnipresent nowadays and networking them is fundamental for the continuous dissemination and thus availability of data. Provision of data in real-time is one of the most important non-functional aspects that safety-critical networks must guarantee. Formal verification of data communication against worst-case deadline requirements is key to certification of emerging x-by-wire systems. Verification allows aircraft to take off, cars to steer by wire, and safety-critical industrial facilities to operate. Therefore, different methodologies for worst-case modeling and analysis of real-time systems have been established. Among them is deterministic Network Calculus (NC), a versatile technique that is applicable across multiple domains such as packet switching, task scheduling, system on chip, software-defined networking, data center networking and network virtualization. NC is a methodology to derive deterministic bounds on two crucial performance metrics of communication systems:
(a) the end-to-end delay data flows experience and
(b) the buffer space required by a server to queue all incoming data.
NC has already seen application in the industry, for instance, basic results have been used to certify the backbone network of the Airbus A380 aircraft.
The NC methodology for worst-case performance analysis of distributed real-time systems consists of two branches. Both share the NC network model but diverge regarding their respective derivation of performance bounds, i.e., their analysis principle. NC was created as a deterministic system theory for queueing analysis and its operations were later cast in a (min,+)-algebraic framework. This branch is known as algebraic Network Calculus (algNC). While algNC can efficiently compute bounds on delay and backlog, the algebraic manipulations do not allow NC to attain the most accurate bounds achievable for the given network model. These tight performance bounds can only be attained with the other, newly established branch of NC, the optimization-based analysis (optNC). However, the only optNC analysis that can currently derive tight bounds was proven to be computationally infeasible even for the analysis of moderately sized networks other than simple sequences of servers.
This thesis makes various contributions in the area of algNC: accuracy within the existing framework is improved, distributivity of the sensor network calculus analysis is established, and most significantly the algNC is extended with optimization principles. They allow algNC to derive performance bounds that are competitive with optNC. Moreover, the computational efficiency of the new NC approach is improved such that this thesis presents the first NC analysis that is both accurate and computationally feasible at the same time. It allows NC to scale to larger, more complex systems that require formal verification of their real-time capabilities.
The Internet has fallen prey to its most successful service, the World-Wide Web. The networksdo not keep up with the demands incurred by the huge amount of Web surfers. Thus, it takeslonger and longer to obtain the information one wants to access via the World-Wide Web.Many solutions to the problem of network congestion have been developed in distributed sys-tems research in general and distributed file and database systems in particular. The introduc-tion of caching and replication strategies has proven to help in many situations and thereforethese techniques are also applied to the WWW. Although most problems and associated solu-tions are known, some circumstances are different with the Web, forcing the adaptation ofknown strategies. This paper gives an overview about these differences and about currentlydeployed, developed, and evaluated solutions.
We have developed a middleware framework for workgroup environments that can support distributed software development and a variety of other application domains requiring document management and change management for distributed projects. The framework enables hypermedia-based integration of arbitrary legacy and new information resources available via a range of protocols, not necessarily known in advance to us as the general framework developers nor even to the environment instance designers. The repositories in which such information resides may be dispersed across the Internet and/or an organizational intranet. The framework also permits a range of client models for user and tool interaction, and applies an extensible suite of collaboration services, including but not limited to multi-participant workflow and coordination, to their information retrievals and updates. That is, the framework is interposed between clients, services and repositories - thus "middleware". We explain how our framework makes it easy to realize a comprehensive collection of workgroup and workflow features we culled from a requirements survey conducted by NASA.
Crowd condition monitoring concerns the crowd safety and concerns business performance metrics. The research problem to be solved is a crowd condition estimation approach to enable and support the supervision of mass events by first-responders and marketing experts, but is also targeted towards supporting social scientists, journalists, historians, public relations experts, community leaders, and political researchers. Real-time insights of the crowd condition is desired for quick reactions and historic crowd conditions measurements are desired for profound post-event crowd condition analysis.
This thesis aims to provide a systematic understanding of different approaches for crowd condition estimation by relying on 2.4 GHz signals and its variation in crowds of people, proposes and categorizes possible sensing approaches, applies supervised machine learning algorithms, and demonstrates experimental evaluation results. I categorize four sensing approaches. Firstly, stationary sensors which are sensing crowd centric signals sources. Secondly, stationary sensors which are sensing other stationary signals sources (either opportunistic or special purpose signal sources). Thirdly, a few volunteers within the crowd equipped with sensors which are sensing other surrounding crowd centric device signals (either individually, in a single group or collaboratively) within a small region. Fourthly, a small subset of participants within the crowd equipped with sensors and roaming throughout a whole city to sense wireless crowd centric signals.
I present and evaluate an approach with meshed stationary sensors which were sensing crowd centric devices. This was demonstrated and empirically evaluated within an industrial project during three of the world-wide largest automotive exhibitions. With over 30 meshed stationary sensors in an optimized setup across 6400m2 I achieved a mean absolute error of the crowd density of just 0.0115
people per square meter which equals to an average of below 6% mean relative error from the ground truth. I validate the contextual crowd condition anomaly detection method during the visit of chancellor Mrs. Merkel and during a large press conference during the exhibition. I present the approach of opportunistically sensing stationary based wireless signal variations and validate this during the Hannover CeBIT exhibition with 80 opportunistic sources with a crowd condition estimation relative error of below 12% relying only on surrounding signals in influenced by humans. Pursuing this approach I present an approach with dedicated signal sources and sensors to estimate the condition of shared office environments. I demonstrate methods being viable to even detect low density static crowds, such as people sitting at their desks, and evaluate this on an eight person office scenario. I present the approach of mobile crowd density estimation by a group of sensors detecting other crowd centric devices in the proximity with a classification accuracy of the crowd density of 66 % (improvement of over 22% over a individual sensor) during the crowded Oktoberfest event. I propose a collaborative mobile sensing approach which makes the system more robust against variations that may result from the background of the people rather than the crowd condition with differential features taking information about the link structure between actively scanning devices, the ratio between values observed by different devices, ratio of discovered crowd devices over time, team-wise diversity of discovered devices, number of semi- continuous device visibility periods, and device visibility durations into account. I validate the approach on multiple experiments including the Kaiserslautern European soccer championship public viewing event and evaluated the collaborative mobile sensing approach with a crowd condition estimation accuracy of 77 % while outperforming previous methods by 21%. I present the feasibility of deploying the wireless crowd condition sensing approach to a citywide scale during an event in Zurich with 971 actively sensing participants and outperformed the reference method by 24% in average.
In recent years several computational systems and techniques fortheorem proving by analogy have been developed. The obvious prac-tical question, however, as to whether and when to use analogy hasbeen neglected badly in these developments. This paper addresses thisquestion, identifies situations where analogy is useful, and discussesthe merits of theorem proving by analogy in these situations. Theresults can be generalized to other domains.
In this paper we present the results of the project “#Datenspende” where during the German election in 2017 more than 4000 people contributed their search results regarding keywords connected to the German election campaign.
Analyzing the donated result lists we prove, that the room for personalization of the search results is very small. Thus the opportunity for the effect mentioned in Eli Pariser’s filter bubble theory to occur in this data is also very small, to a degree that it is negligible. We achieved these results by applying various similarity measures to the result lists that were donated. The first approach using the number of common results as a similarity measure showed that the space for personalization is less than two results out of ten on average when searching for persons and at most four regarding the search for parties. Application of other, more specific measures show that the space is indeed smaller, so that the presence of filter bubbles is not evident.
Moreover this project is also a proof of concept, as it enables society to permanently monitor a search engine’s degree of personalization for any desired search terms. The general design can also be transferred to intermediaries, if appropriate APIs restrict selective access to contents relevant to the study in order to establish a similar degree of trustworthiness.
Wearable activity recognition aims to identify and assess human activities with the help
of computer systems by evaluating signals of sensors which can be attached to the human
body. This provides us with valuable information in several areas: in health care, e.g. fluid
and food intake monitoring; in sports, e.g. training support and monitoring; in entertainment,
e.g. human-computer interface using body movements; in industrial scenarios, e.g.
computer support for detected work tasks. Several challenges exist for wearable activity
recognition: a large number of nonrelevant activities (null class), the evaluation of large
numbers of sensor signals (curse of dimensionality), ambiguity of sensor signals compared
to the activities and finally the high variability of human activity in general.
This thesis develops a new activity recognition strategy, called invariants classification,
which addresses these challenges, especially the variability in human activities. The
core idea is that often even highly variable actions include short, more or less invariant
sub-actions which are due to hard physical constraints. If someone opens a door, the
movement of the hand to the door handle is not fixed. However the door handle has to
be pushed to open the door. The invariants classification algorithm is structured in four
phases: segmentation, invariant identification, classification, and spotting. The segmentation
divides the continuous sensor data stream into meaningful parts, which are related
to sub-activities. Our segmentation strategy uses the zero crossings of the central difference
quotient of the sensor signals, as segment borders. The invariant identification finds
the invariant sub-activities by means of clustering and a selection strategy dependent on
certain features. The classification identifies the segments of a specific activity class, using
models generated from the invariant sub-activities. The models include the invariant
sub-activity signal and features calculated on sensor signals related to the sub-activity. In
the spotting, the classified segments are used to find the entire activity class instances in
the continuous sensor data stream. For this purpose, we use the position of the invariant
sub-activity in the related activity class instance for the estimation of the borders of the
activity instances.
In this thesis, we show that our new activity recognition strategy, built on invariant
sub-activities, is beneficial. We tested it on three human activity datasets with wearable
inertial measurement units (IMU). Compared to previous publications on the same
datasets we got improvement in the activity recognition in several classes, some with a
large margin. Our segmentation achieves a sensible method to separate the sensor data in
relation to the underlying activities. Relying on sub-activities makes us independent from
imprecise labels on the training data. After the identification of invariant sub-activities,
we calculate a value called cluster precision for each sensor signal and each class activity.
This tells us which classes can be easily classified and which sensor channels support
the classification best. Finally, in the training for each activity class, our algorithm selects
suitable signal channels with invariant sub-activities on different points in time and
with different length. This makes our strategy a multi-dimensional asynchronous motif
detection with variable motif length.
We study the global solution of Fredholm integral equations of the second kind by the help of Monte Carlo methods. Global solution means that we seek to approximate the full solution function. This is opposed to the usual applications of Monte Carlo, were one only wants to approximate a functional of the solution. In recent years several researchers developed Monte Carlo methods also for the global problem. In this paper we present a new Monte Carlo algorithm for the global solution of integral equations. We use multiwavelet expansions to approximate the solution. We study the behaviour of variance on increasing levels, and based on this, develop a new variance reduction technique. For classes of smooth kernels and right hand sides we determine the convergence rate of this algorithm and show that it is higher
than those of previously developed algorithms for the global problem. Moreover, an information-based complexity analysis shows that our algorithm is optimal among all stochastic algorithms of the same computational
cost and that no deterministic algorithm of the same cost can reach its convergence rate.
In this report we give an overview of the development of our new Waldmeisterprover for equational theories. We elaborate a systematic stepwise design process, startingwith the inference system for unfailing Knuth - Bendix completion and ending up with animplementation which avoids the main diseases today's provers suffer from: overindulgencein time and space.Our design process is based on a logical three - level system model consisting of basicoperations for inference step execution, aggregated inference machine, and overall controlstrategy. Careful analysis of the inference system for unfailing completion has revealed thecrucial points responsible for time and space consumption. For the low level of our model,we introduce specialized data structures and algorithms speeding up the running system andcutting it down in size - both by one order of magnitude compared with standard techniques.Flexible control of the mid - level aggregation inside the resulting prover is made possible by acorresponding set of parameters. Experimental analysis shows that this flexibility is a pointof high importance. We go on with some implementation guidelines we have found valuablein the field of deduction.The resulting new prover shows that our design approach is promising. We compare oursystem's throughput with that of an established system and finally demonstrate how twovery hard problems could be solved by Waldmeister.
In urban planning, sophisticated simulation models are key tools to estimate future population growth for measuring the impact of planning decisions on urban developments and the environment. Simulated population projections usually result in large, macro-scale, multivariate geospatial data sets. Millions of records have to be processed, stored, and visualized to help planners explore and analyze complex population patterns. We introduce a database driven framework for visualizing geospatial multidimensional simulation data based on the output from UrbanSim, a software for the analysis and planning of urban developments. The designed framework is extendable and aims at integrating empirical-stochastic methods and urban simulation models with techniques developed for information visualization and cartography. First, we develop an empirical model for the estimation of residential building types based on demographic household characteristics. The predicted dwelling type information is important for the analysis of future material use, carbon footprint calculations, and for visualizing simultaneously the results of land usage, density, and other significant parameters in 3D space. Our model uses multinomial logistic regression to derive building types at different scales. The estimated regression coefficients are applied to UrbanSim output in order to predict residential building types. The simulation results and the estimated building types are managed in an object-relational geodatabase. From the database, density, building types, and significant demographic variables are visually encoded as scalable, georeferenced 3D geometries and displayed on top of aerial photographs in a Google Earth visual synthesis. The geodatabase can be accessed and the visualization parameters can be chosen through a web-based user interface. The geometries are encoded in KML, Google's markup language, as ready-to-visualize data sets. The goal is to enhance human cognition by displaying abstract representations of multidimensional data sets in a realistic context and thus to support decision making in planning processes.
Due to the steadily growing flood of data, the appropriate use of visualizations for efficient data analysis is as important today as it has never been before. In many application domains, the data flood is based on processes that can be represented by node-link diagrams. Within such a diagram, nodes may represent intermediate results (or products), system states (or snapshots), milestones or real (and possibly georeferenced) objects, while links (edges) can embody transition conditions, transformation processes or real physical connections. Inspired by the engineering sciences application domain and the research project “SinOptiKom: Cross-sectoral optimization of transformation processes in municipal infrastructures in rural areas”, a platform for the analysis of transformation processes has been researched and developed based on a geographic information system (GIS). Caused by the increased amount of available and interesting data, a particular challenge is the simultaneous visualization of several visible attributes within one single diagram instead of using multiple ones. Therefore, two approaches have been developed, which utilize the available space between nodes in a diagram to display additional information.
Motivated by the necessity of appropriate result communication with various stakeholders, a concept for a universal, dashboard-based analysis platform has been developed. This web-based approach is conceptually capable of displaying data from various data sources and has been supplemented by collaboration possibilities such as sharing, annotating and presenting features.
In order to demonstrate the applicability and usability of newly developed applications, visualizations or user interfaces, extensive evaluations with human users are often inevitable. To reduce the complexity and the effort for conducting an evaluation, the browser-based evaluation framework (BREF) has been designed and implemented. Through its universal and flexible character, virtually any visualization or interaction running in the browser can be evaluated with BREF without any additional application (except for a modern web browser) on the target device. BREF has already proved itself in a wide range of application areas during the development and has since grown into a comprehensive evaluation tool.
Computer processing of free form surfaces forms the basis of a closed construction process starting with surface design and up to NC-production.
Numerical simulation and visualization allow quality analysis before manufacture. A new aspect in surface analysis is described, the stability
of surfaces versus infinitesimal bendings. The stability concept is derived
from the kinetic meaning of a special vector field which is given by the deformation. Algorithms to calculate this vector field together with an appropriate visualization method give a tool able to analyze surface stability.
The visualization of numerical fluid flow datasets is essential to the engineering processes that motivate their computational simulation. To address the need for visual representations that convey meaningful relations and enable a deep understanding of flow structures, the discipline of Flow Visualization has produced many methods and schemes that are tailored to a variety of visualization tasks. The ever increasing complexity of modern flow simulations, however, puts an enormous demand on these methods. The study of vortex breakdown, for example, which is a highly transient and inherently three-dimensional flow pattern with substantial impact wherever it appears, has driven current techniques to their limits. In this thesis, we propose several novel visualization methods that significantly advance the state of the art in the visualization of complex flow structures. First, we propose a novel scheme for the construction of stream surfaces from the trajectories of particles embedded in a flow. These surfaces are extremely useful since they naturally exploit coherence between neighboring trajectories and are highly illustrative in nature. We overcome the limitations of existing stream surface algorithms that yield poor results in complex flows, and show how the resulting surfaces can be used a building blocks for advanced flow visualization techniques. Moreover, we present a visualization method that is based on moving section planes that travel through a dataset and sample the flow. By considering the changes to the flow topology on the plane as it moves, we obtain a method of visualizing topological structures in three-dimensional flows that are not accessible by conventional topological methods. On the same algorithmic basis, we construct an algorithm for the tracking of critical points in such flows, thereby enabling the treatment of time-dependent datasets. Last, we address some problems with the recently introduced Lagrangian techniques. While conceptually elegant and generally applicable, they suffer from an enormous computational cost that we significantly use by developing an adaptive approximation algorithm. This allows the application of such methods on very large and complex numerical simulations. Throughout this thesis, we will be concerned with flow visualization aspect of general practical significance but we will particularly emphasize the remarkably challenging visualization of the vortex breakdown phenomenon.
In urban planning, both measuring and communicating sustainability are among the most recent concerns. Therefore, the primary emphasis of this thesis concerns establishing metrics and visualization techniques in order to deal with indicators of sustainability.
First, this thesis provides a novel approach for measuring and monitoring two indicators of sustainability - urban sprawl and carbon footprints – at the urban neighborhood scale. By designating different sectors of relevant carbon emissions as well as different household categories, this thesis provides detailed information about carbon emissions in order to estimate impacts of daily consumption decisions and travel behavior by household type. Regarding urban sprawl, a novel gridcell-based indicator model is established, based on different dimensions of urban sprawl.
Second, this thesis presents a three-step-based visualization method, addressing predefined requirements for geovisualizations and visualizing those indicator results, introduced above. This surface-visualization combines advantages from both common GIS representation and three-dimensional representation techniques within the field of urban planning, and is assisted by a web-based graphical user interface which allows for accessing the results by the public.
In addition, by focusing on local neighborhoods, this thesis provides an alternative approach in measuring and visualizing both indicators by utilizing a Neighborhood Relation Diagram (NRD), based on weighted Voronoi diagrams. Thus, the user is able to a) utilize original census data, b) compare direct impacts of indicator results on the neighboring cells, and c) compare both indicators of sustainability visually.
Nowadays, the increasing demand for ever more customizable products has emphasized the need for more flexible and fast-changing manufacturing systems. In this environment, simulation has become a strategic tool for the design, development, and implementation of such systems. Simulation represents a relatively low-cost and risk-free alternative for testing the impact and effectiveness of changes in different aspects of manufacturing systems.
Systems that deal with this kind of data for its use in decision making processes are known as Simulation-Based Decision Support Systems (SB-DSS). Although most SB-DSS provide a powerful variety of tools for the automatic and semi-automatic analysis of simulations, visual and interactive alternatives for the manual exploration of the results are still open to further development.
The work in this dissertation is focused on enhancing decision makers’ analysis capabilities by making simulation data more accessible through the incorporation of visualization and analysis techniques. To demonstrate how this goal can be achieved, two systems were developed. The first system, viPhos – standing for visualization of Phos: Greek for light –, is a system that supports lighting design in factory layout planning. viPhos combines simulation, analysis, and visualization tools and techniques to facilitate the global and local (overall factory or single workstations, respectively) interactive exploration and comparison of lighting design alternatives.
The second system, STRAD - standing for Spatio-Temporal Radar -, is a web-based systems that considers the spatio/attribute-temporal analysis of event data. Since decision making processes in manufacturing also involve the monitoring of the systems over time, STRAD enables the multilevel exploration of event data (e.g., simulated or historical registers of the status of machines or results of quality control processes).
A set of four case studies and one proof of concept prepared for both systems demonstrate the suitability of the visualization and analysis strategies adopted for supporting decision making processes in diverse application domains. The results of these case studies indicate that both, the systems as well as the techniques included in the systems can be generalized and extended to support the analysis of different tasks and scenarios.
Due to remarkable technological advances in the last three decades the capacity of computer systems has improved tremendously. Considering Moore's law, the number of transistors on integrated circuits has doubled approximately every two years and the trend is continuing. Likewise, developments in storage density, network bandwidth, and compute capacity show similar patterns. As a consequence, the amount of data that can be processed by today's systems has increased by orders of magnitude. At the same time, however, the resolution of screens has hardly increased by a factor of ten. Thus, there is a gap between the amount of data that can be processed and the amount of data that can be visualized. Large high-resolution displays offer a way to deal with this gap and provide a significantly increased screen area by combining the images of multiple smaller display devices. The main objective of this dissertation is the development of new visualization and interaction techniques for large high-resolution displays.
This dissertation focuses on the visualization of urban microclimate data sets,
which describe the atmospheric impact of individual urban features. The application
and adaptation of visualization and analysis concepts to enhance the
insight into observational data sets used this specialized area are explored, motivated
through application problems encountered during active involvement
in urban microclimate research at the Arizona State University in Tempe, Arizona.
Besides two smaller projects dealing with the analysis of thermographs
recorded with a hand-held device and visualization techniques used for building
performance simulation results, the main focus of the work described in
this document is the development of a prototypic tool for the visualization
and analysis of mobile transect measurements. This observation technique involves
a sensor platform mounted to a vehicle, which is then used to traverse
a heterogeneous neighborhood to investigate the relationships between urban
form and microclimate. The resulting data sets are among the most complex
modes of in-situ observations due to their spatio-temporal dependence, their
multivariate nature, but also due to the various error sources associated with
moving platform observations.
The prototype enables urban climate researchers to preprocess their data,
to explore a single transect in detail, and to aggregate observations from multiple
traverses conducted over diverse routes for a visual delineation of climatic
microenvironments. Extending traditional analysis methods, the suggested visualization
tool provides techniques to relate the measured attributes to each
other and to the surrounding land cover structure. In addition to that, an
improved method for sensor lag correction is described, which shows the potential
to increase the spatial resolution of measurements conducted with slow
air temperature sensors.
In summary, the interdisciplinary approach followed in this thesis triggers
contributions to geospatial visualization and visual analytics, as well as to urban
climatology. The solutions developed in the course of this dissertation are
meant to support domain experts in their research tasks, providing means to
gain a qualitative overview over their specific data sets and to detect patterns,
which can then be further analyzed using domain-specific tools and methods.
The focus of this work is to provide and evaluate a novel method for multifield topology-based analysis and visualization. Through this concept, called Pareto sets, one is capable to identify critical regions in a multifield with arbitrary many individual fields. It uses ideas found in graph optimization to find common behavior and areas of divergence between multiple optimization objectives. The connections between the latter areas can be reduced into a graph structure allowing for an abstract visualization of the multifield to support data exploration and understanding.
The research question that is answered in this dissertation is about the general capability and expandability of the Pareto set concept in context of visualization and application. Furthermore, the study of its relations, drawbacks and advantages towards other topological-based approaches. This questions is answered in several steps, including consideration and comparison with related work, a thorough introduction of the Pareto set itself as well as a framework for efficient implementation and an attached discussion regarding limitations of the concept and their implications for run time, suitable data, and possible improvements.
Furthermore, this work considers possible simplification approaches like integrated single-field simplification methods but also using common structures identified through the Pareto set concept to smooth all individual fields at once. These considerations are especially important for real-world scenarios to visualize highly complex data by removing small local structures without destroying information about larger, global trends.
To further emphasize possible improvements and expandability of the Pareto set concept, the thesis studies a variety of different real world applications. For each scenario, this work shows how the definition and visualization of the Pareto set is used and improved for data exploration and analysis based on the scenarios.
In summary, this dissertation provides a complete and sound summary of the Pareto set concept as ground work for future application of multifield data analysis. The possible scenarios include those presented in the application section, but are found in a wide range of research and industrial areas relying on uncertainty analysis, time-varying data, and ensembles of data sets in general.