Most of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve Bayesian classifier (NBC) have been enhanced as compared to the dataset before applying the proposed method. Moreover, the results indicated that issa was performed better than the statistical imputation techniques such as deleting the samples with missing values, replacing the missing values with zeros, mean, or random values.
conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th
... Show MoreThe study aims to achieve several objectives, including follow-up scientific developments and transformations in the modern concepts of the Holistic Manufacturing System for the purpose of identifying the methods of switching to the entrances of artificial intelligence, and clarifying the mechanism of operation of the genetic algorithm under the Holonic Manufacturing System, to benefit from the advantages of systems and to achieve the maximum savings in time and cost of machines Using the Holistic Manufacturing System method and the Genetic algorithm, which allows for optimal maintenance time and minimizing the total cost, which in turn enables the workers of these machines to control the vacations in th
... Show MoreThis paper aims to study the chemical degradation of Brilliant Green in water via photo-Fenton (H2O2/Fe2+/UV) and Fenton (H2O2/Fe2+) reaction. Fe- B nano particles are applied as incrustation in the inner wall surface of reactor. The data form X- Ray diffraction (XRD) analysis that Fe- B nanocomposite catalyst consist mainly of SiO2 (quartz) and Fe2O3 (hematite) crystallites. B.G dye degradation is estimated to discover the catalytic action of Fe- B synthesized surface in the presence of UVC light and hydrogen peroxide. B.G dye solution with 10 ppm primary concentration is reduced by 99.9% under the later parameter 2ml H2O2, pH= 7, temperature =25°C within 10 min. It is clear that pH of the solution affects the photo- catalytic degradation
... Show MoreA coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c
... Show MoreOur country faced lots of crises specially Wars and still living under the traumatic events. This would result in psychological disorder specially the Acute Stress Disorder (ASD). That’s if not treated, it will turn to be over Post Traumatic Stress Disorder(PTSD). Also not mentioning the shortage of recourses speaks about war and crises. That treat with its inflections psychologically and sociologically theses cases if happened.
The importance of this study arise through it is objective to introduce a program for EMDR which give benefit for treat in health, social, educational institutes.
Aims:
The objective of this Study is the identification of a Test the effectiveness of Eye Movement Desensi
... Show MoreIn this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .