a r t i c l e i n f o a b s t r a c t Due to their finite size and wetting properties, particles deform an interface locally, which can lead to capillary interactions that dramatically alter the behavior of the system, relative to the particle-free case. Many existing multi-component solvers suffer from spurious currents and the inability to employ components with sufficiently large density dif...

This paper presents an algorithm of particle swarm optimization with reduction for global optimization problems. Particle swarm optimization is an algorithm which refers to the collective motion such as birds or fishes, and a multi-point search algorithm which finds a best solution using multiple particles. Particle swarm optimization is so flexible that it can adapt to a number of optimization...

MRI is one of the most powerful techniques to study the internal structure of the body. MRI image quality is affected by various noises. Noises in MRI are usually thermal and mainly due to the motion of charged particles in the coil. Noise in MRI images also cause a limitation in the study of visual images as well as computer analysis of the images. In this paper, first, it is proved that proba...

There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...

Movement of sand particles in nature creates many problems for humans. One of these problems is deposition of particles on rails that decrease the speed of the train or in some cases hampers the reversal of the train rails. In this paper the motion of sand particles over a railway track embankment, and how these particles settle on railway tracks are investigated. Moreover,the performance of di...

Self-structuring patterns can be observed all over the universe, from galaxies to molecules to living matter, yet their emergence is waiting for full understanding. We discovered a simple motion law for moving and interacting self-propelled particles leading to a self-structuring, self-reproducing and self-sustaining life-like system. The patterns emerging within this system resemble patterns f...

The k-goal problem is a generalization of the Shortest Path Problem (SPP) in which the task is to solve k SPP problems, such that all the problems share the same start vertex. kGP was introduced to the heuristic search community for building an Incremental Roadmap Spanner technique (Dobson and Bekris 2014), which is a useful construct in motion plannin for robotics. But kGP has many other appli...

Motion estimation is currently the most computationally intensive portion of the H.264 encoding process. Previous attempts to parallelize this algorithm in CUDA 1 showed sizable speedups but sacrificed quality by ignoring the motion vector prediction (MVp). We demonstrate the viability of a hierarchical (pyramid) motion estimation algorithm in CUDA. This solution addresses the MVp problem while...

With appropriate geometry configurations, bistatic Synthetic Aperture Radar (SAR) can break through the limitations of monostatic SAR on forward-looking imaging. Thanks to such a capability, bistatic forward-looking SAR (BFSAR) has extensive potential applications. For the focusing problem of BFSAR, wavenumber-domain algorithm is accepted as the ideal solution. However, in practical application...