pinecone/core-2020-05-10-deduplication huggingface dataset:
Exponential lower bounds and separation for query rewriting

We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we show that, in the worst case, positive existential and nonrecursive Datalog rewritings are exponentially longer than the original queries; nonrecursive Datalog rewritings are in general exponentially more succinct than positive existential rewritings; while first-order rewritings can be superpolynomially more succinct than positive existential rewritings
Algebraic synchronization trees and processes

International audienceWe study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy
Succinct indices for range queries with applications to orthogonal range maxima

We consider the problem of preprocessing N points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with the largest priority in the rectangle. Using the ideas of the effective entropy of range maxima queries and succinct indices for range maxima queries, we obtain a structure that uses O(N) words and answers the above query in O(logN loglogN) time. This a direct improvement of Chazelle's result from 1985 [10] for this problem - Chazelle required O(N/ε) words to answer queries in O((logN)[superscript 1+ε]) time for any constant ε > 0.Peer-reviewedPost-print39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 201
Hardness of approximation for quantum problems

The polynomial hierarchy plays a central role in classical complexity theory.
Here, we define a quantum generalization of the polynomial hierarchy, and
initiate its study. We show that not only are there natural complete problems
for the second level of this quantum hierarchy, but that these problems are in
fact hard to approximate. Using these techniques, we also obtain hardness of
approximation for the class QCMA. Our approach is based on the use of
dispersers, and is inspired by the classical results of Umans regarding
hardness of approximation for the second level of the classical polynomial
hierarchy [Umans, FOCS 1999]. The problems for which we prove hardness of
approximation for include, among others, a quantum version of the Succinct Set
Cover problem, and a variant of the local Hamiltonian problem with hybrid
classical-quantum ground states.Comment: 21 pages, 1 figure, extended abstract appeared in Proceedings of the
  39th International Colloquium on Automata, Languages and Programming (ICALP),
  pages 387-398, Springer, 201
Distributed Private Heavy Hitters

In this paper, we give efficient algorithms and lower bounds for solving the
heavy hitters problem while preserving differential privacy in the fully
distributed local model. In this model, there are n parties, each of which
possesses a single element from a universe of size N. The heavy hitters problem
is to find the identity of the most common element shared amongst the n
parties. In the local model, there is no trusted database administrator, and so
the algorithm must interact with each of the $n$ parties separately, using a
differentially private protocol. We give tight information-theoretic upper and
lower bounds on the accuracy to which this problem can be solved in the local
model (giving a separation between the local model and the more common
centralized model of privacy), as well as computationally efficient algorithms
even in the case where the data universe N may be exponentially large
Improving Quantum Query Complexity of Boolean Matrix Multiplication
  Using Graph Collision

The quantum query complexity of Boolean matrix multiplication is typically
studied as a function of the matrix dimension, n, as well as the number of 1s
in the output, \ell. We prove an upper bound of O (n\sqrt{\ell}) for all values
of \ell. This is an improvement over previous algorithms for all values of
\ell. On the other hand, we show that for any \eps < 1 and any \ell <= \eps
n^2, there is an \Omega(n\sqrt{\ell}) lower bound for this problem, showing
that our algorithm is essentially tight.
  We first reduce Boolean matrix multiplication to several instances of graph
collision. We then provide an algorithm that takes advantage of the fact that
the underlying graph in all of our instances is very dense to find all graph
collisions efficiently
Classical and quantum partition bound and detector inefficiency

We study randomized and quantum efficiency lower bounds in communication
complexity. These arise from the study of zero-communication protocols in which
players are allowed to abort. Our scenario is inspired by the physics setup of
Bell experiments, where two players share a predefined entangled state but are
not allowed to communicate. Each is given a measurement as input, which they
perform on their share of the system. The outcomes of the measurements should
follow a distribution predicted by quantum mechanics; however, in practice, the
detectors may fail to produce an output in some of the runs. The efficiency of
the experiment is the probability that the experiment succeeds (neither of the
detectors fails).
  When the players share a quantum state, this gives rise to a new bound on
quantum communication complexity (eff*) that subsumes the factorization norm.
When players share randomness instead of a quantum state, the efficiency bound
(eff), coincides with the partition bound of Jain and Klauck. This is one of
the strongest lower bounds known for randomized communication complexity, which
subsumes all the known combinatorial and algebraic methods including the
rectangle (corruption) bound, the factorization norm, and discrepancy.
  The lower bound is formulated as a convex optimization problem. In practice,
the dual form is more feasible to use, and we show that it amounts to
constructing an explicit Bell inequality (for eff) or Tsirelson inequality (for
eff*). We give an example of a quantum distribution where the violation can be
exponentially bigger than the previously studied class of normalized Bell
inequalities.
  For one-way communication, we show that the quantum one-way partition bound
is tight for classical communication with shared entanglement up to arbitrarily
small error.Comment: 21 pages, extended versio
Faster Algorithms for Privately Releasing Marginals

We study the problem of releasing k-way marginals of a database D ∈ {0,1}d)n, while preserving differential privacy. The an- swer to a k-way marginal query is the fraction of D’s records x ∈ {0, 1}d with a given value in each of a given set of up to k columns. Marginal queries enable a rich class of statistical analyses of a dataset, and de- signing efficient algorithms for privately releasing marginal queries has been identified as an important open problem in private data analysis (cf. Barak et. al., PODS ’07). We give an algorithm that runs in time dO( k) and releases a private summary capable of answering any k-way marginal query with at most ±.01 error on every query as long as n ≥ dO( k). To our knowledge, ours is the first algorithm capable of privately releasing marginal queries with non-trivial worst-case accuracy guarantees in time substantially smaller than the number of k-way marginal queries, which is dΘ(k) (for k ≪ d).Engineering and Applied Science
A Matrix Hyperbolic Cosine Algorithm and Applications

In this paper, we generalize Spencer's hyperbolic cosine algorithm to the
matrix-valued setting. We apply the proposed algorithm to several problems by
analyzing its computational efficiency under two special cases of matrices; one
in which the matrices have a group structure and an other in which they have
rank-one. As an application of the former case, we present a deterministic
algorithm that, given the multiplication table of a finite group of size $n$,
it constructs an expanding Cayley graph of logarithmic degree in near-optimal
O(n^2 log^3 n) time. For the latter case, we present a fast deterministic
algorithm for spectral sparsification of positive semi-definite matrices, which
implies an improved deterministic algorithm for spectral graph sparsification
of dense graphs. In addition, we give an elementary connection between spectral
sparsification of positive semi-definite matrices and element-wise matrix
sparsification. As a consequence, we obtain improved element-wise
sparsification algorithms for diagonally dominant-like matrices.Comment: 16 pages, simplified proof and corrected acknowledging of prior work
  in (current) Section
Automata with modulo counters and nondeterministic counter bounds

This is a conference paper. It was published in the Lecture Notes of Computer Science series [© Springer-Verlag]: www.springerlink.com.We introduce and investigate Nondeterministically Bounded\ud
Modulo Counter Automata (NBMCA), which are two-way one-head automata\ud
that comprise a constant number of modulo counters, where the\ud
counter bounds are nondeterministically guessed, and this is the only\ud
element of nondeterminism. NBMCA are tailored to recognising those\ud
languages that are characterised by the existence of a specific factorisation\ud
of their words, e. g., pattern languages. In this work, we subject\ud
NBMCA to a theoretically sound analysis
Typed linear algebra for weighted (probabilistic) automata

