Due to time-varying effects in electro-hydraulic actuator (EHA) system parameters, a selftuning control algorithm using pole placement and recursive identification is presented. A discrete-time model is developed using system identification method to represent the EHA system and residual analysis is used for model validation. A recursive least square (RLS) method with covariance resetting techn...

We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and prove their formula size lower bounds improved from the classical result of Khrapchenko [13]. Moreover, we introduce a notion of unbalanced recursive ternary...

Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper, we explore folds over a form of recursive higher-order function, called hyperfunctions, and show that hyperfunctions allow fold computations to coroutine ac...

We develop a near-concrete interpretation, a program analysis that aims to cut very close to program execution while retaining decidability. Both in name and in spirit, the approach is similar to abstract interpretation, but models heaps with possibly recursive strucure, is path sensitive, and applies in a fully higher-order setting. The main technical contribution is a prune-rerun technique fo...

In this paper we present a recursive formula to find the degree of the determinant of a bivariate polynomial matrix. The proposed algorithm returns the optimal estimation of the degree but has a very large computational cost. The recursive formula can be represented as an assignment problem which is solved with the Hungarian method that has a very small computational cost. The contribution of t...

An Electroencephalography (EEG) inverse solution technique can be seen as a way to add spatial information to extra-cranial measurements. In other words, it is a mathematical/physical way to expand the dimensionality of scalp measurements so as to embed intra-cranial spatial information. This paper presents the new sLORETA-FOCUSS approach estimating the current density distribution in the brain...

In this paper, we present a computer-checked, constructive soundness and completeness result for prototypic recursive type containment with respect to containment of nonwellfounded (finite or infinite) trees. The central role is played by formalisation of substitution of recursive types as a monad, with a traverse function implementing a strategy for potentially infinite recursive unfolding. In...

This paper presents a new method for implementing hierarchical navigation operations in relational database systems as required for applications such as interactive visual explorations over large datasets. A particular class of recursive unions of joins and divisions that operate on hierarchies has been identiied. By using adequate pre-computation (i.e., organizing the hierarchical structure as...

In this paper we discuss the design and implementation of fixed-function, recursive DSP algorithms. We demonstrate by means of a wave digital lattice filter that a sampling frequency of more than 130 MHz can be achieved for a recursive algorithm by using bit-serial arithmetic. The proposed approach leads to very fast recursive algorithms with low power consumption and a minimum requirement of c...

Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which can be parsed top-down with a single lookahead symbol. Unfortunately, many languages such as Java, C++, or C# are not LL(1). Therefore recursive descent parsing cannot be used or the parser has to make its decisions based on semantic information or a multi-symbol lookahead. In this paper we suggest a syst...