Two major challenges for enabling the vision of cloud computing regard (a) the generic and multi-purpose access to (virtualised) resources, and (b) the flexible, dynamic, and on-demand composition of services vertically from the physical link level, all the way “up” to the application level. Both aspects require a respective flexibility and expressibility from the interfaces in-place, which is ...

It is a desirable goal for a protection system to be expressive (providing the desired protections), robust (enabling the system to change without invalidating protections), and analyzable (so it can be understood which protections are provided). Of particular interest in analyzing a system is the decidability of security properties. If the system is not analyzable, how does one know what prote...

Scientific domains are characterized by substantial amounts of complex data, many unknowns, lack of complete theories, and rapid evolution. In many areas of decision making, much of the reasoning process is based on experience rather than on general knowledge. Experts remember positive cases for possible reuse of solutions, but negative cases are also useful for avoiding potentially unsuccessfu...

Machine learning (ML) has recently facilitated many advances in solving problems related to many-body physical systems. Given the intrinsic quantum nature of these problems, it is natural speculate that quantum-enhanced machine will enable us unveil even greater details than we currently have. With this motivation, paper examines a approach based on shallow variational ansatz inspired by tensor...

We propose and analyze a set of variational quantum algorithms for solving quadratic unconstrained binary optimization problems where problem consisting $n_c$ classical variables can be implemented on $\mathcal O(\log n_c)$ number qubits. The underlying encoding scheme allows systematic increase in correlations among the captured by state progressively increasing qubits involved. first examine ...

We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...

Existing authorization mechanisms fail to provide powerful and robust tools for handling security at the scale necessary for today's Internet. These mechanisms are coming under increasing strain from the development and deployment of systems that increase the programmability of the Internet. Moreover, this \increased exibility through programmability" trend seems to be accelerating with the adv...

A class of probabilistic-logic models is considered, which increases the expressibility from HMM’s and SCFG’s regular and contextfree languages to, in principle, Turing complete languages. In general, such models are computationally far too complex for direct use, so optimization by pruning and approximation are needed. The first steps are taken towards a methodology for optimizing such models ...

ion of formal verification One of the strengths of Binary Fission is how well it abstracts away the messy details of formal software verification and presents it as a simple sorting problem. This allows for Binary Fission to represent a wide range of data types and predicates, and get input data from a wide variety of programs. This also keeps Binary Fission accessible to a wide audience. Howev...