Three-dimensional optical microscopy suffers from the well-known compromise between transverse resolution and depth-of-field. This is true for both structural imaging methods and their functional extensions. Interferometric synthetic aperture microscopy (ISAM) is a solution to the 3D coherent microscopy inverse problem that provides depth-independent transverse resolution. We demonstrate the ex...

Microbial ecosystems have been widely used in industrial production, but the inter-relationships of organisms within them haven't been completely clarified due to complex composition and structure of natural microbial ecosystems. So it is challenging for ecologists to get deep insights on how ecosystems function and interplay with surrounding environments. But the recent progresses in synthetic...

At rst glance, privacy and zero-knowledgeness seem to be similar properties. A scheme is private when no information is revealed on the prover and in a zero-knowledge scheme, communications should not leak provers' secrets. Until recently, privacy threats were only partially formalized and some zero-knowledge (ZK) schemes have been proposed so far to ensure privacy. We here explain why the inte...

The numerical treatment of many mathematical models (which arise, for example, in physics, chemistry, biology or economics) leads very often to huge algebraic problems, so that it is difficult (both with regard to the storage needed and with regard to the computing time spent) to handle these problems even on the big modern computers. However, the matrices that occur in the algebraic problems a...

There is a longstanding debate about the zero-point term in the Johnson noise voltage of a resistor. This term originates from a quantumtheoretical treatment of the fluctuation-dissipation theorem (FDT). Is the zero-point term really there, or is it only an experimental artifact, due to the uncertainty principle, for phase-sensitive amplifiers? Could it be removed by renormalization of theories...

We show that public-key bit encryption schemes which support weak (i.e., compact) homomorphic evaluation of any sufficiently “sensitive” collection of functions cannot be proved message indistinguishable beyond AM ∩ coAM via general (adaptive) reductions, and beyond statistical zero-knowledge via reductions of constant query complexity. Examples of sensitive collections include parities, majori...

We study a class of program schemes, NPSB, in which, aside from basic assignments, nondeterministic guessing and while loops, we have access to arrays; but where these arrays are binary write-once in that they are initialized to ‘zero’ and can only ever be set to ‘one’. We show, amongst other results, that: NPSB can be realized as a vectorized Lindstr om logic; there are problems accepted by p...