Fine-grained multi-keyword search schemes over encrypted cloud data. Our innovative donations are three-fold. First, we commence the application scores and partiality factors upon keywords which facilitate the particular keyword search and modified user familiarity. we auxiliary take up the confidential sub-dictionaries procedure to accomplish better effectiveness on index structure, trapdoor g...

In this paper, a visual language, VCP, for queries on complexvalue databases is proposed. The main strength of the new language is that it is purely visual: (i) It has no notion of variable, quantification, partiality, join, pattern matching, regular expression, recursion, or any other construct proper to logical, functional, or other database query languages and (ii) has a very natural, strong...

Ecological modernisation in the form of support to notion green growth remains dominant discourse environmental policy globally. Still, questions limits economic expansion and on a planet with finite natural resources have been at core discourses least since 1970's. A recent effort by Stoknes Rockström (2018) seeks unite notions ecological concept proposing genuine as denoting situation when re...

Countable Lawvere theories model computational effects such as exceptions, side-effects, interactive input/output, nondeterminism and probabilistic nondeterminism. The category of countable Lawvere theories has sums, tensors, and distributive tensors, modelling natural combinations of such effects. It is also closed under taking images. Enrichment in a category such as Cpo allows one to extend ...

Due to mobile device proliferation, content providers can no longer deliver only one version of their content to the users, as they need to deliver an appropriate form of content depending on the capabilities of the viewing devices. Web authors either create multiple versions of the same content for each device, or depend on some intermediaries to do the transformation. In this paper, we propos...

We continue the study of Capretta’s delay monad as a means of introducing non-termination from iteration into Martin-Löf type theory. In particular, we explain in what sense this monad provides a canonical solution. We discuss a class of monads that we call ω-complete pointed classifying monads. These are monads whose Kleisli category is an ωcomplete pointed restriction category where pure maps...

Proof-checking code for compliance to safety policies potentially enables a product-oriented approach to certain aspects of software certification. To date, previous research has focused on generic, low-level programming-language properties such as memory type safety. In this paper we consider proof-checking higher-level domain-specific properties for compliance to safety policies. The paper fi...

The modeling, representation and use of context is the challenge for the coming years in Artificial Intelligence, especially when we now face very large knowledge bases, complex problems and multimedia means. The notion of context is important since it can capture many of the interesting aspects of the way we understand the world, such as relativity, locality, partiality, and contextdependence....

In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations — of which field operations are special cases— on a representation of real numbers by coinductive streams. The algorithms work on coinductive stream of Möbius maps and form the basis of the Edalat–Potts exact real arithmetic. We use the machiner...

We investigate new extensions of the Kruskal-Friedman theorems concerning well-quasiordering of finite trees with the gap condition. For two labelled trees s and t we say that s is embedded with gap into t if there is an injection from the vertices of s into t which maps each edge in s to a unique path in t with greater-or-equal labels. We show that finite trees are well-quasi-ordered with resp...