A low bit rate still image compression scheme by compressing the indices of Vector Quantization (VQ) and generating residual codebook is proposed. The indices of VQ are compressed by exploiting correlation among image blocks, which reduces the bit per index. A residual codebook similar to VQ codebook is generated that represents the distortion produced in VQ. Using this residual codebook the di...

Monte Carlo simulation methods apply a random sampling and modifications can be made of this method is by using variance reduction techniques (VRT). VRT objective is to reduce the variance due to Monte Carlo methods become more accurate with a variance approaching zero and the number of samples approaches infinity, which is not practical in the real situation (Chen, 2004). These techniques are ...

Ant-based clustering due to its flexibility, stigmergic and selforganization has been applied in variety areas from problems arising in commerce, to circuit design, and to text-mining, etc. A modified clustering method with fuzzy ants has been presented in this paper. Firstly, fuzzy ants and its behavior are defined; secondly, the new clustering algorithm has been constructed based on fuzzy ant...

Conjugate gradient methods are probably the most famous iterative methods for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. In this paper, we propose a new conjugate gradient method which is based on the MBFGS secant condition by modifying Perry’s method. Our proposed met...

The Group Method as identified in IS-41 standard was modified in this study to be dual group system to identify the optimal group size and to cope with the location tracking problem of the wireless system. The Group Method can effectively reduce the loading of the network caused by tracking mobile users in a mobile cellular system because it joins several cells to form a group. Instead of perfo...

In this paper we proposed a modified Lagrangian functional for obstacle problem, investigated its properties. Then we construct Uzawa method for finding a saddle point, proved the convergence theorems. Some numerical examples are provided.