The substantial key to initiate an explicit statistical formula for a physically specified continua is to consider a derivative expression, in order to identify the definitive configuration of the continua itself. Moreover, this statistical formula is to reflect the whole distribution of the formula of which the considered continua is the most likely to be dependent. However, a somewhat mathematically and physically tedious path to arrive at the required statistical formula is needed. The procedure in the present research is to establish, modify, and implement an optimized amalgamation between Airy stress function for elastically-deformed media and the multi-canonical joint probability density functions for multivariate distribution complet

   The most likely fusion reaction to be practical is Deuterium and Helium-3 (𝐷−𝐻𝑒
 3 ), which is highly desirable because both Helium -3 and Deuterium are stable and the reaction produces a 14 𝑀𝑒𝑉 proton instead of a neutron and the proton can be shielded by magnetic fields. The strongly dependency of the basically hot plasma parameters such as reactivity, reaction rate, and energy for the emitted protons, upon the total cross section, make the problems for choosing the desirable formula for the cross section, the main goal for our present work.

The interests toward developing accurate automatic face emotion recognition methodologies are growing vastly, and it is still one of an ever growing research field in the region of computer vision, artificial intelligent and automation. However, there is a challenge to build an automated system which equals human ability to recognize facial emotion because of the lack of an effective facial feature descriptor and the difficulty of choosing proper classification method. In this paper, a geometric based feature vector has been proposed. For the classification purpose, three different types of classification methods are tested: statistical, artificial neural network (NN) and Support Vector Machine (SVM). A modified K-Means clustering algorithm

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.

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

   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

This research investigates solid waste management in Al-Kut City. It included the collection of medical and general solid waste generated in five hospitals different in their specialization and capacity through one week, starting from 03/02/2012. Samples were  collected and analyzed periodically to find their generation rate, composition, and physical properties. Analysis results indicated that generation rate ranged between (1102 – 212) kg / bed / day, moisture content and density were (19.0 % - 197 kg/ m3) respectively for medical waste and (41%-255 kg/ m3) respectively for general waste. Theoretically, medical solid waste generated in Al-Kut City (like any other city), affected by capacity, number of patients in a day, and hosp