Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different

Facial identification is one of the biometrical approaches implemented for identifying any facial image with the use of the basic properties of that face. In this paper we proposes a new improved approach for face detection based on coding eyes by using Open CV's Viola-Jones algorithm which removes the falsely detected faces depending on coding eyes. The Haar training module in Open CV is an implementation of the Viola-Jones framework, the training algorithm takes as input a training group of positive and negative images, and generates strong features in the format of an XML file which is capable of subsequently being utilized for detecting the wanted face and eyes in images, the integral image is used to speed up Haar-like features calc

      The Internet of Things (IoT) is a network of devices used for interconnection and data transfer. There is a dramatic increase in IoT attacks due to the lack of security mechanisms. The security mechanisms can be enhanced through the analysis and classification of these attacks. The multi-class classification of IoT botnet attacks (IBA) applied here uses a high-dimensional data set. The high-dimensional data set is a challenge in the classification process due to the requirements of a high number of computational resources. Dimensionality reduction (DR) discards irrelevant information while retaining the imperative bits from this high-dimensional data set. The DR technique proposed here is a classifier-based fe

In this research, the focus was placed on estimating the parameters of the Hypoexponential distribution function using the maximum likelihood method and genetic algorithm. More than one standard, including MSE, has been adopted for comparison by Using the simulation method

Background: Klebsiella pneumoniae were considered as normal flora of skin, and intestine. It can cause damage to human lungs; the danger of this bacterium is related to exposure to the hospital surroundings. materials and methods: the detection of Klebsiella pneumoniae on morphological and biochemical tests and then assured with VITEK 2 system. Resistance to antibiotics was determined by Kirby-Baeur method. And genotyping of IMP-1 in isolates was done by PCR technique, then biofilm formation was identified by Micro titer plate method. Results: The present study included a collecting of 50 specimens from different clinical specimens, (blood 40%, urine 30%, sputum 20%, wound infection 10%); 10 isolates were identified as K

     The human epidermal growth factor receptor-2 (HER2) gene plays a critical role in breast cancer development and progression. HER2 overexpression characterizes a biologically and clinically aggressive breast cancer subtype. In this study, 60 samples from Iraqi women with breast cancer were collected and investigated for HER2 protein in the tissue by immunohistochemistry. Also, 20 samples from healthy Iraqi women were used as a control. The results showed that 18 (30 %) patients expressed the HER2 protein. A molecular study for single nucleotide polymorphism (SNP) was conducted on samples metastasizing to lymph nodes. DNA was extracted and polymerase chain reaction (PCR) was performed to amplify e

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable