This paper presents an algorithm to find out the path of an object which is moving in different frames. These objects are coming from different background. To detect a moving object from different frames correlation is useful but correlation process consumes huge time. So to reduce searching time here selective correlation is used. The proposed algorithm can significantly speed up the computati...

Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management. In the stateof-the-art designs, the memories are implemented with registers and a large crossbar is u...

in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated para...

An investigation of group covariant quantum error correction indicates that the Eastin-Knill theorem, a stumbling block on path to fault-tolerant computation, may be circumvented by using continuous variables.

We have previously reported our attempts to produce microbubble aggregations, by making use of Bjerknes force, which acts to propel microbubbles and to adjust the size of aggregations. However, because we have used simple shape of artificial blood vessels, the behavior of aggregations in a capillary, e.g., probability to obstruct in bloodstream, possibility of embolization, has not been predict...

This paper presents implementation of a soft decision Viterbi decoder suitable for convolution codes with short constraint lengths. The decoder is based on a property of Viterbi algorithm that states “if the survivor paths from all possible states at time n are traced back then with high probability all the paths merge at time n-L where L is the survivor path length”. Pipeline structures are in...

In a traditional block I/O path, the operating system completes virtually all I/Os asynchronously via interrupts. However, performing storage I/O with ultra-low latency devices using next-generation non-volatile memory, it can be shown that polling for the completion – hence wasting clock cycles during the I/O – delivers higher performance than traditional interrupt-driven I/O. This paper thus ...

A fitness landscape is a mapping from the space of genetic sequences, which is modeled here as a binary hypercube of dimension L, to the real numbers. We consider random models of fitness landscapes, where fitness values are assigned according to some probabilistic rule, and study the statistical properties of pathways to the global fitness maximum along which fitness increases monotonically. S...