Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which can be parsed top-down with a single lookahead symbol. Unfortunately, many languages such as Java, C++, or C# are not LL(1). Therefore recursive descent parsing cannot be used or the parser has to make its decisions based on semantic information or a multi-symbol lookahead. In this paper we suggest a syst...

Current business trends, policy markets, production requirements, etc., have created the need for integrating pre-existing Multi Agent Systems (MAS). In the agent-specialized literature, we have found very little work about agent architectures and methodologies that allow us to carry out recursive and dynamic analysis, design, and implementation of MASs. Several difficult challenges for automat...

K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement, instead of the widely adopted recursive bisection paradigm. Our arguments are based on the fact that recursive-bisection-based partitioning algorithms...

Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...

Generalized Probabilistic Logic (GPL) is a temporal logic, based on the modal mu-calculus, for specifying properties of reactive probabilistic systems. GPL is expressive enough that termination of Recursive Markov Chains (RMCs) can be cast as a model checking problem over GPL. In this paper, we explore XPL, an extension to GPL for expressing properties of transition systems with probabilistic a...

Recursive neural models have achieved promising results in many natural language processing tasks. The main difference among these models lies in the composition function, i.e., how to obtain the vector representation for a phrase or sentence using the representations of words it contains. This paper introduces a novel Adaptive Multi-Compositionality (AdaMC) layer to recursive neural models. Th...

Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real valued quantities representing the costs of transitions with respect to various resources. We introduce Recursive Weighted Logic (RWL) being a multi-modal logic that expresses not only qualitative, but also quantitative properties of LWSs by using first-order variables that measure local costs, sim...

This paper is devoted to the mathematical analysis of a general recursive linearization algorithm for solving inverse medium problems with multi-frequency measurements. Under some reasonable assumptions, it is shown that the algorithm is convergent with error estimates. The work is motivated by our effort to analyze recent significant numerical results for solving inverse medium problems. Based...

Cheeger cut has recently been shown to provide excellent classification results for two classes. Whereas the classical Cheeger cut favors a 50-50 partition of the graph, we present here an asymmetric variant of the Cheeger cut which favors, for example, a 10-90 partition. This asymmetric Cheeger cut provides a powerful tool for unsupervised multi-class partitioning. We use it in recursive bipar...

Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which can be parsed top-down with a single lookahead symbol. Unfortunately, many languages such as Java, C++, or C# are not LL(1). Therefore recursive descent parsing cannot be used or the parser has to make its decisions based on semantic information or a multi-symbol lookahead. In this paper we suggest a syst...