Dagstuhl Reports, Volume 4, Issue 3



Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 4, Issue 3, March 2014, Complete Issue

Abstract
Dagstuhl Reports, Volume 4, Issue 3, March 2014, Complete Issue

Cite as

Dagstuhl Reports, Volume 4, Issue 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{DagRep.4.3,
  title =	{{Dagstuhl Reports, Volume 4, Issue 3, March 2014, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3},
  URN =		{urn:nbn:de:0030-drops-46769},
  doi =		{10.4230/DagRep.4.3},
  annote =	{Keywords: Dagstuhl Reports, Volume 4, Issue 3, March 2014, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 4, Issue 3, 2014

Abstract
Table of Contents, Frontmatter

Cite as

Dagstuhl Reports, Volume 4, Issue 3, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{DagRep.4.3.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 4, Issue 3, 2014}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.i},
  URN =		{urn:nbn:de:0030-drops-46750},
  doi =		{10.4230/DagRep.4.3.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
Document
Preference Learning (Dagstuhl Seminar 14101)

Authors: Johannes Fürnkranz, Eyke Hüllermeier, Cynthia Rudin, Roman Slowinski, and Scott Sanner


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14101 "Preference Learning". Preferences have recently received considerable attention in disciplines such as machine learning, knowledge discovery, information retrieval, statistics, social choice theory, multiple criteria decision making, decision under risk and uncertainty, operations research, and others. The goal of this seminar was to showcase recent progress in these different areas with the goal of working towards a common basis of understanding, which should help to facilitate future synergies.

Cite as

Johannes Fürnkranz, Eyke Hüllermeier, Cynthia Rudin, Roman Slowinski, and Scott Sanner. Preference Learning (Dagstuhl Seminar 14101). In Dagstuhl Reports, Volume 4, Issue 3, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{furnkranz_et_al:DagRep.4.3.1,
  author =	{F\"{u}rnkranz, Johannes and H\"{u}llermeier, Eyke and Rudin, Cynthia and Slowinski, Roman and Sanner, Scott},
  title =	{{Preference Learning (Dagstuhl Seminar 14101)}},
  pages =	{1--27},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{F\"{u}rnkranz, Johannes and H\"{u}llermeier, Eyke and Rudin, Cynthia and Slowinski, Roman and Sanner, Scott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.1},
  URN =		{urn:nbn:de:0030-drops-45506},
  doi =		{10.4230/DagRep.4.3.1},
  annote =	{Keywords: machine learning, preference learning, preference elicitation, ranking, social choice, multiple criteria decision making, decision under risk and unce information retrieval}
}
Document
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111)

Authors: Maxime Crochemore, James D. Currie, Gregory Kucherov, and Dirk Nowotka


Abstract
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever information is electronically transmitted (as bit streams), when natural language text is spoken or written down (as words over, for example, the Latin alphabet), in the process of heredity transmission in living cells (through DNA sequences) or the protein synthesis (as sequence of amino acids), and in many more different contexts. Given this universal form of representing information, the need to process strings is apparent and is actually a core purpose of computer use. Algorithms to efficiently search through, analyze, (de-)compress, match, encode and decode strings are therefore of chief interest. Combinatorial problems about strings lie at the core of such algorithmic questions. Many such combinatorial problems are common in the string processing efforts in the different fields of application. The purpose of this seminar is to bring together researchers from different disciplines whose interests are string processing algorithms and related combinatorial problems on words. The two main areas of interest for this seminar are Combinatorics on Words and Stringology. This report documents the program and the outcomes of Dagstuhl Seminar 14111 "Combinatorics and Algorithmics of Strings".

Cite as

Maxime Crochemore, James D. Currie, Gregory Kucherov, and Dirk Nowotka. Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). In Dagstuhl Reports, Volume 4, Issue 3, pp. 28-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{crochemore_et_al:DagRep.4.3.28,
  author =	{Crochemore, Maxime and Currie, James D. and Kucherov, Gregory and Nowotka, Dirk},
  title =	{{Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111)}},
  pages =	{28--46},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Crochemore, Maxime and Currie, James D. and Kucherov, Gregory and Nowotka, Dirk},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.28},
  URN =		{urn:nbn:de:0030-drops-45524},
  doi =		{10.4230/DagRep.4.3.28},
  annote =	{Keywords: combinatorics on words, string algorithms, automata}
}
Document
Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112)

