Necessary and sufficient conditions for the operator equation I AXAX n  * , to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.

The nonhomogeneous higher order linear complex differential equation (HOLCDE) with meromorphic (or entire) functions is considered in this paper. The results are obtained by putting some conditions on the coefficients to prove that the hyper order of any nonzero solution of this equation equals the order of one of its coefficients in case the coefficients are meromorphic functions. In this case, the conditions were put are that the lower order of one of the coefficients dominates the maximum of the convergence exponent of the zeros sequence of it, the lower order of both of the other coefficients and the nonhomogeneous part and that the solution has infinite order. Whiles in case the coefficients are entire functions, any nonzero solutio

Twenty five samples out of sixty wound swabs taken from burn patients were identified as P. aeruginosabacteria by conventional methods. Antibiotics susceptibility tests were performed against thirteen antibiotics. P. aeruginosa samples were treated with 0.5 mg/ml of Safranin O solution then irradiated with 532nm Q-switched Nd:YAG laser at four energy densities (0.324, 0.704, 1.380, and 1.831 J/cm2) for different times of 5, 8 and 11 minutes with 5Hz repetition rate. The viability, susceptibility to antibiotic and production of pyocyanin were determined before and after irradiation. The results showed that the number of CFU/ml of P. aeruginosa decreased with increasing the dose of irradiation. Complete killing of cells was observed at 1.8

The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient b_i is random variable

A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th

A new method presented in this work to detect the existence of hidden

data as a secret message in images. This method must be applyied only on images which have the same visible properties (similar in perspective) where the human eyes cannot detect the difference between them.

This method is based on Image Quality Metrics (Structural Contents

Metric), which means the comparison between the original images and stego images, and determines the size ofthe hidden data. We applied the method to four different images, we detect by this method the hidden data and  find exactly the same size of the hidden data.

There are many images you need to large Khoznah space With the continued evolution of storage technology for computers, there is a need nailed required to reduce Alkhoznip space for pictures and image compression in a good way, the conversion method Alamueja

Let f and g be a self – maps of a rational exterior space . A natural number m is called a minimal coincidence period of maps f and g if f^m and g^m have a coincidence point which is not coincidence by any earlier iterates. This paper presents a complete description of the set of algebraic coincidence periods for self - maps of a rational exterior space which has rank 2 .