This paper revisits a public key cryptosystem which is based on finite string-rewriting systems. We consider a new approach for cryptanalysis of such proposals—the so-called completion attack. If a particular kind of weak key is generated, then a passive adversary is able to retrieve secret messages with a significant probability. Our idea can be applied to other rewriting based cryptosystems a...

We present a new method for automatically proving termination of term rewriting and string rewriting. It is based on the wellknown idea of interpretation of terms in natural numbers where every rewrite step causes a decrease. In the dependency pair setting only weak monotonicity is required for these interpretations. For these we use quasiperiodic functions. It turns out that then the decreasin...

This paper is concerned with a new task of ranking, referred to as “supplementary data assisted ranking”, or “supplementary ranking” for short. Different from conventional ranking, in the new task, each query is associated with two sets of objects: the target objects that are to be ranked, and the supplementary objects whose orders are not of our interest. Existing learning to rank approaches (...

where Q <= Rm is a bounded domain, JS?W denotes m-dimensional Lebesgue measure, (p = (<p\..., (p) is a continuous transformation from Q to Rn (m ^ n) belonging to some Sobolev space W x p' (Q), and (px is the (almost everywhere defined) matrix function (d^/oxj). Here ƒ is a realvalued function o n Q x i ? n x M „ x m , where Mnxm is the space o f n x m matrices. Such integrals arise in the anal...

Two important aspects of semantic parsing for question answering are the breadth of the knowledge source and the depth of logical compositionality. While existing work trades off one aspect for another, this paper simultaneously makes progress on both fronts through a new task: answering complex questions on semi-structured tables using question-answer pairs as supervision. The central challeng...

We study the theory of a Hilbert space H as a module for a unital C∗-algebra A from the point of view of continuous logic. We show this theory, in an appropiate lenguage, has quantifier elimination and it is superstable. We show that for every v ∈ H the type tp(v/∅) is in correspondence with the positive linear functional over A defined by v. Finally, we characterize forking, orthogonality and ...

Lanczos vectors computed in nite precision arithmetic by the three-term recurrence tend to lose their mutual biorthogonality. One either accepts this loss and takes more steps or re-biorthogonalizes the Lanczos vectors at each step. For the symmetric case, there is a compromise approach. This compromise, known as maintaining semi-orthogonality, minimizes the cost of re-orthogonalization. This p...

Local cosine/sine basis is a localized version of co-sine/sine basis with a smooth window function. It has orthogonality and good time and frequency localization properties. Adaptive local cosine/sine basis is a best-basis based on a cost-functional obtained from an overabundant library of cosine/sine packets. In this paper, we apply the 2-D semi-adaptive (time-adaptive or space-adaptive) local...

We calculate, within pQCD parton model at leading orders, the expression of the polarization P of spin 1/2 hadrons (typically Λ baryons), produced in polarized semi-inclusive DIS in all possible cases in which weak interactions are involved. We discuss how to gather new information on fragmentation and distribution functions and give numerical estimates in the cases for which data are or will s...