A large amount of thermal energy is generated from burning hazardous chemical wastes, and the temperature of the flue gases in hazardous waste incinerators reaches up to (1200 °C). The flue gases are cooled to (40°C) and are treated before emission. This thermal energy can be utilized to produce electrical power by designing a system suitable for dangerous flue gases in the future depending on the results of much research about using a proto-type small steam power plant that uses safe fuel to study and develop the electricity generation process with water tube boiler which is manufactured experimentally with theoretical development for some of its parts which are inefficient in experimental work. The studied system gen

The estimation of the stressÙ€ strength reliability of Invers Kumaraswamy distribution will be introduced in this paper based on the maximum likelihood, moment and shrinkage methods. The mean squared error has been used to compare among proposed estimators. Also a Monte Carlo simulation study is conducted to investigate the performance of the proposed methods in this paper.

In this study, a system of nonthermal plasma that was operated under atmospheric pressure and was powered by argon gas was employed. The particular plasma properties are affected by changes in the Ar gas flow ranges from 0.5 to 2.5 l/min, product by stream of the plasma jet that is utilized. By using the aforementioned method generated from AC and DC. After placing Ar gas as the cathode, which represents the negative pole, flows toward the anode, which is represented by a tiny metal plate of Zn measuring 6 × 1 cm2 in size, with a submerged part of 4 cm2 long, with both types of current employed having a high voltage of 13.5 kV and the frequency of AC was 30 kHz, we measured these variable parameters. It has been shown that when argon f

This Book is intended to be textbook studied for undergraduate course in multivariate analysis. This book is designed to be used in semester system. In order to achieve the goals of the book, it is divided into the following chapters (as done in the first edition 2019). Chapter One introduces matrix algebra. Chapter Two devotes to Linear Equation System Solution with quadratic forms, Characteristic roots & vectors. Chapter Three discusses Partitioned Matrices and how to get Inverse, Jacobi and Hessian matrices. Chapter Four deals with Multivariate Normal Distribution (MVN). Chapter Five concern with Joint, Marginal and Conditional Normal Distribution, independency and correlations. While the revised new chapters have been added (as the curr

This Book is intended to be textbook studied for undergraduate course in multivariate analysis. This book is designed to be used in semester system. In order to achieve the goals of the book, it is divided into the following chapters (as done in the first edition 2019). Chapter One introduces matrix algebra. Chapter Two devotes to Linear Equation System Solution with quadratic forms, Characteristic roots & vectors. Chapter Three discusses Partitioned Matrices and how to get Inverse, Jacobi and Hessian matrices. Chapter Four deals with Multivariate Normal Distribution (MVN). Chapter Five concern with Joint, Marginal and Conditional Normal Distribution, independency and correlations. While the revised new chapters have been added (as the curr

This paper deals  with constructing mixed probability distribution  from exponential with scale parameter (β) and also Gamma distribution with (2,β), and the mixed proportions are (  .first of all, the probability density function (p.d.f) and also cumulative distribution function (c.d.f) and also the reliability function are obtained. The parameters of mixed distribution, ( ,β)  are estimated by three different methods, which are  maximum likelihood, and  Moments method,as well proposed method (Differential Least Square Method)(DLSM).The comparison is done using simulation procedure, and all the results are explained in tables.

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

In this work, a joint quadrature for numerical solution of the double integral is presented. This method is based on combining two rules of the same precision level to form a higher level of precision. Numerical results of the present method with a lower level of precision are presented and compared with those performed by the existing high-precision Gauss-Legendre five-point rule in two variables, which has the same functional evaluation. The efficiency of the proposed method is justified with numerical examples. From an application point of view, the determination of the center of gravity is a special consideration for the present scheme. Convergence analysis is demonstrated to validate the current method.

   The main aim of this paper is to use the notion  which was introduced in [1], to offered new classes of separation axioms in ideal spaces. So, we offered new type of notions of convergence in ideal spaces via the set. Relations among several types of separation axioms that offered were explained.

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com