So far the aspects related to efficient processing have dominated the research on recursive queries. In this paper we consider how the formulation of recursive queries can be made easier from the view point of the non-professional user also in the context of complex recursive queries. It is obvious that the conventional rule-based way of defining is too hard and cumbersome for many non-professi...

Karatsuba’s multiplication algorithm uses three singledigit multiplications to perform one two-digit multiplication. If we apply Karatsuba’s multiplier recursively, it takes only 3 single-digit multiplications to multiply a pair of 2-digit numbers. This is a significant improvement compared to 4 single-digit multiplications using grade-school multiplier. In this paper, we will use tensor produc...

A general class of recursive residuals is incorporated in the formulation of suitable (aligned) rank tests for change-points pertaining to some simple linear models. The asymptotic theory of the proposed tests rests on some invariance principles for recursively aligned signed rand statistics, and these are developed. Along with the asymptotic properties of the proposed tests, allied efficiency ...

In this paper, two new methods for computation of the inertia matrix of robot manipulators are proposed. The new algorithms are based on a block diagram of manipulator dynamics, derived from the Newton-Euler formulation. The proposed methods allows to compute the inertia matrix explicitly, in an efficient recursive manner, and can be applied for robot dynamics simulation.

This paper presents a graph-theoretic approach to the identification of yetunknown word translations. The proposed algorithm is based on the recursive SimRank algorithm and relies on the intuition that two words are similar if they establish similar grammatical relationships with similar other words. We also present a formulation of SimRank in matrix form and extensions for edge weights, edge l...

In this paper, we generalize a formulation for converting a length-2'' discrete cosine transform into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are2n-i 2n-2 , . . . 2' respectively, while their structures are extremely regular. The realization can then be converted into recursive filter form, which is of particularly simple for practical...

We describe a recursive formulation of discounted costs for a linear quadratic exponential Gaussian linear regulator problem which implies time-invariant linear decision rules in the innnite horizon case. Time invariance in the discounted case is attained by surrendering state-separability of the risk-adjusted costs.

In this paper, we propose a hybrid symmetrical condensed node TLM approach for the simulation of optical media under femtosecond regime. The formulation is based on the piecewise linear recursive convolution (PLRC) technique, voltage sources and the introduction of the variable admittance concept. Optical solitons with Kerr and Raman nonlinearities are simulated using this novel approach.

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

In this study, we derive sensitivity equations for the problem of optimization-based motion prediction of a mechanical system using the inverse recursive Lagrangian formulation. The simulation and sensitivity formulations are based on Denavit–Hartenberg transformation matrices. External forces and moments are taken into account in the formulation. The sensitivity information is needed in the op...