This study aims to find out the effect of the mediator on scaffolding fourth yearstudent- teachers' teaching competencies and their self-efficacy. The present study combines scaffolding and self-efficacy by using a mediator on scaffolding students affects teaching competencies and selfefficacy and from the results of which the existence of student-teachers’ selfawareness was ensured as an effect of the same independent variable. The model affects their teaching competencies and led them to be aware of the needs of their pupils and themselves. 

The study aims to identify the reality of educational services in the municipality of Karrada described in this disclosure about the reality of the distribution of educational services and appropriate that the distribution with the population density in the region, both quantitatively and qualitatively, as are educational services an event practiced by the cities and provided to the population, it has a significant impact on the cultural development of society.

The aim of this paper was to investigate the removal efficiencies of Zn⁺² ions from wastewater by adsorption (using tobacco leaves) and forward osmosis (using cellulose triacetate (CTA) membrane). Various experimental parameters were investigated in adsorption experiment such as: effect of pH (3 - 7), contact time (0  - 220) min, solute concentration (10 - 100) mg/l, and adsorbent dose (0.2 - 5)g. Whereas for forward osmosis the operating parameters studied were: draw solution concentration (10 - 150) g/l, pH of feed solution (4 - 7), feed solution concentration (10 - 100) mg/l. The result showed that the removal efficiency by using adsorption was 70% and the removal efficiency by using forward osmosis was 96.2 %. 

This paper investigate a sensorless speed control of a separately excited dc motor fed from a buck type dc-dc converter. The control system is designed in digital technique by using a two dimension look-up table. The performance of the drive system was evaluated by digital simulation using Simulink toolbox of Matlab.

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi