Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architecture is limited by its dependence on syntactic tree. In this paper, we introduce...

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...

a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...

At first sight, recursive saturation may seem an ‘unhappy marriage’ between model theory and recursion theory, as some authors put it. Nevertheless, it turns out to work wonderfully well with models of arithmetic. First and most important of all, since there are only countably many recursive sets, the number of recursive types over any infinite structure M is exactly card(M). So by an elementar...

A noise canceling technique based on a model-based recursive processor is presented. Beginning with a canceling scheme using a reference source, it is shown how to obtain an estimate of the noise, which can then be incorporated in a recursive noise canceler. Once this is done, recursive detection and estimation schemes are developed. The approach is to model the nonstationary noise as an autore...

Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves recursive type equations up to equality, and is shown to validate a subtyping rule for recursive types proposed by Amadio and Cardelli.

In this article, we show how the degree of risk aversion, discounting, and preference for intertemporal substitution for a natural resource manager can be structurally estimated within a recursive utility framework. We focus on the management of a reservoir in California, and test the data for consistency with a recursive utility model specification versus standard time-additive separability. T...

Let f ⊆ {0, 1}×Ξ be a relation and g : {0, 1} → {0, 1, ∗} be a promise function. This work investigates the randomised query complexity of the relation f ◦ g ⊆ {0, 1} × Ξ, which can be viewed as one of the most general cases of composition in the query model (letting g be a relation seems to result in a rather unnatural definition of f ◦ g). We show that for every such f and g, R(f ◦ g) ∈ Ω ( R...