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

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

Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject

Orthogonal Frequency Division Multiplexing (OFDM) is one of recent years multicarrier modulation used in order to combat the Inter Symbol Interference (ISI) introduced by frequency selective mobile radio channel. The circular extension of the data symbol, commonly referred to as cyclic prefix is one of the key elements in an OFDM transmission scheme. This paper study The influence of the cyclic prefix duration on the BER performance of an OFDM-VCPL (Orthogonal frequency division multiplexing - Variable Cyclic Prefix Length) system and the conventional OFDM system with frame 64-QAM modulation is evaluated by means of computer simulation in a multipath fading channel. The adaptation of CP is done with respect to the delay spread estimation

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord