The marketing of banking service is considered to be one of the impotent fields which showed a universal inebriates . He research showed the comparison between the application of marketing in ideas and application for loot government and private Iraqi bank. The research comets of four parts; Mythology / the concept and the importance of Banking Marketing / Research applichlion/ Conelnion and  recommendation.

The bile salt hydrolase gene (bshA), encoding bile salt hydrolase enzyme (EC 3.5.1.24) from probiotic isolate Lactobacillus acidophilus Ar strain which is responsible for assimilation cholesterol were studied in the present work. About 801 bp in length DNA fragment of Lb. acidophilus Ar strain was amplified by PCR techniques. Two restriction sites (PstI/SacI) were added to each end of that fragment for manipulation of DNA during cloning. Amplified fragment inserted into pJET1.2\blunt end vector and pMG36e vector respectively. pJET1.2\blunt end vector is overexpression plasmid for E. coli MC1022, and pMG36e vector is a shuttle vector which is able to replicate in both E. coli and lactic acid bacteria. The resulted constructs were named as pJ

New metal complexes of the ligand 4-[5-(2-hydoxy-phenyl)-[1,3,4- oxadiazol -2-ylimino methyl]-1,5-dimethyl-2-phenyl-1,2-dihydro-pyrazol-3-one (L) with the metal ions Co(II), Ni(II), Cu(II) and Zn(II) were prepared in alcoholic medium. The Schiff base was synthesized through condensate of [4-antipyrincarboxaldehyde] with[2-amino-5-(2-hydroxy-phenyl-1,3,4- oxadiazol] in alcoholic medium . Two tetradentate Schiff base ligand were used for complexation upon two metal ions of Co2+, Ni2+, Cu2+ and Zn2+ as dineucler formula M2L2.4H2O. The metal complexes were characterized by FTIR Spectroscopy, electronic Spectroscopy, elemental analysis, magnetic susceptidbility measurements, and also the ligand was characterized by 1H-NMR spectra, and m

Increasing demands on producing environmentally friendly products are becoming a driving force for designing highly active catalysts. Thus, surfaces that efficiently catalyse the nitrogen reduction reactions are greatly sought in moderating air-pollutant emissions. This contribution aims to computationally investigate the hydrodenitrogenation (HDN) networks of pyridine over the γ-Mo₂N(111) surface using a density functional theory (DFT) approach. Various adsorption configurations have been considered for the molecularly adsorbed pyridine. Findings indicate that pyridine can be adsorbed via side-on and end-on modes in six geometries in which one adsorption site is revealed to have the lowest adsorption energy (

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E