In light of the development in computer science and modern technologies, the impersonation crime rate has increased. Consequently, face recognition technology and biometric systems have been employed for security purposes in a variety of applications including human-computer interaction, surveillance systems, etc. Building an advanced sophisticated model to tackle impersonation-related crimes is essential. This study proposes classification Machine Learning (ML) and Deep Learning (DL) models, utilizing Viola-Jones, Linear Discriminant Analysis (LDA), Mutual Information (MI), and Analysis of Variance (ANOVA) techniques. The two proposed facial classification systems are J48 with LDA feature extraction method as input, and a one-dimensional Convolutional Neural Network Hybrid Model (1D-CNNHM). The MUCT database was considered for training and evaluation. The performance, in terms of classification, of the J48 model reached 96.01% accuracy whereas the DL model that merged LDA with MI and ANOVA reached 100% accuracy. Comparing the proposed models with other works reflects that they are performing very well, with high accuracy and low processing time.
The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as
... Show MoreIn this study, we focused on the random coefficient estimation of the general regression and Swamy models of panel data. By using this type of data, the data give a better chance of obtaining a better method and better indicators. Entropy's methods have been used to estimate random coefficients for the general regression and Swamy of the panel data which were presented in two ways: the first represents the maximum dual Entropy and the second is general maximum Entropy in which a comparison between them have been done by using simulation to choose the optimal methods.
The results have been compared by using mean squares error and mean absolute percentage error to different cases in term of correlation valu
... Show MoreThe skill high-jump scoring is based on mechanical and physical abilities. The most important of all is the strength used by the player from the moment of preparation to the moment of scoring, which led the researchers to study the characteristics of the series of power chain functions of this skill according to (Biosyn System) The players of the national team's back line have a handball to find out the relationship between the properties of the power chain curve and the accuracy of the high jump to the upper and lower target angles. The aim of the research was to identify the values of the Force Series variables for the skill of the high-jump curve of the handball as well as the relationship between the properties of the power chain functi
... Show MoreGumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu
... Show MoreInventory or inventories are stocks of goods being held for future use or sale. The demand for a product in is the number of units that will need to be removed from inventory for use or sale during a specific period. If the demand for future periods can be predicted with considerable precision, it will be reasonable to use an inventory rule that assumes that all predictions will always be completely accurate. This is the case where we say that demand is deterministic.
The timing of an order can be periodic (placing an order every days) or perpetual (placing an order whenever the inventory declines to units).
in this research we discuss how to formulating inv
... Show MoreIn this work, porous silicon (PS) are fabricated using electrochemical etching (ECE) process for p-type crystalline silicon (c-Si) wafers of (100) orientation. The structural, morphological and electrical properties of PS synthesized at etching current density of (10, 20, 30) mA/cm2 at constant etching time 10 min are studied. From X-ray diffraction (XRD) measurement, the value of FWHM is in general decreases with increasing current density for p-type porous silicon (p-PS). Atomic force microscope (AFM) showed that for p-PS the average pore diameter decreases at 20 mA. Porous silicon which formed on silicon will be a junction so I-V characteristics have been studied in the dark to calculate ideality factor (n), and saturation current (Is
... Show MoreTchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us
... Show More