DBN Rashid, Astra Salvensis, 2018 - Cited by 1

BN Rashid, Nasaq, 2015

          It is well known that the wreath product  is the endmorphism monoid of a free S-act with n-generators. If S is a trivial semigroup then  is isomorphic to . The extension  for  to  where  is an independent algebra has been investigated. In particular, we consider  is to be , where  is a free left S-act of n-generators. The eventual goal of this paper is to show that  is an endomorphism monoid of a free left S-act of n-generators and to prove that  is embedded in the wreath product .

The free Schiff base ligand (HL1) is prepared by being mixed with the co-ligand 1, 10-phenanthroline (L2). The product then is reacted with metal ions: (Cr+3, Fe+3, Co+2, Ni+2, Cu+2 and Cd+2) to get new metal ion complexes. The ligand is prepared and its metal ion complexes are characterized by physic-chemical spectroscopic techniques such as: FT-IR, UV-Vis, spectra, mass spectrometer, molar conductivity, magnetic moment, metal content, chloride content and microanalysis (C.H.N) techniques. The results show the formation of the free Schiff base ligand (HL1). The fragments of the prepared free Schiff base ligand are identified by the mass spectrometer technique. All the analysis of ligand and its metal complexes are in good agreement with th

Liquefied petroleum gas (LPG), Natural gas (NG) and hydrogen were all used to operate spark ignition internal combustion engine Ricardo E6. A comparison of CO emissions emitted from each case, with emissions emitted from engine fueled with gasoline as a fuel is conducted.

The study was accomplished when engine operated at HUCR for gasoline n(8:1), was compared with its operation at HUCR for each fuel. Compression ratio, equivalence ratio and spark timing were studied at constant speed 1500 rpm.

CO concentrations were little at lean ratios; it appeared to be effected a little with equivalence ratio in this side, at rich side its values became higher, and it appeared to be effected by equivalence ratio highly, the results s

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith