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.
An application of neural network technique was introduced in modeling the point efficiency of sieve tray, based on a
data bank of around 33l data points collected from the open literature.Two models proposed,using back-propagation
algorithm, the first model network consists: volumetric liquid flow rate (QL), F foctor for gas (FS), liquid density (pL),
gas density (pg), liquid viscosity (pL), gas viscosity (pg), hole diameter (dH), weir height (hw), pressure (P) and surface
tension between liquid phase and gas phase (o). In the second network, there are six parameters as dimensionless
group: Flowfactor (F), Reynolds number for liquid (ReL), Reynolds number for gas through hole (Reg), ratio of weir
height to hole diqmeter
In the literature, several correlations have been proposed for hold-up prediction in rotating disk contactor. However,
these correlations fail to predict hold-up over wide range of conditions. Based on a databank of around 611
measurements collected from the open literature, a correlation for hold up was derived using Artificial Neiral Network
(ANN) modeling. The dispersed phase hold up was found to be a function of six parameters: N, vc , vd , Dr , c d m / m ,
s . Statistical analysis showed that the proposed correlation has an Average Absolute Relative Error (AARE) of 6.52%
and Standard Deviation (SD) 9.21%. A comparison with selected correlations in the literature showed that the
developed ANN correlation noticeably
Cutting forces are important factors for determining machine serviceability and product quality. Factors such as speed feed, depth of cut and tool noise radius affect on surface roughness and cutting forces in turning operation. The artificial neural network model was used to predict cutting forces with related to inputs including cutting speed (m/min), feed rate (mm/rev), depth of cut (mm) and work piece hardness (Map). The outputs of the ANN model are the machined cutting force parameters, the neural network showed that all (outputs) of all components of the processing force cutting force FT (N), feed force FA (N) and radial force FR (N) perfect accordance with the experimental data. Twenty-five samp
... Show More
(3)
Many authors investigated the problem of the early visibility of the new crescent moon after the conjunction and proposed many criteria addressing this issue in the literature. This article presented a proposed criterion for early crescent moon sighting based on a deep-learned pattern recognizer artificial neural network (ANN) performance. Moon sight datasets were collected from various sources and used to learn the ANN. The new criterion relied on the crescent width and the arc of vision from the edge of the crescent bright limb. The result of that criterion was a control value indicating the moon's visibility condition, which separated the datasets into four regions: invisible, telescope only, probably visible, and certai
... Show More
(2)
(2)
This paper presents a modified training method for Recurrent Neural Networks. This method depends on the Non linear Auto Regressive (NARX) model with Modified Wavelet Function as activation function (MSLOG) in the hidden layer. The modified model is known as Modified Recurrent Neural (MRN). It is used for identification Forward dynamics of four Degrees of Freedom (4-DOF) Selective Compliance Assembly Robot Arm (SCARA) manipulator robot. This model is also used in the design of Direct Inverse Control (DIC). This method is compared with Recurrent Neural Networks that used Sigmoid activation function (RS) in the hidden layer and Recurrent Neural Networks with Wavelet activation function (RW). Simulation results shows that the MRN model is bett
... Show MoreThis work implements the face recognition system based on two stages, the first stage is feature extraction stage and the second stage is the classification stage. The feature extraction stage consists of Self-Organizing Maps (SOM) in a hierarchical format in conjunction with Gabor Filters and local image sampling. Different types of SOM’s were used and a comparison between the results from these SOM’s was given.
The next stage is the classification stage, and consists of self-organizing map neural network; the goal of this stage is to find the similar image to the input image. The proposal method algorithm implemented by using C++ packages, this work is successful classifier for a face database consist of 20
... Show MoreSensing insole systems are a promising technology for various applications in healthcare and sports. They can provide valuable information about the foot pressure distribution and gait patterns of different individuals. However, designing and implementing such systems poses several challenges, such as sensor selection, calibration, data processing, and interpretation. This paper proposes a sensing insole system that uses force-sensitive resistors (FSRs) to measure the pressure exerted by the foot on different regions of the insole. This system classifies four types of foot deformities: normal, flat, over-pronation, and excessive supination. The classification stage uses the differential values of pressure points as input for a feedforwar
... Show More
(5)
(4)
In this work, a new development of predictive voltage-tracking control algorithm for Proton Exchange Membrane Fuel Cell (PEMFCs) model, using a neural network technique based on-line auto-tuning intelligent algorithm was proposed. The aim of proposed robust feedback nonlinear neural predictive voltage controller is to find precisely and quickly the optimal hydrogen partial pressure action to control the stack terminal voltage of the (PEMFC) model for N-step ahead prediction. The Chaotic Particle Swarm Optimization (CPSO) implemented as a stable and robust on-line auto-tune algorithm to find the optimal weights for the proposed predictive neural network controller to improve system performance in terms of fast-tracking de
... Show More
(7)
(9)
(6)
The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).
(1)