The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...

In this paper, the notion of $L$-convex fuzzy sublattices is introduced and their characterizations are given. Furthermore,  the notion of the degree to which an $L$-subset is an $L$-convex fuzzy sublattice is proposed and its some  characterizations are given. Besides, the $L$-convex fuzzy sublattice degrees of the homomorphic image and pre-image of an $L$-subset are studied. Finally, we obtai...

Penalized Fast Subset Scanning Skyler Speakman, Sriram Somanchi, Edward McFowland III & Daniel B. Neill To cite this article: Skyler Speakman, Sriram Somanchi, Edward McFowland III & Daniel B. Neill (2016) Penalized Fast Subset Scanning, Journal of Computational and Graphical Statistics, 25:2, 382-404, DOI: 10.1080/10618600.2015.1029578 To link to this article: http://dx.doi.org/10.1080/1061860...

We study the pattern matching automaton introduced in [1] for the purpose of seed-based similarity search. We show that our definition provides a compact automaton, much smaller than the one obtained by applying the Aho-Corasick construction. We study properties of this automaton and present an efficient implementation of the automaton construction. We also present some experimental results and...

The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of suuciently low density. Both methods rely on basis reduction algorithms to nd short non-zero vectors in special lattices. The Lagarias-Odlyzko algorithm would solve almost all subset sum prob...

Subset-logic programs are built up of three kinds of program clauses: subset, equational, and relational clauses. Using these clauses, we can program solutions to a broad range of problems of interest in logic programming and deductive databases. In an earlier paper Jay92], we discussed the implementation of subset and equational program clauses. This paper substantially extends that work, and ...

We propose a new probabilistic generative model for analyzing sparse and noisy pairwise relational data, such as friend-links on social network services and customer records in online shops. Real-world relational data often include a large portion of non-informative pairwise data entries. Many existing stochastic blockmodels suffer from these irrelevant data entries because of their rather simp...

This paper describes a method to convert stateless key revocation schemes based on the subset cover principle into stateful schemes. The main motivation is to reduce the bandwidth overhead to make broadcast encryption schemes more practical in network environments with limited bandwidth resources, such as cellular networks. This modification is not fully collusion-resistant. A concrete new sche...

Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . . , Au in order to maximize the size of the intersection of the sets. In this paper we present two NP-Hardness proofs, the first via a direct reduction from 3-Sat. The second proof involves a gap-preserving reduction f...

Regular-LTL (RLTL), extends LTL with regular expressions, and it is the core of the IEEE standard temporal logic PSL. Safety formulas of RLTL, as well as of other temporal logics, are easier to verify than other formulas. This is because verification of safety formulas can be reduced to invariance checking using an auxiliary automaton recognizing violating prefixes. In this paper we define a sp...