Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games

2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached with different types of algorithms: strategy improvement algorithms for 2.5 player reachability games and recursive algorithms for the qualitative analysis of parity games. We present a method that - in contrast to existing techniques - tackles both aspects with the best suited approach and works exclusively on the 2.5 player game itself. The resulting technique is powerful enough to handle games with several million states

Why digital medicine depends on interoperability

Digital data are anticipated to transform medicine. However, most of today's medical data lack interoperability: hidden in isolated databases, incompatible systems and proprietary software, the data are difficult to exchange, analyze, and interpret. This slows down medical progress, as technologies that rely on these data - artificial intelligence, big data or mobile applications - cannot be used to their full potential. In this article, we argue that interoperability is a prerequisite for the digital innovations envisioned for future medicine. We focus on four areas where interoperable data and IT systems are particularly important: (1) artificial intelligence and big data; (2) medical communication; (3) research; and (4) international cooperation. We discuss how interoperability can facilitate digital transformation in these areas to improve the health and well-being of patients worldwide

Lazy Probabilistic Model Checking without Determinisation

The bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic B\"uchi automata is the inclusion of a determinisation step of the automaton under consideration. In this paper, we show that full determinisation can be avoided: subset and breakpoint constructions suffice. We have implemented our approach---both explicit and symbolic versions---in a prototype tool. Our experiments show that our prototype can compete with mature tools like PRISM.Comment: 38 pages. Updated version for introducing the following changes: - general improvement on paper presentation; - extension of the approach to avoid full determinisation; - added proofs for such an extension; - added case studies; - updated old case studies to reflect the added extensio

Discovering Mathematical Objects of Interest -- A Study of Mathematical Notations

Mathematical notation, i.e., the writing system used to communicate concepts in mathematics, encodes valuable information for a variety of information search and retrieval systems. Yet, mathematical notations remain mostly unutilized by today's systems. In this paper, we present the first in-depth study on the distributions of mathematical notation in two large scientific corpora: the open access arXiv (2.5B mathematical objects) and the mathematical reviewing service for pure and applied mathematics zbMATH (61M mathematical objects). Our study lays a foundation for future research projects on mathematical information retrieval for large scientific corpora. Further, we demonstrate the relevance of our results to a variety of use-cases. For example, to assist semantic extraction systems, to improve scientific search engines, and to facilitate specialized math recommendation systems. The contributions of our presented research are as follows: (1) we present the first distributional analysis of mathematical formulae on arXiv and zbMATH; (2) we retrieve relevant mathematical objects for given textual search queries (e.g., linking $P_{n}^{(\alpha, \beta)}\!\left(x\right)$ with `Jacobi polynomial'); (3) we extend zbMATH's search engine by providing relevant mathematical formulae; and (4) we exemplify the applicability of the results by presenting auto-completion for math inputs as the first contribution to math recommendation systems. To expedite future research projects, we have made available our source code and data.Comment: Proceedings of The Web Conference 2020 (WWW'20), April 20--24, 2020, Taipei, Taiwa

Phonon anomalies and lattice dynamics in superconducting oxychlorides Ca2−x_{2-x}CuO2_2Cl

We present a comprehensive study of the phonon dispersion in an underdoped, superconducting Ca$_{2-x}$CuO$_2$Cl$_2$ crystal. We interpret the results using lattice dynamical calculations based on a shell model, and we compare the results, to other hole-doped cuprates, in particular to the ones isomorphic to La$_{2-x}$Sr$_x$CuO$_4$ (LSCO). We found that an anomalous dip in the Cu-O bond stretching dispersion develops in oxychlorides with a simultaneous marked broadening of the mode. The broadening is maximum at $\approx (\pi / (2a) ~ 0 ~ 0)$ that corresponds to the charge-modulations propagation vector. Our analysis also suggests that screening effects in calculations may cause an apparent cosine-shaped bending of the Cu-O bond-stretching dispersion along both the ($q$ 0 0) and ($q$ $q$ 0) directions, that is not observed on the data close to optimal doping. This observation suggests that the discrepancy between experimental data and \textit{ab-initio} calculations on this mode originates from an overestimation of the doping effects on the mode