A set-valuation of a graph G = (V, E) assigns to the vertices or edges of G elements of the power set X 2 of a given nonempty set X subject to certain conditions and set-valuations have a variety of origins. Acharya defined a set-indexer of G to be an injective set-valuation X G V f 2 ) ( : → such that the induced set-valuation ) ( : G E f ⊕ X 2 → on the edges of G defined by ) ( ), ( ) ( ) ( G...

For a graph G = (V, E), a stable set in G is a vertex set such that no pair of vertices in the set are connected by an edge. Stable set enumeration problems have been studied because of their applications to optimization, computational geometry, etc. However, the problem of speeding up enumeration algorithms for stable sets is still open. In this paper, we consider the problem of enumerating al...

Answer Set Programming (ASP) is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL and many others. Since its first informal editions, ASP systems have been compared in the now well-established ASP Competition. The Third (Open) ASP Competition, as the sequel to the ASP...

Current logo retrieval research focuses on closed set scenarios. We argue that the logo domain is too large for this strategy and requires an open set approach. To foster research in this direction, a large-scale logo dataset, called Logos in the Wild, is collected and released to the public. A typical open set logo retrieval application is, for example, assessing the effectiveness of advertise...

This paper presents investigations into the performance of openset, text-independent speaker identification (OSTI-SI) under mismatched data conditions. The scope of the study includes attempts to reduce the adverse effects of such conditions through the introduction of a modified parallel model combination (PMC) method together with condition-adjusted T-Norm (CTNorm) into the OSTI-SI framework....

In this supplement, we provide we provide additional material to further the reader as understanding of the work on Open Set Deep Networks, Mean Activation Vectors, Open Set Recognition and OpenMax algorithm. We present additional experiments on ILSVRC 2012 dataset. First we present experiments to illustrate performance of OpenMax for various parameters of EVT calibration (Alg. 1, main paper) f...

In this paper we describe initial results from the Swedish innovation project "My Care Pathways" which envisions enabling citizens to track their own health by providing them with online access to their historical, current and prospective future events. We describe an information infrastructure and its base services as well as the use of this solution as an open source platform for open innovat...

The lattice E of c.e. sets is a popular object of study in Computability Theory [So87]. A principal fact about this lattice is the undecidability of its first-order theory Th(E). Moreover, Th(E) is known [HN98] to be m-equivalent to the first-order arithmetic Th(N) where N := (ω; +,×). The lattice E may be considered as the lattice of effectively open subsets of the discrete topological space ω...