Authors: Pierre Dillenbourg, Claude Kirchner, John C. Mitchell, and Martin Wirsing


Abstract
The Perspectives Workshop on "Massively Open Online Courses, Current State and Perspectives" took place at Schloss Dagstuhl on March 10--13, 2014. Twenty-three leading researchers and practitioners from informatics and pedagogical sciences presented and discussed current experiences and future directions, challenges, and visions for the influence of MOOCs on university teaching and learning. The first day of the workshop consisted of a series of presentations in which each participant presented those topics and developments he or she considered most relevant for the future development of MOOCs. The abstracts of these talks are given in the first part of this report. On the second and third day the participants divided into several working groups according to the main thematic areas that had been identified on the first day. This gives rise to a Manifesto to be published in the Dagstuhl Manifesto series and to identifying main research questions rised by the emergence of MOOCs: they are summarized in the second part of this report.

Cite as

Pierre Dillenbourg, Claude Kirchner, John C. Mitchell, and Martin Wirsing. Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112). In Dagstuhl Reports, Volume 4, Issue 3, pp. 47-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{dillenbourg_et_al:DagRep.4.3.47,
  author =	{Dillenbourg, Pierre and Kirchner, Claude and Mitchell, John C. and Wirsing, Martin},
  title =	{{Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112)}},
  pages =	{47--61},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Dillenbourg, Pierre and Kirchner, Claude and Mitchell, John C. and Wirsing, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.47},
  URN =		{urn:nbn:de:0030-drops-45910},
  doi =		{10.4230/DagRep.4.3.47},
  annote =	{Keywords: Massively open online courses, MOOC, SPOC, e-learning, education}
}
Document
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)

Authors: Anna Gal, Michal Koucky, Oded Regev, and Rüdiger Reischuk


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14121 "Computational Complexity of Discrete Problems". The first section gives an overview of the topics covered and the organization of the meeting. Section 2 lists the talks given in chronological order. The last section contains the abstracts of the talks.

Cite as

Anna Gal, Michal Koucky, Oded Regev, and Rüdiger Reischuk. Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). In Dagstuhl Reports, Volume 4, Issue 3, pp. 62-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{gal_et_al:DagRep.4.3.62,
  author =	{Gal, Anna and Koucky, Michal and Regev, Oded and Reischuk, R\"{u}diger},
  title =	{{Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)}},
  pages =	{62--84},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Gal, Anna and Koucky, Michal and Regev, Oded and Reischuk, R\"{u}diger},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.62},
  URN =		{urn:nbn:de:0030-drops-45921},
  doi =		{10.4230/DagRep.4.3.62},
  annote =	{Keywords: discrete problems, computational complexity, Turing machines, Boolean circuits, arithmetic circuits, quantum computing, communication complexity, pseudorandomness, derandomization, approximation, data streams}
}
Document
Verification of Cyber-Physical Systems (Dagstuhl Seminar 14122)

Authors: Rupak Majumdar, Richard M. Murray, and Pavithra Prabhakar


Abstract
Cyber-physical systems refer to a new genre of engineered systems consisting of a tight coupling between computation, communication and physical entities. The main focus of the seminar was to discuss issues related to the reliable development of cyber-physical systems by using formal verification. This is a multi-disciplinary area requiring collaboration between areas focusing discrete systems analysis and continuous systems analysis. To this end, the seminar brought together researchers working in the fields of formal methods, control theory and hybrid systems to identify and discuss potential issues and research questions which require collaboration between the communities. This report documents the program and the outcomes of Dagstuhl Seminar 14122 "Verification of Cyber-Physical Systems".

