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 Internet image retrieval is an interesting task that needs efforts from image processing and relationship structure analysis. In this paper, has been proposed compressed method when you need to send more than a photo via the internet based on image retrieval. First, face detection is implemented based on local binary patterns. The background is notice based on matching global self-similarities and compared it with the rest of the image backgrounds. The propose algorithm are link the gap between the present image indexing technology, developed in the pixel domain, and the fact that an increasing number of images stored on the computer are previously compressed by JPEG at the source. The similar images are found and send a few images inst

     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 study presents the test results of Completely Decomposed Granite (CDG) soil tested under drained triaxial compression, direct shear and simple shear tests. Special attention was focused on the modification of the upper halve of conventional Direct Shear Test (DST) to behave as free
head in movement along with vertical strain control during shear stage by using Geotechnical Digital System (GDS). The results show that Free Direct Shear Test (FDST) has clear effect on the measured shear stress and vertical strain during the test. It has been found that shear strength
parameters measured from FDST were closer to those measured from simple shear and drained triaxial compression test. This study also provides an independent check on

Our aim in this paper is to introduce the notation of nearly primary-2-absorbing submodule as generalization of 2-absorbing submodule where a proper submodule  of an -module  is called nearly primary-2-absorbing submodule if whenever , for , , ,  implies that either  or  or . We got many basic, properties, examples and characterizations of this concept. Furthermore, characterizations of nearly primary-2-absorbing submodules in some classes of modules were inserted. Moreover, the behavior of nearly primary-2-absorbing submodule under -epimorphism was studied.

The ground state proton, neutron and matter densities and
corresponding root mean square radii of unstable proton-rich 17Ne
and 27P exotic nuclei are studied via the framework of the twofrequency
shell model. The single particle harmonic oscillator wave
functions are used in this model with two different oscillator size
parameters core b and halo , b the former for the core (inner) orbits
whereas the latter for the halo (outer) orbits. Shell model calculations
for core nucleons and for outer (halo) nucleons in exotic nuclei are
performed individually via the computer code OXBASH. Halo
structure of 17Ne and 27P nuclei is confirmed. It is found that the
structure of 17Ne and 27P nuclei have 2
5 / 2 (1d ) an

      The concept of semi-essential semimodule has been studied by many researchers.

     In this paper, we will develop these results by setting appropriate conditions, and defining new properties, relating to our concept, for example (fully prime semimodule, fully essential semimodule and semi-complement subsemimodule) such that: if for each subsemimodule of -semimodule  is prime, then  is fully prime. If every semi-essential subsemimodule of -semimodule  is essential then  is fully essential. Finally, a prime subsemimodule  of  is called semi-relative intersection complement (briefly, semi-complement) of subsemimodule  in , if , and whenever  with  is a prime subsemimodule in , , then .  Furthermore, some res