Autonomous motion planning is important area of robotics research. This type of planning relieves human operator from tedious job of motion planning. This reduces the possibility of human error and increase efficiency of whole process.

This research presents a new algorithm to plan path for autonomous mobile robot based on image processing techniques by using wireless camera that provides the desired image for the unknown environment . The proposed algorithm is applied on this image to obtain a optimal path for the robot. It is based on the observation and analysis of the obstacles that lying in the straight path between the start and the goal point by detecting these obstacles, analyzing and studying their shapes, positions and

Many fuzzy clustering are based on within-cluster scatter with a compactness measure , but in this paper explaining new fuzzy clustering method which depend on within-cluster scatter with a compactness measure and between-cluster scatter with a separation measure called the fuzzy compactness and separation (FCS). The fuzzy linear discriminant analysis (FLDA) based on within-cluster scatter matrix and between-cluster scatter matrix . Then two fuzzy scattering matrices in the objective function assure the compactness between data elements and cluster centers .To test the optimal number of clusters using validation clustering method is discuss .After that an illustrate example are applied.

The usage of remote sensing techniques in managing and monitoring the environmental areas is increasing due to the improvement of the sensors used in the observation satellites around the earth. Resolution merge process is used to combine high resolution one band image with another one that have low resolution multi bands image to produce one image that is high in both spatial and spectral resolution. In this work different merging methods were tested to evaluate their enhancement capabilities to extract different environmental areas; Principle component analysis (PCA), Brovey, modified (Intensity, Hue ,Saturation) method and High Pass Filter methods were tested and subjected to visual and statistical comparison for evaluation. Both visu

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

The focus of this research lies in the definition of an important aspect of financial development, which is reflected on the alleviation of poverty in Iraq, namely financial inclusion and then taking the path of achieving a sustainable economy, certainly after reviewing one of the important international experiences in this regard and finally measuring the level of financial inclusion in Iraq and its impact on poverty reduction through the absolute poverty line indicator.

Gangyong Lee, S.Tariq Rizvi, and Cosmin S.Roman studied Rickart modules.

The main purpose of this paper is to develop the properties of Rickart modules .

We prove that each injective and prime module is a Rickart module. And we give characterizations of some kind of rings in term of Rickart modules.

     The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 90⁰ to 270⁰ step 90⁰ directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding pro

Let R be a commutative ring with identity and let M be a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of semi-essential submodules which introduced by Ali S. Mijbass and Nada K. Abdullah, and we make simple changes to the definition relate with the zero submodule, so we say that a submodule N of an R-module M is called semi-essential, if whenever N ∩ P = (0), then P = (0) for each prime submodule P of M. Various properties of semi-essential submodules are considered.

The concept of a 2-Absorbing submodule is considered as an essential feature in the field of module theory and has many generalizations. This articale discusses the concept of the Extend Nearly Pseudo Quasi-2-Absorbing submodules and their relationship to the 2-Absorbing submodule, Quasi-2-Absorbing submodule, Nearly-2-Absorbing submodule, Pseudo-2-Absorbing submodule, and the rest of the other concepts previously studied. The relationship between them has been studied, explaining that the opposite is not true and that under certain conditions the opposite becomes true. This article aims to study this concept and gives the most important propositions, characterizations, remarks, examples, lemmas, and observations related to it. In the en