This research aims to demonstrate the knowledge pillars of the product life cycle assessment technique and how to measure the cost according to this technique, and to clarify its role in reducing costs, improving product quality and optimizing the use of available resources, and a set of results has been reached, the most important of which are: The separation of environmental costs through the use of product life cycle assessment technique helps the Management in handling the increase of these costs, reducing the rates of environmental pollution and preserving resources, which contributes to achieving the sustainability of the product, and based on the results obtained, a set of recommendations were presented, the most important of which w

In this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.

      In this Ë‘work, we present theË‘ notion of the Ë‘graph for a KU-semigroup  as theË‘undirected simple graphË‘ with the vertices are the elementsË‘ of  and weË‘Ë‘study the Ë‘graph ofË‘ equivalence classesË‘ofË‘  which is determinedË‘ by theË‘ definition equivalenceË‘ relation ofË‘ these verticesË‘, andË‘ then some related Ë‘properties areË‘ given. Several examples are presented and some theorems are proved. ByË‘ usingË‘ the definitionË‘ ofË‘ isomorphicË‘ graph, Ë‘we showË‘ thatË‘ the graphË‘ of equivalence Ë‘classes Ë‘and the Ë‘graphË‘of Ë‘a KU-semigroup Ë‘  areË‘ theË‘ sameË‘,

                 In this paper, we proved coincidence points theorems for two pairs mappings which are defined on nonempty subset   in metric spaces by using condition (1.1). As application, we established a unique common fixed points theorems for these mappings by using the concept weakly compatible (R-weakly commuting) between these mappings.

A complete metric space is a well-known concept. Kreyszig shows that every non-complete metric space  can be developed into a complete metric space , referred to as completion of .

We use the b-Cauchy sequence to form  which “is the set of all b-Cauchy sequences equivalence classes”. After that, we prove  to be a 2-normed space. Then, we construct an isometric by defining the function from  to ; thus  and  are isometric, where  is the subset of  composed of the equivalence classes that contains constant b-Cauchy sequences. Finally, we prove that  is dense in ,  is complete and the uniqueness of  is up to isometrics

We define L-contraction mapping in the setting of D-metric spaces analogous to L-contraction mappings [1] in complete metric spaces. Also, give a definition for general D- matric spaces.And then prove the existence of fixed point for more general class of mappings in generalized D-metric spaces.

The study focused on the identification of the natural relation between the organizational components, and the most important is the organizational structure, which not hid its effect on each function and operation of the organizational structure through commanding the individual craters and its forms according to the requirement of these function, also it has relation with an organic synthesis that between the dimensions of the organic synthesis and the practice side in the commission of Integrity.

The problem of the research pensioned in some questions about hypothesis and theoretical parts, in which they go a mention about the hypothesis questions is to use all the knowledge's in this atmosphere and th

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f