There is a need for a language able to reconcile the recent upsurge of interest in quantitative methods in the software sciences with logic and set theory that have been used for so many years in capturing the qualitative aspects of the same body of knowledge. Such a lingua franca should be typed, polymorphic, diagrammatic, calculational and easy to blend with traditional notation.
This paper puts forward typed linear algebra (LA) as a candidate notation for such a role. Typed LA emerges from regarding matrices as morphisms of suitable categories whereby traditional linear algebra is equipped with a type system.
In this paper we show typed LA at work in describing weighted (prob- abilistic) automata. Some attention is paid to the interface between the index-free language of matrix combinators and the corresponding index- wise notation, so as to blend with traditional set theoretic notation.Fundação para a Ciência e a Tecnologia (FCT
Lynx: A Programmatic SAT Solver for the RNA-folding Problem

This paper introduces Lynx, an incremental programmatic SAT solver that allows non-expert users to introduce domain-specific code into modern conflict-driven clause-learning (CDCL) SAT solvers, thus enabling users to guide the behavior of the solver.
The key idea of Lynx is a callback interface that enables non-expert users to specialize the SAT solver to a class of Boolean instances. The user writes specialized code for a class of Boolean formulas, which is periodically called by Lynx’s search routine in its inner loop through the callback interface. The user-provided code is allowed to examine partial solutions generated by the solver during its search, and to respond by adding CNF clauses back to the solver dynamically and incrementally. Thus, the user-provided code can specialize and influence the solver’s search in a highly targeted fashion. While the power of incremental SAT solvers has been amply demonstrated in the SAT literature and in the context of DPLL(T), it has not been previously made available as a programmatic API that is easy to use for non-expert users. Lynx’s callback interface is a simple yet very effective strategy that addresses this need.
We demonstrate the benefits of Lynx through a case-study from computational biology, namely, the RNA secondary structure prediction problem. The constraints that make up this problem fall into two categories: structural constraints, which describe properties of the biological structure of the solution, and energetic constraints, which encode quantitative requirements that the solution must satisfy. We show that by introducing structural constraints on-demand through user provided code we can achieve, in comparison with standard SAT approaches, upto 30x reduction in memory usage and upto 100x reduction in time.15th International Conference, Trento, Italy, June 17-20, 2012. Proceeding
Using term rewriting to solve bit-vector arithmetic problems - (Poster Presentation)

Among many theories supported by SMT solvers, the theory of finite-precision bit-vector arithmetic is one of the most useful, for both hardware and software systems verification. This theory is also particularly useful for some specific domains such as cryptography, in which algorithms are naturally expressed in terms of bit-vectors. Cryptol is an example of a domain-specific language (DSL) and toolset for cryptography developed by Galois, Inc.; providing an SMT backend that relies on bit-vector decision procedures to certify the correctness of cryptographic specifications [3]. Most of these decision procedures use bit-blasting to reduce a bit-vector problem into pure propositional SAT. Unfortunately bit-blasting does not scale very well, especially in the presence of operators like multiplication or division
Bounded Counter Languages

We show that deterministic finite automata equipped with $k$ two-way heads
are equivalent to deterministic machines with a single two-way input head and
$k-1$ linearly bounded counters if the accepted language is strictly bounded,
i.e., a subset of $a_1^*a_2^*... a_m^*$ for a fixed sequence of symbols $a_1,
a_2,..., a_m$. Then we investigate linear speed-up for counter machines. Lower
and upper time bounds for concrete recognition problems are shown, implying
that in general linear speed-up does not hold for counter machines. For bounded
languages we develop a technique for speeding up computations by any constant
factor at the expense of adding a fixed number of counters
Regular and context-free pattern languages over small alphabets

The final publication is available at www.springerlink.com.Pattern languages are generalisations of the copy language,\ud
which is a standard textbook example of a context-sensitive and noncontext-\ud
free language. In this work, we investigate a counter-intuitive\ud
phenomenon: with respect to alphabets of size 2 and 3, pattern languages\ud
can be regular or context-free in an unexpected way. For this regularity\ud
and context-freeness of pattern languages, we give several sufficient and\ud
necessary conditions and improve known results
Morphic primitivity and alphabet reductions

The final publication is available at www.springerlink.com.An alphabet reduction is a 1-uniform morphism that maps\ud
a word to an image that contains a smaller number of dfferent letters.\ud
In the present paper we investigate the effect of alphabet reductions on\ud
morphically primitive words, i. e., words that are not a fixed point of\ud
a nontrivial morphism. Our first main result answers a question on the\ud
existence of unambiguous alphabet reductions for such words, and our\ud
second main result establishes whether alphabet reductions can be given\ud
that preserve morphic primitivity. In addition to this, we study Billaud's\ud
Conjecture - which features a dfferent type of alphabet reduction, but\ud
is otherwise closely related to the main subject of our paper - and prove\ud
its correctness for a special case
Inside the class of REGEX Languages

This conference paper was presented at the 16th International Conference, DLT 2012\ud
Taipei, Taiwan, August 14-17, 2012 and published as a book chapter in Developments in Language Theory, Lecture Notes in Computer Science [© Springer]. The definitive version is available at: www.springerlink.com.We study different possibilities of combining the concept of homomorphic replacement with regular expressions in order to investigate the class of languages given by extended regular expressions with backreferences (REGEX). It is shown in which regard existing and natural ways to do this fail to reach the expressive power of REGEX. Furthermore, the complexity of the membership problem for REGEX with a bounded number of backreferences is considered
GF(2^m) Finite-Field Multipliers with Reduced Activity Variations

International audienceElectrical activity variations in a circuit are one of the information leakage used in side channel attacks. In this work, we present GF(2^m) multipliers with reduced activity variations for asymmetric cryptography. Useful activity of typical multiplication algorithms is evaluated. The results show strong shapes, which can be used as a small source of information leakage. We propose modified multiplication algorithms and multiplier architectures to reduce useful activity variations during an operation
A new method for constructing small-bias spaces from Hermitian codes

We propose a new method for constructing small-bias spaces through a
combination of Hermitian codes. For a class of parameters our multisets are
much faster to construct than what can be achieved by use of the traditional
algebraic geometric code construction. So, if speed is important, our
construction is competitive with all other known constructions in that region.
And if speed is not a matter of interest the small-bias spaces of the present
paper still perform better than the ones related to norm-trace codes reported
in [12]
An improved threshold ring signature scheme based on error correcting codes

International audienceThe concept of threshold ring signature in code-based cryptography was introduced by Aguilar et al. in. Their proposal uses Stern's identification scheme as basis. In this paper we construct a novel threshold ring signature scheme built on the q-SD identification scheme recently proposed by Cayrel et al. Our proposed scheme benefits of a performance gain as a result of the reduction in the soundness error from 2/3 for Stern's scheme to 1/2 per round for the q-SD scheme. Our threshold ring signature scheme uses random linear codes over the field Fq, secure in the random oracle model and its security relies on the hardness of an error-correcting codes problem (namely the q-ary syndrome decoding problem). In this paper we also provide implementation results of the Aguilar et al. scheme and our proposal, this is the first efficient implementation of this type of code-based schemes
Addressing governance and ethics in European technology development projects through scenarios

Failures to consider the ethical aspects of technology development and design have resulted in significant negative impacts on individuals over the last decade. In consequence we have seen the emergence and growing interest in technology design movements such as “value sensitive design” and “privacy by design” aimed at specifically addressing issues of social and ethical impact. However, there is still a long way to go in raising awareness of ethical issues in technology design. This paper presents research undertaken as part of the European co-funded project “EGAIS’ which addresses precisely this issue of ethics consideration in technology development. A key component of the awareness raising initiative in technology design is the use of scenarios to prompt thinking across a range of stakeholders, and with this in mind the authors conducted a workshop at this IFIP Summer School using a scenario to stimulate discussion and promote ‘context aware’ thinking. A summary of the discussions, key points, and suggestions for further work are included here
Introduction to Stokes structures

The purpose of these lectures is to introduce the notion of a Stokes-perverse
sheaf as a receptacle for the Riemann-Hilbert correspondence for holonomic
D-modules. They develop the original idea of P. Deligne in dimension one, and
make it enter the frame of perverse sheaves. They also give a first step for a
general definition in higher dimension, and make explicit particular cases of
the Riemann-Hilbert correspondence, relying on recent results of T. Mochizuki.Comment: Expanded Lecture notes of lectures given in Lisboa, jan. 2009. V2:
  175 pages, 5 figures. Some corrections and improvements and new Lecture 6
  added. V3: 191 pages, Lecture 14 added. V4: 202 pages, Duality properties
  added in Lectures 5 & 7. V5: revised and corrected version: 242 page
Coreference detection of low quality objects

The problem of record linkage is a widely studied problem that aims to identify coreferent (i.e. duplicate) data in a structured data source. As indicated by Winkler, a solution to the record linkage problem is only possible if the error rate is sufficiently low. In other words, in order to succesfully deduplicate a database, the objects in the database must be of sufficient quality. However, this assumption is not always feasible. In this paper, it is investigated how merging of low quality objects into one high quality object can improve the process of record linkage. This general idea is illustrated in the context of strings comparison, where strings of low quality (i.e. with a high typographical error rate) are merged into a string of high quality by using an n-dimensional Levenshtein distance matrix and compute the optimal alignment between the dirty strings. Results are presented and possible refinements are proposed
Discovering the Preferences of Physicians with Regards to Rank-ordered Medical Documents

The practice of evidence-based medicine involves consulting documents from repositories such as Scopus, PubMed, or the Cochrane Library. The most common approach for presenting retrieved documents is in the form of a list, with the assumption that the higher a document is on a list, the more relevant it is. Despite this list-based presentation, it is seldom studied how physicians perceive the importance of the order of documents presented in a list. This paper describes an empirical study that elicited and modeled physicians’ preferences with regard to list-based results. Preferences were analyzed using a GRIP method that relies on pairwise comparisons of selected subsets of possible rank-ordered lists composed of 3 documents. The results allow us to draw conclusions regarding physicians’ attitudes towards the importance of having documents ranked correctly on a result list, versus the importance of retrieving relevant but misplaced documents. Our findings should help developers of clinical information retrieval applications when deciding how retrieved documents should be presented and how performance of the application should be assessed