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 initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.
This paper deals with the Magnetohydrodynyamic (Mill)) flow for a viscoclastic fluid of the generalized Oldroyd-B model. The fractional calculus approach is used to establish the constitutive relationship of the non-Newtonian fluid model. Exact analytic solutions for the velocity and shear stress fields in terms of the Fox H-function are obtained by using discrete Laplace transform. The effect of different parameter that controlled the motion and shear stress equations are studied through plotting using the MATHEMATICA-8 software.
Mass transfer correlations for iron rotating cylinder electrode in chloride/sulphate solution, under isothermal and
controlled heat transfer conditions, were derived. Limiting current density values for the oxygen reduction reaction from
potentiostatic experiments at different bulk temperatures and various turbulent flow rates, under isothermal and heat
transfer conditions, were used for such derivation. The corelations were analogous to that obtained by Eisenberg et all
and other workers.
Polyaromatic hydrocarbons (PAHs) are a group of aromatic compounds that contain at least two rings. These compounds are found naturally in petroleum products and are considered the most prevalent pollutants in the environment. The lack of microorganism capable of degrading some PAHs led to their accumulation in the environment which usually causes major health problems as many of these compounds are known carcinogens. Xanthene is one of the small PAHs which has three rings. Many xanthene derivatives are useful dyes that are used for dyeing wood and cosmetic articles. However, several studies have illustrated that these compounds have toxic and carcinogenic effects. The first step of the bacterial degradation of xanthene is conducted by d
... Show MoreA novel method for Network Intrusion Detection System (NIDS) has been proposed, based on the concept of how DNA sequence detects disease as both domains have similar conceptual method of detection. Three important steps have been proposed to apply DNA sequence for NIDS: convert the network traffic data into a form of DNA sequence using Cryptography encoding method; discover patterns of Short Tandem Repeats (STR) sequence for each network traffic attack using Teiresias algorithm; and conduct classification process depends upon STR sequence based on Horspool algorithm. 10% KDD Cup 1999 data set is used for training phase. Correct KDD Cup 1999 data set is used for testing phase to evaluate the proposed method. The current experiment results sh
... Show MoreA field-pilot scale slow sand filter (SSF) was constructed at Al-Rustamiya Sewage Treatment Plant (STP) in Baghdad city to investigate the removal efficiency in terms of Biochemical Oxygen Demand (BOD5), Chemical oxygen demand (COD), Total Suspended Solids (TSS) and Chloride concentrations for achieving better secondary effluent quality from this treatment plant. The SSF was designed at a 0.2 m/h filtration rate with filter area 1 m2 and total filter depth of 2.3 m. A filter sand media 0.35 mm in size and 1 m depth was supported by 0.2 m layer of gravel of size 5 mm. The secondary effluent from Al-Rustamiya STP was used as the influent to the slow sand filter. The results showed that the removal of BOD5, COD, TSS, and Chloride were
... Show MoreDeep learning (DL) plays a significant role in several tasks, especially classification and prediction. Classification tasks can be efficiently achieved via convolutional neural networks (CNN) with a huge dataset, while recurrent neural networks (RNN) can perform prediction tasks due to their ability to remember time series data. In this paper, three models have been proposed to certify the evaluation track for classification and prediction tasks associated with four datasets (two for each task). These models are CNN and RNN, which include two models (Long Short Term Memory (LSTM)) and GRU (Gated Recurrent Unit). Each model is employed to work consequently over the two mentioned tasks to draw a road map of deep learning mod
... Show MoreLED is an ultra-lightweight block cipher that is mainly used in devices with limited resources. Currently, the software and hardware structure of this cipher utilize a complex logic operation to generate a sequence of random numbers called round constant and this causes the algorithm to slow down and record low throughput. To improve the speed and throughput of the original algorithm, the Fast Lightweight Encryption Device (FLED) has been proposed in this paper. The key size of the currently existing LED algorithm is in 64-bit & 128-bit but this article focused mainly on the 64-bit key (block size=64-bit). In the proposed FLED design, complex operations have been replaced by LFSR left feedback technology to make the algorithm perform more e
... Show MoreDue to the huge variety of 5G services, Network slicing is promising mechanism for dividing the physical network resources in to multiple logical network slices according to the requirements of each user. Highly accurate and fast traffic classification algorithm is required to ensure better Quality of Service (QoS) and effective network slicing. Fine-grained resource allocation can be realized by Software Defined Networking (SDN) with centralized controlling of network resources. However, the relevant research activities have concentrated on the deep learning systems which consume enormous computation and storage requirements of SDN controller that results in limitations of speed and accuracy of traffic classification mechanism. To fill thi
... Show MoreKeys for 22 species representing 10 genera of Thripidae were provided collection of
samples carried out during 1999-2001 in different localities in the middle of Iraq. Of them
four species are described as new to science, Frankliniella megacephala sp. nov; Retithrips
bagdadensis sp. nov; Chirothrips imperatus sp. nov; Taeniothrips tigridis sp. nov; Another
fourteen species are recorded for the first time in Iraq; Thrips meridionalis (Pri.);
Microcephalothrips abdominils (Crawford Scolothrips sexmaculatus (Pergande),);Scolothrips
pallidus (Beach); Scritothrips mangiferae Pri.; Frankliniella tritici Bagnall; Frankliniella
schultzie Trybom; Frankliniella unicolor Morgan; Retithrips aegypticus Marchal; Retithrips
java