Refine
Year of publication
Document Type
- Article (108) (remove)
Language
- English (108)
Is part of the Bibliography
- yes (108) (remove)
Keywords
- Dynamic pricing (3)
- MOOC (3)
- e-learning (3)
- BPMN (2)
- Business process models (2)
- DMN (2)
- Digitale Bildung (2)
- Dynamic programming (2)
- Energy (2)
- Kursdesign (2)
- Micro Degree (2)
- Oligopoly competition (2)
- Online-Lehre (2)
- Onlinekurs (2)
- Onlinekurs-Produktion (2)
- Smart micro-grids (2)
- course design (2)
- creativity (2)
- deep learning (2)
- design thinking (2)
- digital education (2)
- framework (2)
- inertial measurement unit (2)
- machine learning (2)
- micro degree (2)
- micro-credential (2)
- natural language processing (2)
- online course creation (2)
- online course design (2)
- online teaching (2)
- proteomics (2)
- 3D point clouds (1)
- 3D visualization (1)
- Activity-oriented Optimization (1)
- Adoption effects (1)
- Advertising (1)
- Algebraic methods (1)
- Anomaly detection (1)
- Answer set programming (1)
- Approximation algorithms (1)
- Architecture synthesis (1)
- Architectures (1)
- Artistic Image Stylization (1)
- Autoimmune (1)
- Automated parsing (1)
- BRCA1 (1)
- Batch activity (1)
- Batch processing (1)
- Behavioral economics (1)
- Behavioral equivalence and refinement (1)
- Big Five model (1)
- Bisimulation and simulation (1)
- Business Process Management (1)
- Business process choreographies (1)
- Business process improvement (1)
- Business process modeling (1)
- Car safety management (1)
- Causal inference (1)
- Causal structure learning (1)
- Cheating attacks (1)
- Circular economy (1)
- Clinical decision support (1)
- Clinical predictive modeling (1)
- Colored Petri Net (1)
- Commonsense reasoning (1)
- Complexity (1)
- Conceptual modeling (1)
- ContextErlang (1)
- Critical pair analysis (CPA) (1)
- Cross-platform (1)
- Custom Writable Class (1)
- DSA (1)
- Data breach (1)
- Data modeling (1)
- Data processing (1)
- Data profiling (1)
- Data profiling application (1)
- Data warehouse (1)
- Data-driven price anticipation (1)
- Data-driven strategies (1)
- Database (1)
- Debugging (1)
- Decision models (1)
- Decision support (1)
- Deep learning (1)
- Denial of sleep (1)
- Disadvantaged communities (1)
- Distributed snapshot algorithm (1)
- Document classification (1)
- Domain Objects (1)
- Drift (1)
- Dynamic pricing competition (1)
- E-commerce (1)
- E-health (1)
- EMG (1)
- Economic evaluation (1)
- Effect measurement (1)
- Electrical products (1)
- Electronic health record (1)
- Enumeration algorithm (1)
- Estimation-of-distribution algorithm (1)
- European reference networks (1)
- Expressive rendering (1)
- Eye-tracking (1)
- Feature selection (1)
- Feedback control loop (1)
- Field study (1)
- First-hitting time (1)
- Forecasting (1)
- Foreign key (1)
- Formal modelling (1)
- Formal verification of behavior preservation (1)
- Gene Expression Data Analysis (1)
- Gene expression (1)
- General Earth and Planetary Sciences (1)
- General demand function (1)
- Geography, Planning and Development (1)
- Graph logic (1)
- Graph logics (1)
- Graph transformation (1)
- Graph transformation (double pushout approach) (1)
- Graph transformations (1)
- Grid stability (1)
- HENSHIN (1)
- Holant problems (1)
- Home appliances (1)
- ICT (1)
- Identity leak (1)
- Image Abstraction (1)
- Image Processing (1)
- Imbalanced medical image semantic segmentation (1)
- Indoor environments (1)
- Institutions (1)
- Integrative Gene Selection (1)
- Interactive Media (1)
- Interactive control (1)
- Internet of things (1)
- Interpretability (1)
- Invariant checking (1)
- Kalman filtering (1)
- Kernelization (1)
- Knowledge Bases (1)
- LC-MS (1)
- Level-of-detail visualization (1)
- Link layer security (1)
- Literature review (1)
- Load modeling (1)
- Log data (1)
- Lossy networks (1)
- Low-processing capable devices (1)
- MAC security (1)
- MOOCs (1)
- MS (1)
- Manufacturing (1)
- Massive Open Online Course (MOOC) (1)
- Micro-grid networks (1)
- Minimal hitting set (1)
- Mobile applications (1)
- Mobile devices (1)
- Monitoring (1)
- Multi-objective optimization (1)
- Multiview classification (1)
- Natural language analysis (1)
- Natural language processing (1)
- Navigational logics (1)
- Nephrology (1)
- Neural networks (1)
- Non-photorealistic rendering (1)
- Online survey (1)
- Opinion mining (1)
- Optimal control (1)
- OptoGait (1)
- Ordinances (1)
- PRISM model checker (1)
- PTCTL (1)
- PTM (1)
- Parallel independence (1)
- Parallel processing (1)
- Parking search (1)
- Patents (1)
- Patient (1)
- Pattern (1)
- Pattern Recognition (1)
- Peer-to-Peer ridesharing (1)
- Polystore (1)
- Popular matching (1)
- Power auctioning (1)
- Power consumption characterization (1)
- Power demand (1)
- Predictive models (1)
- Pricing (1)
- Primary biliary cholangitis (1)
- Primary key (1)
- Primary sclerosing cholangitis (1)
- Prior Knowledge (1)
- Prior knowledge (1)
- Privacy (1)
- Probabilistic timed automata (1)
- Process Enactment (1)
- Process Execution (1)
- Process discovery (1)
- Process mining (1)
- Query optimization (1)
- RESTful choreographies (1)
- RGB-D cameras (1)
- Random process (1)
- Real-time rendering (1)
- Reconfigurable architecture (1)
- Recurrent generative (1)
- Recycling investments (1)
- Relational model transformation (1)
- Reproducible benchmarking (1)
- Resource Allocation (1)
- Resource Management (1)
- Resource constrained smart micro-grids (1)
- Response strategies (1)
- Security (1)
- Semantic enrichment (1)
- Sensor networks (1)
- Service-oriented (1)
- Smart cities (1)
- Social (1)
- Source Code Readability (1)
- Spatio-temporal visualization (1)
- Specification (1)
- Squeak (1)
- Stable marriage (1)
- Stable matching (1)
- StackOverflow (1)
- Statistical process mining (1)
- Stochastic differential games (1)
- Strategic cognition (1)
- Style transfer (1)
- Supervised deep neural (1)
- System design (1)
- Taxonomy (1)
- Technology mapping (1)
- Text mining (1)
- Theory (1)
- Time series analysis (1)
- Trajectory visualization (1)
- Transversal hypergraph (1)
- Treemaps (1)
- Triple graph grammars (1)
- Ubiquitous business process (1)
- Unbiasedness (1)
- Unique column combination (1)
- Validation (1)
- Visual analytics (1)
- W[3]-Completeness (1)
- Water Science and Technology (1)
- Wireless sensor networks (1)
- Word embedding (1)
- X-ray (1)
- XIC extraction (1)
- Zebris (1)
- accuracy (1)
- active layers (1)
- active touch (1)
- acute kidney injury (1)
- acyclic preferences (1)
- adversarial network (1)
- algorithms (1)
- approximate counting (1)
- artificial intelligence for health (1)
- aspect-oriented programming (1)
- assignments (1)
- availability (1)
- bioinformatics (1)
- bioinformatics tool (1)
- blockchain (1)
- brand personality (1)
- breast-cancer (1)
- business process management (1)
- business processes (1)
- clinical exome (1)
- cliquy tree (1)
- cloud computing (1)
- communication (1)
- comparison of devices (1)
- complex networks (1)
- computational mass spectrometry (1)
- computational models (1)
- conformance checking (1)
- connectivity (1)
- constrained optimization (1)
- content gamification (1)
- context (1)
- context groups (1)
- contextual-variability modeling (1)
- data (1)
- data pipeline (1)
- deferred choice (1)
- demand learning (1)
- design behaviour (1)
- design cognition (1)
- developing countries (1)
- digital health (1)
- digital transformation (1)
- disorder recognition (1)
- drift theory (1)
- dynamic AOP (1)
- dynamic causal modeling (1)
- dynamic service adaptation (1)
- e-Commerce (1)
- e-commerce (1)
- education (1)
- end-stage kidney disease (1)
- entity-component-system (1)
- evaluation (1)
- everyday life (1)
- evolutionary computation (1)
- exact algorithms (1)
- expectation maximisation algorithm (1)
- facial mimicry (1)
- federated learning (1)
- field study (1)
- flexibility (1)
- forest number (1)
- formal semantics (1)
- formal testing (1)
- gait analysis (1)
- gait analysis algorithm (1)
- gameful learning (1)
- gene (1)
- genome-wide association (1)
- genomics (1)
- graph (1)
- graph analysis (1)
- graph conditions (1)
- group-based behavior adaptation (1)
- hate speech detection (1)
- healthcare (1)
- hepatitis (1)
- human activity recognition (1)
- human motion (1)
- image processing (1)
- implied methods (1)
- independency tree (1)
- industry (1)
- industry 4.0 (1)
- innovation (1)
- insula (1)
- internet topology (1)
- intransitivity (1)
- inventory management (1)
- label-free quantification (1)
- learner engagement (1)
- learning (1)
- learning path (1)
- literature review (1)
- lively groups (1)
- location prediction algorithm (1)
- machine (1)
- male infertility (1)
- management (1)
- measurement (1)
- media (1)
- memory (1)
- mental models (1)
- metaanalysis (1)
- metabolomics (1)
- metacognition (1)
- methods (1)
- metric temporal graph logic (1)
- modification stoichiometry (1)
- modularization (1)
- motion capture (1)
- multiple modalities (1)
- mutations (1)
- narrative (1)
- networks (1)
- neurological disorders (1)
- null results (1)
- object-oriented languages (1)
- oligopoly competition (1)
- omics (1)
- oracles (1)
- oxytocin (1)
- parameterized complexity (1)
- parietal operculum (1)
- partial order resolution (1)
- partition functions (1)
- patent analysis (1)
- peer assessment (1)
- peer evaluation (1)
- peer review (1)
- personality prediction (1)
- pervasive healthcare (1)
- phosphoproteomics (1)
- polynomials (1)
- poset (1)
- post-translational modification (1)
- predicated generic functions (1)
- predicted spectra (1)
- privacy and security (1)
- privacy attack (1)
- probabilistic routing (1)
- process mining (1)
- programming (1)
- proteomics graph networks (1)
- public dataset (1)
- quality assessment (1)
- quantification (1)
- rainbow connection (1)
- rapid eGFRcrea decline (1)
- reactive object queries (1)
- real-time rendering (1)
- recommendations (1)
- reliability (1)
- reported out-come measures (1)
- reward (1)
- risk (1)
- risk-aware dispatching (1)
- self-paced learning (1)
- sensor data (1)
- smart contracts (1)
- social interaction (1)
- social media analysis (1)
- social modulation (1)
- software development (1)
- software engineering (1)
- somatosensation (1)
- spatial aggregation (1)
- spectrum clustering (1)
- speech (1)
- stable matching (1)
- state space modelling (1)
- stochastic process (1)
- storytelling (1)
- strongly stable matching (1)
- study (1)
- super stable matching (1)
- susceptibility (1)
- text mining (1)
- timed graph (1)
- toxic comment classification (1)
- trajectory data (1)
- transcriptomics (1)
- transformation (1)
- transparency (1)
- transport network companies (1)
- trustworthiness (1)
- typed attributed symbolic graphs (1)
- uBPMN (1)
- ubiquitous business process model and notation (uBPMN) (1)
- ubiquitous business process modeling (1)
- ubiquitous computing (ubicomp) (1)
- ubiquitous decision-aware business process (1)
- ubiquitous decisions (1)
- uncertainty (1)
- upper bound (1)
- user-generated content (1)
- variants, (1)
- voice (1)
- weakly (1)
- workflow patterns (1)
Institute
- Hasso-Plattner-Institut für Digital Engineering GmbH (108) (remove)
We present fully polynomial time approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures known as polymers in statistical physics. Our method involves establishing zero-free regions for the partition functions of polymer models and using the most significant terms of the cluster expansion to approximate them. Results of our technique include new approximation and sampling algorithms for a diverse class of Holant polynomials in the low-temperature regime (i.e. small external field) and approximation algorithms for general Holant problems with small signature weights. Additionally, we give randomised approximation and sampling algorithms with faster running times for more restrictive classes. Finally, we improve the known zero-free regions for a perfect matching polynomial.
Which event happened first?
(2021)
First come, first served: Critical choices between alternative actions are often made based on events external to an organization, and reacting promptly to their occurrence can be a major advantage over the competition. In Business Process Management (BPM), such deferred choices can be expressed in process models, and they are an important aspect of process engines. Blockchain-based process execution approaches are no exception to this, but are severely limited by the inherent properties of the platform: The isolated environment prevents direct access to external entities and data, and the non-continual runtime based entirely on atomic transactions impedes the monitoring and detection of events. In this paper we provide an in-depth examination of the semantics of deferred choice, and transfer them to environments such as the blockchain. We introduce and compare several oracle architectures able to satisfy certain requirements, and show that they can be implemented using state-of-the-art blockchain technology.
In an effort to describe and produce different formats for video instruction, the research community in technology-enhanced learning, and MOOC scholars in particular, have focused on the general style of video production: whether it is a digitally scripted “talk-and-chalk” or a “talking head” version of a learning unit. Since these production styles include various sub-elements, this paper deconstructs the inherited elements of video production in the context of educational live-streams. Using over 700 videos – both from synchronous and asynchronous modalities of large video-based platforms (YouTube and Twitch), 92 features were found in eight categories of video production. These include commonly analyzed features such as the use of green screen and a visible instructor, but also less studied features such as social media connections and changing camera perspective depending on the topic being covered. Overall, the research results enable an analysis of common video production styles and a toolbox for categorizing new formats – independent of their final (a)synchronous use in MOOCs. Keywords: video production, MOOC video styles, live-streaming.
Quantifying neurological disorders from voice is a rapidly growing field of research and holds promise for unobtrusive and large-scale disorder monitoring. The data recording setup and data analysis pipelines are both crucial aspects to effectively obtain relevant information from participants. Therefore, we performed a systematic review to provide a high-level overview of practices across various neurological disorders and highlight emerging trends. PRISMA-based literature searches were conducted through PubMed, Web of Science, and IEEE Xplore to identify publications in which original (i.e., newly recorded) datasets were collected. Disorders of interest were psychiatric as well as neurodegenerative disorders, such as bipolar disorder, depression, and stress, as well as amyotrophic lateral sclerosis amyotrophic lateral sclerosis, Alzheimer's, and Parkinson's disease, and speech impairments (aphasia, dysarthria, and dysphonia). Of the 43 retrieved studies, Parkinson's disease is represented most prominently with 19 discovered datasets. Free speech and read speech tasks are most commonly used across disorders. Besides popular feature extraction toolkits, many studies utilise custom-built feature sets. Correlations of acoustic features with psychiatric and neurodegenerative disorders are presented. In terms of analysis, statistical analysis for significance of individual features is commonly used, as well as predictive modeling approaches, especially with support vector machines and a small number of artificial neural networks. An emerging trend and recommendation for future studies is to collect data in everyday life to facilitate longitudinal data collection and to capture the behavior of participants more naturally. Another emerging trend is to record additional modalities to voice, which can potentially increase analytical performance.
VLDB 2021
(2021)
The 47th International Conference on Very Large Databases (VLDB'21) was held on August 16-20, 2021 as a hybrid conference. It attracted 180 in-person attendees in Copenhagen and 840 remote attendees. In this paper, we describe our key decisions as general chairs and program committee chairs and share the lessons we learned.
Viper
(2021)
Key-value stores (KVSs) have found wide application in modern software systems. For persistence, their data resides in slow secondary storage, which requires KVSs to employ various techniques to increase their read and write performance from and to the underlying medium. Emerging persistent memory (PMem) technologies offer data persistence at close-to-DRAM speed, making them a promising alternative to classical disk-based storage. However, simply drop-in replacing existing storage with PMem does not yield good results, as block-based access behaves differently in PMem than on disk and ignores PMem's byte addressability, layout, and unique performance characteristics. In this paper, we propose three PMem-specific access patterns and implement them in a hybrid PMem-DRAM KVS called Viper. We employ a DRAM-based hash index and a PMem-aware storage layout to utilize the random-write speed of DRAM and efficient sequential-write performance PMem. Our evaluation shows that Viper significantly outperforms existing KVSs for core KVS operations while providing full data persistence. Moreover, Viper outperforms existing PMem-only, hybrid, and disk-based KVSs by 4-18x for write workloads, while matching or surpassing their get performance.
Verbal focus shifts
(2018)
Previous studies on design behaviour indicate that focus shifts positively influence ideational productivity. In this study we want to take a closer look at how these focus shifts look on the verbal level. We describe a mutually influencing relationship between mental focus shifts and verbal low coherent statements. In a case study based on the DTRS11 dataset we identify 297 low coherent statements via a combined topic modelling and manual approach. We introduce a categorization of the different instances of low coherent statements. The results indicate that designers tend to shift topics within an existing design issue instead of completely disrupting it. (C) 2018 Elsevier Ltd. All rights reserved.
Despite advances in machine learning-based clinical prediction models, only few of such models are actually deployed in clinical contexts. Among other reasons, this is due to a lack of validation studies. In this paper, we present and discuss the validation results of a machine learning model for the prediction of acute kidney injury in cardiac surgery patients initially developed on the MIMIC-III dataset when applied to an external cohort of an American research hospital. To help account for the performance differences observed, we utilized interpretability methods based on feature importance, which allowed experts to scrutinize model behavior both at the global and local level, making it possible to gain further insights into why it did not behave as expected on the validation cohort. The knowledge gleaned upon derivation can be potentially useful to assist model update during validation for more generalizable and simpler models. We argue that interpretability methods should be considered by practitioners as a further tool to help explain performance differences and inform model update in validation studies.
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertices. The minimum number of colors needed to rainbow-connect a graph G is the rainbow connection number of G, denoted by rc(G).& nbsp;A simple way to rainbow-connect a graph G is to color the edges of a spanning tree with distinct colors and then re-use any of these colors to color the remaining edges of G. This proves that rc(G) <= |V (G)|-1. We ask whether there is a stronger connection between tree-like structures and rainbow coloring than that is implied by the above trivial argument. For instance, is it possible to find an upper bound of t(G)-1 for rc(G), where t(G) is the number of vertices in the largest induced tree of G? The answer turns out to be negative, as there are counter-examples that show that even c .t(G) is not an upper bound for rc(G) for any given constant c.& nbsp;In this work we show that if we consider the forest number f(G), the number of vertices in a maximum induced forest of G, instead of t(G), then surprisingly we do get an upper bound. More specifically, we prove that rc(G) <= f(G) + 2. Our result indicates a stronger connection between rainbow connection and tree-like structures than that was suggested by the simple spanning tree based upper bound.
In discrete manufacturing, the knowledge about causal relationships makes it possible to avoid unforeseen production downtimes by identifying their root causes. Learning causal structures from real-world settings remains challenging due to high-dimensional data, a mix of discrete and continuous variables, and requirements for preprocessing log data under the causal perspective. In our work, we address these challenges proposing a process for causal reasoning based on raw machine log data from production monitoring. Within this process, we define a set of transformation rules to extract independent and identically distributed observations. Further, we incorporate a variable selection step to handle high-dimensionality and a discretization step to include continuous variables. We enrich a commonly used causal structure learning algorithm with domain-related orientation rules, which provides a basis for causal reasoning. We demonstrate the process on a real-world dataset from a globally operating precision mechanical engineering company. The dataset contains over 40 million log data entries from production monitoring of a single machine. In this context, we determine the causal structures embedded in operational processes. Further, we examine causal effects to support machine operators in avoiding unforeseen production stops, i.e., by detaining machine operators from drawing false conclusions on impacting factors of unforeseen production stops based on experience.