Issue
Dagstuhl Reports, Volume 1, Issue 11
-
Part of:
Volume:
Dagstuhl Reports, Volume 1
Journal: Dagstuhl Reports (DagRep)
Event
Dagstuhl Seminars 11441, 11451, 11452, 11461, 11471, 11481Publication Details
- published at: 2012-03-06
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports1
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 1, Issue 11, November 2011, Complete Issue
Abstract
Dagstuhl Reports, Volume 1, Issue 11, November 2011, Complete Issue
Cite as
Dagstuhl Reports, Volume 1, Issue 11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{DagRep.1.11,
title = {{Dagstuhl Reports, Volume 1, Issue 11, November 2011, Complete Issue}},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11},
URN = {urn:nbn:de:0030-drops-34479},
doi = {10.4230/DagRep.1.11},
annote = {Keywords: Dagstuhl Reports, Volume 1, Issue 11, November 2011, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 1, Issue 11, 2011
Abstract
Table of Contents, Frontmatter
Cite as
Dagstuhl Reports, Volume 1, Issue 11, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{DagRep.1.11.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 1, Issue 11, 2011}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.i},
URN = {urn:nbn:de:0030-drops-34463},
doi = {10.4230/DagRep.1.11.i},
annote = {Keywords: Table of Contents, Frontmatter}
}
Document
Science and Engineering of Cyber-Physical Systems (Dagstuhl Seminar 11441)
Abstract
Today, a new category of engineering systems is emerging that combines the physical with the computational in a holistic way: Cyber-physical systems (CPS). The key property of these systems is that functionality and salient system properties are emerging from an intensive interaction of physical and computational components. Traditional separation along engineering disciplines in the design of such systems leads to various quality, maintainability and evolutionary problems, and integrated theories and engineering techniques are urgently needed. The purpose of the seminar is to bring together researchers from the field, from both academia and industry to discuss the new scientific foundations and engineering principles for the vastly emerging field of CPS.
Cite as
Holger Giese, Bernhard Rumpe, Bernhard Schätz, and Janos Sztipanovits. Science and Engineering of Cyber-Physical Systems (Dagstuhl Seminar 11441). In Dagstuhl Reports, Volume 1, Issue 11, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{giese_et_al:DagRep.1.11.1,
author = {Giese, Holger and Rumpe, Bernhard and Sch\"{a}tz, Bernhard and Sztipanovits, Janos},
title = {{Science and Engineering of Cyber-Physical Systems (Dagstuhl Seminar 11441)}},
pages = {1--22},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
editor = {Giese, Holger and Rumpe, Bernhard and Sch\"{a}tz, Bernhard and Sztipanovits, Janos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.1},
URN = {urn:nbn:de:0030-drops-33752},
doi = {10.4230/DagRep.1.11.1},
annote = {Keywords: Embedded systems, real-time systems, control, composition, system integration, design automation, model-driven development, validation \& verification}
}
Document
Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451)
Abstract
In many areas one needs to extract relevant information from
signals generated by dynamical systems evolving on networks with a
configuration that itself evolves with time. Such problems occur e.g.
in surveillance systems for security, in early warning systems of
disasters such as earthquakes, hurricanes and forest fires, in
collaborative filtering, in search engines for evolving data bases and
in reputation systems based on evolving votes. In each of those examples
one wants to extract relevant information from an evolving database. Information science is one of the most expansive scientific areas nowadays, much due to the vast amount of information that is available on the Internet, and and the rapid growth of e-business. There are several open problems in these areas of research and even partial answers would have an important impact. There is a pressing need to make progress in analysis tools and in algorithms for such complex tasks. The purpose of the Dagstuhl Seminar 11451 ``Data Mining, Networks and Dynamics'' was to bring together a diverse community of researchers working in different aspects of this exciting field.
Cite as
Lars Elden and Andreas Frommer. Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451). In Dagstuhl Reports, Volume 1, Issue 11, pp. 23-38, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{elden_et_al:DagRep.1.11.23,
author = {Elden, Lars and Frommer, Andreas},
title = {{Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451)}},
pages = {23--38},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
editor = {Elden, Lars and Frommer, Andreas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.23},
URN = {urn:nbn:de:0030-drops-33765},
doi = {10.4230/DagRep.1.11.23},
annote = {Keywords: dynamic networks, data mining, optimization on manifolds, iterative methods, graph algorithms, network models in applications}
}
Document
Analysis of Dynamic Social and Technological Networks (Dagstuhl Seminar 11452)
Abstract
With the growing popularity of online communication tools, researchers have
turned their attention to the study of the networks arising between users of
social networking services, between mobile phone callers and, in general,
between individuals connected by technological means. Thanks to the rich
set of techniques and methods developed by complex network science, and
joining forces with sociologists and psychologists, the analysis of
dynamic social and technological networks has sparked many important
results, attracting even more interest as the importance of such systems
grows over time.
This Dagstuhl seminar brought together researchers and practitioners from
computer science, physics and psychology, covering the diverse areas of social
and technological network analysis. The goal of the seminar was to bring
together people from different areas of expertise, focusing on both mathematical
aspects and practical applications of theoretical models and techniques. In
particular, the evolution of this research field and of its future perspectives was a major theme of the seminar. This seminar was attended by 25 participants.
Cite as
Vito Latora, Cecilia Mascolo, and Mirco Musolesi. Analysis of Dynamic Social and Technological Networks (Dagstuhl Seminar 11452). In Dagstuhl Reports, Volume 1, Issue 11, pp. 39-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{latora_et_al:DagRep.1.11.39,
author = {Latora, Vito and Mascolo, Cecilia and Musolesi, Mirco},
title = {{Analysis of Dynamic Social and Technological Networks (Dagstuhl Seminar 11452)}},
pages = {39--49},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
editor = {Latora, Vito and Mascolo, Cecilia and Musolesi, Mirco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.39},
URN = {urn:nbn:de:0030-drops-33744},
doi = {10.4230/DagRep.1.11.39},
annote = {Keywords: complex networks, network analysis, network data mining}
}
Document
Coding Theory (Dagstuhl Seminar 11461)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11461
``Coding Theory''. A (channel) code is typically a set of vectors of the same length n over a finite alphabet \Sigma. By choosing a fixed codebook, binary
strings of appropriate length are injectively mapped into the elements of the code. These elements are then transmitted over a communications channel which induces errors on the codeword.
Depending on how well the original code is designed, and which algorithms are used, the result of this transmission and attempts to recover the original vector after transmission can be anywhere between disastrous to excellent. Coding theory is all about the design of excellent codes as a function of the communications channel, and the design of efficient algorithms for choosing the codebook vectors, and more importantly, for recovering the original
vector after transmission. As such, successful design of codes requires knowledge and tools in a number of areas such as combinatorics, algorithms design, probability theory and complexity theory, to name a few.
The purpose of this workshop is to bring together researchers in the field to
discuss recent theoretical advances in algebraic coding, codes on graphs, and
network coding, as well as new and emerging applications of coding methods to
real-world problems.
Cite as
Joachim Rosenthal, M. Amin Shokrollahi, and Judy L. Walker. Coding Theory (Dagstuhl Seminar 11461). In Dagstuhl Reports, Volume 1, Issue 11, pp. 50-65, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{rosenthal_et_al:DagRep.1.11.50,
author = {Rosenthal, Joachim and Shokrollahi, M. Amin and Walker, Judy L.},
title = {{Coding Theory (Dagstuhl Seminar 11461)}},
pages = {50--65},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
editor = {Rosenthal, Joachim and Shokrollahi, M. Amin and Walker, Judy L.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.50},
URN = {urn:nbn:de:0030-drops-33770},
doi = {10.4230/DagRep.1.11.50},
annote = {Keywords: Algebraic coding theory, complexity theory, cryptography, graph theory, graph based codes, information theory, randomized algorithms, networking}
}
Document
Efficient Algorithms for Global Optimisation Methods in Computer Vision (Dagstuhl Seminar 11471)
Abstract
This report documents the program and the results of Dagstuhl Seminar 11471
Efficient Algorithms for Global Optimisation Methods in Computer Vision,
taking place November 20-25 in 2011. The focus of the seminar was to discuss
the design of efficient computer vision algorithms based on global optimisation
methods in the context of the entire design pipeline. Since there is no
such conference that deals with all aspects of the design process -- modelling,
mathematical analysis, numerical solvers, and parallelisation -- the seminar aimed at bringing together researchers from computer science and mathematics covering all four fields.
Cite as
Andrés Bruhn, Thomas Pock, and Xue-Cheng Tai. Efficient Algorithms for Global Optimisation Methods in Computer Vision (Dagstuhl Seminar 11471). In Dagstuhl Reports, Volume 1, Issue 11, pp. 66-90, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{bruhn_et_al:DagRep.1.11.66,
author = {Bruhn, Andr\'{e}s and Pock, Thomas and Tai, Xue-Cheng},
title = {{Efficient Algorithms for Global Optimisation Methods in Computer Vision (Dagstuhl Seminar 11471)}},
pages = {66--90},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
editor = {Bruhn, Andr\'{e}s and Pock, Thomas and Tai, Xue-Cheng},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.66},
URN = {urn:nbn:de:0030-drops-33789},
doi = {10.4230/DagRep.1.11.66},
annote = {Keywords: Computer Vision, Modelling, Mathematical Foundations, Data Structures, Efficient Algorithms, Parallel Computing}
}
Document
Models@run.time (Dagstuhl Seminar 11481)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar
11481 ``Models@run.time''. Research on models@run.time seeks to extend
the applicability of models and abstractions to the runtime
environment, with the goal of providing effective technologies for
managing the complexity of evolving software behaviour while it is
executing. The Dagstuhl Seminar ``Models@run.time'' brought together a
diverse set of researchers and practitioners with a broad range of
expertise, including MDE, software architectures, reflection,
self-adaptive systems, validation and verification, middleware,
robotics and requirements engineering.
Cite as
Uwe Aßmann, Nelly Bencomo, Betty H. C. Cheng, and Robert B. France. Models@run.time (Dagstuhl Seminar 11481). In Dagstuhl Reports, Volume 1, Issue 11, pp. 91-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
Copy BibTex To Clipboard
@Article{amann_et_al:DagRep.1.11.91,
author = {A{\ss}mann, Uwe and Bencomo, Nelly and Cheng, Betty H. C. and France, Robert B.},
title = {{Models@run.time (Dagstuhl Seminar 11481)}},
pages = {91--123},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {1},
number = {11},
editor = {A{\ss}mann, Uwe and Bencomo, Nelly and Cheng, Betty H. C. and France, Robert B.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.91},
URN = {urn:nbn:de:0030-drops-33794},
doi = {10.4230/DagRep.1.11.91},
annote = {Keywords: Self-adaptive Systems, Feedback Loop, Assurance, Uncertainty, Requirements, Optimization, Adaptation}
}