We are used Bayes estimators for unknown scale parameter  when shape Parameter  is known of Erlang distribution. Assuming different informative priors for unknown scale  parameter. We derived The posterior density with posterior mean and posterior variance using different informative priors for unknown scale parameter  which are the inverse exponential distribution, the inverse chi-square distribution, the inverse Gamma distribution, and the standard Levy distribution as prior. And we derived Bayes estimators based on the general entropy loss function (GELF) is used the Simulation method to obtain the results. we generated different cases for the parameters of the Erlang model, for different sample sizes. The estimates have been comp

     The stress(Y) – strength(X) model reliability Bayesian estimation which defines life of a component with strength X and stress Y (the component fails if and only if at any time the applied stress is greater than its strength) has been studied, then the reliability; R=P(Y<X), can be considered as a measure of the component performance. In this paper, a Bayesian analysis has been considered for R when the two variables X and Y are independent Weibull random variables with common parameter α in order to study the effect of each of the two different scale parameters β and λ; respectively, using three different [weighted, quadratic and entropy] loss functions under two different prior functions [Gamma and extension of Jeffery

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

 Most statistical research generally relies on the study of the behaviour of different phenomena during specific time periods and the use of the results of these studies in the development of appropriate recommendations and decision-making and for the purpose of statistical inference on the parameters of the statistical distribution of life times in  The technical staff of most of the manufacturers in the research units of these companies deals with censored data, the main objective of the study of survival is the need to provide information that is the basis for decision making and must clarify the problem and then the goals and limitations of this study and that  It may have different possibilities to perform the

    Semantic segmentation is effective in numerous object classification tasks such as autonomous vehicles and scene understanding. With the advent in the deep learning domain, lots of efforts are seen in applying deep learning algorithms for semantic segmentation. Most of the algorithms gain the required accuracy while compromising on their storage and computational requirements. The work showcases the implementation of Convolutional Neural Network (CNN) using Discrete Cosine Transform (DCT), where DCT exhibit exceptional energy compaction properties. The proposed Adaptive Weight Wiener Filter (AWWF) rearranges the DCT coefficients by truncating the high frequency coefficients. AWWF-DCT model reinstate the convolutional l

Lung cancer, similar to other cancer types, results from genetic changes. However, it is considered as more threatening due to the spread of the smoking habit, a major risk factor of the disease. Scientists have been collecting and analyzing the biological data for a long time, in attempts to find methods to predict cancer before it occurs. Analysis of these data requires the use of artificial intelligence algorithms and neural network approaches. In this paper, one of the deep neural networks was used, that is the enhancer Deep Belief Network (DBN), which is constructed from two Restricted Boltzmann Machines (RBM). The visible nodes for the first RBM are 13 nodes and 8 nodes in each hidden layer for the two RBMs. The enhancer DBN was tr

Early detection of brain tumors is critical for enhancing treatment options and extending patient survival. Magnetic resonance imaging (MRI) scanning gives more detailed information, such as greater contrast and clarity than any other scanning method. Manually dividing brain tumors from many MRI images collected in clinical practice for cancer diagnosis is a tough and time-consuming task. Tumors and MRI scans of the brain can be discovered using algorithms and machine learning technologies, making the process easier for doctors because MRI images can appear healthy when the person may have a tumor or be malignant. Recently, deep learning techniques based on deep convolutional neural networks have been used to analyze med

     Hyperglycemia is a complication of diabetes (high blood sugar). This condition causes biochemical alterations in the cells of the body, which may lead to structural and functional problems throughout the body, including the eye. Diabetes retinopathy (DR) is a type of retinal degeneration induced by long-term diabetes that may lead to blindness. propose our deep learning method for the early detection of retinopathy using an efficient net B1 model and using the APTOS 2019 dataset. we used the Gaussian filter as one of the most significant image-processing algorithms. It recognizes edges in the dataset and reduces superfluous noise. We will enlarge the retina picture to 224×224 (the Efficient Net B1 standard) and utilize data aug

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.