Cite as

Rupak Majumdar, Richard M. Murray, and Pavithra Prabhakar. Verification of Cyber-Physical Systems (Dagstuhl Seminar 14122). In Dagstuhl Reports, Volume 4, Issue 3, pp. 85-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{majumdar_et_al:DagRep.4.3.85,
  author =	{Majumdar, Rupak and Murray, Richard M. and Prabhakar, Pavithra},
  title =	{{Verification of Cyber-Physical Systems (Dagstuhl Seminar 14122)}},
  pages =	{85--102},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Majumdar, Rupak and Murray, Richard M. and Prabhakar, Pavithra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.85},
  URN =		{urn:nbn:de:0030-drops-45937},
  doi =		{10.4230/DagRep.4.3.85},
  annote =	{Keywords: Formal Verification, Cyber-Physical Systems, Hybrid Systems}
}
Document
Computational Models of Cultural Behavior for Human-Agent Interaction (Dagstuhl Seminar 14131)

Authors: Elisabeth André, Ruth Aylett, Gert Jan Hofstede, and Ana Paiva


Abstract
From March 23 2014 to March 28, the seminar "Computational Models of Cultural Behavior for Human-Agent Interaction" held in Schloss Dagstuhl -- Leibniz Center for Informatics. During the seminar, an interdisciplinary group of researchers explored and discussed theories and techniques for computational models of culture as part of virtual human simulations. Culturally-sensitive agents do not only improve the acceptance of man-machine interfaces by adapting their verbal and non-verbal behavior to the user's assumed cultural background. They also bear enormous potential for a rapidly growing number of ICT-based language and cultural training scenarios that make use of role-play with virtual characters. The seminar brought together researchers with an interdisciplinary background that profited from each other's perspective and explored challenges for the future.

Cite as

Elisabeth André, Ruth Aylett, Gert Jan Hofstede, and Ana Paiva. Computational Models of Cultural Behavior for Human-Agent Interaction (Dagstuhl Seminar 14131). In Dagstuhl Reports, Volume 4, Issue 3, pp. 103-137, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{andre_et_al:DagRep.4.3.103,
  author =	{Andr\'{e}, Elisabeth and Aylett, Ruth and Hofstede, Gert Jan and Paiva, Ana},
  title =	{{Computational Models of Cultural Behavior for Human-Agent Interaction (Dagstuhl Seminar 14131)}},
  pages =	{103--137},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Andr\'{e}, Elisabeth and Aylett, Ruth and Hofstede, Gert Jan and Paiva, Ana},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.103},
  URN =		{urn:nbn:de:0030-drops-45945},
  doi =		{10.4230/DagRep.4.3.103},
  annote =	{Keywords: Cultural models, Cultural grounding, Social simulation, Affective computing, (Multi-)Agent architectures, Virtual agents, Social robots}
}
Document
Interaction and Collective Movement Processing (Dagstuhl Seminar 14132)

Authors: Maike Buchin, Luca Giuggioli, van Kreveld. Marc, and Guy Theraulaz


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14132 ``Interaction and Collective Movement Processing''. This seminar brought together a group of 30 scientists with varied backgrounds, but with a shared interest in computations involved in the processing of moving entity data, like humans or animals. The seminar focused on characterizing and modelling interaction between moving entities, and featured four invited talks in four main research fields: ecology, computational geometry, GIScience, and collective motion. The remainder of the program consisted of short presentations, open problem sessions, break-out groups to work on open problems, and reporting sessions based on research done in the break-out groups.

Cite as

Maike Buchin, Luca Giuggioli, van Kreveld. Marc, and Guy Theraulaz. Interaction and Collective Movement Processing (Dagstuhl Seminar 14132). In Dagstuhl Reports, Volume 4, Issue 3, pp. 138-152, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{buchin_et_al:DagRep.4.3.138,
  author =	{Buchin, Maike and Giuggioli, Luca and van Kreveld. Marc and Theraulaz, Guy},
  title =	{{Interaction and Collective Movement Processing (Dagstuhl Seminar 14132)}},
  pages =	{138--152},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Buchin, Maike and Giuggioli, Luca and van Kreveld. Marc and Theraulaz, Guy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.138},
  URN =		{urn:nbn:de:0030-drops-45953},
  doi =		{10.4230/DagRep.4.3.138},
  annote =	{Keywords: collective movement, moving entity, computational geometry, GIScience, ecology, collective motion, trajectory, movement analysis}
}
Document
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141)

