The study included the collection of samples of raw cow milk to isolate Leuconostoc bacteria, samples were sub cultured on De-Man Rogosa Sharpe-Vancomycin medium, the pure colonies were selected and subjected to the cultural and microscopically tests, according to that 25 cocci bacterial isolates were obtained, then isolates were subjected to biochemical tests. Result of tests showed that 12 isolates belong to the genus Leuconostoc out of 25 cocci bacterial isolates, Vitek2 system was used as a supplementary step. Results of final identification showed that 3 sub species were obtained included Leuconostoc mesenteroides ssp. cremoris 9 out of 12 isolates, while it was 2 isolates of Leuconostoc mesenteroides ssp. mesenteroides and one isol

 Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)

In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.

In cognitive radio system, the spectrum sensing has a major challenge in needing a sensing method, which has a high detection capability with reduced complexity. In this paper, a low-cost hybrid spectrum sensing method with an optimized detection performance based on energy and cyclostationary detectors is proposed. The method is designed such that at high signal-to-noise ratio SNR values, energy detector is used alone to perform the detection. At low SNR values, cyclostationary detector with reduced complexity may be employed to support the accurate detection. The complexity reduction is done in two ways: through reducing the number of sensing samples used in the autocorrelation process in the time domain and through using the Slid

This paper discusses the limitation of both Sequence Covering Array (SCA) and Covering Array (CA) for testing reactive system when the order of parameter-values is sensitive. In doing so, this paper proposes a new model to take the sequence values into consideration. Accordingly, by superimposing the CA onto SCA yields another type of combinatorial test suite termed Multi-Valued Sequence Covering Array (MVSCA) in a more generalized form. This superimposing is a challenging process due to NP-Hardness for both SCA and CA. Motivated by such a challenge, this paper presents the MVSCA with a working illustrative example to show the similarities and differences among combinatorial testing methods. Consequently, the MVSCA is a