In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net RDN(B) for k > 0 has (2no)/2 nodes and d0 + k links per node, where n0 and d0 are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of ...

This paper presents a new characterization of provably recursive functions of first-order arithmetic. We consider functions defined by sets of equations. The equations can be arbitrary, not necessarily defining primitive recursive, or even total, functions. The main result states that a function is provably recursive iff its totality is provable (using natural deduction) from the defining set o...

Optimal as well as recursive parameter estimation for semimartingales had been studied in Thavaneswaran and Thompson [1, 2]. Recently, there has been a growing interest in modeling volatility of the observed process by nonlinear stochastic processes (Taylor [3]). In this paper, we study the recursive estimates for various classes of discretely sampled continuous time stochastic volatility model...

To obtain a robust version of exponential and Holt-Winters smoothing the idea of M -estimation can be used. The difficulty is the formulation of an easy-to-use recursive formula for its computation. A first attempt was made by Cipra (Robust exponential smoothing, J. Forecast. 11 (1992), 57–69). The recursive formulation presented there, however, is unstable. In this paper, a new recursive compu...

To build the systems that can adapt to their environments and learn from their experience is a long-standing goal and today it attracts researchers from many fields. But the power of evolutionary information processing that allows biological complex systems to adapt is still out of reach. With its extraordinary evolvable capabilities to adapt in rapidly changing and extremely hostile environmen...

The analysis of discrete event systems under partial observation is an important topic, with major applications such as the detection of information flow and the diagnosis of faulty behaviors. We consider recursive tile systems, which are infinite systems generated by a finite collection of finite tiles, a simplified variant of deterministic graph grammars. Recursive tile systems are expressive...

The initial-algebra approach to modelling datatypes consists of giving constructors for building larger objects of that type from smaller ones, and laws identifying di erent ways of constructing the same object. The recursive decomposition of objects of the datatype leads directly to a recursive pattern of computation on those objects, which is very helpful for both functional and parallel prog...

The discrete cosine transform (DCT) and the discrete sine transform (DST) have found wide applications in speech and image processing, as well as telecommunication signal processing for the purpose of data compression, feature extraction, image reconstruction, and ltering. In this paper, we present new recursive algorithms for the DCT and the DST. The proposed method is based on certain recursi...

The purpose of this paper is to present a general method to compute recursively the probability mass function of the discrete stable, discrete Linnik and discrete Mittag-Le­ er distribution. The recursive computation method is based on the representation of these distributions as compound distributions and on the Panjer algorithm (see Panjer (1981), Klugman et al. (1998) or Rolski et al. (1999)...