The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic

Empirical equations for estimating thickening time and compressive strength of bentonitic - class "G" cement slurries were derived as a function of water to cement ratio and apparent viscosity (for any ratios). How the presence of such an equations easily extract the thickening time and compressive strength values of the oil field saves time without reference to the untreated control laboratory tests such as pressurized consistometer for thickening time test and Hydraulic Cement Mortars including water bath ( 24 hours ) for compressive strength test those may have more than one day.

It is considered as one of the statistical methods used to describe and estimate the relationship between randomness (Y) and explanatory variables (X). The second is the homogeneity of the variance, in which the dependent variable is a binary response takes two values  (One when a specific event occurred and zero when that event did not happen) such as (injured and uninjured, married and unmarried) and that a large number of explanatory variables led to the emergence of the problem of linear multiplicity that makes the estimates inaccurate, and the method of greatest possibility and the method of declination of the letter was used in estimating A double-response logistic regression model by adopting the Jackna

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.

PMMA/TiO2 homogeneous thin films were deposited by using plasma jet system under normal atmospheric pressure and room temperature. PMMA/TiO2 nanocomposite thin film synthesized by plasma polymerization. Titanium oxide was mixed with Methyl Methacrylate Monomer (MMA) with specific weight ratios (1, 3 and 5 grams of TiO2 per 100 ml of MMA). Optical properties of PMMA/TiO2 nanocomposite thin films were characterized by UV-Visible absorption spectra using a double beam UV-Vis-NIR Spectrophotometer. The thin films surface morphological analysis is carried out by employing SEM. The structure analysis are achieved by X-ray diffraction. UV-Visible absorption spectra shows that the increasing the concentration of titanium oxide added to the polym

The digital camera which contain light unit inside it is useful with low illumination but not for high. For different intensity; the quality of the image will not stay good but it will have dark or low intensity so we can not change the contrast and the intensity in order to increase the losses information in the bright and the dark regions. . In this search we study the regular illumination on the images using the tungsten light by changing the intensities. The result appears that the tungsten light gives nearly far intensity for the three color bands(RGB) and the illuminated band(L).the result depend on the statistical properties which represented by the voltage ,power and intensities and the effect of this parameter on the digital

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).