Sebastian Böcker, R. Gundry, L. Martens, Magnus Palmblad
{"title":"Computational Proteomics (Dagstuhl Seminar 21271)","authors":"Sebastian Böcker, R. Gundry, L. Martens, Magnus Palmblad","doi":"10.4230/DagRep.11.6.1","DOIUrl":"https://doi.org/10.4230/DagRep.11.6.1","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dagstuhl reportsPub Date : 2021-01-01DOI: 10.4230/DagRep.11.8.52
M. Dezani-Ciancaglini, Roland Kuhn, S. Lindley, A. Scalas
{"title":"Behavioural Types: Bridging Theory and Practice (Dagstuhl Seminar 21372)","authors":"M. Dezani-Ciancaglini, Roland Kuhn, S. Lindley, A. Scalas","doi":"10.4230/DagRep.11.8.52","DOIUrl":"https://doi.org/10.4230/DagRep.11.8.52","url":null,"abstract":"Behavioural types specify the way in which software components interact with one another. Unlike data types (which describe the structure of data), behavioural types describe communication protocols, and their verification ensures that programs do not violate such protocols. The behavioural types research community has developed a flourishing literature on communicationcentric programming, exploring many directions. One of the most studied behavioural type systems are session types, introduced by Honda et al. in the ‘90s, and awarded with prizes for their influence in the past 20 and 10 years (by the ESOP and POPL conferences, respectively). Other varieties of behavioural types include typestate systems, choreographies, and behavioural contracts; research on verification techniques covers the spectrum from fully static verification at compile-time to fully dynamic verification at run-time. In the last decade, research on behavioural types has shifted emphasis towards practical applications, using both novel and existing programming languages (e.g., Java, Python, Go, C, Haskell, OCaml, Erlang, Scala, Rust). An earlier Dagstuhl Seminar, 17051 “Theory and Applications of Behavioural Types” (January 29–February 3, 2017), played an important role in coordinating this effort. Yet, despite the vibrant community and the stream of new results, the use of behavioural types for mainstream software development and verification remains limited. This limitation is largely down to the rapid pace at which mainstream industrial practice for the design and development of concurrent and distributed systems evolves, often resulting in substantial divergence from academic research. In the absence of established tools to express communication protocols, widely used implementations concentrate solely on scalability and reliability. The flip side is that these systems are either overly loose, supporting any conceivable communication structure (via brokers), or overly restricted, supporting only simple requestresponse protocols (like HTTP or RPC). In this seminar, experts from academia and industry explored together how best to bridge the gap between theory and mainstream practice. They tackled challenges that are fundamental in practical systems development, but are rarely or only partially addressed in the behavioural types literature – in particular, failure handling, asynchronous communication, and dynamic reconfiguration. Moreover they explored how the tools of behavioural types and programming languages theory (such as linearity, gradual types, and dependent types) can help to address these challenges. Seminar September 12–17, 2021 – http://www.dagstuhl.de/21372 2012 ACM Subject Classification Theory of computation → Models of computation; Theory of computation → Process calculi; Theory of computation → Type structures","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"206 1","pages":"52-75"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dagstuhl reportsPub Date : 2021-01-01DOI: 10.4230/DagRep.11.4.34
Cristina L. Abad, Ian T Foster, N. Herbst, A. Iosup
{"title":"Serverless Computing (Dagstuhl Seminar 21201)","authors":"Cristina L. Abad, Ian T Foster, N. Herbst, A. Iosup","doi":"10.4230/DagRep.11.4.34","DOIUrl":"https://doi.org/10.4230/DagRep.11.4.34","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"34-93"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dagstuhl reportsPub Date : 2021-01-01DOI: 10.4230/DagRep.11.5.76
B. Fefferman, Sevag Gharibian, N. Schuch, B. Terhal
{"title":"Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261)","authors":"B. Fefferman, Sevag Gharibian, N. Schuch, B. Terhal","doi":"10.4230/DagRep.11.5.76","DOIUrl":"https://doi.org/10.4230/DagRep.11.5.76","url":null,"abstract":"This report documents the program and outcomes of Dagstuhl Seminar 21261 “Quantum Complexity: Theory and Application”. The seminar ran from June 27 to July 2 , 2021, and was held in a hybrid format (due to COVID travel restrictions). Of the 55 total participants from 14 countries, 17 participants were on-site, and 38 were remote. Recent advances in both theoretic and experimental aspects of quantum complexity theory were presented and discussed, ranging from new theoretical developments via a “Quantum Strong Exponential Time Hypothesis”, to more experimentally oriented talks involving benchmarking of random circuits in quantum supremacy experiments. In addition, an open problem session and a discussion session regarding the current state of the field were included. Seminar June 27 – July 2, 2021 – http://www.dagstuhl.de/21261 2012 ACM Subject Classification Theory of computation → Quantum complexity theory","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"76-88"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dagstuhl reportsPub Date : 2021-01-01DOI: 10.4230/DagRep.11.6.147
Eva Darulova, B. Falsafi, A. Gerstlauer, Phillip Stanley-Marbell
{"title":"Approximate Systems (Dagstuhl Seminar 21302)","authors":"Eva Darulova, B. Falsafi, A. Gerstlauer, Phillip Stanley-Marbell","doi":"10.4230/DagRep.11.6.147","DOIUrl":"https://doi.org/10.4230/DagRep.11.6.147","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"147-163"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dagstuhl reportsPub Date : 2021-01-01DOI: 10.4230/DagRep.11.9.102
Philipp Hennig, Ilse C. F. Ipsen, Maren Mahsereci, Tim Sullivan
{"title":"Probabilistic Numerical Methods - From Theory to Implementation (Dagstuhl Seminar 21432)","authors":"Philipp Hennig, Ilse C. F. Ipsen, Maren Mahsereci, Tim Sullivan","doi":"10.4230/DagRep.11.9.102","DOIUrl":"https://doi.org/10.4230/DagRep.11.9.102","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"102-119"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dagstuhl reportsPub Date : 2021-01-01DOI: 10.4230/DagRep.11.1.24
O. Boissier, A. Ciortea, A. Harth, A. Ricci
{"title":"Autonomous Agents on the Web (Dagstuhl Seminar 21072)","authors":"O. Boissier, A. Ciortea, A. Harth, A. Ricci","doi":"10.4230/DagRep.11.1.24","DOIUrl":"https://doi.org/10.4230/DagRep.11.1.24","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"273 1","pages":"24-100"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70434750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dagstuhl reportsPub Date : 2021-01-01DOI: 10.4230/DagRep.11.10.111
Falai Chen, T. Dokken, Géraldine Morin
{"title":"Geometric Modeling: Interoperability and New Challenges (Dagstuhl Seminar 21471)","authors":"Falai Chen, T. Dokken, Géraldine Morin","doi":"10.4230/DagRep.11.10.111","DOIUrl":"https://doi.org/10.4230/DagRep.11.10.111","url":null,"abstract":"This report documents the program and the outcomes of Dagstuhl Seminar 21471 “Geometric Modeling: Interoperability and New Challenges”. This seminar was initially planned on May 2021, and was delayed due to the pandemic. The seminar took place as a hybrid version with on site and remote participants. It provided a great opportunity for exchanges which, as pointed out by participants, were very appreciated in this period where international scientific interactions have been diminished. This report summarizes the seminar communications, first by providing the abstracts of the talks which present recent results in geometric modeling. Moreover, the scientific exchanges during the seminar provided a great basis for scientific discussions that resulted to the included five reports which highlight the new and future challenges in Geometric Modeling. In this talk we present the spatial counterpart of the recently introduced class of planar Pythagorean-Hodograph (PH) B–Spline curves. Spatial Pythagorean-Hodograph B–Spline curves are odd-degree, non-uniform, parametric spatial B–Spline curves whose arc length is a B–Spline function of the curve parameter and can thus be computed explicitly without numerical quadrature. We provide the general construction of these curves using quaternion algebra and formulate the problem of point interpolation by clamped and closed PH B–Spline curves of arbitrary odd degree. In particular, we provide closed form solutions for the cubic and the quintic cases, and discuss how degree-(2 n + 1), C n -continuous PH B–Spline curves can be computed by optimizing several scale-invariant fairness measures with interpolation constraints. Finally, we define Rational B-Spline Euler Rodrigues Frames (RBSERF) for regular PH B-Spline curves as well as rational tensor product B-Spline pipe surfaces. A functional is introduced to minimize the rotation of the RBSERF, and the results are illustrated on the corresponding rational pipe surface. The design and analysis of adaptive isogeometric methods with hierarchical spline constructions has attracted remarkable interest in the last few years. In order to increase the flexibility of the hierarchical approximation framework, while simultaneously preserving the performance of the overall adaptive scheme, particular attention is currently devoted to address the fast formation of system matrices arising from hierarchical discretization as well as to the development of effective multi-patch extensions. The talk will present recent results on these directions. strategies to generate 2-dimensional random auxetic meta-materials. Starting from a dense irregular network, we seek to reduce the Poisson’s ratio, by pruning bonds (edges) based solely on geometric criteria. To this end, we first deduce some prominent geometric features from regular auxetic networks and then introduce a strategy combining a pure geometric pruning algorithm followed by a physics-based testing phase to determine the resulting P","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"34 1","pages":"111-150"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70434810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}