The aim of this research is to study the effect of welded joint design (Butt joint and lap joint) on thejoint strength during tension and fatigue loading with different current of welding (40,50,60,70,80) ^per, and different type of wire welding. The result of this research is showed that the effect of fatigue loading on the type of joint is more than the effect of tension loading on it. And the butt joint welding is better than the lap joint welding during the fatigue loaded.The experimental results of the effect of W'elding current showed that more increasing and more decreasing the value of the heat input, during the welding was found to produce mechanical brittleness on the buttjoint welding during the static and dynamic loading. Also i

The aim of this paper is to present a weak form of -light functions by using -open set which is -light function, and to offer new concepts of disconnected spaces and totally disconnected spaces. The relation between them have been studied. Also, a new form of -totally disconnected and inversely -totally disconnected function have been defined, some examples and facts was submitted.

Abstract

The research aims to determine the role of the efficiency of Human Resources Information System in the effectiveness of Employees Performance Appraisal System in the Ministry of Higher Education and Scientific Research / Center for the ministry, it was touching the researchers need the ministry to devise methods that employ outputs Human Resources Information System in the organization surveyed for the development of methods and levels of process evaluate the performance of its employees, in order to identify the extent of the role played by human resources information system in the process of assessing the performance of employees, we raised the question of the President as follows:

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the