Abstract: Recently, we proposed a new method for representing and solving decision problems based on the framework of valuation-based systems. The new representation is called a valuation network, and the new solution method is called a fusion algorithm. In this paper, we compare valuation networks to decision trees and influence diagrams. We also compare the fusion algorithm to the backward re...

In order to identify the engine inlet oil film parameters more accurately, the oil film identification equation based on oil film model is built under the consideration of random error which is consisted by model error and measurement error. For the purpose of eliminating the influence of random error to the identification results, Recursive Auxiliary Variable (RAV) is put forward. At the same ...

A recursion relation is formulated for the Green’s function for calculating the effective electron coupling in bridge-assisted electronic transfer systems, within the framework of the tight-binding Hamiltonian. The recursion expression relates the Green’s function of a chain bridge to that of the bridge that is one unit less. It is applicable regardless of the number of orbitals per unit. This ...

This note reexamines Spector’s remarkable computational interpretation of full classical analysis. Spector’s interpretation makes use of a rather abstruse recursion schema, so-called bar recursion, used to interpret the double negation shift DNS. In this note bar recursion is presented as a generalisation of a simpler primitive recursive functional needed for the interpretation of a finite (int...

We give a recursion-theoretic characterization of the complexity classes NC for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computati...

Recursion is a simple but powerful programming technique used extensively in functional languages. For a number of reasons, however, it is often desirable to use structured forms of recursion in programming, encapsulated in so-called recursion operators, in preference to unrestricted recursion. In particular, using recursion operators has proved invaluable for transforming and reasoning about f...

Syntactic recursion is argued to be a key property of natural languages, allowing us to create an infinite number of utterances from a finite number of words and rules. Some have argued that recursion is uniquely human. There are at least two possibilities for the origins of recursion: 1) Recursion is a property of the language faculty. 2) Recursion is an historical accomplishment and is cultur...