Computer systems and networks are being used in almost every aspect of our daily life, the security threats to computers and networks have increased significantly. Usually, password-based user authentication is used to authenticate the legitimate user. However, this method has many gaps such as password sharing, brute force attack, dictionary attack and guessing. Keystroke dynamics is one of the famous and inexpensive behavioral biometric technologies, which authenticate a user based on the analysis of his/her typing rhythm. In this way, intrusion becomes more difficult because the password as well as the typing speed must match with the correct keystroke patterns. This thesis considers static keystroke dynamics as a transparent layer of the user for user authentication. Back Propagation Neural Network (BPNN) and the Probabilistic Neural Network (PNN) are used as a classifier to discriminate between the authentic and impostor users. Furthermore, four keystroke dynamics features namely: Dwell Time (DT), Flight Time (FT), Up-Up Time (UUT), and a mixture of (DT) and (FT) are extracted to verify whether the users could be properly authenticated. Two datasets (keystroke-1) and (keystroke-2) are used to show the applicability of the proposed Keystroke dynamics user authentication system. The best results obtained with lowest false rates and highest accuracy when using UUT compared with DT and FT features and comparable to combination of DT and FT, because of UUT as one direct feature that implicitly contained the two other features DT, and FT; that lead to build a new feature from the previous two features making the last feature having more capability to discriminate the authentic users from the impostors. In addition, authentication with UUT alone instead of the combination of DT and FT reduce the complexity and computational time of the neural network when compared with combination of DT and FT features.
(5)
(4)
(30)
(25)
In this study, the adsorption of Zn (NO3)2 is carried out by using surfaces of malvaparviflora. The validity of the adsorption is evaluated by using atomic absorption Spectrophotometry through determination the amount of adsorbed Zn (NO3)2. Various parameters such as PH, adsorbent weight and contact time are studied in terms of their effect on the reaction progress. Furthermore, Lagergren’s equation is used to determine adsorption kinetics. It is observed that high removal of Zn (NO3)2 is obtained at PH=2. High removal of Zn (NO3)2 is at the time equivalent of 60 min and reaches equilibrium,where 0.25gm is the best weight of adsorbant . For kinetics the reaction onto malvaparviflora follows pseudo first order Lagergren’s equation.
(1)
In This paper, sky radio emission background level associated with radio storm burst for the Sun and Jupiter is determined at frequency (20.1 MHz). The observation data for radio Jove telescope for the Sun and Jupiter radio storm observations data are loaded from NASA radio Jove telescope website, the data of Sunspot number are loaded from National Geophysical Data Center, (NGDC). Two radio Jove stations [(Sula, MT), (Lamy, NM)] are chose from data website for these huge observations data. For the Sun, twelve figures are used to determine the relation between radio background emission, and the daily Sunspot number. For Jupiter a twenty four figures are used to determine the relation between radio background emission and diffraction betwe
... Show MoreIn this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr
... Show MoreSecured multimedia data has grown in importance over the last few decades to safeguard multimedia content from unwanted users. Generally speaking, a number of methods have been employed to hide important visual data from eavesdroppers, one of which is chaotic encryption. This review article will examine chaotic encryption methods currently in use, highlighting their benefits and drawbacks in terms of their applicability for picture security.
In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c
... Show More
In this paper we present the first ever measured experimental electron momentum density of Cu2Sb at an intermediate resolution (0.6 a.u.) using 59.54 keV 241Am Compton spectrometer. The measurements are compared with the theoretical Compton profiles using density function theory (DFT) within a linear combination of an atomic orbitals (LCAO) method. In DFT calculation, Perdew-Burke-Ernzerhof (PBE) scheme is employed to treat correlation whereas exchange is included by following the Becke scheme. It is seen that various approximations within LCAO-DFT show relatively better agreement with the experimental Compton data. Ionic model calculations for a number of configurations (Cu+x/2)2(Sb-x) (0.0≤x≤2.0) are also performed utilizing free a
... Show More
The aim of this research is to compare traditional and modern methods to obtain the optimal solution using dynamic programming and intelligent algorithms to solve the problems of project management.
It shows the possible ways in which these problems can be addressed, drawing on a schedule of interrelated and sequential activities And clarifies the relationships between the activities to determine the beginning and end of each activity and determine the duration and cost of the total project and estimate the times used by each activity and determine the objectives sought by the project through planning, implementation and monitoring to maintain the budget assessed
... Show More