The analysis of survival and reliability considered of topics and methods of vital statistics at the present time because of their importance in the various demographical, medical, industrial and engineering fields. This research focused generate random data for samples from the probability distribution Generalized Gamma: GG, known as: "Inverse Transformation" Method: ITM, which includes the distribution cycle integration function incomplete Gamma integration making it more difficult classical estimation so will be the need to illustration to the method of numerical approximation and then appreciation of the function of survival function. It was estimated survival function by simulation the way "Monte Carlo". The Entropy method used for the

The main object of this paper is to study the representations of monomial groups and characters technique for representations of monomial groups. We refer to monomial groups by M-groups. Moreover we investigate the relation of monomial groups and solvable groups. Many applications have been given the symbol G e.g. group of order 297 is an M-group and solvable. For any group G, the factor group G/G? (G? is the derived subgroup of G) is an M-group in particular if G = Sn, SL(4,R).

Let G be a finite group and X be a conjugacy class of order 3 in G. In this paper, we introduce a new type of graphs, namely A₄-graph of  G, as a simple graph denoted by A₄(G,X) which has X as a vertex set. Two vertices,  x and y, are adjacent if and only if  x≠y and  x y^-1=y x^-1. General properties  of the A₄-graph as well as the structure of A₄(G,X) when G@ ³D₄(2) will be studied.

  In this paper, the concept of normalized duality mapping has introduced in real convex modular spaces. Then, some of its properties have shown which allow dealing with results related to the concept of uniformly smooth convex real modular spaces. For multivalued mappings defined on these spaces, the convergence of a two-step type iterative sequence to a fixed point is proved

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

      Assume that G is a finite group and X is a subset of G. The commuting graph is denoted by С(G,X) and has a set of vertices X with two distinct vertices x, y Î X, being connected together on the condition of xy = yx. In this paper, we investigate the structure of Ϲ(G,X) when G is a particular type of Leech lattice groups, namely Higman–Sims group HS and Janko group J₂, along with  X as a G-conjugacy class of elements of order 3. We will pay particular attention to analyze the discs’ structure and determinate the diameters, girths, and clique number for these graphs.

Presents here in the results of comparison between the theoretical equation stated by Huang and Menq and laboratory model tests used to study the bearing capacity of square footing on geogrid-reinforced loose sand by performing model tests. The effects of several parameters were studied in order to study the general behavior of improving the soil by using the geogrid. These parameters include depth of first layer of reinforcement, vertical spacing of reinforcement layers, number of reinforcement layers and types of reinforcement layers The results show that the theoretical equation can be used to estimate the bearing capacity of loose sand.

Load balancing in computer networks is one of the most subjects that has got researcher's attention in the last decade. Load balancing will lead to reduce processing time and memory usage that are the most two concerns of the network companies in now days, and they are the most two factors that determine if the approach is worthy applicable or not. There are two kinds of load balancing, distributing jobs among other servers before processing starts and stays at that server to the end of the process is called static load balancing, and moving jobs during processing is called dynamic load balancing. In this research, two algorithms are designed and implemented, the History Usage (HU) algorithm that statically balances the load of a Loaded

New metal ion complexes were synthesized with the general formula; K[PtLCl4], [ReLCl4] and K[ML(Cl)2] where M = Pd(II), Cd(II), Zn(II) and Hg(II), from the Azo ligand (HL) [2-Hydroxy-3-((5-mercapto-1,3,4-thiadiazol-2-yl)diazenyl)-1-naphth aldehyde] (HL) the ligand was synthesized from (2-hydroxy-1-naphthaldehyde) and (5-amino-1,3,4-thiadiazole-2-thiol). The ligand and its metal complexes are characterized by phisco- chemical spectroscopic techniques (FT.IR, UV-Vis and Mass spectra, elemental analysis, molar conductivity, Atomic Absorption, Chloride contain and magnetic susceptibility). The spectral data suggest that the (HL) behaves as a bidentate ligand in all complexes. These studies revealed tetrahedral geometries for all metal complexes

In the present paper, we have introduced some new definitions On D- compact topological group and D-L. compact topological group for the compactification in topological spaces and groups, we obtain some results related to D- compact topological group and D-L. compact topological group.