Chacha 20 is a stream cypher that is used as lightweight on many CPUs that do not have dedicated AES instructions. As stated by Google, that is the reason why they use it on many devices, such as mobile devices, for authentication in TLS protocol. This paper proposes an improvement of chaha20 stream cypher algorithm based on tent and Chebyshev functions (IChacha20). The main objectives of the proposed IChacha20 algorithm are increasing security layer, designing a robust structure of the IChacha20 to be enabled to resist various types of attacks, implementing the proposed algorithm for encryption of colour images, and transiting it in a secure manner. The test results proved that the MSE, PSNR, UQI and NCC metrics of IChacha20 are better than those of the original Chacha20. Also, the proposed method has a faster execution time (01:26:4 sec) compared with the original algorithm (02:07:1 sec).
The research aims to identify the theoretical foundations for measuring and analyzing quality costs and continuous improvement, as well as measuring and analyzing quality costs for the Directorate of Electricity Supply / Middle Euphrates and continuous improvement of the distribution of electrical energy,The problem was represented by the high costs of failure and waste in electrical energy result to the excesses on the network and the missing (lost) energy,Thus, measuring and analyzing quality costs for the distribution of electrical energy and identifying continuous improvement leads to a reduction in missing and an increase in sales, as the research reached many conclusions, the most important of which is the high percentage o
... Show MoreIn this work we present a technique to extract the heart contours from noisy echocardiograph images. Our technique is based on improving the image before applying contours detection to reduce heavy noise and get better image quality. To perform that, we combine many pre-processing techniques (filtering, morphological operations, and contrast adjustment) to avoid unclear edges and enhance low contrast of echocardiograph images, after implementing these techniques we can get legible detection for heart boundaries and valves movement by traditional edge detection methods.
Iris recognition occupies an important rank among the biometric types of approaches as a result of its accuracy and efficiency. The aim of this paper is to suggest a developed system for iris identification based on the fusion of scale invariant feature transforms (SIFT) along with local binary patterns of features extraction. Several steps have been applied. Firstly, any image type was converted to grayscale. Secondly, localization of the iris was achieved using circular Hough transform. Thirdly, the normalization to convert the polar value to Cartesian using Daugman’s rubber sheet models, followed by histogram equalization to enhance the iris region. Finally, the features were extracted by utilizing the scale invariant feature
... Show MoreIn this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.
In this article, we define and study a family of modified Baskakov type operators based on a parameter . This family is a generalization of the classical Baskakov sequence. First, we prove that it converges to the function being approximated. Then, we find a Voronovsky-type formula and obtain that the order of approximation of this family is . This order is better than the order of the classical Baskakov sequence whenever . Finally, we apply our sequence to approximate two test functions and analyze the numerical results obtained.
<span>We present the linearization of an ultra-wideband low noise amplifier (UWB-LNA) operating from 2GHz to 11GHz through combining two linearization methods. The used linearization techniques are the combination of post-distortion cancellation and derivative-superposition linearization methods. The linearized UWB-LNA shows an improved linearity (IIP3) of +12dBm, a minimum noise figure (NF<sub>min.</sub>) of 3.6dB, input and output insertion losses (S<sub>11</sub> and S<sub>22</sub>) below -9dB over the entire working bandwidth, midband gain of 6dB at 5.8GHz, and overall circuit power consumption of 24mW supplied from a 1.5V voltage source. Both UWB-LNA and linearized UWB-LNA designs are
... Show MoreThe Research examines the transmission advantage from Floor Trading (FT) to the Electronic Trading (ET) in the Iraqi Stock Exchange (ISE). Testing three hypothesis, first, test the significant different of market depth before and after period of ET used, second, test the significant different of market liquidity also before and after period of ET used. And third test the impact of market depth and liquidity on the performance of ISE. AnEvent Study is depended with 74 observing distributed equality on research period which is extent among 2006 to 2012, Note that the event window is 5-7-2009.The Result of hypothesis testing explore that the all three null main hypothesis is refusing and accept the alternative of it's because the ET
... Show MoreScience, technology and many other fields are use clustering algorithm widely for many applications, this paper presents a new hybrid algorithm called KDBSCAN that work on improving k-mean algorithm and solve two of its
problems, the first problem is number of cluster, when it`s must be entered by user, this problem solved by using DBSCAN algorithm for estimating number of cluster, and the second problem is randomly initial centroid problem that has been dealt with by choosing the centroid in steady method and removing randomly choosing for a better results, this work used DUC 2002 dataset to obtain the results of KDBSCAN algorithm, it`s work in many application fields such as electronics libraries,