Issue
Dagstuhl Reports, Volume 5, Issue 6
-
Part of:
Volume:
Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep)
Publication Details
- published at: 2016-02-29
- 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 6, June 2015, Complete Issue
Abstract
Dagstuhl Reports, Volume 5, Issue 6, June 2015, Complete Issue
Cite as
Dagstuhl Reports, Volume 5, Issue 6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
Copy BibTex To Clipboard
@Article{DagRep.5.6,
title = {{Dagstuhl Reports, Volume 5, Issue 6, June 2015, Complete Issue}},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {5},
number = {6},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.6},
URN = {urn:nbn:de:0030-drops-57707},
doi = {10.4230/DagRep.5.6},
annote = {Keywords: Dagstuhl Reports, Volume 5, Issue 6, June 2015, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 5, Issue 6, 2015
Abstract
Table of Contents, Frontmatter
Cite as
Dagstuhl Reports, Volume 5, Issue 6, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
Copy BibTex To Clipboard
@Article{DagRep.5.6.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 5, Issue 6, 2015}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {5},
number = {6},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.6.i},
URN = {urn:nbn:de:0030-drops-57691},
doi = {10.4230/DagRep.5.6.i},
annote = {Keywords: Dagstuhl Reports, Table of Contents, Volume 5, Issue 6, 2015}
}
Document
Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15241 "Computational Social Choice: Theory and Applications". The seminar featured a mixture of classic scientific talks (including three overview talks), open problem presentations, working group sessions, and five-minute contributions ("rump session"). While there were other seminars on related topics in the past, a special emphasis was put on practical applications in this edition.
Cite as
Craig Boutilier, Britta Dorn, Nicolas Maudet, and Vincent Merlin. Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241). In Dagstuhl Reports, Volume 5, Issue 6, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
Copy BibTex To Clipboard
@Article{boutilier_et_al:DagRep.5.6.1,
author = {Boutilier, Craig and Dorn, Britta and Maudet, Nicolas and Merlin, Vincent},
title = {{Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241)}},
pages = {1--27},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {5},
number = {6},
editor = {Boutilier, Craig and Dorn, Britta and Maudet, Nicolas and Merlin, Vincent},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.6.1},
URN = {urn:nbn:de:0030-drops-55050},
doi = {10.4230/DagRep.5.6.1},
annote = {Keywords: Computational Social Choice, Voting, Matching, Fair Division}
}
Document
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15242
"Complexity of Symbolic and Numerical Problems".
Cite as
Peter Bürgisser, Felipe Cucker, Marek Karpinski, and Nicolai Vorobjov. Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). In Dagstuhl Reports, Volume 5, Issue 6, pp. 28-47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
Copy BibTex To Clipboard
@Article{burgisser_et_al:DagRep.5.6.28,
author = {B\"{u}rgisser, Peter and Cucker, Felipe and Karpinski, Marek and Vorobjov, Nicolai},
title = {{Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)}},
pages = {28--47},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {5},
number = {6},
editor = {B\"{u}rgisser, Peter and Cucker, Felipe and Karpinski, Marek and Vorobjov, Nicolai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.6.28},
URN = {urn:nbn:de:0030-drops-55066},
doi = {10.4230/DagRep.5.6.28},
annote = {Keywords: Symbolic computation, Algorithms in real algebraic geometry, Complexity lower bounds, Geometry of numerical algorithms}
}
Document
Sparse Modelling and Multi-exponential Analysis (Dagstuhl Seminar 15251)
Abstract
The research fields of harmonic analysis, approximation theory and computer algebra are seemingly different domains and are studied by seemingly separated research communities. However, all of these are connected to each other in many ways.
The connection between harmonic analysis and approximation theory is not accidental: several constructions among which wavelets and Fourier series, provide major insights into central problems in approximation theory. And the intimate connection between approximation theory and computer algebra exists even longer: polynomial interpolation is a long-studied and important problem in both symbolic and numeric computing, in the former to counter expression swell and in the latter to construct a simple data model.
A common underlying problem statement in many applications is that of determining the number of components, and for each component the value of the frequency, damping factor, amplitude and phase in a multi-exponential model. It occurs, for instance, in magnetic resonance and infrared spectroscopy, vibration analysis, seismic data analysis, electronic odour recognition, keystroke recognition, nuclear science, music signal processing, transient detection, motor fault diagnosis, electrophysiology, drug clearance monitoring and glucose tolerance testing, to name just a few.
The general technique of multi-exponential modeling is closely related to what is commonly known as the Pad/'e-Laplace method in approximation theory, and the technique of sparse interpolation in the field of computer algebra. The problem statement is also solved using a stochastic perturbation method in harmonic analysis. The problem of multi-exponential modeling is an inverse problem and therefore may be severely ill-posed, depending on the relative location of the frequencies and phases. Besides the reliability of the estimated parameters, the sparsity of the multi-exponential representation has become important. A representation is called sparse if it is a combination of only a few elements instead of all available generating elements. In sparse interpolation, the aim is to determine all the parameters from only a small amount of data samples, and with a complexity proportional to the number of terms in the representation.
Despite the close connections between these fields, there is a clear lack of communication in the scientific literature. The aim of this seminar is to bring researchers together from the three mentioned fields, with scientists from the varied application domains.
Cite as
Annie Cuyt, George Labahn, Avraham Sidi, and Wen-shin Lee. Sparse Modelling and Multi-exponential Analysis (Dagstuhl Seminar 15251). In Dagstuhl Reports, Volume 5, Issue 6, pp. 48-69, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
Copy BibTex To Clipboard
@Article{cuyt_et_al:DagRep.5.6.48,
author = {Cuyt, Annie and Labahn, George and Sidi, Avraham and Lee, Wen-shin},
title = {{Sparse Modelling and Multi-exponential Analysis (Dagstuhl Seminar 15251)}},
pages = {48--69},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {5},
number = {6},
editor = {Cuyt, Annie and Labahn, George and Sidi, Avraham and Lee, Wen-shin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.6.48},
URN = {urn:nbn:de:0030-drops-55073},
doi = {10.4230/DagRep.5.6.48},
annote = {Keywords: Sparse Interpolation, Exponential Analysis, Signal Processing, Rational Approximation}
}
Document
Logics for Dependence and Independence (Dagstuhl Seminar 15261)
Abstract
This report documents the programme and outcomes of Dagstuhl Seminar 15261 "Logics for Dependence and Independence". This seminar served as a follow-up seminar to the highly successful seminar "Dependence Logic: Theory and Applications" (Dagstuhl Seminar 13071). A key objective of the seminar was to bring together researchers working in dependence logic and in the application areas so that they can communicate state-of-the-art advances and embark on a systematic interaction. The goal was especially to reach those researchers who have recently started working in this thriving area.
Cite as
Erich Grädel, Juha Kontinen, Jouka Väänänen, and Heribert Vollmer. Logics for Dependence and Independence (Dagstuhl Seminar 15261). In Dagstuhl Reports, Volume 5, Issue 6, pp. 70-85, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
Copy BibTex To Clipboard
@Article{gradel_et_al:DagRep.5.6.70,
author = {Gr\"{a}del, Erich and Kontinen, Juha and V\"{a}\"{a}n\"{a}nen, Jouka and Vollmer, Heribert},
title = {{Logics for Dependence and Independence (Dagstuhl Seminar 15261)}},
pages = {70--85},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {5},
number = {6},
editor = {Gr\"{a}del, Erich and Kontinen, Juha and V\"{a}\"{a}n\"{a}nen, Jouka and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.6.70},
URN = {urn:nbn:de:0030-drops-55084},
doi = {10.4230/DagRep.5.6.70},
annote = {Keywords: team semantics, dependence logic, mathematical logic, computational complexity, finite model theory, game theory}
}