Face recognition is a crucial biometric technology used in various security and identification applications. Ensuring accuracy and reliability in facial recognition systems requires robust feature extraction and secure processing methods. This study presents an accurate facial recognition model using a feature extraction approach within a cloud environment. First, the facial images undergo preprocessing, including grayscale conversion, histogram equalization, Viola-Jones face detection, and resizing. Then, features are extracted using a hybrid approach that combines Linear Discriminant Analysis (LDA) and Gray-Level Co-occurrence Matrix (GLCM). The extracted features are encrypted using the Data Encryption Standard (DES) for security and then sent to the cloud server hosting the deep model. Upon reaching the server, the features are decrypted and fed into the proposed Fuzzy Face Deep Model (FFDM), which incorporates a fuzzy layer to enhance recognition accuracy. The model was evaluated using the MUCT and LFW datasets, demonstrating high accuracy and notable results, with precision of 99.65% and 100% on MUCT and LFW, respectively.
Flexible molecular docking is a computational method of structure-based drug design to evaluate binding interactions between receptor and ligand and identify the ligand conformation within the receptor pocket. Currently, various molecular docking programs are extensively applied; therefore, realizing accuracy and performance of the various docking programs could have a significant value. In this comparative study, the performance and accuracy of three widely used non-commercial docking software (AutoDock Vina, 1-Click Docking, and UCSF DOCK) was evaluated through investigations of the predicted binding affinity and binding conformation of the same set of small molecules (HIV-1 protease inhibitors) and a protein target HIV-1 protease enzy
... Show MoreThe aim of this paper is to introduce the concepts of asymptotically p-contractive and asymptotically severe accretive mappings. Also, we give an iterative methods (two step-three step) for finite family of asymptotically p-contractive and asymptotically severe accretive mappings to solve types of equations.
AA Abbass, HL Hussein, WA Shukur, J Kaabi, R Tornai, Webology, 2022 Individual’s eye recognition is an important issue in applications such as security systems, credit card control and guilty identification. Using video images cause to destroy the limitation of fixed images and to be able to receive users’ image under any condition as well as doing the eye recognition. There are some challenges in these systems; changes of individual gestures, changes of light, face coverage, low quality of video images and changes of personal characteristics in each frame. There is a need for two phases in order to do the eye recognition using images; revelation and eye recognition which will use in the security systems to identify the persons. The mai
... Show MoreThe aim of the research is to examine the multiple intelligence test item selection based on Howard Gardner's MI model using the Generalized Partial Estimation Form, generalized intelligence. The researcher adopted the scale of multiple intelligences by Kardner, it consists of (102) items with eight sub-scales. The sample consisted of (550) students from Baghdad universities, Technology University, al-Mustansiriyah university, and Iraqi University for the academic year (2019/2020). It was verified assumptions theory response to a single (one-dimensional, local autonomy, the curve of individual characteristics, speed factor and application), and analysis of the data according to specimen partial appreciation of the generalized, and limits
... Show MoreThe 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
... Show More