Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show MoreThe present research deals with the spatial variance analysis in Jwartadistrict and conducting a comparison on the spatial and seasonal changes of the vegetation cover between (2007-2013) in order to deduce the relationship between the vegetation density and the areas which are exposed to the risk of water erosion by using Plant Variation Index NDVI) C (coefficient and by using Satellite images of Landsat satellite which are taken in 2/7/2007 and Satellite images of Landsat satellite taken in 11/1/ 2013, the programs of remote sensitivity and the Geographic Information Systems.
The study reveals that there is a variance in the density of vegetation cover of the area under study betwee 2007 and 2013. Howev
... Show MoreThis study tackles a fourth-order inverse problem involving a cantilever beam with nonlocal conditions to simultaneously calculate the beam’s displacement and an unknown time-dependent coefficient. A finite difference approach is suggested to discretize the hyperbolic fourth-order equation. A stability analysis for the proposed scheme is also provided. The indirect problem is the minimization of the misfit function. The goal of the minimization algorithm is to reduce the gap between the measured (noisy) data and the numerical computed solution provided by the model. To achieve stable results, Tikhonov’s regularization technique is employed, and two numerical test examples are shown to illustrate the suggested scheme's reliabilit
... Show MoreA new Differential Evolution (ARDE) algorithm is introduced that automatically adapt a repository of DE strategies and parameters adaptation schemes of the mutation factor and the crossover rate to avoid the problems of stagnation and make DE responds to a wide range of function characteristics at different stages of the evolution. ARDE algorithm makes use of JADE strategy and the MDE_pBX parameters adaptive schemes as frameworks. Then a new adaptive procedure called adaptive repository (AR) has been developed to select the appropriate combinations of the JADE strategies and the parameter control schemes of the MDE_pBX to generate the next population based on their fitness values. Experimental results have been presented to confirm the reli
... Show MoreInthisstudy,FourierTransformInfraredSpectrophotometry(FTIR),XRay Diffraction(XRD)andlossonignition(LOI),comparativelyemployedtoprovideaquick,relativelyinexpensiveandefficientmethodforidentifyingandquantifyingcalcitecontentofphosphateoresamplestakenfromAkashatsiteinIraq.Acomprehensivespectroscopicstudyofphosphate-calcitesystemwasreportedfirstintheMid-IRspectra(4004000cm-1)usingShimadzuIRAffinity-1,fordifferentcutsofphosphatefieldgradeswithsamplesbeneficiatedusingcalcinationandleachingwithorganicacidatdifferenttemperatures.Thenusingtheresultedspectratocreateacalibrationcurverelatesmaterialconcentrationstotheintensity(peaks)ofFTIRabsorbanceandappliesthiscalibrationtospecifyphosphate-calcitecontentinIraqicalcareousphosphateore.Theirpeakswereass
... Show MoreImage compression is one of the data compression types applied to digital images in order to reduce their high cost for storage and/or transmission. Image compression algorithms may take the benefit of visual sensitivity and statistical properties of image data to deliver superior results in comparison with generic data compression schemes, which are used for other digital data. In the first approach, the input image is divided into blocks, each of which is 16 x 16, 32 x 32, or 64 x 64 pixels. The blocks are converted first into a string; then, encoded by using a lossless and dictionary-based algorithm known as arithmetic coding. The more occurrence of the pixels values is codded in few bits compare with pixel values of less occurre
... Show MoreHuman identification is crucial in forensics for the investigation of large-scale disasters such as fires, epidemics, earthquakes, and tsunamis. Even though biometric identification using panoramic dental radiography (PDR) has been the subject of several studies in the literature, further study remains a necessary and challenging issue. In this research, a human identification system was developed based on a convolutional neural network (CNN) and contour transform (CT). The proposed system was implemented on a total of 1540 PDR from 302 individuals. The preprocessing applied to PDRs for enhancing and taking the Region of Interest (ROI). The features were extracted using CT transform. These features were fused with features extracted
... Show MoreThe manuscript should contain an abstract. The abstract should be self-contained and citation-free and should not exceed 200 words. The abstract should state the purpose, approach, results and conclusions of the work. The author should assume that the reader has some knowledge of the subject but has not read the paper. Thus, the abstract should be intelligible and complete in it-self (no numerical references); it should not cite figures, tables, or sections of the paper. The abstract should be written using third person instead of first perso The fast microwave assisted pyrolysis (FMWAP) of water hyacinth (WH) for biochar production is investigated. Taguchi’s method was used to optimize FMWAP parameters. The effects of microwave
... Show More