Refine
Year of publication
Document Type
- Preprint (732)
- Article (382)
- Working Paper (114)
- Doctoral Thesis (54)
- Conference Proceeding (37)
- Report (20)
- Part of a Book (9)
- Book (5)
- Master's Thesis (5)
- Bachelor Thesis (3)
Language
- English (1365) (remove)
Has Fulltext
- yes (1365)
Is part of the Bibliography
- no (1365)
Keywords
- Lambda-Kalkül (20)
- Heavy Ion Experiments (19)
- Formale Semantik (11)
- Hadron-Hadron scattering (experiments) (10)
- Hadron-Hadron Scattering (9)
- lambda calculus (9)
- LHC (8)
- Operationale Semantik (8)
- Heavy-ion collision (7)
- Kongress (7)
- Nebenläufigkeit (7)
- Programmiersprache (7)
- concurrency (7)
- functional programming (6)
- semantics (6)
- Kryptologie (5)
- Online-Publikation (5)
- Textanalyse ; Linguistische Datenverarbeitung; Computerlinguistik (5)
- Verifikation (5)
- contextual equivalence (5)
- pi-calculus (5)
- ALICE (4)
- Computerlinguistik (4)
- Linguistische Datenverarbeitung (4)
- Logik (4)
- Quark-Gluon Plasma (4)
- Textanalyse (4)
- adequate translations (4)
- letrec (4)
- ALICE experiment (3)
- Collective Flow (3)
- Funktionale Programmiersprache (3)
- Funktionale Programmierung (3)
- Jets and Jet Substructure (3)
- LLL-reduction (3)
- Petri net (3)
- Verification (3)
- automated deduction (3)
- call-by-need (3)
- context lemma (3)
- functional programming languages (3)
- observational semantics (3)
- rewriting (3)
- verification (3)
- (surface) partial differential equations (2)
- Analog Circuits (2)
- BioCreative V.5 (2)
- BioNLP (2)
- Call-by-Need (2)
- Charm physics (2)
- Commitment Scheme (2)
- Computer science (2)
- Contextual Equivalence (2)
- Databases (2)
- Electroencephalography (2)
- External Memory (2)
- F.4.1 (2)
- FPGA (2)
- Finite Volumes (2)
- Heavy Ions (2)
- Heavy Quark Production (2)
- Kinect (2)
- Knapsack problem (2)
- Kontextuelle Gleichheit (2)
- Lattice basis reduction (2)
- Lepton-Nucleon Scattering (experiments) (2)
- Logic in computer science (2)
- Logics (2)
- Multimodal Learning Analytics (2)
- Named entity recognition (2)
- Natural Language Processing (2)
- Nichtdeterminismus (2)
- Numismatics (2)
- Oblivious Transfer (2)
- Paging (2)
- Particle Correlations and Fluctuations (2)
- Particle and resonance production (2)
- Pb–Pb collisions (2)
- Programming (2)
- Programmtransformation (2)
- Pufferspeicher (2)
- QCD (2)
- RDF (2)
- Randomization (2)
- San Jose (2)
- Semantics (2)
- Shortest lattice vector problem (2)
- Subset sum problem (2)
- Theoretische Informatik (2)
- amyloid precursor protein (2)
- call-by-name (2)
- computational complexity (2)
- computational virology (2)
- context unification (2)
- data structures (2)
- economics (2)
- hepatitis C virus (HCV) (2)
- hippocampus (2)
- infinitary lambda calculus (2)
- lambda-calculus (2)
- lazy evaluation (2)
- logics in artificial intelligence (2)
- lower bounds (2)
- massively parallel multigrid solvers (2)
- matching (2)
- morphology (2)
- neural networks (2)
- non-determinism (2)
- nondeterminism (2)
- parameter estimation (2)
- population dynamics (2)
- pp collisions (2)
- presynaptic active zone (2)
- program transformation (2)
- programming languages (2)
- realistic geometries (2)
- second order unification (2)
- segments (2)
- septic shock (2)
- simulation (2)
- unification (2)
- viral dynamics (2)
- 3D spatio-temporal resolved mathematical models (1)
- 3D spatiotemporal resolved mathematical models (1)
- 900 GeV (1)
- ALICE detector (1)
- ATPG (1)
- Abfrageverarbeitung (1)
- Abstraction (1)
- Abstrakte Reduktion (1)
- Abstrakter Automat (1)
- Active learning (1)
- Adaptive Prediction (1)
- Adaptive control (1)
- Adaptive process control (1)
- Agent <Künstliche Intelligenz> (1)
- Agenten (1)
- Agents (1)
- Agroecology (1)
- Algorithmus (1)
- Alice ML (1)
- Alpha equivalence (1)
- Alternate hydrophobicity (1)
- Amino acid pattern (1)
- Analog (1)
- Analog Verification (1)
- Analoges System (1)
- Analogschaltungen (1)
- Angiography (1)
- Anti-nuclei (1)
- App ecosystem (1)
- Approximation algorithm (1)
- Arabidopsis thaliana metabolism (1)
- Artificial neural networks (1)
- Atrial fibrillation classification (1)
- Attention mechanism (1)
- Auswahlprozess (1)
- Automata theory (1)
- Automatic (1)
- Autonomous Learning (1)
- BESIII (1)
- BFS (1)
- Baumgrammatiken (1)
- Beauty production (1)
- Behavioural ecology (1)
- Behavioural methods (1)
- Benchmark testing (1)
- Beschreibungskomplexität (1)
- Beta-sheet (1)
- Big Data (1)
- BigBench (1)
- Bildnisschutz (1)
- Bildverarbeitung (1)
- Biodiversity (1)
- Biomedical named entity recognition (1)
- Blended learning (1)
- Blind Signature (1)
- Block Korkin—Zolotarev reduction (1)
- Boosted Jets (1)
- Branching fractions (1)
- Breaking knapsack cryptosystems (1)
- C-reactive protein (1)
- CABG (1)
- CBM detector (1)
- CEMP (1)
- CHEMDNER (1)
- CRF (1)
- CT (1)
- CTL (1)
- Caché (1)
- Call-by-need Lambda Calculus (1)
- Cameras (1)
- Cell staining (1)
- Cellular neural network (1)
- Centrality Class (1)
- Centrality Selection (1)
- Chatbot (1)
- Chinese Remainder Theorem (1)
- Claude Elwood (1)
- Clean (1)
- Closed World Assumption (CWA) (1)
- Closest Vector Problem (1)
- Clustering (1)
- Coding Scheme (1)
- Cognition (1)
- Cognitive (1)
- Commitment (1)
- Commitment schemes (1)
- Comparison with QCD (1)
- Complexity (1)
- Computational Humanities (1)
- Computational complexity (1)
- Computational geometry (1)
- Computational models (1)
- Computational neuroscience (1)
- Computational science (1)
- Computer Science (1)
- Concrete (1)
- Conjoint Analysis (1)
- Connected Components (1)
- Continual deep learning (1)
- Convolutional Neural Networks (1)
- Coordination (1)
- Correctness (1)
- Crowdsourcing (1)
- Cuneiform (1)
- Data Analytics (1)
- Data processing (1)
- Data protection (1)
- Data science (1)
- Dataflow Computing (1)
- Datenaustausch (1)
- Datenintegration (1)
- Datenqualität (1)
- Datenschutz (1)
- Deep learning (1)
- Deictic and iconic gestures (1)
- Detector Readout (1)
- Developmental Robotics (1)
- Developmental biology (1)
- Dialog Generation (1)
- Digital Humanities (1)
- Digital Rights Management (1)
- Digitalkamera (1)
- Dirichlet bound (1)
- Discrete Logarithm (1)
- Diskrete Mathematik (1)
- Dispositional learning analytics (1)
- Dynamic Graph Algorithms (1)
- Dynamical systems (1)
- E-Learning (1)
- EDISON competence framework (1)
- Educational institutions (1)
- Effective Field Theories (1)
- Ego-motion Estimation (1)
- Eigenbewegungsschaetzung (1)
- Electron-pion identification (1)
- Electroweak interaction (1)
- Elektronik (1)
- Elektronisches Wasserzeichen (1)
- Elliptic flow (1)
- Energy Efficiency (1)
- Energy-efficiency (1)
- Engineering (1)
- Entropie (1)
- Entropie <Informationstheorie> (1)
- Entwurfsautomation (1)
- Equation of State (1)
- Erasure-Correcting Codes (1)
- Error Mitigation (1)
- Euler method (1)
- Europe (1)
- Event-related potential (1)
- Exchange Format (1)
- Experimental Evaluation (1)
- Experimental Methods (1)
- Explicit Feedback (1)
- Extraterrestrial measurements (1)
- F.1.3 (1)
- FPGAs (1)
- Factoring (1)
- Fault Tolerance (1)
- Feasibility (1)
- Femtoscopy (1)
- Fiber Bundles (1)
- Fibre/foam sandwich radiator (1)
- Flash Memories (1)
- Formal Verification (1)
- Formale Verifikation (1)
- Formative assessment (1)
- Fourier-Motzkin algorithm (1)
- Frontmatter (1)
- Futures (1)
- GPGPU (1)
- GPRO (1)
- GPU Computing (1)
- GPU algorithms (1)
- Gedächtnis (1)
- Gedächtnisbildung (1)
- Gene expression (1)
- Generalized procrustes analysis (1)
- Geodesics (1)
- Gestural writing (1)
- Graph (1)
- Graph Algorithms (1)
- Graph theory (1)
- Green Computing (1)
- Großhirnrinde (1)
- H.2.3 (1)
- HBT (1)
- HEP-Computing (1)
- HPC (1)
- Hadron production (1)
- Hadron-Hadron Scattering Heavy (1)
- Hadronic decays (1)
- Hard Scattering (1)
- Hash Funktionen (1)
- Haskell (1)
- Haskell 98 (1)
- Hauptkomponentenanalyse (1)
- Heavy Ion Experiment (1)
- Heavy flavor production (1)
- Heavy flavour production (1)
- Heavy ions (1)
- Heavy-flavour decay muons (1)
- Heavy-ion collisions (1)
- Hematoxylin staining (1)
- Heuristics (1)
- High Level Synthesis (1)
- High energy physics (1)
- Higher education (1)
- Histology (1)
- Hive (1)
- Hochschule (1)
- Hodgkin lymphoma (1)
- Householder reflection (1)
- Hybrid automaton (1)
- Hydrophobicity scale (1)
- Hypertext (1)
- I/O Model (1)
- ICA (1)
- IS post-adoption (1)
- Iconography (1)
- Identification (1)
- Image processing (1)
- Image schemata (1)
- Implicit Discourse Parsing (1)
- Implicit Feedback (1)
- Implicit Semantic Role Labeling (1)
- In-TIPS thrombosis (1)
- Inclusive spectra (1)
- Independent Component Analysis ICA (1)
- Induktive Inferenz (1)
- Infinite games with perfect information (1)
- Inflammation (1)
- Informatik (1)
- Information Retrieval (1)
- Informationelles Selbstbestimmungsrecht (1)
- Informationsintegration (1)
- Integer relations (1)
- Intensity interferometry (1)
- InterSystems (1)
- Intrinsic Motivations (1)
- Invariant Mass Distribution (1)
- Invariant object recognition (1)
- Ionisation energy loss (1)
- Ionizing Radiation (1)
- Isolation (1)
- Iteratives Array (1)
- Java (1)
- Jet Physics (1)
- Jet Substructure (1)
- Jets (1)
- Kalman Filter (1)
- Kalman filter (1)
- Kalman-Filter (1)
- Kinetic hypertext authoring (1)
- Klebsiella pneumoniae (1)
- Knowledge engineering (1)
- Kohonen map (1)
- Kohonen mapping (1)
- Kollaboration <Informatik> (1)
- Kolmogorov complexity (1)
- Kontextuelle Gleicheit (1)
- Koordination (1)
- Korkin—Zolotarev reduction (1)
- Kryptographie (1)
- Kryptosystem (1)
- LSTM (1)
- LTP (1)
- Label cover (1)
- Lambda Calculus (1)
- Langzeitgedächtnis (1)
- Large Language Models (1)
- Lateral inhibited network (1)
- Lattice QCD (1)
- Lattice Quantum Field Theory (1)
- Lattice Reduction (1)
- Lattice-QCD (1)
- Layout (1)
- Learner goals (1)
- Learning Analytics (1)
- Learning analytics (1)
- Learning analytics dashboard (1)
- Learning dispositions (1)
- Lehre (1)
- Leichtgewichtige Kryptographie (1)
- Lernen (1)
- Letrec-Kalkül (1)
- Lifelong machine learning (1)
- Line reconstruction (1)
- Linked Data (1)
- Linux Container (1)
- Local field potential (1)
- Low density subset sum algorithm (1)
- Lymph nodes (1)
- Lymphocytes (1)
- MIMIC-III (1)
- ML <Programmiersprache> (1)
- Machine learning (1)
- Manatee invariant (1)
- Manhattan distance (1)
- Many-core computer architectures (1)
- MapReduce (1)
- Material budget (1)
- Mathematical model (1)
- McEliece (1)
- Medical Systems (1)
- Mehragentensystem (1)
- Merkmalsraum (1)
- Merkmalsselektion (1)
- Message authentication (1)
- Microarray (1)
- Mid-rapidity (1)
- Minimum Bias (1)
- Mitochondria (1)
- Mobile Phones (1)
- Mobile platforms (1)
- Model Checking (1)
- Modular Multiplication (1)
- Monte Carlo (1)
- Multi-Parton Interactions (1)
- Multi-strange baryons (1)
- Multi-wire proportional drift chamber (1)
- Multiset independent component analysis (1)
- Museum information system (1)
- Museums (1)
- NF-κB pathway (1)
- NP-complete problems (1)
- NP-hard (1)
- NP-hardness (1)
- NREM-Schlaf (1)
- Natural Language Understanding (1)
- Network models (1)
- Netzzusammenschaltung (1)
- Neural Networks (1)
- Neural encoding models (1)
- Neural network (1)
- Neurofuzzy (1)
- Neuronale Plastizität (1)
- Nichtlineare Datenanalyse (1)
- Nichtlineare Merkmalsselektion (1)
- Noisy point clouds (1)
- Non-Malleability (1)
- Non-determinism (1)
- Nonlinear Data Analysis (1)
- Nonlinear Feature Selection (1)
- Noticeable Probability (1)
- Nuclear Physics (1)
- Nuclear modification factor (1)
- ODE (1)
- ORC (1)
- Object vision (1)
- Objekterkennung (1)
- Online Algorithmen (1)
- Online Algorithms (1)
- Online algorithms (1)
- Ontologies (1)
- Ontology (1)
- Open set recognition (1)
- Open world learning (1)
- Open-access data resource (1)
- Operational Semantics (1)
- Oracle Query (1)
- PDE (1)
- PDEs (1)
- PYTHIA (1)
- Paging Algorithms (1)
- Parallel and SIMD calculations (1)
- Paramecium (1)
- Parameter estimation (1)
- Parkinson diagnosis (1)
- Parquet (1)
- Particle and Resonance Production (1)
- Particle correlations and fluctuations (1)
- Pathologists (1)
- Patternsprachen (1)
- Pb–Pb (1)
- Persönlichkeitsrecht (1)
- Phase Diagram of QCD (1)
- Phase-reset (1)
- Phosphate (1)
- Planning systems (1)
- Planungssystem (1)
- Planungssysteme (1)
- Plastizität (1)
- Plastizität <Physiologie> (1)
- PointNet (1)
- Polynomielles Wortproblem (1)
- Portabler Objektadapter (1)
- Pose Estimation (1)
- Positive fluid balance (1)
- Postoperative atrial fibrillation (1)
- Prag <1999> (1)
- Precongruence (1)
- Preface (1)
- Preßburg <2003> (1)
- Principal Component Analysis PCA (1)
- Principal Independent Component Analysis PICA (1)
- Principal component analysis (1)
- Privacy (1)
- Private Information Retrieval (1)
- Probabilistically checkable proofs (1)
- Production Cross Section (1)
- Program Transformations (1)
- Programmiersprachen (1)
- Programmkalküle (1)
- Programmkorrektheit (1)
- Properties of Hadrons (1)
- Prophet Inequalities (1)
- Proteins (1)
- Proton–proton (1)
- Präkongruenz (1)
- Präsenzlehre (1)
- Public Key Cryptosystem (1)
- Public Parameter (1)
- Python (1)
- Q-modularity (1)
- Quadratic Residue (1)
- Quantitative Imaging (1)
- Quark Deconfinement (1)
- Quark Gluon Plasma (1)
- Quark Production (1)
- Quark gluon plasma (1)
- Quarkonium (1)
- RBF-nets (1)
- RF development (1)
- RNA biology (1)
- RNA interference (1)
- Random Oracle (1)
- Random String (1)
- Randomized algorithms (1)
- Rapidity Range (1)
- Rate Distortion Theory (1)
- Rating Scale (1)
- Rating Scale Design (1)
- Rating System (1)
- Reaktivierung der Gedächtnisspuren (1)
- Recht am eignenen Bild (1)
- Reduktionssystem (1)
- Reinforcement Learning (1)
- Relationale Datenbank (1)
- Relativistic heavy ion physics (1)
- Representation Problem (1)
- Resolution Parameter (1)
- Resonances (1)
- Roboter (1)
- Robotics (1)
- Rubber extrusion (1)
- Rènyi mutual information (1)
- SHA-3 (1)
- SLAM (1)
- SLLL-reduction (1)
- SMASH (1)
- SORN (1)
- SPARQL (1)
- SQL-on-Hadoop (1)
- STDP (1)
- SWRL (1)
- San Francisco (1)
- Santa Barbara (1)
- Saward (1)
- Schlaf (1)
- Security (1)
- Security Parameter (1)
- Sehrinde (1)
- Seitenersetzungsstrategie (1)
- Selbstorganisierende Karte (1)
- Selection process (1)
- Self-Instruct (1)
- Self-organized eigenvector jets (1)
- Self-regulated learning (1)
- Semantic Web (1)
- Semantik (1)
- Sense-making (1)
- Sequence analysis (1)
- Shannon (1)
- Sharing (1)
- Short-lived particles (1)
- Sichere Antworten (1)
- Signaling pathway (1)
- Signature (1)
- Similarity (1)
- Single Event Effects (1)
- Single electrons (1)
- Single muons (1)
- Social behaviour (1)
- Software updates (1)
- SparkSQL (1)
- Specialized Information Service (1)
- Speicherbedarf (1)
- Sprachtheorie (1)
- Stable reduction algorithm (1)
- Statistical Classification (1)
- Stereo Vision (1)
- Stereophotographie (1)
- Stochastic Probing (1)
- Striktheitsanalyse (1)
- Student-facing learning analytics (1)
- Sumerian (1)
- Systematic Uncertainty (1)
- TIPS (1)
- TR (1)
- Table of Contents (1)
- Takens-Grassberger correlation integral (1)
- Technology-Enhanced Learning (1)
- Telekommunikationsnetz (1)
- Telekommunikationswirtschaft (1)
- Termination (1)
- Terrmersetzungssystem (1)
- Testing (1)
- Text mining (1)
- Time Constraints (1)
- Time Projection Chamber (1)
- Tracking (1)
- Training (1)
- Transfer learning (1)
- Transform coding (1)
- Transinformation (1)
- Transition invariant (1)
- Transition radiation detector (1)
- Transjugular Intrahepatic Portosystemic Shunt (1)
- Translation (1)
- Transmembrane helix (1)
- Transmembrane sheets (1)
- Transverse momentum (1)
- Trapdoor (1)
- Trigger (1)
- UPT (1)
- Umbenennung (1)
- Unabhängige Komponentenanalyse (1)
- Ungewissheit (1)
- Uniform resource locators (1)
- Universa feature extraxtion (1)
- Unüberwachtes Lernen (1)
- User Profile (1)
- VLSI (1)
- Valve surgery (1)
- Vector Boson Production (1)
- Vectorization (1)
- Visual (1)
- Visual object recognition (1)
- Voyeurism (1)
- Voyeurismus (1)
- WWW (1)
- Watermarking (1)
- Web (1)
- Web Analytics (1)
- Wechselseitige Information (1)
- Workshop Organization (1)
- Wortproblem (1)
- Xenon-based gas mixture (1)
- Z-inspection (1)
- Zellularer Automat (1)
- abstract reduction (1)
- acute infection (1)
- adaption (1)
- addition-invariant first-order logic (1)
- adequate translation (1)
- agent-based modeling (1)
- aging (1)
- algebraic closure properties (1)
- algorithms (1)
- alignment in communication structural coupling (1)
- alpha renaming (1)
- ambiguity (1)
- anaplastic large cell lymphoma (1)
- anatomy ontologies (1)
- approximation complexity (1)
- approximation networks (1)
- artificial intelligence (1)
- attention-based object recognition (1)
- automata (1)
- automatic handwriting analysis (1)
- average pairwise distance (1)
- big data (1)
- big data benchmarking (1)
- biochemical pathways (1)
- bisimulation (1)
- boutons (1)
- built-in self-test (1)
- calcium dynamics (1)
- call-by-need evaluation (1)
- call-by-need lambda calculus (1)
- cancer (1)
- cell motility (1)
- cellular automata (1)
- cellular neural nets (1)
- centrality (1)
- certain answers (1)
- chemokine receptors (1)
- chosen ciphertext attack (1)
- chronic infection (1)
- classical Hodgkin lymphoma (1)
- classification (1)
- clinical presentation (1)
- clique problem (1)
- closed world assumption (CWA) (1)
- cluster transformation (1)
- clustering (1)
- codon usage preferences (1)
- colorabdity (1)
- columnar file formats (1)
- combinatorics (1)
- common transition pairs (1)
- communication complexity (1)
- community (1)
- complementary information (1)
- compression (1)
- computational geometry (1)
- computer vision (1)
- concurrent composition (1)
- continued fraction algorithm (1)
- corpus study (1)
- correctness (1)
- coupled differential equations (1)
- coupon collector problem (1)
- dE/dx (1)
- dancing (1)
- data acquisition; high energy physics; FPGA; CBM; FLES (1)
- data analysis (1)
- data crowdsourcing (1)
- data exchange (1)
- data orthonormalization network (1)
- data quality (1)
- data science education (1)
- data streams (1)
- decidability questions (1)
- decidable characterisations (1)
- deduction (1)
- deductive database (1)
- deduktive Datenbank (1)
- deep learning (1)
- descriptive patterns (1)
- deskriptive Pattern (1)
- detailed modeling (1)
- detector (1)
- differential equations (1)
- digital pathology (1)
- discrete logarithm (1)
- discrete processing (1)
- diskrete Verarbeitung (1)
- dissemination (1)
- drahtlos (1)
- dynamic programming (1)
- e-Entropy (1)
- eHumanities (1)
- early warning signs (1)
- electrical stimulation (1)
- electronic pen (1)
- elementary mode (1)
- emergence (1)
- epigenome (1)
- epileptogenesis (1)
- epistemic network analysis (1)
- error bounds (1)
- ethical co-design (1)
- ethics (1)
- evolutionary associative learning (1)
- experimental results (1)
- exponentiation (1)
- eye-tracking (1)
- families of hash functions (1)
- feature selection (1)
- feedforward network layers (1)
- finite model theory (1)
- firing pattern (1)
- first-order logic (1)
- floating point arithmetic (1)
- floating point errors (1)
- formal languages (1)
- formal semantics (1)
- fractions of exponentiation (1)
- functional module (1)
- futures (1)
- gamification (1)
- gamma Zyklus (1)
- gamma cycle (1)
- gene expression (1)
- generatives Lernen (1)
- generic algorithm (1)
- generic group model (1)
- genetic algorithm (1)
- genotype–phenotype (1)
- grammar-based compression (1)
- graph algorithms (1)
- graph isomorphism (1)
- graph understanding (1)
- hard bit (1)
- hashing (1)
- haskell (1)
- hawkes processes (1)
- healthcare (1)
- heavy ion collisions (1)
- heavy ion experiments (1)
- heterogeneity (1)
- hierarchies and reducibilities (1)
- higher education (1)
- highly regular nearby points (1)
- homeostasis (1)
- human lymph node (1)
- human viruses (1)
- hybrid (1)
- image analysis (1)
- image databases (1)
- image encoding (1)
- immune system (1)
- impact parameter (1)
- incremental schemes (1)
- inductive inference (1)
- information conservation (1)
- information decomposition (1)
- information distribution (1)
- information landscape (1)
- inner product (1)
- integer points (1)
- integer relation (1)
- integer vector (1)
- intertextual similarity (1)
- intratextual similarity (1)
- intrinsic plasticity (1)
- invariant transition pairs (1)
- iterated subsegments (1)
- iterative arrays (1)
- kinetic fingerprint (1)
- knapsack cryptosystems (1)
- knowledge area (1)
- knowledge graphs (1)
- kontextabhängige Verarbeitung (1)
- kontextuelle Gleichheit (1)
- lattice basis reduction (1)
- lattices (1)
- learning goal (1)
- learning unit (1)
- length defect (1)
- linguistic linked open data (1)
- linguistic networks graph distance measures (1)
- linguistic relativity (1)
- linked open data (1)
- literature digitization (1)
- local LLL-reduction (1)
- local LLLreduction (1)
- local coordinates (1)
- local randomness (1)
- logic (1)
- logic synthesis (1)
- logical interpretations (1)
- logical networks (1)
- low-resource languages (1)
- machine learning (1)
- machine models (1)
- macronucleus (1)
- malignant melanoma (1)
- mathematical modeling (1)
- mathematical models of viral RNA cycle (1)
- matroids, online algorithm (1)
- maximal common transition set (1)
- maximal information gain (1)
- meson (1)
- meta languages (1)
- metabolic networks (1)
- minimal cut set (1)
- minimum description length (1)
- minimum entropy (1)
- mitochondria (1)
- model parameter adaption (1)
- model verification (1)
- modeling and simulation (1)
- models of computation (1)
- morphological filtering (1)
- multiple correspondence analysis (1)
- multiple texts (1)
- mutation (1)
- mutual information (1)
- mutual information of graphs (1)
- network model (1)
- network reduction (1)
- network similarity measurement (1)
- neural nets (1)
- neuromuscular junction (1)
- neuron (1)
- neuronal network (1)
- newspaper (1)
- noise suppression (1)
- nominal unification (1)
- non-commercial publishing (1)
- non-malleability (1)
- nondeterministic finite automata (1)
- nondetermmistlc Turing machines (1)
- ntracellular signaling (1)
- observational equivalence (1)
- off-line memory reprocessing (1)
- one-more decryption attack (1)
- one-way function (1)
- one-way functions (1)
- open access (1)
- optimization (1)
- overfitting (1)
- packing problem (1)
- parallel (1)
- parallel processes (1)
- parliamentary debate (1)
- parsing (1)
- pattern languages (1)
- phage (1)
- phage therapy (1)
- plasticity (1)
- polynomial random number generator (1)
- polynomial word problem (1)
- postrelational database (1)
- postrelationale Datenbank (1)
- precongruence (1)
- prediction quality (1)
- principal component analysis (1)
- process approximation (1)
- program correctness (1)
- programming calculi (1)
- programming languages design (1)
- public speaking (1)
- quark gluon plasma (1)
- quicksort (1)
- random function generator (1)
- random hyperbolic graph generator (1)
- random number generator (1)
- random oracle model (1)
- randomized algorithms (1)
- rate-distortion theory (1)
- reaction-diffusion systems (1)
- reactive systems (1)
- reception (1)
- redundancy (1)
- redundant information (1)
- regular tree languages (1)
- relative termination (1)
- representation (1)
- representative claims (1)
- resistance (1)
- restricted Hebbian learning (1)
- reward-dependent learning (1)
- rewriting systems (1)
- rosetting T cells (1)
- salsa (1)
- satlsfiablhty (1)
- scale-invariant object model (1)
- secretary problem (1)
- secure bit (1)
- security analysis of protocols (1)
- security of data (1)
- segmentation (1)
- semantic web (1)
- sensor-based learning support (1)
- sharing (1)
- shock filter (1)
- short integer relation (1)
- shortest lattice vector (1)
- signature size (1)
- signed ElGamal encryption (1)
- similarity (1)
- simultaneous diophantine approximations (1)
- simultaneous security of bits (1)
- single block replacement (1)
- small RNA (1)
- social media (1)
- sorting (1)
- space bounded computations (1)
- space improvements (1)
- space optimization (1)
- sparse coding (1)
- specialized vocabulary (1)
- specification and verification (1)
- spectra (1)
- storage optimization (1)
- straight line programs (1)
- streaming algorithm (1)
- strictness analysis (1)
- string rewriting (1)
- stroke (1)
- structure-function relationships (1)
- subset sum problems (1)
- substitution attacks (1)
- succinct data structures (1)
- succinctness (1)
- surface approximation (1)
- synapse (1)
- synaptic normalization (1)
- synergistic interaction (1)
- synergy (1)
- syntax (1)
- systems biology (1)
- t-cluster (1)
- t-invariant (1)
- tailored learning path (1)
- termination (1)
- testability (1)
- text mining tools (1)
- text search (1)
- textbooks (1)
- the set disjointness problem (1)
- theory of computation (1)
- three-level topic model (1)
- threshold concepts (1)
- trajectories (1)
- transition invariant (1)
- translation (1)
- translational selection (1)
- tree grammars (1)
- trustworthy AI (1)
- trustworthy AI Co-design (1)
- uncertainty (1)
- unique information (1)
- variability (1)
- verzögerte Auswertung (1)
- volatility clustering (1)
- volume-visualization (1)
- warts (1)
- weight resolutions (1)
- whitening filter (1)
- whole slide image (1)
- wikipedia (1)
- wireless business model pyramid scheme multi-level (1)
- within-host viral modeling (1)
- within-host viral modelling (1)
- women’s quota (1)
- xAPI (1)
- √sN N = 2.76 TeV (1)
Institute
- Informatik (1365) (remove)
Highlights
• Transparency of design, reference frames and support for action were found to support students' sense-making of LA dashboards.
• The higher the overall SRL score, the more relevant the three factors were perceived by learners.
• Learner goals affect how relevant students find reference frames.
• The SRL effect on the perceived relevance of transparency depends on learner goals.
Abstract
Unequal stakeholder engagement is a common pitfall of adoption approaches of learning analytics in higher education leading to lower buy-in and flawed tools that fail to meet the needs of their target groups. With each design decision, we make assumptions on how learners will make sense of the visualisations, but we know very little about how students make sense of dashboard and which aspects influence their sense-making. We investigated how learner goals and self-regulated learning (SRL) skills influence dashboard sense-making following a mixed-methods research methodology: a qualitative pre-study followed-up with an extensive quantitative study with 247 university students. We uncovered three latent variables for sense-making: transparency of design, reference frames and support for action. SRL skills are predictors for how relevant students find these constructs. Learner goals have a significant effect only on the perceived relevance of reference frames. Knowing which factors influence students' sense-making will lead to more inclusive and flexible designs that will cater to the needs of both novice and expert learners.
Measurements of the pT-dependent flow vector fluctuations in Pb-Pb collisions at sNN−−−√=5.02 TeV using azimuthal correlations with the ALICE experiment at the LHC are presented. A four-particle correlation approach [1] is used to quantify the effects of flow angle and magnitude fluctuations separately. This paper extends previous studies to additional centrality intervals and provides measurements of the pT-dependent flow vector fluctuations at sNN−−−√=5.02 TeV with two-particle correlations. Significant pT-dependent fluctuations of the V⃗ 2 flow vector in Pb-Pb collisions are found across different centrality ranges, with the largest fluctuations of up to ∼15% being present in the 5% most central collisions. In parallel, no evidence of significant pT-dependent fluctuations of V⃗ 3 or V⃗ 4 is found. Additionally, evidence of flow angle and magnitude fluctuations is observed with more than 5σ significance in central collisions. These observations in Pb-Pb collisions indicate where the classical picture of hydrodynamic modeling with a common symmetry plane breaks down. This has implications for hard probes at high pT, which might be biased by pT-dependent flow angle fluctuations of at least 23% in central collisions. Given the presented results, existing theoretical models should be re-examined to improve our understanding of initial conditions, quark--gluon plasma (QGP) properties, and the dynamic evolution of the created system.
The intense photon fluxes from relativistic nuclei provide an opportunity to study photonuclear interactions in ultraperipheral collisions. The measurement of coherently photoproduced π+π−π+π− final states in ultraperipheral Pb-Pb collisions at sNN−−−√=5.02 TeV is presented for the first time. The cross section, dσ/dy, times the branching ratio (ρ→π+π+π−π−) is found to be 47.8±2.3 (stat.)±7.7 (syst.) mb in the rapidity interval |y|<0.5. The invariant mass distribution is not well described with a single Breit-Wigner resonance. The production of two interfering resonances, ρ(1450) and ρ(1700), provides a good description of the data. The values of the masses (m) and widths (Γ) of the resonances extracted from the fit are m1=1385±14 (stat.)±3 (syst.) MeV/c2, Γ1=431±36 (stat.)±82 (syst.) MeV/c2, m2=1663±13 (stat.)±22 (syst.) MeV/c2 and Γ2=357±31 (stat.)±49 (syst.) MeV/c2, respectively. The measured cross sections times the branching ratios are compared to recent theoretical predictions.
Measurement of beauty-quark production in pp collisions at √s = 13 TeV via non-prompt D mesons
(2024)
The pT-differential production cross sections of non-prompt D0, D+, and D+s mesons originating from beauty-hadron decays are measured in proton−proton collisions at a centre-of-mass energy s√ of 13 TeV. The measurements are performed at midrapidity, |y|<0.5, with the data sample collected by ALICE from 2016 to 2018. The results are in agreement with predictions from several perturbative QCD calculations. The fragmentation fraction of beauty quarks to strange mesons divided by the one to non-strange mesons, fs/(fu+fd), is found to be 0.114±0.016 (stat.)±0.006 (syst.)±0.003 (BR)±0.003 (extrap.). This value is compatible with previous measurements at lower centre-of-mass energies and in different collision systems in agreement with the assumption of universality of fragmentation functions. In addition, the dependence of the non-prompt D meson production on the centre-of-mass energy is investigated by comparing the results obtained at s√=5.02 and 13 TeV, showing a hardening of the non-prompt D-meson pT-differential production cross section at higher s√. Finally, the bb¯¯¯ production cross section per unit of rapidity at midrapidity is calculated from the non-prompt D0, D+, D+s, and Λ+c hadron measurements, obtaining dσ/dy=75.2±3.2 (stat.)±5.2 (syst.)+12.3−3.2 (extrap.) μb.
The two-particle momentum correlation functions between charm mesons (D∗± and D±) and charged light-flavor mesons (π± and K±) in all charge-combinations are measured for the first time by the ALICE Collaboration in high-multiplicity proton–proton collisions at a center-of-mass energy of √s = 13 TeV. For DK and D∗K pairs, the experimental results are in agreement with theoretical predictions of the residual strong interaction based on quantum chromodynamics calculations on the lattice and chiral effective field theory. In the case of Dπ and D∗π pairs, tension between the calculations including strong interactions and the measurement is observed. For all particle pairs, the data can be adequately described by Coulomb interaction only, indicating a shallow interaction between charm and light-flavor mesons. Finally, the scattering lengths governing the residual strong interaction of the Dπ and D∗π systems are determined by fitting the experimental correlation functions with a model that employs a Gaussian potential. The extracted values are small and compatible with zero.
Analysis of machine learning prediction quality for automated subgroups within the MIMIC III dataset
(2023)
The motivation for this master’s thesis is to explore the potential of predictive data analytics in the field of medicine. For this, the MIMIC-III dataset offers an extensive foundation for the construction of prediction models, including Random Forest, XGBOOST, and deep learning networks. These models were implemented to forecast the mortality of 2,655 stroke patients.
The first part of the thesis involved conducting a comprehensive data analysis of the filtered MIMIC-III dataset.
Subsequently, the effectiveness and fairness of the predictive models were evaluated. Although the performance levels of the developed models did not match those reported in related research, their potential became evident. The results obtained demonstrated promising capabilities and highlighted the effectiveness of the applied methodologies. Moreover, the feature relevance within the XGBOOST model was examined to increase model explainability.
Finally, relevant subgroups were identified to perform a comparative analysis of the prediction performance across these subgroups. While this approach can be regarded as a valuable methodology, it was not possible to investigate underlying reasons for potential unfairness across clusters. Inside the test data, not enough instances remained per subgroup for further fairness or feature relevance analysis.
In conclusion, the implementation of an alternative use case with a higher patient count is recommended.
The code for this analysis is made available via a GitHub repository and includes a frontend to visualize the results.
Studying the neural basis of human dynamic visual perception requires extensive experimental data to evaluate the large swathes of functionally diverse brain neural networks driven by perceiving visual events. Here, we introduce the BOLD Moments Dataset (BMD), a repository of whole-brain fMRI responses to over 1,000 short (3s) naturalistic video clips of visual events across ten human subjects. We use the videos’ extensive metadata to show how the brain represents word- and sentence-level descriptions of visual events and identify correlates of video memorability scores extending into the parietal cortex. Furthermore, we reveal a match in hierarchical processing between cortical regions of interest and video-computable deep neural networks, and we showcase that BMD successfully captures temporal dynamics of visual events at second resolution. With its rich metadata, BMD offers new perspectives and accelerates research on the human brain basis of visual event perception.
We study threshold testing, an elementary probing model with the goal to choose a large value out of n i.i.d. random variables. An algorithm can test each variable X_i once for some threshold t_i, and the test returns binary feedback whether X_i ≥ t_i or not. Thresholds can be chosen adaptively or non-adaptively by the algorithm. Given the results for the tests of each variable, we then select the variable with highest conditional expectation. We compare the expected value obtained by the testing algorithm with expected maximum of the variables. Threshold testing is a semi-online variant of the gambler’s problem and prophet inequalities. Indeed, the optimal performance of non-adaptive algorithms for threshold testing is governed by the standard i.i.d. prophet inequality of approximately 0.745 + o(1) as n → ∞. We show how adaptive algorithms can significantly improve upon this ratio. Our adaptive testing strategy guarantees a competitive ratio of at least 0.869 - o(1). Moreover, we show that there are distributions that admit only a constant ratio c < 1, even when n → ∞. Finally, when each box can be tested multiple times (with n tests in total), we design an algorithm that achieves a ratio of 1 - o(1).
Recent lattice QCD results, comparing to a hadron resonance gas model, have shown the need for hundreds of particles in hadronic models. These extra particles influence both the equation of state and hadronic interactions within hadron transport models. Here, we introduce the PDG21+ particle list, which contains the most up-to-date database of particles and their properties. We then convert all particles decays into 2 body decays so that they are compatible with SMASH in order to produce a more consistent description of a heavy-ion collision.
Current deep learning methods are regarded as favorable if they empirically perform well on dedicated test sets. This mentality is seamlessly reflected in the resurfacing area of continual learning, where consecutively arriving data is investigated. The core challenge is framed as protecting previously acquired representations from being catastrophically forgotten. However, comparison of individual methods is nevertheless performed in isolation from the real world by monitoring accumulated benchmark test set performance. The closed world assumption remains predominant, i.e. models are evaluated on data that is guaranteed to originate from the same distribution as used for training. This poses a massive challenge as neural networks are well known to provide overconfident false predictions on unknown and corrupted instances. In this work we critically survey the literature and argue that notable lessons from open set recognition, identifying unknown examples outside of the observed set, and the adjacent field of active learning, querying data to maximize the expected performance gain, are frequently overlooked in the deep learning era. Hence, we propose a consolidated view to bridge continual learning, active learning and open set recognition in deep neural networks. Finally, the established synergies are supported empirically, showing joint improvement in alleviating catastrophic forgetting, querying data, selecting task orders, while exhibiting robust open world application.