Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

This paper shews how to estimate the parameter of generalized exponential Rayleigh (GER) distribution by three estimation methods. The first one is maximum likelihood estimator method the second one is moment employing estimation method (MEM), the third one is rank set sampling estimator method (RSSEM)The simulation technique is used for all these estimation methods to find the parameters for generalized exponential Rayleigh distribution. Finally using the mean squares error criterion to compare between these estimation methods to find which of these methods are best to the others

Receive money laundering phenomenon of interest to researchers and scholars on different intellectual orientation of economic or political or other, as this process is gaining paramount importance in light of business and increase the number of banks in the province of Kurdistan of Iraq and Erbil in particular and in the presence of openness developments chaotic economic and there are no factors encourage money laundering operation because of the presence of the hidden economy and the weakness of the banking and legal measures to combat them, and on this basis there is a need to examine money laundering operation in the province of Arbil, to indicate the presence or absence of a money laundering operation in working in the provin

Key generation for data cryptography is vital in wireless communications security. This key must be generated in a random way so that can not be regenerated by a third party other than the intended receiver. The random nature of the wireless channel is utilized to generate the encryption key. However, the randomness of wireless channels deteriorated over time due to channel aging which casing security threats, particularly for spatially correlated channels. In this paper, the effect of channel aging on the ciphering key generations is addressed. A proposed method to randomize the encryption key each coherence time is developed which decreases the correlation between keys generated at consecutive coherence times. When compared to the

ABSTRACT Background: Neuropilin 1(NRP1) is considered a novel non - tyrosine kinase co- receptor for the vascular endothelial growth factors (VEGF). First discovered on migrating neurons. NRP1is suggested to be up-regulated in cells of different types of cancer and implicated with advanced disease. The aim of this study was to investigate the variation in expression of NRP1 in oral, laryngeal and skin squamous cell carcinoma. Materials and methods: Tissue sections from 120 formalin fixed- paraffin embedded blocks histopathologically diagnosed as oral, laryngeal and skin SCC (40 blocks for each),immunohistohemically stained in immunoperoxidase method with monoclonal antibodies to NRP1, the localization of expression was examined and the res

Survival analysis is widely applied to data that described by the length of time until the occurrence of an event under interest such as death or other important events. The purpose of this paper is to use the dynamic methodology which provides a flexible method, especially in the analysis of discrete survival time, to estimate the effect of covariate variables through time in the survival analysis on dialysis patients with kidney failure until death occurs. Where the estimations process is completely based on the Bayes approach by using two estimation methods: the maximum A Posterior (MAP) involved with Iteratively Weighted Kalman Filter Smoothing (IWKFS) and in combination with the Expectation Maximization (EM) algorithm. While the other