Service composition in stochastic settings

With the growth of the Internet-of-Things and online Web services, more services with more capabilities are available to us. The ability to generate new, more useful services from existing ones has been the focus of much research for over a decade. The goal is, given a specification of the behavior of the target service, to build a controller, known as an orchestrator, that uses existing services to satisfy the requirements of the target service. The model of services and requirements used in most work is that of a finite state machine. This implies that the specification can either be satisfied or not, with no middle ground. This is a major drawback, since often an exact solution cannot be obtained. In this paper we study a simple stochastic model for service composition: we annotate the tar- get service with probabilities describing the likelihood of requesting each action in a state, and rewards for being able to execute actions. We show how to solve the resulting problem by solving a certain Markov Decision Process (MDP) derived from the service and requirement specifications. The solution to this MDP induces an orchestrator that coincides with the exact solution if a composition exists. Otherwise it provides an approximate solution that maximizes the expected sum of values of user requests that can be serviced. The model studied although simple shades light on composition in stochastic settings and indeed we discuss several possible extensions

Gauge-invariant quark-antiquark nonlocal condensates in lattice QCD

We study, by numerical simulations on a lattice, the behaviour of the gauge-invariant quark-antiquark nonlocal condensates in the QCD vacuum with dynamical fermions. A determination is also done in the quenched approximation and the results are compared with the full-QCD case. The fermionic correlation length is extracted and compared with the analogous gluonic quantity.Comment: 14 pages, LaTeX file, + 6 PS figure

Improved lattice operators: the case of the topological charge density

We analyze the properties of a class of improved lattice topological charge density operators, constructed by a smearing-like procedure. By optimizing the choice of the parameters introduced in their definition, we find operators having (i) a better statistical behavior as estimators of the topological charge density on the lattice, i.e. less noisy; (ii) a multiplicative renormalization much closer to one; (iii) a large suppression of the perturbative tail (and other unphysical mixings) in the corresponding lattice topological susceptibility.Comment: 11 pages (REVTEX) + 4 (uuencoded) figure

Operational distance and fidelity for quantum channels

We define and study a fidelity criterion for quantum channels, which we term the minimax fidelity, through a noncommutative generalization of maximal Hellinger distance between two positive kernels in classical probability theory. Like other known fidelities for quantum channels, the minimax fidelity is well-defined for channels between finite-dimensional algebras, but it also applies to a certain class of channels between infinite-dimensional algebras (explicitly, those channels that possess an operator-valued Radon--Nikodym density with respect to the trace in the sense of Belavkin--Staszewski) and induces a metric on the set of quantum channels which is topologically equivalent to the CB-norm distance between channels, precisely in the same way as the Bures metric on the density operators associated with statistical states of quantum-mechanical systems, derived from the well-known fidelity (`generalized transition probability') of Uhlmann, is topologically equivalent to the trace-norm distance.Comment: 26 pages, amsart.cls; improved intro, fixed typos, added a reference; accepted by J. Math. Phy

Toward a well defined monopole creation operator

The lattice implementation of monopole creation operator proves to have problems related to bulk transitions that can possibly affect the interpretation of its mean value as an order parameter for monopole condensation. Preliminary evidence is presented that these unexpected behaviours are in fact only due to lattice artefacts and do not spoil the physical interpretation of the monopole operator

Performance of a deterministic source of entangled photonic qubits

We study the possible limitations and sources of decoherence in the scheme for the deterministic generation of polarization-entangled photons, recently proposed by Gheri et al. [K. M. Gheri et al., Phys. Rev. A 58, R2627 (1998)], based on an appropriately driven single atom trapped within an optical cavity. We consider in particular the effects of laser intensity fluctuations, photon losses, and atomic motion.Comment: 10 pages, 6 figure

Superbroadcasting of continuous variables mixed states

We consider the problem of broadcasting quantum information encoded in the average value of the field from N to M>N copies of mixed states of radiation modes. We derive the broadcasting map that preserves the complex amplitude, while optimally reducing the noise in conjugate quadratures. We find that from two input copies broadcasting is feasible, with the possibility of simultaneous purification (superbroadcasting). We prove similar results for purification (M<=N) and for phase-conjugate broadcasting.Comment: 11 pages, 1 figure, revtex4 style, revised versio

Updating DL-Lite ontologies through first-order queries

In this paper we study instance-level update in DL-LiteA, the description logic underlying the OWL 2 QL standard. In particular we focus on formula-based approaches to ABox insertion and deletion. We show that DL-LiteA, which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for updates. That is, every update can be reformulated into a set of insertion and deletion instructions computable through a nonrecursive datalog program. Such a program is readily translatable into a first-order query over the ABox considered as a database, and hence into SQL. By exploiting this result, we implement an update component for DLLiteA-based systems and perform some experiments showing that the approach works in practice.Peer ReviewedPostprint (author's final draft