004 Datenverarbeitung; Informatik
Refine
Year of publication
- 2021 (81) (remove)
Document Type
- Article (58)
- Conference Proceeding (8)
- Doctoral Thesis (7)
- Monograph/Edited Volume (6)
- Postprint (2)
Is part of the Bibliography
- yes (81) (remove)
Keywords
- blockchain (3)
- business process management (2)
- business processes (2)
- computer vision (2)
- cyber-physical systems (2)
- deferred choice (2)
- formal semantics (2)
- memory (2)
- oracles (2)
- perception of robots (2)
- probabilistic timed systems (2)
- qualitative Analyse (2)
- qualitative analysis (2)
- quantitative Analyse (2)
- quantitative analysis (2)
- smart contracts (2)
- workflow patterns (2)
- (FPGA) (1)
- 3D point cloud (1)
- 3D visualization (1)
- 3D-Punktwolke (1)
- 3D-Visualisierung (1)
- Actor model (1)
- Agency (1)
- Algebraic methods (1)
- Algorithmen (1)
- Algorithms (1)
- Animal building (1)
- Answer Set Programming (1)
- Antwortmengenprogrammierung (1)
- Application (1)
- Argument Mining (1)
- Artificial Intelligence (1)
- Artificial neural networks (1)
- Attribute aggregation (1)
- Augmented and virtual reality (1)
- Authentication (1)
- Automatically controlled windows (1)
- BPMN (1)
- Baumweite (1)
- Bean (1)
- Big Data (1)
- Bitcoin (1)
- Blockchains (1)
- Body schema (1)
- Bounded Model Checking (1)
- Business process modeling (1)
- CCS Concepts (1)
- Calibration (1)
- Canvas (1)
- Case management (1)
- Clinical predictive modeling (1)
- Cographs (1)
- Coherent partition (1)
- Complexity (1)
- Compliance checking (1)
- Compound Values (1)
- Computational Complexity (1)
- Computational photography (1)
- Computer crime (1)
- Conceptual modeling (1)
- Consistency (1)
- Convolution (1)
- Critical pairs (1)
- Crowd-sourcing (1)
- Cryptography (1)
- Currencies (1)
- Data Structure Optimization (1)
- Data dependencies (1)
- Data mining (1)
- Data modeling (1)
- Data profiling (1)
- Data warehouse (1)
- Data-centric (1)
- Datenstrukturoptimierung (1)
- Datenvisualisierung (1)
- Decision support (1)
- Deep learning (1)
- Delta preservation (1)
- Developmental robotics (1)
- Digital image analysis (1)
- Distributed programming (1)
- Dynamic Programming (1)
- Dynamische Programmierung (1)
- E-Learning (1)
- Ecosystems (1)
- Emerging Topics in Digital Government (1)
- Entity resolution (1)
- Estimation-of-distribution algorithm (1)
- Evolutionary algorithms (1)
- Exponential Time Hypothesis (1)
- Exponentialzeit Hypothese (1)
- Feature extraction (1)
- Feature selection (1)
- Federated learning (1)
- Field programmable gate arrays (1)
- Finite automata (1)
- Formal modelling (1)
- Forschungskolleg (1)
- Functional dependencies (1)
- Gene expression (1)
- General Earth and Planetary Sciences (1)
- Geography, Planning and Development (1)
- Geschäftsmodell (1)
- Graph databases (1)
- Graph homomorphisms (1)
- Graph logic (1)
- Graph partitions (1)
- Graph repair (1)
- Graph transformation (1)
- Graphentransformationssysteme (1)
- Hasso Plattner Institute (1)
- Hasso-Plattner-Institut (1)
- HiGHmed (1)
- Histograms (1)
- Human (1)
- Human-robot interaction (1)
- Häkeln (1)
- IHL (1)
- IHRL (1)
- Identity management systems (1)
- Image (1)
- Image resolution (1)
- Image-based rendering (1)
- Improving classroom (1)
- Inclusion dependencies (1)
- Industries (1)
- Initial conflicts (1)
- Interaktionstechniken (1)
- Interpretability (1)
- Interval Timed Automata (1)
- Kernel (1)
- Klausurtagung (1)
- Knowledge Representation and Reasoning (1)
- Komplexitätstheorie (1)
- Kunstanalyse (1)
- Künstliche Intelligenz (1)
- Learning Analytics (1)
- Licenses (1)
- Loss (1)
- Lower Bounds (1)
- MOOC (1)
- MOOCs (1)
- Machine Learning (1)
- Machine learning (1)
- Marketing (1)
- Matroids (1)
- Media in education (1)
- Mensch-Computer-Interaktion (1)
- Mobile Mapping (1)
- Model repair (1)
- Model verification (1)
- Model-driven (1)
- Modellprüfung (1)
- Multimodal behavior (1)
- Mutation operators (1)
- Natural ventilation (1)
- Nephrology (1)
- Nested graph conditions (1)
- Network clustering (1)
- Objects (1)
- Objekte (1)
- Online Learning Environments (1)
- Onlinekurse (1)
- Optimization (1)
- OptoGait (1)
- Order dependencies (1)
- Parameterized Complexity (1)
- Parametrisierte Komplexität (1)
- Pedagogical issues (1)
- Peripersonal space (1)
- Ph.D. retreat (1)
- Plant identification (1)
- Popular matching (1)
- Prime graphs (1)
- Prior knowledge (1)
- Privacy (1)
- Protocols (1)
- Query execution (1)
- Query optimization (1)
- Rainfall-runoff (1)
- Relational data (1)
- Reproducible benchmarking (1)
- Reversibility (1)
- Robot learning (1)
- Robot personality (1)
- Run time analysis (1)
- SQL (1)
- Scale-invariant feature transform (SIFT) (1)
- Security (1)
- Self-Regulated Learning (1)
- Sequential anomaly (1)
- Service-Oriented Architecture (1)
- Service-oriented Systems Engineering (1)
- Signal processing (1)
- Simulations (1)
- Smalltalk (1)
- Specification (1)
- Stable marriage (1)
- Stable matching (1)
- Stance Detection (1)
- Submodular functions (1)
- Systems of parallel communicating (1)
- Theory (1)
- Time series (1)
- Timed Automata (1)
- Treewidth (1)
- Twitter (1)
- Uncanny valley (1)
- Unique column combinations (1)
- Untere Schranken (1)
- VGG16 (1)
- VR (1)
- Validation (1)
- Verbundwerte (1)
- Virtual Machines (1)
- Virtual Reality (1)
- Virtuelle Maschinen (1)
- Visualisierungskonzept-Exploration (1)
- Vocabulary (1)
- Water Science and Technology (1)
- Werbung (1)
- Werkzeuge (1)
- Wissensrepräsentation und Schlussfolgerung (1)
- X-ray imaging (1)
- Zebris (1)
- acyclic preferences (1)
- algorithms (1)
- answer set programming (1)
- architecture (1)
- art analysis (1)
- attacks (1)
- attribute assurance (1)
- automata (1)
- bibliometric analysis (1)
- biomarker detection (1)
- bounded model checking (1)
- cancer therapy (1)
- center dot Computing (1)
- citation analysis (1)
- coding and information theory (1)
- cognitive load (1)
- complexity dichotomy (1)
- computed tomography (1)
- computer science (1)
- computer-aided design (1)
- conditions (1)
- crochet (1)
- cryptocurrency exchanges (1)
- cryptology (1)
- cultural heritage (1)
- cyber (1)
- cyber threat intelligence (1)
- cyber-attack (1)
- cyber-physikalische Systeme (1)
- cyber-physische Systeme (1)
- cyberwar (1)
- data integration (1)
- data pipeline (1)
- data quality (1)
- data structures and information theory (1)
- data visualization (1)
- deep learning (1)
- demografische Informationen (1)
- demographic information (1)
- digital education (1)
- digital identity (1)
- duplicate detection (1)
- e-learning (1)
- emotional design (1)
- engagement (1)
- engineering (1)
- erzeugende gegnerische Netzwerke (1)
- experience (1)
- expression (1)
- external knowledge bases (1)
- field-programmable gate array (1)
- forensics (1)
- functions (1)
- gait analysis algorithm (1)
- gene (1)
- gene selection (1)
- general (1)
- generative adversarial networks (1)
- geospatial data (1)
- graph transformation systems (1)
- hardware architecture (1)
- health care (1)
- healthcare (1)
- higher education (1)
- human computer interaction (1)
- identity broker (1)
- image processing (1)
- inertial measurement unit (1)
- influence mapping (1)
- interaction techniques (1)
- international human rights (1)
- international humanitarian law (1)
- interval probabilistic timed systems (1)
- interval probabilistische zeitgesteuerte Systeme (1)
- interval timed automata (1)
- intransitivity (1)
- iteration method (1)
- knowledge representation and nonmonotonic reasoning (1)
- kulturelles Erbe (1)
- law and technology (1)
- learning factory (1)
- literature review (1)
- logic programming methodology and applications (1)
- long-term interaction (1)
- maschinelles Sehen (1)
- methodologie (1)
- methods (1)
- metric learning (1)
- microcredential (1)
- mobile mapping (1)
- model checking (1)
- modelling (1)
- modular counting (1)
- molecular tumor board (1)
- mood (1)
- multimedia learning (1)
- mutual gaze (1)
- networks (1)
- neural (1)
- new technologies (1)
- online course creation (1)
- online course design (1)
- parallel processing (1)
- personalization principle (1)
- personalized medicine (1)
- planning (1)
- poset (1)
- power relations (1)
- prior knowledge (1)
- probabilistische gezeitete Systeme (1)
- probabilistische zeitgesteuerte Systeme (1)
- processes (1)
- processing (1)
- programming skills (1)
- public dataset (1)
- quantified logics (1)
- real-time (1)
- rechnerunterstütztes Konstruieren (1)
- research school (1)
- restoration (1)
- review (1)
- räumliche Geodaten (1)
- security (1)
- self-sovereign identity (1)
- semantic classification (1)
- semantische Klassifizierung (1)
- service-oriented systems engineering (1)
- signal processing (1)
- similarity learning (1)
- software engineering (1)
- stable matching (1)
- stakeholder analysis (1)
- strongly stable matching (1)
- super stable matching (1)
- teaching (1)
- theory (1)
- tiefes Lernen (1)
- timed automata (1)
- tools (1)
- training (1)
- transfer learning (1)
- trust model (1)
- uncanny valley (1)
- usability (1)
- virtual reality (1)
- visual language (1)
- visualization (1)
- visualization concept exploration (1)
- visuelle Sprache (1)
- vulnerabilities (1)
- weakly (1)
- web-based development environment (1)
- web-basierte Entwicklungsumgebung (1)
Institute
- Hasso-Plattner-Institut für Digital Engineering GmbH (23)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (19)
- Institut für Informatik und Computational Science (11)
- Fachgruppe Betriebswirtschaftslehre (9)
- Bürgerliches Recht (4)
- Department Linguistik (3)
- Extern (3)
- Institut für Biochemie und Biologie (3)
- Department Erziehungswissenschaft (2)
- Institut für Physik und Astronomie (2)
Phe2vec
(2021)
Robust phenotyping of patients from electronic health records (EHRs) at scale is a challenge in clinical informatics. Here, we introduce Phe2vec, an automated framework for disease phenotyping from EHRs based on unsupervised learning and assess its effectiveness against standard rule-based algorithms from Phenotype KnowledgeBase (PheKB). Phe2vec is based on pre-computing embeddings of medical concepts and patients' clinical history. Disease phenotypes are then derived from a seed concept and its neighbors in the embedding space. Patients are linked to a disease if their embedded representation is close to the disease phenotype. Comparing Phe2vec and PheKB cohorts head-to-head using chart review, Phe2vec performed on par or better in nine out of ten diseases. Differently from other approaches, it can scale to any condition and was validated against widely adopted expert-based standards. Phe2vec aims to optimize clinical informatics research by augmenting current frameworks to characterize patients by condition and derive reliable disease cohorts.
Our input is a complete graph G on n vertices where each vertex has a strict ranking of all other vertices in G. The goal is to construct a matching in G that is popular. A matching M is popular if M does not lose a head-to-head election against any matching M ': here each vertex casts a vote for the matching in {M,M '} in which it gets a better assignment. Popular matchings need not exist in the given instance G and the popular matching problem is to decide whether one exists or not. The popular matching problem in G is easy to solve for odd n. Surprisingly, the problem becomes NP-complete for even n, as we show here. This is one of the few graph theoretic problems efficiently solvable when n has one parity and NP-complete when n has the other parity.
We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges, and they also have the right to declare a draw or even withdraw from such a comparison. This freedom is then gradually restricted as we specify six stages of orderedness in the preferences, ending with the classical case of strictly ordered lists. We study all cases occurring when combining the three known notions of stability-weak, strong, and super-stability-under the assumption that each side of the bipartite market obtains one of the six degrees of orderedness. By designing three polynomial algorithms and two NP-completeness proofs, we determine the complexity of all cases not yet known and thus give an exact boundary in terms of preference structure between tractable and intractable cases.
In the field of Business Process Management (BPM), modeling business processes and related data is a critical issue since process activities need to manage data stored in databases. The connection between processes and data is usually handled at the implementation level, even if modeling both processes and data at the conceptual level should help designers in improving business process models and identifying requirements for implementation. Especially in data -and decision-intensive contexts, business process activities need to access data stored both in databases and data warehouses. In this paper, we complete our approach for defining a novel conceptual view that bridges process activities and data. The proposed approach allows the designer to model the connection between business processes and database models and define the operations to perform, providing interesting insights on the overall connected perspective and hints for identifying activities that are crucial for decision support.
Epistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective literal is true in all or some stable models. As it can be imagined, the associated semantics has proved to be non-trivial, since the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. Unfortunately, comparison among these proposals has been limited to a study of their effect on individual examples, rather than identifying general properties to be checked. In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case. We formally define when an arbitrary semantics satisfies the epistemic splitting property and examine some of the consequences that can be derived from that, including its relation to conformant planning and to epistemic constraints. Interestingly, we prove (through counterexamples) that most of the existing approaches fail to fulfill the epistemic splitting property, except the original semantics proposed by Gelfond 1991 and a recent proposal by the authors, called Founded Autoepistemic Equilibrium Logic.
Power relations within the area of blockchain governance are complex by definition and a comprehensive analysis that links technological and institutional elements is missing to date. The research that is presented with this article focuses on the visualization of the shifting power relations with the introduction of blockchain. For this purpose, the analysis leverages an adjusted version of the multi-stakeholder influence mapping tool. The analysis considers the various stakeholders within the multi-layered blockchain technology stack and compares three fundamental blockchain scenarios, including public and private blockchain settings. The findings show that public administrations face indeed less power with the introduction of blockchain, while new stakeholders come into play who wield influence rather uncontrolled. Nonetheless, public administrations are not powerless overall and remain influential stakeholders. This paper concludes that blockchain governance is not as democratic as blockchain enthusiasts tend to argue and derives corresponding opportunities for further research.
In control theory, to solve a finite-horizon sequential decision problem (SDP) commonly means to find a list of decision rules that result in an optimal expected total reward (or cost) when taking a given number of decision steps. SDPs are routinely solved using Bellman's backward induction. Textbook authors (e.g. Bertsekas or Puterman) typically give more or less formal proofs to show that the backward induction algorithm is correct as solution method for deterministic and stochastic SDPs. Botta, Jansson and Ionescu propose a generic framework for finite horizon, monadic SDPs together with a monadic version of backward induction for solving such SDPs. In monadic SDPs, the monad captures a generic notion of uncertainty, while a generic measure function aggregates rewards. In the present paper, we define a notion of correctness for monadic SDPs and identify three conditions that allow us to prove a correctness result for monadic backward induction that is comparable to textbook correctness proofs for ordinary backward induction. The conditions that we impose are fairly general and can be cast in category-theoretical terms using the notion of Eilenberg-Moore algebra. They hold in familiar settings like those of deterministic or stochastic SDPs, but we also give examples in which they fail. Our results show that backward induction can safely be employed for a broader class of SDPs than usually treated in textbooks. However, they also rule out certain instances that were considered admissible in the context of Botta et al. 's generic framework. Our development is formalised in Idris as an extension of the Botta et al. framework and the sources are available as supplementary material.
We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.
We introduce a new measure of descriptional complexity on finite automata, called the number of active states. Roughly speaking, the number of active states of an automaton A on input w counts the number of different states visited during the most economic computation of the automaton A for the word w. This concept generalizes to finite automata and regular languages in a straightforward way. We show that the number of active states of both finite automata and regular languages is computable, even with respect to nondeterministic finite automata. We further compare the number of active states to related measures for regular languages. In particular, we show incomparability to the radius of regular languages and that the difference between the number of active states and the total number of states needed in finite automata for a regular language can be of exponential order.
Correction to: Knowledge bases and software support for variant interpretation in precision oncology
(2021)
Precision oncology is a rapidly evolving interdisciplinary medical specialty. Comprehensive cancer panels are becoming increasingly available at pathology departments worldwide, creating the urgent need for scalable cancer variant annotation and molecularly informed treatment recommendations. A wealth of mainly academia-driven knowledge bases calls for software tools supporting the multi-step diagnostic process. We derive a comprehensive list of knowledge bases relevant for variant interpretation by a review of existing literature followed by a survey among medical experts from university hospitals in Germany. In addition, we review cancer variant interpretation tools, which integrate multiple knowledge bases. We categorize the knowledge bases along the diagnostic process in precision oncology and analyze programmatic access options as well as the integration of knowledge bases into software tools. The most commonly used knowledge bases provide good programmatic access options and have been integrated into a range of software tools. For the wider set of knowledge bases, access options vary across different parts of the diagnostic process. Programmatic access is limited for information regarding clinical classifications of variants and for therapy recommendations. The main issue for databases used for biological classification of pathogenic variants and pathway context information is the lack of standardized interfaces. There is no single cancer variant interpretation tool that integrates all identified knowledge bases. Specialized tools are available and need to be further developed for different steps in the diagnostic process.
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.
Data encoding has been applied to database systems for decades as it mitigates bandwidth bottlenecks and reduces storage requirements. But even in the presence of these advantages, most in-memory database systems use data encoding only conservatively as the negative impact on runtime performance can be severe. Real-world systems with large parts being infrequently accessed and cost efficiency constraints in cloud environments require solutions that automatically and efficiently select encoding techniques, including heavy-weight compression. In this paper, we introduce workload-driven approaches to automaticaly determine memory budget-constrained encoding configurations using greedy heuristics and linear programming. We show for TPC-H, TPC-DS, and the Join Order Benchmark that optimized encoding configurations can reduce the main memory footprint significantly without a loss in runtime performance over state-of-the-art dictionary encoding. To yield robust selections, we extend the linear programming-based approach to incorporate query runtime constraints and mitigate unexpected performance regressions.
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.
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.
In recent years, computer vision algorithms based on machine learning have seen rapid development. In the past, research mostly focused on solving computer vision problems such as image classification or object detection on images displaying natural scenes. Nowadays other fields such as the field of cultural heritage, where an abundance of data is available, also get into the focus of research. In the line of current research endeavours, we collaborated with the Getty Research Institute which provided us with a challenging dataset, containing images of paintings and drawings. In this technical report, we present the results of the seminar "Deep Learning for Computer Vision". In this seminar, students of the Hasso Plattner Institute evaluated state-of-the-art approaches for image classification, object detection and image recognition on the dataset of the Getty Research Institute. The main challenge when applying modern computer vision methods to the available data is the availability of annotated training data, as the dataset provided by the Getty Research Institute does not contain a sufficient amount of annotated samples for the training of deep neural networks. However, throughout the report we show that it is possible to achieve satisfying to very good results, when using further publicly available datasets, such as the WikiArt dataset, for the training of machine learning models.
The noble way to substantiate decisions that affect many people is to ask these people for their opinions. For governments that run whole countries, this means asking all citizens for their views to consider their situations and needs.
Organizations such as Africa's Voices Foundation, who want to facilitate communication between decision-makers and citizens of a country, have difficulty mediating between these groups. To enable understanding, statements need to be summarized and visualized. Accomplishing these goals in a way that does justice to the citizens' voices and situations proves challenging. Standard charts do not help this cause as they fail to create empathy for the people behind their graphical abstractions. Furthermore, these charts do not create trust in the data they are representing as there is no way to see or navigate back to the underlying code and the original data. To fulfill these functions, visualizations would highly benefit from interactions to explore the displayed data, which standard charts often only limitedly provide.
To help improve the understanding of people's voices, we developed and categorized 80 ideas for new visualizations, new interactions, and better connections between different charts, which we present in this report. From those ideas, we implemented 10 prototypes and two systems that integrate different visualizations. We show that this integration allows consistent appearance and behavior of visualizations. The visualizations all share the same main concept: representing each individual with a single dot. To realize this idea, we discuss technologies that efficiently allow the rendering of a large number of these dots. With these visualizations, direct interactions with representations of individuals are achievable by clicking on them or by dragging a selection around them. This direct interaction is only possible with a bidirectional connection from the visualization to the data it displays. We discuss different strategies for bidirectional mappings and the trade-offs involved. Having unified behavior across visualizations enhances exploration. For our prototypes, that includes grouping, filtering, highlighting, and coloring of dots. Our prototyping work was enabled by the development environment Lively4. We explain which parts of Lively4 facilitated our prototyping process. Finally, we evaluate our approach to domain problems and our developed visualization concepts.
Our work provides inspiration and a starting point for visualization development in this domain. Our visualizations can improve communication between citizens and their government and motivate empathetic decisions. Our approach, combining low-level entities to create visualizations, provides value to an explorative and empathetic workflow. We show that the design space for visualizing this kind of data has a lot of potential and that it is possible to combine qualitative and quantitative approaches to data analysis.
We systematically explore the effect of calibration data length on the performance of a conceptual hydrological model, GR4H, in comparison to two Artificial Neural Network (ANN) architectures: Long Short-Term Memory Networks (LSTM) and Gated Recurrent Units (GRU), which have just recently been introduced to the field of hydrology. We implemented a case study for six river basins across the contiguous United States, with 25 years of meteorological and discharge data. Nine years were reserved for independent validation; two years were used as a warm-up period, one year for each of the calibration and validation periods, respectively; from the remaining 14 years, we sampled increasing amounts of data for model calibration, and found pronounced differences in model performance. While GR4H required less data to converge, LSTM and GRU caught up at a remarkable rate, considering their number of parameters. Also, LSTM and GRU exhibited the higher calibration instability in comparison to GR4H. These findings confirm the potential of modern deep-learning architectures in rainfall runoff modelling, but also highlight the noticeable differences between them in regard to the effect of calibration data length.
Coherent network partitions
(2021)
We continue to study coherent partitions of graphs whereby the vertex set is partitioned into subsets that induce biclique spanned subgraphs. The problem of identifying the minimum number of edges to obtain biclique spanned connected components (CNP), called the coherence number, is NP-hard even on bipartite graphs. Here, we propose a graph transformation geared towards obtaining an O (log n)-approximation algorithm for the CNP on a bipartite graph with n vertices. The transformation is inspired by a new characterization of biclique spanned subgraphs. In addition, we study coherent partitions on prime graphs, and show that finding coherent partitions reduces to the problem of finding coherent partitions in a prime graph. Therefore, these results provide future directions for approximation algorithms for the coherence number of a given graph.
Despite the phenomenal growth of Big Data Analytics in the last few years, little research is done to explicate the relationship between Big Data Analytics Capability (BDAC) and indirect strategic value derived from such digital capabilities. We attempt to address this gap by proposing a conceptual model of the BDAC - Innovation relationship using dynamic capability theory. The work expands on BDAC business value research and extends the nominal research done on BDAC – innovation. We focus on BDAC's relationship with different innovation objects, namely product, business process, and business model innovation, impacting all value chain activities. The insights gained will stimulate academic and practitioner interest in explicating strategic value generated from BDAC and serve as a framework for future research on the subject
Helping overcome distance, the use of videoconferencing tools has surged during the pandemic. To shed light on the consequences of videoconferencing at work, this study takes a granular look at the implications of the self-view feature for meeting outcomes. Building on self-awareness research and self-regulation theory, we argue that by heightening the state of self-awareness, self-view engagement depletes participants’ mental resources and thereby can undermine online meeting outcomes. Evaluation of our theoretical model on a sample of 179 employees reveals a nuanced picture. Self-view engagement while speaking and while listening is positively associated with self-awareness, which, in turn, is negatively associated with satisfaction with meeting process, perceived productivity, and meeting enjoyment. The criticality of the communication role is put forward: looking at self while listening to other attendees has a negative direct and indirect effect on meeting outcomes; however, looking at self while speaking produces equivocal effects.