In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.

     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

In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.

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

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ? W ? M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of ri