Conferences  >  Informatics  >  Scientific Computing and Data Science  >  Germany

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Neural Networks and Artificial Intelligence, Machine Learning,    Information & Knowledge Management, Big Data Computing

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Many big data sets in various application domains have complex relationships, which can be modelled as graphs, consisting of entities and relationships between them. Consequently, graphs are extensively studied in both Mathematics and Computer science. In particular, planar graphs, which can be drawn without edge crossings in the plane, form a distinguished role in Graph Theory and Graph Algorithms. Many structural properties of planar graphs are investigated, in terms of excluded minors, low density, and small separators, which lead to efficient algorithms for planar graphs. Consequently, fundamental algorithms for planar graphs have been discovered. However, most real-world graphs, such as social networks and biological networks, are nonplanar. For example, the scale-free networks, which are used to model web graphs, social networks and biological networks, are globally sparse nonplanar graphs, with locally dense clusters and low diameters. To understand such real-world networks, we need to solve fundamental mathematical and algorithmic research questions on beyond-planar graphs, which generalize the notion of planar graphs, in terms of topological constraints or forbidden edge crossing patterns.

Graph Theory and Combinatorics,    Information & Knowledge Management, Big Data Computing

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The global fight against the COVID-19 pandemic has presented massive challenges and real opportunities for data science and visualization research and technology. Epidemiologists, virologists, infection control experts and public health officials are required to make sense of information from a huge variety of data sources. Physicians and medical researchers have access to rapidly changing medical data as the pandemic evolves. Political stakeholders (supported by economists, public health officials, and other experts analyzing the data) make decisions on which action to take, balancing the impact on public health with social and economic impacts. The general public is regularly presented with visualization, through news, conventional and social media, and government publications, and these inform their actions for the next days and weeks.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

There is currently an insufficient transfer of state-of-the-art research knowledge from computer science to research software engineering, and vice versa, in part leading to an incomplete understanding in computer science of the domain-specific and general challenges in research software engineering. This interactive seminar therefore brings the computer science and software engineering research community and the research software engineering community together to define a common language, and apply it to improve reciprocal knowledge transfer.

Software Engineering,    Computational Physics and Numerical Simulation

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Metabolomic data, usually from mass spectrometry or nuclear magnetic resonance spectroscopy, is highly complex and information rich. With continuing advances in metabolite detection technologies, the volume and complexity of data is ever increasing. Computational analysis of metabolomic data, from raw data processing to biological interpretation, is therefore fundamental to realizing the impact of metabolomics on a diverse array of application fields, e.g., environmental toxicity, industrial biotechnology, and biomedicine. This Dagstuhl Seminar extends the Computational Metabolomics series to examine how we can enhance the utility and interpretation of metabolomics data.

Application Software,    Algorithms and Data Structures

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Modern algorithms for data analysis require the use of advanced probabilistic methods to achieve desirable scalability and accuracy guarantees. At the same time, modern data-analysis tasks require the use of advanced statistics to handle challenges such as testing for multiple hypotheses or identifying dependencies among data points, such as in time series or graphs. Probabilistic methods are also at the core theoretical computer-science areas, such as sublinear algorithms and average-case analysis. To obtain efficient data-analysis algorithms, probabilistic methods require careful balancing of theoretical and practical aspects. This Dagstuhl Seminar brings together researchers interested in statistical and probabilistic methods to design and analyze scalable algorithms for discovering knowledge in large and rich datasets. We plan to cover the following topics, among others.

Information & Knowledge Management, Big Data Computing,    Probability and Statistics, Game Theory

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The vision of NFDI4DS is to support all steps of the complex and interdisciplinary research data lifecycle in Data Science and Artificial Intelligence. The overarching objective of NFDI4DS is the development, establishment, and sustainment of a national research data infrastructure for the Data Science and Artificial Intelligence community. The key idea is to work towards increasing the transparency, reproducibility and fairness of Data Science and Artificial Intelligence projects, by making all digital artifacts available, interlinking them, and offering innovative tools and services. Within this Dagstuhl Research Meeting, the NFDI4DS partners will reflect on their progress so far, and will work on their long-term strategy.

Information & Knowledge Management, Big Data Computing,    Neural Networks and Artificial Intelligence, Machine Learning

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

In modern computational systems, the need to handle large-scale inputs imposes interesting computational challenges. Two such challenges are (1) the need to distribute the computation over multiple units, and (2) the dynamic nature of the input, which may undergo changes over time. A particular class of problems studied in these settings is when the input to the computational task is a huge graph. The field of dynamic graph algorithms addresses efficiently processing edge/vertex insertions/deletions in the input graph. In distributed graph algorithms, the input resides across multiple machines, and the goal is to solve the problem while minimizing the number of rounds of communication. Both of these rich research areas have been extensively studied since at least the 1980’s. We know of efficient algorithms for a large variety of tasks, such as shortest paths problems, coloring, subgraph finding, symmetry breaking, approximations, and many more. However, there are still fundamental problems with no known efficient solutions in some of these models, and even more where the exact complexity of computation is yet to be determined. In the recent years, a number of influential works show how transferring ideas from one of these models to the other provides progress on some of the long-lasting open problems. The goal of this Dagstuhl Seminar is to build a bridge between the two research communities of dynamic graph algorithms and distributed computing, by working together on joint research frontiers.

High Performance Computing, Supercomputing, Parallel Computing,    Distributed, Edge and Cloud Computing