Computer systems and networks are increasingly used for many types of applications; as a result the security threats to computers and networks have also increased significantly. Traditionally, password user authentication is widely used to authenticate legitimate user, but this method has many loopholes such as password sharing, brute force attack, dictionary attack and more. The aim of this paper is to improve the password authentication method using Probabilistic Neural Networks (PNNs) with three types of distance include Euclidean Distance, Manhattan Distance and Euclidean Squared Distance and four features of keystroke dynamics including Dwell Time (DT), Flight Time (FT), mixture of (DT) and (FT), and finally Up-Up Time (UUT). The resul

      As a new technology, blockchain provides the necessary capabilities to assure data integrity and data security through encryption. Mostly, all existing algorithms that provide security rely on the process of discovering a suitable key. Hence, key generation is considered the core of powerful encryption. This paper uses Zernike moment and Mersenne prime numbers to generate strong prime numbers by extracting the features from biometrics (speech). This proposed system sends these unique and strong prime numbers to the RSA algorithm to generate the keys. These keys represent a public address and a private key in a cryptocurrency wallet that is used to encrypt transactions. The benefit of this work is that it provides a high degree

The Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t

Tracking moving objects is one of a very important applications within the computer vision. The goal of object tracking is segmenting a region of interest from a video scene and keeping track of its motion and positioning. Track moving objects used in many applications such as video surveillance, robot vision, and traffic monitoring, and animation. In this paper a four-wheeled robotic system have been designed and implemented by using Arduino-Uno microcontroller. Also a useful algorithms have been developed to detect and track objects in real time. The main proposed algorithm based on the kernel based color algorithm and some geometric properties to tracking color object. Robotic system is a compromise of two principal parts which are th

Let 


 
, 1
( )
1 2 ,
( , ) 1 2
m n
s s
m n
f s s a e m n   , (s   it , j 1,2) j j j  ,  
m 1  and
 
n 1  being an increasing sequences of positive numbers and a E m n  , where E
is Banach algebra, represent a vector valued entire Dirichlet functions in two
variables. The space  of all such entire functions having order at most equal to 
is considered in this paper. A metric topology using the growth parameters of f is
defined on  and its various properties are obtained. The form of linear operator on
the space  is characterized and proper bases are also characterized in terms of
growth parameters  .

A new approach for baud time (or baud rate) estimation of a random binary signal is presented. This approach utilizes the spectrum of the signal after nonlinear processing in a way that the estimation error can be reduced by simply increasing the number of the processed samples instead of increasing the sampling rate. The spectrum of the new signal is shown to give an accurate estimate about the baud time when there is no apriory information or any restricting preassumptions. The performance of the estimator for random binary square waves perturbed by white Gaussian noise and ISI is evaluated and compared with that of the conventional estimator of the zero crossing detector.

This paper demonstrates a new technique based on a combined form of the new transform method with homotopy perturbation method to find the suitable accurate solution of autonomous Equations with initial condition.  This technique is called the transform homotopy perturbation method (THPM). It can be used to solve the problems without resorting to the frequency domain.The implementation of the suggested method demonstrates the usefulness in finding exact solution for linear and nonlinear problems. The practical results show the efficiency and reliability of technique and easier implemented than HPM in finding exact solutions.Finally, all algorithms in this paper implemented in MATLAB version 7.12.

     The purpose of this paper is to study a new class of fuzzy covering dimension functions, called fuzzy

The study of entry and reentry dynamics for space vehicles is very important, particularly for manned vehicles and vehicles which is carry important devices and which can be used again. There are three types for entry dynamic, ballistics entry, glide entry and skip entry. The skip entry is used in this work for describing entry dynamics and determining trajectory. The inertia coordinate system is used to derive equations of motion and determines initial condition for skip entry. The velocity and drag force for entry vehicle, where generate it during entry into earth’s atmosphere are calculated in this work. Also the deceleration during descending and determining entry angles, velocities ratio and altitude ratio have been studied. The c

The paper aims at initiating and exploring the concept of extended metric known as the Strong Altering JS-metric, a stronger version of the Altering JS-metric. The interrelation of Strong Altering JS-metric with the b-metric and dislocated metric has been analyzed and some examples have been provided. Certain theorems on fixed points for expansive self-mappings in the setting of complete Strong Altering JS-metric space have also been discussed.