In this paper, the decomposition of nD-rotations is studied. Using this decomposition, nD-rotations are classified and properties are underlined. For each class, an algorithm previously presented by the authors to decompose nD-rotation into planar rotations is proposed and a generalized algorithm is presented. Moreover, an alternate algorithm based on the Schur decomposition is investigated. A ...

To solve task decomposition of multi-expert system, agent-based task decomposition model and algorithm based on dependency is introduced. Firstly, AND/OR dependency graph for operation set is presented. Formal description of task decomposition based on With AND/OR dependency graph, is proposed. Secondly, task decomposition algorithm based on operation dependency is analyzed to solve communicati...

In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen decomposition of such matrices is though the singular value decomposition, which is available only if all the weights are nonnegative. Our proposed algorithm ac...

An algorithm is presented that solves the Minimum Dominating Set problem exactly using polynomial space based on dynamic programming for a tree decomposition. A direct application of dynamic programming based on a tree decomposition would result in an exponential space algorithm, but we use zeta transforms to obtain a polynomial space algorithm in exchange for a moderate increase of the time. T...

The minimum α-fat decomposition problem is the problem of decomposing a simple polygon into fewest subpolygons, each with aspect ratio at most α, for a given α > 0. The main result in the paper is a polynomial time algorithm that solves the version of this problem that disallows Steiner points. The algorithm returns an optimal α-fat decomposition, if there is one, and reports failure otherwise....

This paper presents an algorithm based on the wavelet decomposition, for feature extraction from the ECG signal and recognition of four types of Ventricular Arrhythmias. A set of Discrete Wavelet Transform (DWT) coefficients, which contain the maximum information about the arrhythmia, was selected from the wavelet decomposition. The algorithm is applied on the ECG registrations from the MIT-BIH...

A distributed algorithm f o r finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the algorithm either the ears are correctly labeled o r the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messag...

There are some methods to decompose a signal into different components such as: Fourier decomposition and wavelet decomposition. But they have limitations in some aspects. Recently, there is a new signal decomposition algorithm called the Empirical Mode Decomposition (EMD) Algorithm which provides a powerful tool for adaptive multiscale analysis of nonstationary signals. Recent works have demon...

Functional decomposition has recently been adopted for look-up tabel (LUT)-based field-programmable gate array (FPGA) technology mapping with good results. In this paper we propose a novel method to unify functional single-output and multiple-output decomposition. We first address a compatible class encoding algorithm to minimize the number of compatible classes in the image function. After app...

The genetic algorithm which determines the good functional decomposition of multiple-valued logic functions is presented. The algorithm expands the range of searching for a best decomposition, providing the optimal column multiplicity. The possible solutions are evaluated using the gain of decomposition for multiple-valued function.