Authors: Javier Esparza, Alain Finkel, Pierre McKenzie, and Joel Ouaknine


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14141 "Reachability Problems for Infinite-State Systems", held from March 30th until April 4th, 2014. The seminar gathered 44 participants and the program consisted of 34 presentations. Participants were asked to contribute open questions prior and during the seminar. A list of these open questions appears in a separate section of the present report. This list generated collaborations among participants and gave rise to research publications solving (partially), for example, question 5.13, namely "what functions are computable by VASS?"

Cite as

Javier Esparza, Alain Finkel, Pierre McKenzie, and Joel Ouaknine. Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). In Dagstuhl Reports, Volume 4, Issue 3, pp. 153-180, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{esparza_et_al:DagRep.4.3.153,
  author =	{Esparza, Javier and Finkel, Alain and McKenzie, Pierre and Ouaknine, Joel},
  title =	{{Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141)}},
  pages =	{153--180},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Esparza, Javier and Finkel, Alain and McKenzie, Pierre and Ouaknine, Joel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.153},
  URN =		{urn:nbn:de:0030-drops-46121},
  doi =		{10.4230/DagRep.4.3.153},
  annote =	{Keywords: Infinite-State Systems, Reachability Problems, Formal Verification, Well-Structured Transition Systems, Counter Machines, Vector Addition Systems, Timed Systems}
}
Document
Spatial reference in the Semantic Web and in Robotics (Dagstuhl Seminar 14142)

Authors: Aldo Gangemi, Verena V. Hafner, Werner Kuhn, Simon Scheider, and Luc Steels


Abstract
The seminar on "Spatial reference in the Semantic Web and in Robotics" was held from March 30 until April 4, 2014. Seminar participants presented their work related to spatial reference from the viewpoint of Robotics, Spatial Cognition, Geospatial information and the Semantic Web. Groups worked on concrete questions and challenges which were developed during the seminar, some of which resulted in follow up work. This report summarizes the outcomes of the seminar discussions and presents the abstracts of participant talks.

Cite as

Aldo Gangemi, Verena V. Hafner, Werner Kuhn, Simon Scheider, and Luc Steels. Spatial reference in the Semantic Web and in Robotics (Dagstuhl Seminar 14142). In Dagstuhl Reports, Volume 4, Issue 3, pp. 181-201, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{gangemi_et_al:DagRep.4.3.181,
  author =	{Gangemi, Aldo and Hafner, Verena V. and Kuhn, Werner and Scheider, Simon and Steels, Luc},
  title =	{{Spatial reference in the Semantic Web and in Robotics (Dagstuhl Seminar 14142)}},
  pages =	{181--201},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{3},
  editor =	{Gangemi, Aldo and Hafner, Verena V. and Kuhn, Werner and Scheider, Simon and Steels, Luc},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.181},
  URN =		{urn:nbn:de:0030-drops-46134},
  doi =		{10.4230/DagRep.4.3.181},
  annote =	{Keywords: Spatial reference systems, Semantic Web, Robotics, Embodiment, Spatial cognition}
}

Filters


Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail