No abstract

No abstract

No abstract

No abstract

No abstract

This paper presents a general theoretical framework of spline adaptive filtering based on a normalized version of orthogonal gradient adaptive algorithm. A nonlinear spline adaptive filter normally consists of a linear combination with a memory-less function and a spline function for adaptive approach. We explain how the adaptive linear filter and spline control points are derived in a straightforward iterative gradient-based method. In order to improve the convergence characteristics, the normalized version of orthogonal gradient adaptive algorithm is introduced by the orthogonal projection along with the gradient adaptive algorithm. In addition, a simple form of adaptation algorithm is introduced how to obtain a lower bound on the excess mean square error (MSE) in a theoretical basis. Convergence and stability analysis based on the MSE criterion are proven in terms of the excess MSE. Simulation results reveal that the proposed algorithm achieves more robustness compared with the conventional spline adaptive filtering algorithm.

No abstract

This paper presents a heuristic approach for workflow scheduling in heterogeneous distributed embedded system (HDES). A genetic algorithm (GA) and ant colony optimization (ACO) modified with the greedy algorithm introduced to the system contains multiple heterogeneous embedded machines (HEMs) working as a cluster. Users can remotely access and utilize their computational power. The communications on different types of buses are taken into account to find an optimal solution. New meta-heuristic information based on forwarding dependency is proposed to build probability for ACO to generate task priorities. Besides, a greedy algorithm for machine allocation is incorporated to complete task scheduling. Experiments based on random task graphs running in the HEM cluster demonstrate the effectiveness of the modified greedy ant colony optimization algorithm which outperforms the others by 33% more result quality.