Issue
Dagstuhl Reports, Volume 13, Issue 4
-
Part of:
Volume:
Dagstuhl Reports, Volume 13
Journal: Dagstuhl Reports (DagRep)
Publication Details
- published at: 2023-11-02
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports13
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 13, Issue 4, April 2023, Complete Issue
Abstract
Dagstuhl Reports, Volume 13, Issue 4, April 2023, Complete Issue
Cite as
Dagstuhl Reports, Volume 13, Issue 4, pp. 1-122, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
Copy BibTex To Clipboard
@Article{DagRep.13.4,
title = {{Dagstuhl Reports, Volume 13, Issue 4, April 2023, Complete Issue}},
pages = {1--122},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {13},
number = {4},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4},
URN = {urn:nbn:de:0030-drops-192342},
doi = {10.4230/DagRep.13.4},
annote = {Keywords: Dagstuhl Reports, Volume 13, Issue 4, April 2023, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 13, Issue 4, 2023
Abstract
Dagstuhl Reports, Table of Contents, Volume 13, Issue 4, 2023
Cite as
Dagstuhl Reports, Volume 13, Issue 4, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
Copy BibTex To Clipboard
@Article{DagRep.13.4.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 13, Issue 4, 2023}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {13},
number = {4},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4.i},
URN = {urn:nbn:de:0030-drops-192353},
doi = {10.4230/DagRep.13.4.i},
annote = {Keywords: Table of Contents, Frontmatter}
}
Document
Normative Reasoning for AI (Dagstuhl Seminar 23151)
Abstract
Normative reasoning is reasoning about normative matters - such as obligations, permissions, and the rights of individuals or groups. It is prevalent in both legal and ethical discourse, and it can - and arguably should - play a crucial role in the construction of autonomous agents. We often find it important to know whether specific norms apply in a given situation, and to understand why and when they apply, and why some other norms do not apply. In most cases, our reasons for wanting to know are purely practical - we want to make the correct decision - but they can also be more theoretical - as they are when we engage in theoretical ethics. Either way, the same questions are crucial for designing autonomous agents sensitive to legal, ethical, and social norms. This Dagstuhl Seminar brought together experts in computer science, logic (including deontic logic and argumentation), philosophy, ethics, and law with the aim of finding effective ways of formalizing norms and embedding normative reasoning in AI systems. We discussed new ways of using deontic logic and argumentation to provide explanations answering normative why questions, including such questions as "Why should I do A (rather than B)?", "Why should you do A (rather than I)?", "Why do you have the right to do A despite a certain fact or a certain norm?", and "Why does one normative system forbid me to do A, while another one allows it?". We also explored the use of formal methods in combination with sub-symbolic AI (or Machine Learning) with a view towards designing autonomous agents that can follow (legal, ethical, and social) norms.
Cite as
Agata Ciabattoni, John F. Horty, Marija Slavkovik, Leendert van der Torre, and Aleks Knoks. Normative Reasoning for AI (Dagstuhl Seminar 23151). In Dagstuhl Reports, Volume 13, Issue 4, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
Copy BibTex To Clipboard
@Article{ciabattoni_et_al:DagRep.13.4.1,
author = {Ciabattoni, Agata and Horty, John F. and Slavkovik, Marija and van der Torre, Leendert and Knoks, Aleks},
title = {{Normative Reasoning for AI (Dagstuhl Seminar 23151)}},
pages = {1--23},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {13},
number = {4},
editor = {Ciabattoni, Agata and Horty, John F. and Slavkovik, Marija and van der Torre, Leendert and Knoks, Aleks},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4.1},
URN = {urn:nbn:de:0030-drops-192367},
doi = {10.4230/DagRep.13.4.1},
annote = {Keywords: deontic logic, autonomous agents, AI ethics, deontic explanations}
}
Document
Secure and Efficient Post-Quantum Cryptography in Hardware and Software (Dagstuhl Seminar 23152)
Abstract
NIST recently announced the winners of its post-quantum cryptography (PQC) standardization process and outlined the next steps in its ongoing standardization efforts. With fewer algorithms now in the focus of the cryptographic community, the time has come to intensify the investigation of efficiency and physical security aspects of PQC algorithms. This is required to enable PQC in real-life applications and to provide feedback to NIST and submitters before final standardization. To allow widespread adoption, the implementation of PQC in current microchip technologies must be possible within application- or platform-specific constraints such as area, memory, time, power, and energy budgets. Furthermore, more and more PQC use-cases require resistance to physical attacks like power analysis.
The primary aim of this Dagstuhl Seminar was to initiate deeper investigations into secure and efficient implementations of PQC on hardware and hardware/software codesign platforms. In this direction, the seminar brought together researchers in theoretical cryptology, applied cryptography, cryptographic hardware and software systems, and physical security. During the seminar, participants identified new challenges and research directions in PQC, exchanged thoughts and ideas, and initiated collaborations on researching secured and efficient design methodologies for PQC.
Cite as
Thomas Pöppelmann, Sujoy Sinha Roy, and Ingrid Verbauwhede. Secure and Efficient Post-Quantum Cryptography in Hardware and Software (Dagstuhl Seminar 23152). In Dagstuhl Reports, Volume 13, Issue 4, pp. 24-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
Copy BibTex To Clipboard
@Article{poppelmann_et_al:DagRep.13.4.24,
author = {P\"{o}ppelmann, Thomas and Roy, Sujoy Sinha and Verbauwhede, Ingrid},
title = {{Secure and Efficient Post-Quantum Cryptography in Hardware and Software (Dagstuhl Seminar 23152)}},
pages = {24--39},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {13},
number = {4},
editor = {P\"{o}ppelmann, Thomas and Roy, Sujoy Sinha and Verbauwhede, Ingrid},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4.24},
URN = {urn:nbn:de:0030-drops-192373},
doi = {10.4230/DagRep.13.4.24},
annote = {Keywords: Post-quantum cryptography, secure hardware and software, cryptographic implementations, side-channel attacks, fault attacks, countermeasures against attacks}
}
Document
Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23161 "Pushing the Limits of Computational Combinatorial Constructions". In this Dagstuhl Seminar, we focused on computational methods for challenging problems in combinatorial construction. This includes algorithms for construction of combinatorial objects with prescribed symmetry, for isomorph-free exhaustive generation, and for combinatorial search. Examples of specific algorithmic techniques are tactical decomposition, the Kramer-Mesner method, algebraic methods, graph isomorphism software, isomorph-free generation, clique-finding methods, heuristic search, SAT solvers, and combinatorial optimization. There was an emphasis on problems involving graphs, designs and codes, also including topics in related fields such as finite geometry, graph decomposition, Hadamard matrices, Latin squares, and q-analogs of designs and codes.
Cite as
Lucia Moura, Anamari Nakic, Patric Östergård, Alfred Wassermann, and Charlene Weiß. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). In Dagstuhl Reports, Volume 13, Issue 4, pp. 40-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
Copy BibTex To Clipboard
@Article{moura_et_al:DagRep.13.4.40,
author = {Moura, Lucia and Nakic, Anamari and \"{O}sterg\r{a}rd, Patric and Wassermann, Alfred and Wei{\ss}, Charlene},
title = {{Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)}},
pages = {40--57},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {13},
number = {4},
editor = {Moura, Lucia and Nakic, Anamari and \"{O}sterg\r{a}rd, Patric and Wassermann, Alfred and Wei{\ss}, Charlene},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4.40},
URN = {urn:nbn:de:0030-drops-192384},
doi = {10.4230/DagRep.13.4.40},
annote = {Keywords: automorphism groups, combinatorial algorithms, finite geometries, subspace designs}
}
Document
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23162 "New Frontiers of Parameterized Complexity in Graph Drawing”. The seminar was held in-person from April 16 to April 21, 2023. It brought together 32 researchers from the Graph Drawing and the Parameterized Complexity research communities to discuss and explore new research frontiers on the interface between the two fields. The report collects the abstracts of talks and open problems presented in the seminar, as well as brief progress reports from the working groups.
Cite as
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, and Liana Khazaliya. New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). In Dagstuhl Reports, Volume 13, Issue 4, pp. 58-97, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
Copy BibTex To Clipboard
@Article{ganian_et_al:DagRep.13.4.58,
author = {Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav and Khazaliya, Liana},
title = {{New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)}},
pages = {58--97},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {13},
number = {4},
editor = {Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav and Khazaliya, Liana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4.58},
URN = {urn:nbn:de:0030-drops-192393},
doi = {10.4230/DagRep.13.4.58},
annote = {Keywords: algorithm design, computational geometry, graph drawing, parameterized complexity}
}
Document
Driving HPC Operations With Holistic Monitoring and Operational Data Analytics (Dagstuhl Seminar 23171)
Abstract
Advances in analytic approaches have brought the vision of efficient High Performance Computing (HPC) operations enabled by dynamic analysis driving automated feedback and adaptation within reach. Many HPC centers have started the development and deployment of frameworks to enable continuous and holistic monitoring, archiving, and analysis of performance data from their production machines and related infrastructures. The impact of such frameworks rests upon the ability to effectively analyze such data and to take action based on analysis results. Analytic techniques have been successfully developed and applied in other domains but their features may not apply directly to HPC operations data and situations. Response options are limited in HPC implementations. Leveraging, adapting, and extending analysis techniques and response options would open up new avenues for research and development of actionable analytics that can drive more intelligent operations through both manual and automated response to conditions of interest.
This Dagstuhl Seminar 23171 brought together practitioners and researchers in the areas of HPC system management and monitoring, analytics, and computer science to collaboratively work on developing community solutions for revolutionizing HPC system operations. The topics discussed in this seminar spanned use cases, data and analytic approaches required to address the use cases, use of analysis results to improve performance and operations, and research in the development and use of autonomous feedback loops.
Cite as
Jim Brandt, Florina Ciorba, Ann Gentile, Michael Ott, and Torsten Wilde. Driving HPC Operations With Holistic Monitoring and Operational Data Analytics (Dagstuhl Seminar 23171). In Dagstuhl Reports, Volume 13, Issue 4, pp. 98-120, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
Copy BibTex To Clipboard
@Article{brandt_et_al:DagRep.13.4.98,
author = {Brandt, Jim and Ciorba, Florina and Gentile, Ann and Ott, Michael and Wilde, Torsten},
title = {{Driving HPC Operations With Holistic Monitoring and Operational Data Analytics (Dagstuhl Seminar 23171)}},
pages = {98--120},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {13},
number = {4},
editor = {Brandt, Jim and Ciorba, Florina and Gentile, Ann and Ott, Michael and Wilde, Torsten},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.4.98},
URN = {urn:nbn:de:0030-drops-192403},
doi = {10.4230/DagRep.13.4.98},
annote = {Keywords: Monitoring, Operational Data Analytics, Dagstuhl Seminar, WAFVR}
}