The basic concept of diversity; where two or more inputs at the receiver are used to get uncorrelated signals. The aim of this paper is an attempt to compare some possible combinations of diversity reception and MLSE detection techniques. Various diversity combining techniques can be distinguished: Equal Gain Combining (EGC), Maximal Ratio Combining (MRC), Selection Combining and Selection Switching Combining (SS).The simulation results shows that the MRC give better performance than the other types of combining (about 1 dB compare with EGC and 2.5~3 dB compare with selection and selection switching combining).

Features is the description of the image contents which could be corner, blob or edge. Corners are one of the most important feature to describe image, therefore there are many algorithms to detect corners such as Harris, FAST, SUSAN, etc. Harris is a method for corner detection and it is an efficient and accurate feature detection method. Harris corner detection is rotation invariant but it isn’t scale invariant. This paper presents an efficient harris corner detector invariant to scale, this improvement done by using gaussian function with different scales. The experimental results illustrate that it is very useful to use Gaussian linear equation to deal with harris weakness.

Abstract:

One of the important things provided by fuzzy model is to identify the membership functions. In the fuzzy reliability applications with failure functions of the kind who cares that deals with positive variables .There are many types of membership functions studied by many researchers, including triangular membership function, trapezoidal membership function and bell-shaped membership function. In I research we used beta function. Based on this paper study classical method to obtain estimation fuzzy reliability function for both series and parallel systems.

In this review of literature, the light will be concentrated on the local drugs delivery systems for treating the periodontal diseases. Principles, types, advantages and indications of each type will be discussed in this paper.

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc