Issue
Dagstuhl Reports, Volume 5, Issue 3
-
Part of:
Volume:
Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep)
Event
Dagstuhl Seminars 15101, 15102, 15111, 15112, 15121, 15122, 15131Publication Details
- published at: 2015-09-22
- 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 3, March 2015, Complete Issue
Abstract
Dagstuhl Reports, Volume 5, Issue 3, March 2015, Complete Issue
Cite as
Dagstuhl Reports, Volume 5, Issue 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{DagRep.5.3,
title = {{Dagstuhl Reports, Volume 5, Issue 3, March 2015, Complete Issue}},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3},
URN = {urn:nbn:de:0030-drops-54701},
doi = {10.4230/DagRep.5.3},
annote = {Keywords: Dagstuhl Reports, Volume 5, Issue 3, March 2015, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 5, Issue 3, 2015
Abstract
Table of Contents, Frontmatter
Cite as
Dagstuhl Reports, Volume 5, Issue 3, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{DagRep.5.3.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 5, Issue 3, 2015}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.i},
URN = {urn:nbn:de:0030-drops-54695},
doi = {10.4230/DagRep.5.3.i},
annote = {Keywords: Dagstuhl Reports, Table of Contents, Volume 5, Issue 3, 2015}
}
Document
Bridging Information Visualization with Machine Learning (Dagstuhl Seminar 15101)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15101
"Bridging Information Visualization with Machine Learning". This seminar is
a successor to Dagstuhl seminar 12081 "Information Visualization, Visual Data
Mining and Machine Learning" held in 2012. The main goal of this second
seminar was to identify important challenges to overcome in order to build
systems that integrate machine learning and information visualization.
Cite as
Daniel A. Keim, Tamara Munzner, Fabrice Rossi, and Michael Verleysen. Bridging Information Visualization with Machine Learning (Dagstuhl Seminar 15101). In Dagstuhl Reports, Volume 5, Issue 3, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{keim_et_al:DagRep.5.3.1,
author = {Keim, Daniel A. and Munzner, Tamara and Rossi, Fabrice and Verleysen, Michael},
title = {{Bridging Information Visualization with Machine Learning (Dagstuhl Seminar 15101)}},
pages = {1--27},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
editor = {Keim, Daniel A. and Munzner, Tamara and Rossi, Fabrice and Verleysen, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.1},
URN = {urn:nbn:de:0030-drops-52665},
doi = {10.4230/DagRep.5.3.1},
annote = {Keywords: Information visualization, Machine learning, Visual data mining, Exploratory data analysis}
}
Document
Secure Routing for Future Communication Networks (Dagstuhl Seminar 15102)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15102 "Secure Routing for Future Communication Networks". Routing is a fundamental mechanism in communication networks, and its security is critical to ensure availability and prevent attacks; however, developing and deploying secure routing mechanism is still a challenge. Significant research effort is required to advance routing security in key areas: intra-domain routing, inter-domain routing, routing in new Internet architectures, and routing in mobile and wireless networks. The seminar covered these general aspects along with the following important guiding questions. How to systematise the topic area of routing security? What are evolutionary or revolutionary options towards more secure routing systems? How to secure inter-domain routing? How to secure intra-domain routing and routing in mobile/wireless settings?
How to achieve data plane/forwarding security?
Cite as
Amir Herzberg, Matthias Hollick, and Adrian Perrig. Secure Routing for Future Communication Networks (Dagstuhl Seminar 15102). In Dagstuhl Reports, Volume 5, Issue 3, pp. 28-40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{herzberg_et_al:DagRep.5.3.28,
author = {Herzberg, Amir and Hollick, Matthias and Perrig, Adrian},
title = {{Secure Routing for Future Communication Networks (Dagstuhl Seminar 15102)}},
pages = {28--40},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
editor = {Herzberg, Amir and Hollick, Matthias and Perrig, Adrian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.28},
URN = {urn:nbn:de:0030-drops-52670},
doi = {10.4230/DagRep.5.3.28},
annote = {Keywords: Security, Secure routing, Communication networks, Future internet, Mobile and wireless networks}
}
Document
Computational Geometry (Dagstuhl Seminar 15111)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15111 "Computational Geometry". The seminar was held from 8th to 13th March 2015 and 41 senior and young researchers from various countries and continents attended it. Recent developments in the field were presented and new challenges in computational geometry were identified.
Cite as
Otfried Cheong, Jeff Erickson, and Monique Teillaud. Computational Geometry (Dagstuhl Seminar 15111). In Dagstuhl Reports, Volume 5, Issue 3, pp. 41-62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{cheong_et_al:DagRep.5.3.41,
author = {Cheong, Otfried and Erickson, Jeff and Teillaud, Monique},
title = {{Computational Geometry (Dagstuhl Seminar 15111)}},
pages = {41--62},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
editor = {Cheong, Otfried and Erickson, Jeff and Teillaud, Monique},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.41},
URN = {urn:nbn:de:0030-drops-52689},
doi = {10.4230/DagRep.5.3.41},
annote = {Keywords: Algorithms, geometry, theory, approximation, implementation, combinatorics, topology}
}
Document
Network Calculus (Dagstuhl Seminar 15112)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15112 "Network Calculus". At the seminar, about 30 invited researchers from academia and industry discussed the promises, approaches, and open challenges of the Network Calculus. This report gives a general overview of the presentations and outcomes of discussions of the seminar.
Cite as
Florin Ciucu, Markus Fidler, Jörg Liebeherr, and Jens Schmitt. Network Calculus (Dagstuhl Seminar 15112). In Dagstuhl Reports, Volume 5, Issue 3, pp. 63-83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{ciucu_et_al:DagRep.5.3.63,
author = {Ciucu, Florin and Fidler, Markus and Liebeherr, J\"{o}rg and Schmitt, Jens},
title = {{Network Calculus (Dagstuhl Seminar 15112)}},
pages = {63--83},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
editor = {Ciucu, Florin and Fidler, Markus and Liebeherr, J\"{o}rg and Schmitt, Jens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.63},
URN = {urn:nbn:de:0030-drops-52691},
doi = {10.4230/DagRep.5.3.63},
annote = {Keywords: Deterministic, Stochastic Network Calculus, Queueing Theory, Effective Bandwidth, Performance Evaluation}
}
Document
Mixed Criticality on Multicore/Manycore Platforms (Dagstuhl Seminar 15121)
Abstract
This report provides an overview of the discussions, the program and the outcomes of the first Dagstuhl Seminar on Mixed Criticality on multicore/Manycore Platforms. The seminar brought together researchers working on challenges related to executing mixed criticality real-time applications on multicore and manycore architectures with the main purpose of promoting a closer interaction between the sub-communities involved in real-time scheduling, real-time operating systems / runtime environments, and timing analysis as well as interaction with specialists in hardware architectures.
Cite as
Sanjoy K. Baruah, Liliana Cucu-Grosjean, Roabert I. Davis, and Claire Maiza. Mixed Criticality on Multicore/Manycore Platforms (Dagstuhl Seminar 15121). In Dagstuhl Reports, Volume 5, Issue 3, pp. 84-142, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{baruah_et_al:DagRep.5.3.84,
author = {Baruah, Sanjoy K. and Cucu-Grosjean, Liliana and Davis, Roabert I. and Maiza, Claire},
title = {{Mixed Criticality on Multicore/Manycore Platforms (Dagstuhl Seminar 15121)}},
pages = {84--142},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
editor = {Baruah, Sanjoy K. and Cucu-Grosjean, Liliana and Davis, Roabert I. and Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.84},
URN = {urn:nbn:de:0030-drops-52707},
doi = {10.4230/DagRep.5.3.84},
annote = {Keywords: Mixed-Criticality, Real-time systems, Multicore/Manycore Platforms, fixed priority; probabilistic scheduling, varying-speed processors model combination}
}
Document
Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122)
Abstract
In natural language processing (NLP) there is an increasing interest in formal models for processing graphs rather than more restricted structures such as strings or trees. Such models of graph transformation have previously been studied and applied in various other areas of computer science, including formal language theory, term rewriting, theory and implementation of programming languages, concurrent processes, and software engineering. However, few researchers from NLP are familiar with this work, and at the same time, few researchers from the theory of graph transformation are aware of the specific desiderata, possibilities and challenges that one faces when applying the theory of graph transformation to NLP problems. The Dagstuhl Seminar 15122 "Formal Models of Graph Transformation in Natural Language Processing" brought researchers from the two areas together. It initiated an interdisciplinary exchange about existing work, open problems, and interesting applications.
Cite as
Frank Drewes, Kevin Knight, and Marco Kuhlmann. Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122). In Dagstuhl Reports, Volume 5, Issue 3, pp. 143-161, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{drewes_et_al:DagRep.5.3.143,
author = {Drewes, Frank and Knight, Kevin and Kuhlmann, Marco},
title = {{Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122)}},
pages = {143--161},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
editor = {Drewes, Frank and Knight, Kevin and Kuhlmann, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.143},
URN = {urn:nbn:de:0030-drops-53484},
doi = {10.4230/DagRep.5.3.143},
annote = {Keywords: Automata theory, Graph transformation, Natural language processing}
}
Document
Normative Multi-Agent Systems (Dagstuhl Seminar 15131)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15131 "Normative Multi-Agent Systems". Normative systems are systems in the behavior of which norms play a role and which need normative concepts in order to be described or specified. A normative multi-agent system combines models for normative systems (dealing for example with obligations, permissions and prohibitions) with models for multi-agent systems. Normative multi-agent systems provide a promising model for human and artificial agent coordination because they integrate norms and individual intelligence. They are a prime example of the use of sociological theories in multi-agent systems, and therefore of the relation between agent theory—both multi-agent systems and autonomous agents—and the social sciences—sociology, philosophy, economics, legal science, etc.
The aim of this Dagstuhl Seminar was to feature two fresh themes in broader computing and software engineering: social computing and governance. These themes are highly interdisciplinary, bringing together research strands from computing, information sciences, economics, sociology, and psychology. Further there is considerable excitement about these areas in academia, industry, and public policy organizations. Our third theme was agreement technologies, a more traditional topic but nonetheless relevant for the NorMAS community.
A norm is a fundamental social construct. Norms define the essential fabric of a society. Our purpose in this seminar was to explore the connections of norms to each of the themes, especially from a computational perspective.
Moreover, the seminar has been conceived for the writing of a volume titled "Handbook of Normative Multi Agent Systems" aimed to become a standard reference in the field and to provide guidelines for future research in normative multi-agent systems.
Cite as
Amit K. Chopra, Leon van der Torre, Harko Verhagen, and Serena Villata. Normative Multi-Agent Systems (Dagstuhl Seminar 15131). In Dagstuhl Reports, Volume 5, Issue 3, pp. 162-176, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Article{chopra_et_al:DagRep.5.3.162,
author = {Chopra, Amit K. and van der Torre, Leon and Verhagen, Harko and Villata, Serena},
title = {{Normative Multi-Agent Systems (Dagstuhl Seminar 15131)}},
pages = {162--176},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {3},
editor = {Chopra, Amit K. and van der Torre, Leon and Verhagen, Harko and Villata, Serena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.3.162},
URN = {urn:nbn:de:0030-drops-52710},
doi = {10.4230/DagRep.5.3.162},
annote = {Keywords: Normative Multiagent Systems, Autonomous agents and Multiagent systems, Social Computing, Governance, Agreement Technologies, Norms}
}