Related papers: The appearance function for paper-folding words
Studying facial expressions is a notoriously difficult endeavor. Recent advances in the field of affective computing have yielded impressive progress in automatically detecting facial expressions from pictures and videos. However, much of…
Motivated by old and new applications, we investigate Datalog as a language for sequence databases. We reconsider classical features of Datalog programs, such as negation, recursion, intermediate predicates, and relations of higher arities.…
A point-shift $F$ maps each point of a point process $\Phi$ to some point of $\Phi$. For all translation invariant point-shifts $F$, the $F$-foliation of $\Phi$ is a partition of the support of $\Phi$ which is the discrete analogue of the…
We present the heavy-to-light form factors with two different non-vanishing masses at next-to-next-to-leading order and study its expansion in the small mass. The leading term of this small-mass expansion leads to a factorized expression…
Users of program analyses expect that results change predictably in response to changes in their programs, but many analyses fail to provide such robustness. This paper introduces a theoretical framework that provides a unified language to…
Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations, where a Cayley permutation is a word of positive integers such that if…
We propose a calculus of string diagrams to reason about satisfiability of Boolean formulas, and prove it to be sound and complete. We then showcase our calculus in a few case studies. First, we consider SAT-solving. Second, we consider…
The present article describes the development of a software which was written in visual basic programming language. The software calculates the particle collection efficiency and penetration of a fibrous filter medium for given values of…
We consider the class $\mathcal{E}_t(Y)$ of Appell polynomials whose generating function is given by means of a real power $t$ of the moment generating function of a certain random variable $Y$. For such polynomials, we obtain explicit…
Natural language processing for programming aims to use NLP techniques to assist programming. It is increasingly prevalent for its effectiveness in improving productivity. Distinct from natural language, a programming language is highly…
For the purposes of tool development, computer languages are usually described using context-free grammars with annotations such as semantic actions or pretty-printing instructions. These descriptions are processed by generators which…
We characterize the inclusions of weighted classes of entire functions in terms of the defining weights resp. weight systems. First we treat weights defined in terms of a so-called associated weight function where the weight(system) is…
We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In…
Grammatical features such as number and gender serve two central functions in human languages. While they encode salient semantic attributes like numerosity and animacy, they also offload sentence processing cost by predictably linking…
Rule sets are often used in Machine Learning (ML) as a way to communicate the model logic in settings where transparency and intelligibility are necessary. Rule sets are typically presented as a text-based list of logical statements…
We prove a factorization theorem for heavy-to-light form factors. Our result differs in several important ways from previous proposals. A proper separation of scales gives hard kernels that are free of endpoint singularities. A general…
Formulaic expressions, such as 'in this paper we propose', are helpful for authors of scholarly papers because they convey communicative functions; in the above, it is showing the aim of this paper'. Thus, resources of formulaic…
We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $(x)_l (y)_m$ for $l,m =1,...,k$. Algebraic and combinatoric properties of these coefficients are…
In this paper, we describe string attractors of all factors of episturmian sequences and show that their size is equal to the number of distinct letters contained in the factor.
We introduce SentEval, a toolkit for evaluating the quality of universal sentence representations. SentEval encompasses a variety of tasks, including binary and multi-class classification, natural language inference and sentence similarity.…