String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

Incremental Sheet Metal Forming (ISMF) is a modern sheet metal forming technology which offers the possibility of manufacturing 3D complex parts of thin sheet metals using the CNC milling machine. The surface quality is a very important aspect in any manufacturing process. Therefore, this study focuses on the resultant residual stresses by forming parameters, namely; (tool shape, step over, feed rate, and slope angle) using Taguchi method for the products formed by single point incremental forming process (SPIF). For evaluating the surface quality, practical experiments to produce pyramid like shape have been implemented on aluminum sheets (AA1050) for thickness (0.9) mm. Three types of tool shape used in this work, the spherical tool ga

The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola

In the image processing’s field and computer vision it’s important to represent the image by its information. Image information comes from the image’s features that extracted from it using feature detection/extraction techniques and features description. Features in computer vision define informative data. For human eye its perfect to extract information from raw image, but computer cannot recognize image information. This is why various feature extraction techniques have been presented and progressed rapidly. This paper presents a general overview of the feature extraction categories for image.

Thin films of vanadium oxide nanoparticles doped with different concentrations of europium oxide (2, 4, 6, and 8) wt % are deposited on glass and Si substrates with orientation (111) utilizing by pulsed laser deposition technique using Nd:YAG laser that has a wavelength of 1064 nm, average frequency of 6 Hz and pulse duration of 10 ns. The films were annealed in air at 300 °C for two hours, then the structural, morphological and optical properties are characterized using x-ray diffraction (XRD), Field emission scanning electron microscopy (FESEM) and UV-Vis spectroscopy respectively. The X-ray diffraction results of V2O5:Eu2O3 exhibit that the film has apolycrystalline monoclinic V2O5 and triclinic V4O7 phases. The FESEM image shows a h

DBNRHM Sami, International Journal of Research in Social Sciences and Humanities, 2020

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