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

Background: The Covid-19 pandemic changed the world; its most important achievement for education was changing the approach from traditional to virtual education. The present study aimed to investigate the role of virtual education networks on mental health of students including personality, beliefs, scientific, and cultural dimensions, in selected countries.Methods: This was an exploratory and applied study. According to the phenomenology strategy, theoretical saturation occurred after 24 semi-structured and targeted qualitative interviews with teachers from Iran, Iraq, Syria and Lebanon, in 2023. Quantitative data was collected through a researcher-made online questionnaire with 423 participants. Teachers with at least a Bachelor’s degr

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.

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

The employment of cognitive radio (CR) is critical to the successful development of wireless communications. In this field, especially when using the multiple input multiple output (MIMO) antenna technology, energy consumption is critical. If the principal user (PU) is present, developers can utilize the energy detecting approach to tell. The researchers employed two distinct phases to conduct their research: the intense and accurate sensing stages. After the furious sensing step was completed, the PU user was identified as having a maximum or minimal energy channel. There are two situations in which the proposed algorithm's performance is tested: channels for fading AWGN and Rayleigh. When the proposed methods' simulation results a

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

Internet paths sharing the same congested link can be identified using several shared congestion detection techniques. The new detection technique which is proposed in this paper depends on the previous novel technique (delay correlation with wavelet denoising (DCW) with new denoising method called Discrete Multiwavelet Transform (DMWT) as signal denoising to separate between queuing delay caused by network congestion and delay caused by various other delay variations. The new detection technique provides faster convergence (3 to 5 seconds less than previous novel technique) while using fewer probe packets approximately half numbers than the previous novel technique, so it will reduce the overload on the network caused by probe packets.

The inverse kinematics of redundant manipulators has infinite solutions by using conventional methods, so that, this work presents applicability of intelligent tool (artificial neural network ANN) for finding one desired solution from these solutions. The inverse analysis and trajectory planning of a three link redundant planar robot have been studied in this work using a proposed dual neural networks model (DNNM), which shows a predictable time decreasing in the training session. The effect of the number of the training sets on the DNNM output and the number of NN layers have been studied. Several trajectories have been implemented using point to point trajectory planning algorithm with DNNM and the result shows good accuracy of the end

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.