In the last years, the research of extraction the movable object from video sequence in application of computer vision become wide spread and well-known . in this paper the extraction of background model by using parallel computing is done by two steps : the first one using non-linear buffer to extraction frame from video sequence depending on the number of frame whether it is even or odd . the goal of this step is obtaining initial background when over half of training sequence contains foreground object . in the second step , The execution time of the traditional K-mean has been improved to obtain initial background through perform the k-mean by using parallel computing where the time has been minimized to 50% of the conventional time

this paper give a proof of known conditions for the existence of peridic conincidence points of continuius maps using lindemann theotem on transcendental numbers

In this paper, a new analytical method is introduced to find the general solution of linear partial differential equations. In this method, each Laplace transform (LT) and Sumudu transform (ST) is used independently along with canonical coordinates. The strength of this method is that it is easy to implement and does not require initial conditions.

The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme

Medium Access Control (MAC) spoofing attacks relate to an attacker altering the manufacturer assigned MAC address to any other value. MAC spoofing attacks in Wireless Fidelity (WiFi) network are simple because of the ease of access to the tools of the MAC fraud on the Internet like MAC Makeup, and in addition to that the MAC address can be changed manually without software. MAC spoofing attacks are considered one of the most intensive attacks in the WiFi network; as result for that, many MAC spoofing detection systems were built, each of which comes with its strength and weak points. This paper logically identifies and recognizes the weak points
and masquerading paths that penetrate the up-to-date existing detection systems. Then the

The data compression is a very important process in order to reduce the size of a large data to be stored or transported, parametric curves such that Bezier curve is a suitable method to return gradual change and mutability of this data. Ridghelet transform solve the problems in the wavelet transform and it can compress the image well but when it uses with Bezier curve, the equality of compressed image become very well. In this paper, a new compression method is proposed by using Bezier curve with Ridgelet transform on RGB images. The results showed that the proposed method present good performance in both subjective and objective experiments. When the PSNR values equal to (34.2365, 33.4323 and 33.0987), they were increased in the propos

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove