004 Datenverarbeitung; Informatik
Refine
Has Fulltext
- no (57)
Year of publication
- 2021 (57) (remove)
Document Type
- Article (57) (remove)
Is part of the Bibliography
- yes (57) (remove)
Keywords
- perception of robots (2)
- (FPGA) (1)
- Actor model (1)
- Algebraic methods (1)
- Animal building (1)
- Application (1)
- Argument Mining (1)
- Artificial neural networks (1)
- Attribute aggregation (1)
- Augmented and virtual reality (1)
- Authentication (1)
- Automatically controlled windows (1)
- BPMN (1)
- Bean (1)
- Big Data (1)
- Bitcoin (1)
- Blockchains (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)
- Computational photography (1)
- Computer crime (1)
- Conceptual modeling (1)
- Consistency (1)
- Convolution (1)
- Critical pairs (1)
- Crowd-sourcing (1)
- Cryptography (1)
- Currencies (1)
- Data dependencies (1)
- Data mining (1)
- Data modeling (1)
- Data profiling (1)
- Data warehouse (1)
- Data-centric (1)
- Decision support (1)
- Deep learning (1)
- Delta preservation (1)
- Digital image analysis (1)
- Distributed programming (1)
- Ecosystems (1)
- Entity resolution (1)
- Estimation-of-distribution algorithm (1)
- Evolutionary algorithms (1)
- Feature extraction (1)
- Feature selection (1)
- Federated learning (1)
- Field programmable gate arrays (1)
- Finite automata (1)
- Formal modelling (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)
- HiGHmed (1)
- Histograms (1)
- Human (1)
- Human-robot interaction (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)
- Interpretability (1)
- Kernel (1)
- Licenses (1)
- Loss (1)
- Machine learning (1)
- Marketing (1)
- Matroids (1)
- Media in education (1)
- Model repair (1)
- Model verification (1)
- Model-driven (1)
- Multimodal behavior (1)
- Mutation operators (1)
- N-of-1 trial (1)
- Natural ventilation (1)
- Nephrology (1)
- Nested graph conditions (1)
- Network clustering (1)
- Onlinekurse (1)
- Optimization (1)
- OptoGait (1)
- Order dependencies (1)
- Pedagogical issues (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 personality (1)
- Run time analysis (1)
- SCED (1)
- SQL (1)
- Scale-invariant feature transform (SIFT) (1)
- Security (1)
- Sequential anomaly (1)
- Signal processing (1)
- Simulations (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)
- Twitter (1)
- Uncanny valley (1)
- Unique column combinations (1)
- VGG16 (1)
- VR (1)
- Validation (1)
- Vocabulary (1)
- Water Science and Technology (1)
- Werbung (1)
- X-ray imaging (1)
- Zebris (1)
- acyclic preferences (1)
- algorithms (1)
- answer set programming (1)
- app (1)
- architecture (1)
- attacks (1)
- attribute assurance (1)
- automata (1)
- bibliometric analysis (1)
- biomarker detection (1)
- blockchain (1)
- business process management (1)
- business processes (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 vision (1)
- conditions (1)
- cryptocurrency exchanges (1)
- cryptology (1)
- cyber (1)
- cyber threat intelligence (1)
- cyber-attack (1)
- cyberwar (1)
- data integration (1)
- data pipeline (1)
- data quality (1)
- data structures and information theory (1)
- deferred choice (1)
- digital health (1)
- digital identity (1)
- digital interventions (1)
- duplicate detection (1)
- emotional design (1)
- engagement (1)
- engineering (1)
- expression (1)
- external knowledge bases (1)
- field-programmable gate array (1)
- forensics (1)
- formal semantics (1)
- functions (1)
- gait analysis algorithm (1)
- gene (1)
- gene selection (1)
- general (1)
- hardware architecture (1)
- health care (1)
- healthcare (1)
- identity broker (1)
- image processing (1)
- inertial measurement unit (1)
- international human rights (1)
- international humanitarian law (1)
- intransitivity (1)
- iteration method (1)
- law and technology (1)
- learning factory (1)
- literature review (1)
- long-term interaction (1)
- memory (1)
- methodologie (1)
- methods (1)
- metric learning (1)
- mobile application (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)
- oracles (1)
- parallel processing (1)
- personalization principle (1)
- personalized medicine (1)
- planning (1)
- poset (1)
- prior knowledge (1)
- processes (1)
- processing (1)
- programming skills (1)
- public dataset (1)
- quantified logics (1)
- real-time (1)
- restoration (1)
- review (1)
- security (1)
- self-sovereign identity (1)
- signal processing (1)
- similarity learning (1)
- single-case experimental design (1)
- smart contracts (1)
- software engineering (1)
- stable matching (1)
- strongly stable matching (1)
- super stable matching (1)
- teaching (1)
- training (1)
- transfer learning (1)
- trust model (1)
- uncanny valley (1)
- usability (1)
- virtual reality (1)
- vulnerabilities (1)
- weakly (1)
- web application (1)
- workflow patterns (1)
Institute
- Hasso-Plattner-Institut für Digital Engineering gGmbH (19)
- Hasso-Plattner-Institut für Digital Engineering GmbH (10)
- Institut für Informatik und Computational Science (7)
- Bürgerliches Recht (4)
- Department Linguistik (3)
- Extern (3)
- Fachgruppe Betriebswirtschaftslehre (3)
- Institut für Biochemie und Biologie (3)
- Department Erziehungswissenschaft (2)
- Institut für Physik und Astronomie (2)
PC2P
(2021)
Motivation:
Prediction of protein complexes from protein-protein interaction (PPI) networks is an important problem in systems biology, as they control different cellular functions. The existing solutions employ algorithms for network community detection that identify dense subgraphs in PPI networks. However, gold standards in yeast and human indicate that protein complexes can also induce sparse subgraphs, introducing further challenges in protein complex prediction.
Results:
To address this issue, we formalize protein complexes as biclique spanned subgraphs, which include both sparse and dense subgraphs. We then cast the problem of protein complex prediction as a network partitioning into biclique spanned subgraphs with removal of minimum number of edges, called coherent partition. Since finding a coherent partition is a computationally intractable problem, we devise a parameter-free greedy approximation algorithm, termed Protein Complexes from Coherent Partition (PC2P), based on key properties of biclique spanned subgraphs. Through comparison with nine contenders, we demonstrate that PC2P: (i) successfully identifies modular structure in networks, as a prerequisite for protein complex prediction, (ii) outperforms the existing solutions with respect to a composite score of five performance measures on 75% and 100% of the analyzed PPI networks and gold standards in yeast and human, respectively, and (iii,iv) does not compromise GO semantic similarity and enrichment score of the predicted protein complexes. Therefore, our study demonstrates that clustering of networks in terms of biclique spanned subgraphs is a promising framework for detection of complexes in PPI networks.
In recent years, many efforts have been made to apply image processing techniques for plant leaf identification. However, categorizing leaf images at the cultivar/variety level, because of the very low inter-class variability, is still a challenging task. In this research, we propose an automatic discriminative method based on convolutional neural networks (CNNs) for classifying 12 different cultivars of common beans that belong to three various species. We show that employing advanced loss functions, such as Additive Angular Margin Loss and Large Margin Cosine Loss, instead of the standard softmax loss function for the classification can yield better discrimination between classes and thereby mitigate the problem of low inter-class variability. The method was evaluated by classifying species (level I), cultivars from the same species (level II), and cultivars from different species (level III), based on images from the leaf foreside and backside. The results indicate that the performance of the classification algorithm on the leaf backside image dataset is superior. The maximum mean classification accuracies of 95.86, 91.37 and 86.87% were obtained at the levels I, II and III, respectively. The proposed method outperforms the previous relevant works and provides a reliable approach for plant cultivars identification.
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.
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.
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.
Selbstbestimmtes Lernen mit Onlinekursen findet zunehmend mehr Akzeptanz in unserer Gesellschaft. Lernende können mithilfe von Onlinekursen selbst festlegen, was sie wann lernen und Kurse können durch vielfältige Adaptionen an den Lernfortschritt der Nutzer angepasst und individualisiert werden. Auf der einen Seite ist eine große Zielgruppe für diese Lernangebote vorhanden. Auf der anderen Seite sind die Erstellung von Onlinekursen, ihre Bereitstellung, Wartung und Betreuung kostenintensiv, wodurch hochwertige Angebote häufig kostenpflichtig angeboten werden müssen, um als Anbieter zumindest kostenneutral agieren zu können. In diesem Beitrag erörtern und diskutieren wir ein offenes, nachhaltiges datengetriebenes zweiseitiges Geschäftsmodell zur Verwertung geprüfter Onlinekurse und deren kostenfreie Bereitstellung für jeden Lernenden. Kern des Geschäftsmodells ist die Nutzung der dabei entstehenden Verhaltensdaten, die daraus mögliche Ableitung von Persönlichkeitsmerkmalen und Interessen und deren Nutzung im kommerziellen Kontext. Dies ist eine bei der Websuche bereits weitläufig akzeptierte Methode, welche nun auf den Lernkontext übertragen wird. Welche Möglichkeiten, Herausforderungen, aber auch Barrieren überwunden werden müssen, damit das Geschäftsmodell nachhaltig und ethisch vertretbar funktioniert, werden zwei unabhängige, jedoch synergetisch verbundene Geschäftsmodelle vorgestellt und diskutiert. Zusätzlich wurde die Akzeptanz und Erwartung der Zielgruppe für das vorgestellte Geschäftsmodell untersucht, um notwendige Kernressourcen für die Praxis abzuleiten. Die Ergebnisse der Untersuchung zeigen, dass das Geschäftsmodell von den Nutzer*innen grundlegend akzeptiert wird. 10 % der Befragten würden es bevorzugen, mit virtuellen Assistenten – anstelle mit Tutor*innen zu lernen. Zudem ist der Großteil der Nutzer*innen sich nicht darüber bewusst, dass Persönlichkeitsmerkmale anhand des Nutzerverhaltens abgeleitet werden können.
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.
The increasing demand for software engineers cannot completely be fulfilled by university education and conventional training approaches due to limited capacities. Accordingly, an alternative approach is necessary where potential software engineers are being educated in software engineering skills using new methods. We suggest micro tasks combined with theoretical lessons to overcome existing skill deficits and acquire fast trainable capabilities. This paper addresses the gap between demand and supply of software engineers by introducing an actionoriented and scenario-based didactical approach, which enables non-computer scientists to code. Therein, the learning content is provided in small tasks and embedded in learning factory scenarios. Therefore, different requirements for software engineers from the market side and from an academic viewpoint are analyzed and synthesized into an integrated, yet condensed skills catalogue. This enables the development of training and education units that focus on the most important skills demanded on the market. To achieve this objective, individual learning scenarios are developed. Of course, proper basic skills in coding cannot be learned over night but software programming is also no sorcery.
Um in der digitalisierten Wirtschaft mitzuspielen, müssen Unternehmen, Markt und insbesondere Kunden detailliert verstanden werden. Neben den „Big Playern“ aus dem Silicon Valley sieht der deutsche Mittelstand, der zu großen Teilen noch auf gewachsenen IT-Infrastrukturen und Prozessen agiert, oft alt aus. Um in den nächsten Jahren nicht gänzlich abgehängt zu werden, ist ein Umbruch notwendig. Sowohl Leistungserstellungsprozesse als auch Leistungsangebot müssen transparent und datenbasiert ausgerichtet werden. Nur so können Geschäftsvorfälle, das Marktgeschehen sowie Handeln der Akteure integrativ bewertet und fundierte Entscheidungen getroffen werden. In diesem Beitrag wird das Konzept der Data-Driven Organization vorgestellt und aufgezeigt, wie Unternehmen den eigenen Analyticsreifegrad ermitteln und in einem iterativen Transformationsprozess steigern können.
Machine learning for improvement of thermal conditions inside a hybrid ventilated animal building
(2021)
In buildings with hybrid ventilation, natural ventilation opening positions (windows), mechanical ventilation rates, heating, and cooling are manipulated to maintain desired thermal conditions. The indoor temperature is regulated solely by ventilation (natural and mechanical) when the external conditions are favorable to save external heating and cooling energy. The ventilation parameters are determined by a rule-based control scheme, which is not optimal. This study proposes a methodology to enable real-time optimum control of ventilation parameters. We developed offline prediction models to estimate future thermal conditions from the data collected from building in operation. The developed offline model is then used to find the optimal controllable ventilation parameters in real-time to minimize the setpoint deviation in the building. With the proposed methodology, the experimental building's setpoint deviation improved for 87% of time, on average, by 0.53 degrees C compared to the current deviations.