The paper considers the phase retrieval problem in N dimensional complex vector spaces. It provides two sets of deterministic measurement vectors which guarantee signal recovery for all signals, excluding only a specific subspace and a union of subspaces, respectively. A stable analytic reconstruction procedure of low complexity is given. Additionally it is proven that signal recovery from thes...

Abstract In their 2018 paper, Carolina Adler, Gertrude Hirsch Hadorn, Thomas Breu, Urs Wiesmann, and Christian Pohl propose that transferability of knowledge across cases in transdisciplinary research should be thought terms arguments by analogy. We aim to advance this discussion about examining it the light recent ideas transfer, extrapolation, external validity philosophy science. problematis...

The extremely precise extraction of the proton radius by Pohl et al. from the meaAnnu. Rev. Nucl. Part. Sci. 2013, Vol. 63. doi: 10.1146/annurev-nucl-102212-170627 sured energy difference between the 2P and 2S states of muonic hydrogen disagrees significantly with that extracted from electronic hydrogen or elastic electron-proton scattering. This is the proton radius puzzle. The origins of the ...

1. Ben Achour C, Rolland C, Souveyet C, Maiden NAM (1999) Guiding use case authoring: results of an empirical study. In: Proceedings of the 4th IEEE international symposium on requirements engineering RE 1999, IEEE Computer Society, Washington, DC, USA, pp 36–43 2 Bubenko J, Rolland C, Loucopoulos P, DeAntonellis V (1994) Facilitating ‘fuzzy to formal’ requirements modelling. In: Proceedings of...

We present the first streaming algorithm for the longest path problem in undirected graphs. The input graph is given as a stream of edges and RAM is limited to only a linear number of edges at a time (linear in the number of vertices n). We prove a per-edge processing time of O(n), where a naive solution would have required Ω(n2). Moreover, we give a concrete linear upper bound on the number of...