Issue
Dagstuhl Reports, Volume 6, Issue 11
-
Part of:
Volume:
Dagstuhl Reports, Volume 6
Journal: Dagstuhl Reports (DagRep)
Event
Dagstuhl Seminars 16451, 16452, 16461, 16462, 16471, 16472 (Perspectives Workshop), 16481, 16482Publication Details
- published at: 2017-04-18
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports6
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 6, Issue 11, November 2016, Complete Issue
Abstract
Dagstuhl Reports, Volume 6, Issue 11, November 2016, Complete Issue
Cite as
Dagstuhl Reports, Volume 6, Issue 11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{DagRep.6.11,
title = {{Dagstuhl Reports, Volume 6, Issue 11, November 2016, Complete Issue}},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11},
URN = {urn:nbn:de:0030-drops-71132},
doi = {10.4230/DagRep.6.11},
annote = {Keywords: Dagstuhl Reports, Volume 6, Issue 11, November 2016, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 6, Issue 11, 2016
Abstract
Table of Contents, Frontmatter
Cite as
Dagstuhl Reports, Volume 6, Issue 11, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{DagRep.6.11.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 6, Issue 11, 2016}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.i},
URN = {urn:nbn:de:0030-drops-71122},
doi = {10.4230/DagRep.6.11.i},
annote = {Keywords: Dagstuhl Reports, Table of Contents, Volume 6, Issue 11, 2016}
}
Document
Structure and Hardness in P (Dagstuhl Seminar 16451)
Abstract
This document contains description of the talks at the Dagstuhl seminar 16451 "Structure and Hardness in P". The main goal of the seminar was to bring together researchers from several disciplines and connect those who work on proving conditional lower bounds with those who or may benefit from it. This resulted in an extensive list of open problems which is also provided.
Cite as
Moshe Lewenstein, Seth Pettie, and Virginia Vassilevska Williams. Structure and Hardness in P (Dagstuhl Seminar 16451). In Dagstuhl Reports, Volume 6, Issue 11, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{lewenstein_et_al:DagRep.6.11.1,
author = {Lewenstein, Moshe and Pettie, Seth and Vassilevska Williams, Virginia},
title = {{Structure and Hardness in P (Dagstuhl Seminar 16451)}},
pages = {1--34},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Lewenstein, Moshe and Pettie, Seth and Vassilevska Williams, Virginia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.1},
URN = {urn:nbn:de:0030-drops-70373},
doi = {10.4230/DagRep.6.11.1},
annote = {Keywords: Algorithmic equivalences, Classifying P, Hardness assumptions, Lower bounds}
}
Document
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452)
Abstract
This report summarizes Dagstuhl Seminar 16452 "Beyond-Planar Graphs: Algorithmics and Combinatorics'' and documents the talks and discussions.
The seminar brought together 29 researchers in the areas of graph theory, combinatorics, computational geometry, and graph drawing. The common interest was in the exploration of structural properties and the development of algorithms for so-called beyond-planar graphs, i.e., non-planar graphs with topological constraints such as specific types of crossings, or with some forbidden crossing patterns. The seminar began with three introductory talks by experts in the different fields. Abstracts of these talks are collected in this report. Next we discussed and grouped together open research problems about beyond planar graphs, such as their combinatorial structures (e.g, thickness, crossing number, coloring), their topology (e.g., string graph representation), their geometric representations (e.g., straight-line drawing, visibility representation, contact representation), and applications (e.g., algorithms for real-world network visualization). Four working groups were formed and a report from each group is included here.
Cite as
Sok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, and János Pach. Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). In Dagstuhl Reports, Volume 6, Issue 11, pp. 35-62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{hong_et_al:DagRep.6.11.35,
author = {Hong, Sok-Hee and Kaufmann, Michael and Kobourov, Stephen G. and Pach, J\'{a}nos},
title = {{Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452)}},
pages = {35--62},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Hong, Sok-Hee and Kaufmann, Michael and Kobourov, Stephen G. and Pach, J\'{a}nos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.35},
URN = {urn:nbn:de:0030-drops-70385},
doi = {10.4230/DagRep.6.11.35},
annote = {Keywords: graph drawing, graph algorithms, graph theory, geometric algorithms, combinatorial geometry, visualization}
}
Document
Assessing ICT Security Risks in Socio-Technical Systems (Dagstuhl Seminar 16461)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 16461 "Assessing ICT Security Risks in Socio-Technical Systems". As we progress from classic mechanical or electrical production systems, over ICT systems, to socio-technical systems, risk assessment becomes increasingly complex and difficult. Risk assessment for traditional engineering systems assumes the systems to be deterministic. In non-deterministic systems, standard procedure is to fix those factors that are not deterministic. These techniques do not scale to ICT systems where many risks are hard to trace due to the immaterial
nature of information. Beyond ICT systems, socio-technical systems also contain human actors as integral parts of the system. In such socio-technical systems there may occur unforeseen interactions between the system, the environment, and the human actors, especially insiders. Assessing ICT security risks for socio-technical systems and their economic environment requires methods and tools that integrate relevant socio-technical security metrics. In this seminar we investigated systematic methods and tools to estimate those ICT security risks in socio-technical systems and their economic environment. In particular, we searched for novel security risk assessment methods that integrate different types of socio-technical security metrics.
Cite as
Tyler W. Moore, Christian W. Probst, Kai Rannenberg, and Michel van Eeten. Assessing ICT Security Risks in Socio-Technical Systems (Dagstuhl Seminar 16461). In Dagstuhl Reports, Volume 6, Issue 11, pp. 63-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{moore_et_al:DagRep.6.11.63,
author = {Moore, Tyler W. and Probst, Christian W. and Rannenberg, Kai and van Eeten, Michel},
title = {{Assessing ICT Security Risks in Socio-Technical Systems (Dagstuhl Seminar 16461)}},
pages = {63--89},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Moore, Tyler W. and Probst, Christian W. and Rannenberg, Kai and van Eeten, Michel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.63},
URN = {urn:nbn:de:0030-drops-70390},
doi = {10.4230/DagRep.6.11.63},
annote = {Keywords: economics of risk assessment, human factor, return on security investment, security risk management, socio-technical security}
}
Document
Inpainting-Based Image Compression (Dagstuhl Seminar 16462)
Abstract
Inpainting-based image compression is an emerging paradigm for compressing visual data in a completely different way than popular transform-based methods such as JPEG. The underlying idea sounds very simple: One stores only a small, carefully selected subset of the data, which results in a substantial reduction of the file size. In the decoding phase, one interpolates the missing data by means of a suitable inpainting process. It propagates information from the known data into the areas where nothing has been stored, e.g. by solving a partial differential equation or by clever copy-and-paste
mechanisms.
Inpainting-based codecs (coders and decoders) are more intuitive than transform-based ones, they are closer to biological mechanisms in our brain, and first results show that they may offer promising performance for high compression rates. However, before these ideas become practically viable, a number of difficult fundamental problems must be solved first. They involve e.g. the selection of the data and the inpainting operator, coding strategies, and the search for highly efficient numerical algorithms. This requires a collaborative effort of experts in data compression, inpainting, optimisation, approximation theory, numerical algorithms, and biological vision. In this Dagstuhl seminar we have brought together leading researcher from all
these fields for the first time. It enabled a very fruitful and inspiring interaction which will form the basis for future progress.
Cite as
Christine Guillemot, Gerlind Plonka-Hoch, Thomas Pock, and Joachim Weickert. Inpainting-Based Image Compression (Dagstuhl Seminar 16462). In Dagstuhl Reports, Volume 6, Issue 11, pp. 90-107, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{guillemot_et_al:DagRep.6.11.90,
author = {Guillemot, Christine and Plonka-Hoch, Gerlind and Pock, Thomas and Weickert, Joachim},
title = {{Inpainting-Based Image Compression (Dagstuhl Seminar 16462)}},
pages = {90--107},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Guillemot, Christine and Plonka-Hoch, Gerlind and Pock, Thomas and Weickert, Joachim},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.90},
URN = {urn:nbn:de:0030-drops-70406},
doi = {10.4230/DagRep.6.11.90},
annote = {Keywords: approximation, inpainting, interpolation, lossy image compression, optimisation, partial differential equations (PDEs), sparsity}
}
Document
Concurrency with Weak Memory Models (Dagstuhl Seminar 16471)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 16471 "Concurrency with Weak Memory Models: Semantics, Languages, Compilation, Verification, Static Analysis, and Synthesis". The aim of the seminar was to bring together people from various horizons, including theoreticians and verification practitioners as well as hardware vendors, in order to set up a long-term research program to design formal methods and develop tools ensuring the correctness of concurrent programs on modern multi-processor architectures.
Cite as
Jade Alglave, Patrick Cousot, and Caterina Urban. Concurrency with Weak Memory Models (Dagstuhl Seminar 16471). In Dagstuhl Reports, Volume 6, Issue 11, pp. 108-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{alglave_et_al:DagRep.6.11.108,
author = {Alglave, Jade and Cousot, Patrick and Urban, Caterina},
title = {{Concurrency with Weak Memory Models (Dagstuhl Seminar 16471)}},
pages = {108--128},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Alglave, Jade and Cousot, Patrick and Urban, Caterina},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.108},
URN = {urn:nbn:de:0030-drops-70415},
doi = {10.4230/DagRep.6.11.108},
annote = {Keywords: Compilation, Computer Memory, Concurrency, Memory Barrier, Memory Ordering, Micro-Architecture, Multiprocessor, Out-of-Order Execution, Parallelism, Program Synthesis, Programming Language, Semantics, Static Analysis, Verification, Weak Memory Model}
}
Document
QoE Vadis? (Dagstuhl Perspectives Workshop 16472)
Abstract
This report documents the program and the outcomes of Dagstuhl Perspectives Workshop 16472 "QoE Vadis?", which was preceded by the three Dagstuhl Seminars 09192 "From Quality of Service to Quality of Experience" (2009), 12181 "Quality of Experience: From User Perception to Instrumental Metrics" (2012), and 15022 "Quality of Experience: From Assessment to Application" (2015). As suggested by the name, the Perspectives Workshop set out to jointly and critically reflect on future perspectives and directions of Quality of Experience (QoE) research. This report reflects upon the organization of the workshop. It also provides a set of personal statements and feedbacks (through the innovative "Advocatus Diaboli" approach), as well as a marriage proposal with the area of User Experience (UX). Finally, an overview of the recommendations in the upcoming Dagstuhl Manifesto is given.
Cite as
Markus Fiedler, Sebastian Möller, Peter Reichl, and Min Xie. QoE Vadis? (Dagstuhl Perspectives Workshop 16472). In Dagstuhl Reports, Volume 6, Issue 11, pp. 129-141, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{fiedler_et_al:DagRep.6.11.129,
author = {Fiedler, Markus and M\"{o}ller, Sebastian and Reichl, Peter and Xie, Min},
title = {{QoE Vadis? (Dagstuhl Perspectives Workshop 16472)}},
pages = {129--141},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Fiedler, Markus and M\"{o}ller, Sebastian and Reichl, Peter and Xie, Min},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.129},
URN = {urn:nbn:de:0030-drops-71056},
doi = {10.4230/DagRep.6.11.129},
annote = {Keywords: multimedia, network and application management, network quality monitoring and measurement, quality of experience, socio-economic and business aspects user experience}
}
Document
New Directions for Learning with Kernels and Gaussian Processes (Dagstuhl Seminar 16481)
Abstract
The Dagstuhl Seminar on 16481 "New Directions for Learning with Kernels and Gaussian Processes" brought together two principal theoretical camps of the machine learning community at a crucial time for the field. Kernel methods and Gaussian process models together form a significant part of the discipline's foundations, but their prominence is waning while more elaborate but poorly understood hierarchical models are ascendant. In a lively, amiable seminar, the participants re-discovered common conceptual ground (and some continued points of disagreement) and productively discussed how theoretical rigour can stay relevant during a hectic phase for the subject.
Cite as
Arthur Gretton, Philipp Hennig, Carl Edward Rasmussen, and Bernhard Schölkopf. New Directions for Learning with Kernels and Gaussian Processes (Dagstuhl Seminar 16481). In Dagstuhl Reports, Volume 6, Issue 11, pp. 142-167, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{gretton_et_al:DagRep.6.11.142,
author = {Gretton, Arthur and Hennig, Philipp and Rasmussen, Carl Edward and Sch\"{o}lkopf, Bernhard},
title = {{New Directions for Learning with Kernels and Gaussian Processes (Dagstuhl Seminar 16481)}},
pages = {142--167},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Gretton, Arthur and Hennig, Philipp and Rasmussen, Carl Edward and Sch\"{o}lkopf, Bernhard},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.142},
URN = {urn:nbn:de:0030-drops-71064},
doi = {10.4230/DagRep.6.11.142},
annote = {Keywords: gaussian processes, kernel methods, machine learning, probabilistic numerics, probabilistic programming}
}
Document
Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482)
Abstract
This report documents the Dagstuhl Seminar on Algorithms and Effectivity
in Tropical Mathematics and Beyond, which took place from
November 27 -- December 02, 2016. The report contains an executive
summary as well as abstracts of the talks which reflect recent progress
in the topic of the meeting.
Cite as
Stéphane Gaubert, Dima Grigoriev, Michael Joswig, and Thorsten Theobald. Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482). In Dagstuhl Reports, Volume 6, Issue 11, pp. 168-184, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{gaubert_et_al:DagRep.6.11.168,
author = {Gaubert, St\'{e}phane and Grigoriev, Dima and Joswig, Michael and Theobald, Thorsten},
title = {{Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482)}},
pages = {168--184},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {11},
editor = {Gaubert, St\'{e}phane and Grigoriev, Dima and Joswig, Michael and Theobald, Thorsten},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.168},
URN = {urn:nbn:de:0030-drops-71073},
doi = {10.4230/DagRep.6.11.168},
annote = {Keywords: Algorithms in tropical mathematics, complexity, effective bounds, optimization, zero-sum games}
}