Machine scheduling problems (MSP) are considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutions have been proved and some special cases have been introduced and proved since the problem is an NP-hard problem to find some efficient solutions that are efficient for the discussed problem 1// and good or optimal solutions for the multi-objective functions 1// ,, and emphasize the importance of the dominance rule (DR), which can be applied to this problem to improve efficient solutions.
One of the most important features of the Amazon Web Services (AWS) cloud is that the program can be run and accessed from any location. You can access and monitor the result of the program from any location, saving many images and allowing for faster computation. This work proposes a face detection classification model based on AWS cloud aiming to classify the faces into two classes: a non-permission class, and a permission class, by training the real data set collected from our cameras. The proposed Convolutional Neural Network (CNN) cloud-based system was used to share computational resources for Artificial Neural Networks (ANN) to reduce redundant computation. The test system uses Internet of Things (IoT) services through our ca
... Show MoreThis study was aimed to determine a phytotoxicity experiment with kerosene as a model of a total petroleum hydrocarbon (TPHs) as Kerosene pollutant at different concentrations (1% and 6%) with aeration rate (0 and 1 L/min) and retention time (7, 14, 21, 28 and 42 days), was carried out in a subsurface flow system (SSF) on the Barley wetland. It was noted that greatest elimination 95.7% recorded at 1% kerosene levels and aeration rate 1L / min after a period of 42 days of exposure; whereas it was 47% in the control test without plants. Furthermore, the percent of elimination efficiencies of hydrocarbons from the soil was ranged between 34.155%-95.7% for all TPHs (Kerosene) concentrations at aeration rate (0 and 1 L/min). The Barley c
... Show MoreThe aim of present work is to study the removal of phenol present in aqueous feed solution by the emulsion liquid membrane technique using kerosene as a diluent, sodium hydroxide as a stripping agent, and sorbitan monooleate (Span 80) as a surfactant. The parameters studied were: surfactant concentration, volume ratio of membrane phase to internal phase, and stirring speed. It was found that more than 98% of phenol can be removed at the conditions were surfactant concentration 2% (v/v), volume ratio of membrane phase to internal phase 5:1 and stirring speed 400 rpm. Maximum phenol extraction efficiency at 7 minutes of process time was observed. It was found that there was a good agreement between the standard kerosene an
... Show MoreSeveral remote sensor network (WSN) tasks require sensor information join. This in-processing Join is configured in parallel sensor hub to save battery power and limit the communication cost. Hence, a parallel join system is proposed for sensor networks. The proposed parallel join algorithm organizes in section-situated databases. A novel join method has been proposed for remote WSNs to limit the aggregate communication cost and enhance execution. This approach depends on two procedures; section-situated databases and parallel join algorithm utilized to store sensor information and speed up processing respectively. A segment arranged databases store information table in segmented shrewd. The Parallel-Joining WSN algorithm is effectively
... Show MoreDrought is a complex phenomenon that has severe impacts on the environment. Vegetation and its conditions are very sensitive to drought effects. This study aimed to monitor and assess the drought severity and its relationships to some ecological variables in ten districts of Erbil Governorate (Kurdistan Region), Iraq, throughout 20 years (1998-2017). The results revealed that droughts frequently hit Erbil throughout the study period. The Landsat time-series- based on Vegetation Condition Index (VCI) significantly correlated with precipitation, Digital Elevation Model (DEM), and latitude. Extreme VCI-based drought area percentages were recorded in 1999, 2000, 2008, and 2011 by 43.4%, 67.9%, 43.3%, and 40.0%, respe
... Show MoreThis paper concerns with the state and proof the existence and uniqueness theorem of triple state vector solution (TSVS) for the triple nonlinear parabolic partial differential equations (TNPPDEs) ,and triple state vector equations (TSVEs), under suitable assumptions. when the continuous classical triple control vector (CCTCV) is given by using the method of Galerkin (MGA). The existence theorem of a continuous classical optimal triple control vector (CCTOCV) for the continuous classical optimal control governing by the TNPPDEs under suitable conditions is proved.
The most common artifacts in ultrasound (US) imaging are reverberation and comet-tail. These are multiple reflection echoing the interface that causing them, and result in ghost echoes in the ultrasound image. A method to reduce these unwanted artifacts using a Otsu thresholding to find region of interest (reflection echoes) and output applied to median filter to remove noise. The developed method significantly reduced the magnitude of the reverberation and comet-tail artifacts. Support Vector Machine (SVM) algorithm is most suitable for hyperplane differentiate. For that, we use image enhancement, extraction of feature, region of interest, Otsu thresholding, and finally classification image datasets to normal or abnormal image.
... Show MoreRecently there has been an urgent need to identify the ages from their personal pictures and to be used in the field of security of personal and biometric, interaction between human and computer, security of information, law enforcement. However, in spite of advances in age estimation, it stills a difficult problem. This is because the face old age process is determined not only by radical factors, e.g. genetic factors, but also by external factors, e.g. lifestyle, expression, and environment. This paper utilized machine learning technique to intelligent age estimation from facial images using support vector machine (SVM) on FG_NET dataset. The proposed work consists of three phases: the first phase is image preprocessing include four st
... Show MoreIn this study, we have created a new Arabic dataset annotated according to Ekman’s basic emotions (Anger, Disgust, Fear, Happiness, Sadness and Surprise). This dataset is composed from Facebook posts written in the Iraqi dialect. We evaluated the quality of this dataset using four external judges which resulted in an average inter-annotation agreement of 0.751. Then we explored six different supervised machine learning methods to test the new dataset. We used Weka standard classifiers ZeroR, J48, Naïve Bayes, Multinomial Naïve Bayes for Text, and SMO. We also used a further compression-based classifier called PPM not included in Weka. Our study reveals that the PPM classifier significantly outperforms other classifiers such as SVM and N
... Show MoreAmong the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the
... Show More