In this paper, I show that general recursive definitions can be represented in the free monad which supports the ‘effect’ of making a recursive call, without saying how these calls should be executed. Diverse semantics can be given within a total framework by suitable monad morphisms. The Bove-Capretta construction of the domain of a general recursive function can be presented datatype-generica...

Hyperspace graph paper (HSGP) is a technique for visualising surfaces defined over moderate dimensional binary spaces1. The key to this technique is in unfolding the hypercube using recursive steps so that the topology of the high dimensional space is reflected in a recursive structure in the two-dimensional unfolding (see Figure 1). In this paper, we describe the original studies that tested t...

The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have sufferedfrom the rigorous restriction on the number of nodes. Like the other incomplete networks, the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, it is first shown that the structures of the incomplete WK-recursive networks are conveniently represented with m...

We introduce a new class of finite horizon stochastic decision problems in which preferences change over time, and provide a proof of the existence of a recursively optimal strategy. Recursive optimization techniques dominate many areas of economic dynamics. However, in decision problems in which tastes change over time, the solution technique most commonly applied is not recursive, but rather ...

This paper presents a recursive secret sharing technique that distributes k − 1 secrets of length b each into n shares such that each share is effectively of length n k−1 · b and any k pieces suffice for reconstructing all the k − 1 secrets. Since n k−1 is near the optimal factor of n/k, and can be chosen to be close to 1, the proposed technique is space efficient. Furthermore, each share is in...

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

An integrated approach to the design of an automatic control system for canals using a Linear Quadratic Gaussian regulator based on recursive least squares estimation was developed. The one-dimensional partial differential equations describing open channel flow (Saint-Venant) equations are linearized about an average operating condition of the canal. The concept of optimal control theory is app...

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

Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme is effective for non-recursive XML documents, but inefficient for deep recursive XML documents due to the high CPU cost of pruning and merging too many streams for some twig pattern queries involving recursive tags. ...