Most of the Internet of Things (IoT), cell phones, and Radio Frequency Identification (RFID) applications need high speed in the execution and processing of data. this is done by reducing, system energy consumption, latency, throughput, and processing time. Thus, it will affect against security of such devices and may be attacked by malicious programs. Lightweight cryptographic algorithms are one of the most ideal methods Securing these IoT applications. Cryptography obfuscates and removes the ability to capture all key information patterns ensures that all data transfers occur Safe, accurate, verified, legal and undeniable.  Fortunately, various lightweight encryption algorithms could be used to increase defense against various at

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

Gray-Scale Image Brightness/Contrast Enhancement with Multi-Model
Histogram linear Contrast Stretching (MMHLCS) method

In this paper, a random transistor-transistor logic signal generator and a synchronization circuit are designed and implemented in lab-scale measurement device independent–quantum key distribution systems. The random operation of the weak coherent sources and the system’s synchronization signals were tested by a time to digital convertor.

The software-defined network (SDN) is a new technology that separates the control plane from data ‎plane for the network devices. One of the most significant issues in the video ‎surveillance system is the link failure. When the path failure occurs, the monitoring center cannot receive the ‎video from the cameras. In this paper, two methods are proposed to solve this problem.  The first ‎method uses the Dijkstra algorithm to re-find the path at the source node switch. The second method ‎uses the Dijkstra algorithm to re-find the path at the ingress node switch (or failed link).

The aim of this research was to estimate the production function to measure returns to scale and distribution efficiency of  resources used in the production of wheat. Cross sectional data used of a random sample of 130 farmers in Dhi Qar Province. The results of the quantitative analysis of estimating production function showed that the double logarithmic form was the best estimated model based on economic and statistical indicators. However, that form suffered from heteroscedasticity and autocorrelation, so the robust regression technique was chosen. Value of returns to scale was 0.89 and this indicates decreasing returns to scale. This means that production function is in the second stage of the function. The results of the dist