It is common practice to compare the computational power of different models of computation. For example, the recursive functions are strictly more powerful than the primitive recursive functions, because the latter are a proper subset of the former (which includes Ackermann’s function). Side-by-side with this “containment” method of measuring power, it is also standard to base comparisons on “...

an adaptive version of growing and pruning rbf neural network has been used to predict the system output and implement linear model-based predictive controller (lmpc) and non-linear model-based predictive controller (nmpc) strategies. a radial-basis neural network with growing and pruning capabilities is introduced to carry out on-line model identification.an unscented kalman filter (ukf) algor...

In this paper, we present a graph model which is powerful in classifying and compiling linear recursive formulas in deductive databases. The graph model consists of two kinds of graphs: I-graph and Resolution Graph. We can extract essential properties of a recursive formula from its I-graph and can easily figure out the compiled formula and the query evaluation plan of the recursive formula fro...

Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable model semantics is Π11-hard. In this paper we prove that a larger class of programs, called finitely recursive programs, preserves most of the good properties...

FIR(Finite Impulse Response) filter is well known to be ideal for the finite time state-space model, but it requires much computation due to its inherent non-recursive structure especially when the measurement interval grows to a large extent. And often a fixed-lag smoother based on the finite time interval is needed to monitor the soundness of the system model and the measurement model, but th...

We deene a formal model for a class of recursive-parallel systems with speciic invocation and synchronization primitives. This original model is innnite-state but can still be analyzed successfully using the \well-structured transition systems" approach.

We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, λY calculus, is equivalent to schemes, we propose the use of a model of λY -calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a ...

In this work, we propose a simple but e‚ective method to interpret black-box machine learning models globally. Œat is, we use a compact binary tree, the interpretation tree, to explicitly represent the most important decision rules that are implicitly contained in the black-box machine learning models. Œis tree is learned from the contribution matrix which consists of the contributions of input...

We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both overand under-approximations of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible...

PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories we define a model of parallel computation with a very high level of abstraction – PARES (Parallel Recursive ...