Issue
Dagstuhl Reports, Volume 5, Issue 4
-
Part of:
Volume:
Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep)
Event
Dagstuhl Seminars 15151, 15152, 15161, 15162, 15171, 15181, 15182Publication Details
- published at: 2015-12-21
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports5
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 5, Issue 4, April 2015, Complete Issue
Abstract
Dagstuhl Reports, Volume 5, Issue 4, April 2015, Complete Issue
Cite as
Dagstuhl Reports, Volume 5, Issue 4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{DagRep.5.4,
title = {{Dagstuhl Reports, Volume 5, Issue 4, April 2015, Complete Issue}},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4},
URN = {urn:nbn:de:0030-drops-56699},
doi = {10.4230/DagRep.5.4},
annote = {Keywords: Dagstuhl Reports, Volume 5, Issue 4, April 2015, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 5, Issue 4, 2015
Abstract
Table of Contents, Frontmatter
Cite as
Dagstuhl Reports, Volume 5, Issue 4, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{DagRep.5.4.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 5, Issue 4, 2015}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.i},
URN = {urn:nbn:de:0030-drops-56688},
doi = {10.4230/DagRep.5.4.i},
annote = {Keywords: Dagstuhl Reports, Table of Contents, Volume 5, Issue 4, 2015}
}
Document
Assuring Resilience, Security and Privacy for Flexible Networked Systems and Organisations (Dagstuhl Seminar 15151)
Abstract
Dagstuhl Seminar 15151 entitled “Assuring Resilience, Security and Privacy for Flexible Networked Systems and Organisations” brought together researchers from different disciplines in order to establish a research agenda for making future services in our increasingly connected world more resilient and secure, as well as addressing privacy. The participants came from a range of disciplines covering the techno-legal domain, resilience and systems security, and socio-technical concerns. The use case domains that were discussed during the Seminar covered the Internet of Things (IoT) as well as Cloud-based applications in which flexible service composition is a crucial element. From a starting point covering the “big picture”, the legal viewpoint, the technical viewpoint, and the organisational viewpoint, we derived initial research questions in small groups, and the questions and issues arising were then consolidated and refined. The groups discussed the issues in depth and have produced the report and the research agenda contained here.
Cite as
David Hutchison, Klara Nahrstedt, Marcus Schöller, Indra Spiecker gen. Döhmann, and Markus Tauber. Assuring Resilience, Security and Privacy for Flexible Networked Systems and Organisations (Dagstuhl Seminar 15151). In Dagstuhl Reports, Volume 5, Issue 4, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{hutchison_et_al:DagRep.5.4.1,
author = {Hutchison, David and Nahrstedt, Klara and Sch\"{o}ller, Marcus and Spiecker gen. D\"{o}hmann, Indra and Tauber, Markus},
title = {{Assuring Resilience, Security and Privacy for Flexible Networked Systems and Organisations (Dagstuhl Seminar 15151)}},
pages = {1--17},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Hutchison, David and Nahrstedt, Klara and Sch\"{o}ller, Marcus and Spiecker gen. D\"{o}hmann, Indra and Tauber, Markus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.1},
URN = {urn:nbn:de:0030-drops-52725},
doi = {10.4230/DagRep.5.4.1},
annote = {Keywords: Resilience, security, privacy, legal aspects, networked systems, organisations, society}
}
Document
Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152)
Abstract
One of the most common assumptions in many machine learning and data analysis tasks is that the given data points are realizations of independent and identically distributed (IID) random variables. However, this assumption is often violated, e.g., when training and test data come from different distributions (dataset bias or domain shift) or the data points are highly interdependent (e.g., when the data exhibits temporal or spatial correlations). Both scenarios are typical situations in visual recognition and computational biology. For instance, computer vision and image analysis models can be learned from object-centric internet resources, but are often rather applied to real-world scenes. In computational biology and personalized medicine, training data may be recorded at a particular hospital, but the model is applied to make predictions on data from different hospitals, where patients exhibit a different population structure. In the seminar report, we discuss, present, and explore new machine learning methods that can deal with non-i.i.d. data as well as new application scenarios.
Cite as
Trevor Darrell, Marius Kloft, Massimiliano Pontil, Gunnar Rätsch, and Erik Rodner. Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152). In Dagstuhl Reports, Volume 5, Issue 4, pp. 18-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{darrell_et_al:DagRep.5.4.18,
author = {Darrell, Trevor and Kloft, Marius and Pontil, Massimiliano and R\"{a}tsch, Gunnar and Rodner, Erik},
title = {{Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152)}},
pages = {18--55},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Darrell, Trevor and Kloft, Marius and Pontil, Massimiliano and R\"{a}tsch, Gunnar and Rodner, Erik},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.18},
URN = {urn:nbn:de:0030-drops-53497},
doi = {10.4230/DagRep.5.4.18},
annote = {Keywords: machine learning, computer vision, computational biology, transfer learning, domain adaptation}
}
Document
Advanced Stencil-Code Engineering (Dagstuhl Seminar 15161)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15161 "Advanced Stencil-Code Engineering". The seminar was hosted by the DFG project with the same name (ExaStencils for short) in the DFG priority programme "Software for Exascale Computing" (SPPEXA). It brought together experts from mathematics, computer science and applications to explore the challenges of very high performance and massive parallelism in solving partial differential equations. Its aim was to lay the basis for a new interdisciplinary research community on high-performance stencil codes.
Cite as
Christian Lengauer, Matthias Bolten, Robert D. Falgout, and Olaf Schenk. Advanced Stencil-Code Engineering (Dagstuhl Seminar 15161). In Dagstuhl Reports, Volume 5, Issue 4, pp. 56-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{lengauer_et_al:DagRep.5.4.56,
author = {Lengauer, Christian and Bolten, Matthias and Falgout, Robert D. and Schenk, Olaf},
title = {{Advanced Stencil-Code Engineering (Dagstuhl Seminar 15161)}},
pages = {56--75},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Lengauer, Christian and Bolten, Matthias and Falgout, Robert D. and Schenk, Olaf},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.56},
URN = {urn:nbn:de:0030-drops-53503},
doi = {10.4230/DagRep.5.4.56},
annote = {Keywords: Code generation, domain-specific languages, exascale computing, high-performance computing, massive parallelism, multigrid, partial differential equations, program optimization, program parallelization, stencil codes}
}
Document
Software and Systems Traceability for Safety-Critical Projects (Dagstuhl Seminar 15162)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15162 on "Software and Systems Traceability for Safety-Critical Projects". The event brought together researchers and industrial practitioners working in the field of safety critical software to explore the needs, challenges, and solutions for Software and Systems Traceability in this domain. The goal was to explore the gap between the traceability prescribed by guidelines and that delivered by manufacturers, and starting from a clean slate, to clearly articulate traceability needs for safety-critical software systems, to identify challenges, explore solutions, and to propose a set of principles and domain-specific exemplars for achieving traceability in safety critical systems.
Cite as
Jane Cleland-Huang, Sanjai Rayadurgam, Patrick Mäder, and Wilhelm Schäfer. Software and Systems Traceability for Safety-Critical Projects (Dagstuhl Seminar 15162). In Dagstuhl Reports, Volume 5, Issue 4, pp. 76-97, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{clelandhuang_et_al:DagRep.5.4.76,
author = {Cleland-Huang, Jane and Rayadurgam, Sanjai and M\"{a}der, Patrick and Sch\"{a}fer, Wilhelm},
title = {{Software and Systems Traceability for Safety-Critical Projects (Dagstuhl Seminar 15162)}},
pages = {76--97},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Cleland-Huang, Jane and Rayadurgam, Sanjai and M\"{a}der, Patrick and Sch\"{a}fer, Wilhelm},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.76},
URN = {urn:nbn:de:0030-drops-53518},
doi = {10.4230/DagRep.5.4.76},
annote = {Keywords: safety-critical software development, assurance cases, software and systems traceability}
}
Document
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15171 "Theory and Practice of SAT Solving". The purpose of this workshop was to explore one of the most significant problems in all of computer science, namely that of computing whether formulas in propositional logic are satisfiable or not. This problem is believed to be intractable in general (by the theory of NP-completeness). However, the last two decades have seen dramatic developments in algorithmic techniques, and today so-called SAT solvers are routinely and successfully used to solve large-scale real-world instances in a wide range of application areas.
A surprising aspect of this development is that the best current SAT solvers are still to a large extent based on methods from the early 1960s, which can often handle formulas with millions of variables but may also get hopelessly stuck on formulas with just a few hundred variables. The fundamental question of when SAT solvers perform well or badly, and what underlying mathematical properties of the formulas influence SAT solver performance, remains very poorly understood.
Another intriguing aspect is that much stronger mathematical methods of reasoning about propositional logic formulas are known today, in particular methods based on algebra and geometry, and these methods would seem to have great potential based on theoretical studies. However, attempts at harnessing the power of such methods have conspicuously failed to deliver any significant
improvements in practical performance. This workshop gathered leading researchers in applied and theoretical areas of SAT and computational complexity to stimulate an increased exchange of ideas between these two communities. We see great opportunities for fruitful interplay between theoretical and applied research in this area, and believe that this workshop showed beyond doubt that a more vigorous interaction between the two has potential for major long-term impact in computer science, as well for applications in industry.
Cite as
Armin Biere, Vijay Ganesh, Martin Grohe, Jakob Nordström, and Ryan Williams. Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). In Dagstuhl Reports, Volume 5, Issue 4, pp. 98-122, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{biere_et_al:DagRep.5.4.98,
author = {Biere, Armin and Ganesh, Vijay and Grohe, Martin and Nordstr\"{o}m, Jakob and Williams, Ryan},
title = {{Theory and Practice of SAT Solving (Dagstuhl Seminar 15171)}},
pages = {98--122},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Biere, Armin and Ganesh, Vijay and Grohe, Martin and Nordstr\"{o}m, Jakob and Williams, Ryan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.98},
URN = {urn:nbn:de:0030-drops-53520},
doi = {10.4230/DagRep.5.4.98},
annote = {Keywords: SAT, Boolean SAT solvers, SAT solving, conflict-driven clause learning, Gr\"{o}bner bases, pseudo-Boolean solvers, proof complexity, computational complexity, parameterized complexity}
}
Document
Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15181 "Challenges and Trends in Probabilistic Programming". Probabilistic programming is at the heart of machine learning for describing distribution functions; Bayesian inference is pivotal in their analysis. Probabilistic programs are used in security for describing both cryptographic constructions (such as randomised encryption) and security experiments. In addition, probabilistic models are an active research topic in quantitative information now. Quantum programs are inherently probabilistic due to the random outcomes of quantum measurements. Finally, there is a rapidly growing interest in program analysis of probabilistic programs, whether it be using model checking, theorem proving, static analysis, or similar. Dagstuhl Seminar 15181 brought researchers from these various research communities together so as to exploit synergies and realize cross-fertilisation.
Cite as
Gilles Barthe, Andrew D. Gordon, Joost-Pieter Katoen, and Annabelle McIver. Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181). In Dagstuhl Reports, Volume 5, Issue 4, pp. 123-141, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{barthe_et_al:DagRep.5.4.123,
author = {Barthe, Gilles and Gordon, Andrew D. and Katoen, Joost-Pieter and McIver, Annabelle},
title = {{Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181)}},
pages = {123--141},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Barthe, Gilles and Gordon, Andrew D. and Katoen, Joost-Pieter and McIver, Annabelle},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.123},
URN = {urn:nbn:de:0030-drops-53536},
doi = {10.4230/DagRep.5.4.123},
annote = {Keywords: Bayesian networks, differential privacy, machine learning, probabilistic programs, security, semantics, static analysis, verification}
}
Document
Qualification of Formal Methods Tools (Dagstuhl Seminar 15182)
Abstract
Formal methods tools have been shown to be effective at finding defects in and
verifying the correctness of safety-critical systems, many of which require some form of certification. However, there are still many issues that must be addressed before formal verification tools can be used as part of the certification of safety-critical systems. For example, most developers of avionics systems are unfamiliar with which formal methods tools are most appropriate for different problem domains. Different levels of expertise are necessary to use these tools effectively and correctly. In most certification processes, a tool used to meet process objectives must be qualified. The qualification of formal verification tools will likely pose unique challenges.
Cite as
Darren Cofer, Gerwin Klein, Konrad Slind, and Virginie Wiels. Qualification of Formal Methods Tools (Dagstuhl Seminar 15182). In Dagstuhl Reports, Volume 5, Issue 4, pp. 142-159, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{cofer_et_al:DagRep.5.4.142,
author = {Cofer, Darren and Klein, Gerwin and Slind, Konrad and Wiels, Virginie},
title = {{Qualification of Formal Methods Tools (Dagstuhl Seminar 15182)}},
pages = {142--159},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Cofer, Darren and Klein, Gerwin and Slind, Konrad and Wiels, Virginie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.142},
URN = {urn:nbn:de:0030-drops-53543},
doi = {10.4230/DagRep.5.4.142},
annote = {Keywords: Dependable systems, Certification, Qualification, Formal methods, Verification tools}
}