The statistical distributions study aimed to obtain on best descriptions  of variable sets phenomena, which each of them got one behavior of that distributions .  The estimation operations study for that distributions considered of important things which could n't canceled in variable behavior study, as result  this research came as trial for reaching to best method for information distribution estimation which is generalized linear failure rate distribution, throughout studying the theoretical sides by depending on statistical posteriori methods  like greatest ability, minimum squares method and Mixing method (suggested method).        

The research

     The paper shows how to estimate the three parameters of the generalized exponential Rayleigh distribution by utilizing the three estimation methods, namely, the moment employing estimation method (MEM), ordinary least squares estimation method (OLSEM),  and maximum entropy estimation method (MEEM). The simulation technique is used for all these estimation methods to find the parameters for the generalized exponential Rayleigh distribution. In order to find the best method, we use the mean squares error criterion. Finally, in order to extract the experimental results, one of object oriented programming languages visual basic. net was used

Some relations of inclusion and their properties are investigated for functions of type " -valent that involves the generalized operator of Srivastava-Attiya by using the principle of strong differential subordination.

In this paper, simulation studies and applications of the New Weibull-Inverse Lomax (NWIL) distribution were presented. In the simulation studies, different sample sizes ranging from 30, 50, 100, 200, 300, to 500 were considered. Also, 1,000 replications were considered for the experiment. NWIL is a fat tail distribution. Higher moments are not easily derived except with some approximations. However, the estimates have higher precisions with low variances. Finally, the usefulness of the NWIL distribution was illustrated by fitting two data  sets

     By definition, the detection of protein complexes that form protein-protein interaction networks (PPINs) is an NP-hard problem. Evolutionary algorithms (EAs), as global search methods, are proven in the literature to be more successful than greedy methods in detecting protein complexes. However, the design of most of these EA-based approaches relies on the topological information of the proteins in the PPIN. Biological information, as a key resource for molecular profiles, on the other hand, acquired a little interest in the design of the components in these EA-based methods. The main aim of this paper is to redesign two operators in the EA based on the functional domain rather than the graph topological domain. The perturb

            In this paper the definition of fuzzy anti-normed linear spaces and its basic properties are used to prove some properties of a finite dimensional fuzzy anti-normed linear space.    

 The internal administrative spaces of the interior designer formed an obsession for their development and for finding solutions and treatments to advance to enhance the state of adaptation for their employees by providing a healthy, appropriate and sound environment for work and production. . The first chapter focuses on laying theoretical foundations to show what health materials are used in the administrative spaces of the training directorates of the Ministry of Education in Baghdad. The second chapter dealt with the knowledge of health materials, their impact and effectiveness in the interior space, and the variables of their functional characteristics and their work in the interior spaces in a way that enhances the development of

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.

This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.