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

     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.

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 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

One-third of the total waste generated in the world is construction and demolition waste. Reducing the life cycle of building materials includes increasing their recycling and reuse by using recycled aggregates. By preventing, the need to open new aggregate quarries and reducing the amount of construction waste dumped into landfills, the use of recycled concrete aggregate in drum compacted concrete protects the environment. Four samples of PRCC were prepared for testing (compressive strength, tensile strength, flexural strength, density, water absorption, porosity) as the reference mix and (10, 15, and 20%) of fine recycled concrete aggregate as a partial replacement for fine natural aggregate by volume. The mix is designed according to

The reaction of 2-amino-benzothiazole with bis [O,O-2,3,O,O – 5,6 – (chloro(carboxylic) methiylidene) ] – L – ascorbic acid (L-AsCl2) gave new product 3-(Benzo[d]Thaizole-2-Yl) – 9-Oxo-6,7,7a,9-Tertrahydro-2H-2,10:4,7-Diepoxyfuro [3,2-f][1,5,3] Dioxazonine – 2,4 (3H) – Dicarboxylic Acid, Hydro-chloride (L-as-am)), which has been insulated and identified by (C, H, N) elemental microanalysis (Ft-IR),(U.v–vis), mass spectroscopy and H-NMR techniques. The (L-as am) ligand complexes were obtained by the reaction of (L-as-am) with [M(II) = Co,Ni,Cu, and Zn] metal ions. The synthesized complexes are characterized by Uv–Visible (Ft –IR), mass spectroscopy molar ratio, molar conductivity, and Magnetic susceptibility techniques. (

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

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with