In this paper, some estimators of the unknown shape parameter and reliability function  of Basic Gompertz distribution (BGD) have been obtained, such as MLE, UMVUE, and MINMSE, in addition to estimating Bayesian estimators under Scale invariant squared error loss function assuming informative prior represented by Gamma distribution and non-informative prior by using Jefferys prior. Using Monte Carlo simulation method, these estimators of the shape parameter and R(t), have been compared based on mean squared errors and integrated mean squared, respectively

Breast cancer was one of the most common reasons for death among the women in the world. Limited awareness of the seriousness of this disease, shortage number of specialists in hospitals and waiting the diagnostic for a long period time that might increase the probability of expansion the injury cases. Consequently, various machine learning techniques have been formulated to decrease the time taken of decision making for diagnoses the breast cancer and that might minimize the mortality rate. The proposed system consists of two phases. Firstly, data pre-processing (data cleaning, selection) of the data mining are used in the breast cancer dataset taken from the University of California, Irvine machine learning repository in this stage we

Android operating system, since its first start, is growing very fast and takes a large space in smart devices market. It is built and developed on Linux and designed basically for touch screen devices such as, mobiles, tablets, etc. Mobile devices are markedly complicated and feature-rich; therefore they are prone to reliability of software and performance problems. Because of the small resources, smart devices, such as CPU, RAM, suffer from problems. One of these problems is Software Aging (SA). SA is recognized in long running OSs as a shortage in resources, performance retreating, and finally failure. SA is looked at from two sides, namely the poor response time of application which represents the end user side and the shortage in me

The effect of short range correlations on the inelastic longitudinal
Coulomb form factors for different states of J   4 , T  1with
excitation energies 3.553,7.114, 8.960 and 10.310 MeV in 18O is
analyzed. This effect (which depends on the correlation parameter )
is inserted into the ground state charge density distribution through
the Jastrow type correlation function. The single particle harmonic
oscillator wave function is used with an oscillator size parameter b.
The parameters  and b are considered as free parameters, adjusted
for each excited state separately so as to reproduce the experimental
root mean square charge radius of 18O. The model space of 18O does
not contribute to the tra

Performance of gas-solid spouted bed benefit from solids uniformity structure (UI).Therefore, the focus of this work is to maximize UI across the bed based on process variables. Hence, UI is to be considered as the objective of the optimization process .Three selected process variables are affecting the objective function. These decision variables are: gas velocity, particle density and particle diameter. Steady-state solids concentration measurements were carried out in a narrow 3-inch cylindrical spouted bed made of Plexiglas that used 60° conical shape base. Radial concentration of particles (glass and steel beads) at various bed heights and different flow patterns were measured using sophisticated optical probes. Stochastic Genetic

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

In the current research work, a method to reduce the color levels of the pixels within digital images was proposed. The recent strategy was based on self organization map neural network method (SOM). The efficiency of recent method was compared with the well known logarithmic methods like Floyd-Steinberg (Halftone) dithering and Octtrees (Quadtrees) methods. Experimental results have shown that by adjusting the sampling factor can produce higher-quality images with no much longer run times, or some better quality with shorter running times than existing methods. This observation refutes the repeated neural networks is necessarily slow but have best results. The generated quantization map can be exploited for color image compression, clas

     Dropping packets with a linear function between two configured queue thresholds in Random Early Detection (RED) model is incapable of yielding satisfactory network performance. In this article, a new enhanced and effective active queue management algorithm, termed Double Function RED (DFRED in short) is developed to further curtail network delay. Specifically, DFRED algorithm amends the packet dropping probability approach of RED by dividing it into two sub-segments. The first and second partitions utilizes and implements a quadratic and linear increase respectively in the packet dropping probability computation to distinguish between two traffic loads: low and high. The ns-3 simulation performance evaluations clearly indicate t

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

The Internet is the hallmark of the age of technology and this technology is complemented by the presence of software which is one of the basic components of the operation of the network and it is used in almost all daily life aspects such as industry, commerce and others. Because the digital documents and objects can be easily replicated and distributed at an economically low cost and as the software is a type of digital object, the problem of software watermarking risen as related to how to protect data from piracy. Therefore, various techniques have been developed to protect codes from misusing and unauthorized alteration. Each of them is known as watermarking technology that protects data by inserting secret information into software