This document presents a performance comparison between the perdomain path computation method and the Path Computation Element (PCE) Architecture-based Backward Recursive Path Computation (BRPC) procedure. Metrics to capture the significant performance aspects are identified, and detailed simulations are carried out on realistic scenarios. A performance analysis for each of the path computation...

We present an automata-theoretic framework to the veriication of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P. Now P is correct if and only if a program P A , obtained by combining P and A, terminates. We formalize this ide...

Recursive types extend the simply-typed lambda calculus (STLC) with additional expressive power to enable diverging computation and encode recursive data-types (e.g., lists). Two formulations of exist: iso-recursive equi-recursive. The relative advantages iso- equi-recursion are well- studied when it comes their impact on type-inference. However, semantic expressiveness two remains unclear so f...

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 ...

A technique based on fitting splines to the phase derivative curve is presented for the efficient and reliable computation of the two—dimensional complex cepstrum. The technique is an adaptive numerical integration scheme and makes use of several computational strategies within the Tribolet's phase unwrapping algorithm. An application of the complex cepstrum in testing the stability of two—dime...

A top-down page segmentation technique known as the recursive X-Y cut decomposes a document image recursively into a set of rectanguzar blocks. This paper proposes that the recursive X-Y cut be implemented using bounding bozes of connected components of black pixels instead of using image pizels. The advantage is that great improvement can be achieved in computation. In fact, once bounding boxe...

This paper describes the design of type III and type IV linear-phase finite-impulse response (FIR) low-pass digital differentiators according to the maximally flat criterion. We introduce a two-term recursive formula that enables the simple stable computation of the impulse response coefficients. The same recursive formula is valid for both Type III and Type IV solutions.

In this paper we present a form of law of large numbers on Pn, the space of n× n symmetric positive-definite (SPD) matrices equipped with Fisher-Rao metric. Specifically, we propose a recursive algorithm for estimating the Karcher expectation of an arbitrary distribution defined on Pn, and we show that the estimates computed by the recursive algorithm asymptotically converge in probability to t...

This paper treats the problem of implementing efficiently recursive Horn Clauses queries, including those with function symbols. In particular, the situation is studied where the initial bindings of the arguments in the recursive query goal can be used in the top-down (as in backward chaining) execution phase to improve the efficiency and, often, to guarantee the termination, of the forward cha...

The class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the General Purpose Analogue Computer of Claude Shannon; classical digital computation was embedded in several ways...