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 t

<span>As a result of numerous applications and low installation costs, wireless sensor networks (WSNs) have expanded excessively. The main concern in the WSN environment is to lower energy consumption amidst nodes while preserving an acceptable level of service quality. Using multi-mobile sinks to reduce the nodes' energy consumption have been considered as an efficient strategy. In such networks, the dynamic network topology created by the sinks mobility makes it a challenging task to deliver the data to the sinks. Thus, in order to provide efficient data dissemination, the sensor nodes will have to readjust the routes to the current position of the mobile sinks. The route re-adjustment process could result in a significant m

<abstract><p>Many variations of the algebraic Riccati equation (ARE) have been used to study nonlinear system stability in the control domain in great detail. Taking the quaternion nonsymmetric ARE (QNARE) as a generalized version of ARE, the time-varying QNARE (TQNARE) is introduced. This brings us to the main objective of this work: finding the TQNARE solution. The zeroing neural network (ZNN) technique, which has demonstrated a high degree of effectiveness in handling time-varying problems, is used to do this. Specifically, the TQNARE can be solved using the high order ZNN (HZNN) design, which is a member of the family of ZNN models that correlate to hyperpower iterative techniques. As a result, a novel

Its well known that understanding human facial expressions is a key component in understanding emotions and finds broad applications in the field of human-computer interaction (HCI), has been a long-standing issue. In this paper, we shed light on the utilisation of a deep convolutional neural network (DCNN) for facial emotion recognition from videos using the TensorFlow machine-learning library from Google. This work was applied to ten emotions from the Amsterdam Dynamic Facial Expression Set-Bath Intensity Variations (ADFES-BIV) dataset and tested using two datasets.

In this work, a simple and new method is proposed to simultaneously improve the physical layer security and the transmission performance of the optical orthogonal frequency division multiplexing system, by combining orthogonal frequency division multiplexing technique with chaotic theory principles. In the system, a 2-D chaotic map is employed. The introduced system replaces complex operations such as matrix multiplication with simple operations such as multiplexing and inverting. The system performance in terms of bit error rate (BER) and peak to average ratio (PAPR) is enhanced. The system is simulated using Optisystem15 with a MATLAB2016 and for different constellations. The simulation results showed that the  BE

Localization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo

Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the  Random Waypoint model (RWP), Random Direction model (RD), Nomadic Co

Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the  Random Waypoint model (RWP), Random Direction model (RD), Nomadic Co