The economy is exceptionally reliant on agricultural productivity. Therefore, in domain of agriculture, plant infection discovery is a vital job because it gives promising advance towards the development of agricultural production. In this work, a framework for potato diseases classification based on feed foreword neural network is proposed. The objective of this work is presenting a system that can detect and classify four kinds of potato tubers diseases; black dot, common scab, potato virus Y and early blight based on their images. The presented PDCNN framework comprises three levels: the pre-processing is first level, which is based on K-means clustering algorithm to detect the infected area from potato image. The second level is features extraction which extracts features from the infected area based on hybrid features: grey level run length matrix and 1st order histogram based features. The attributes that extracted from second level are utilized in third level using FFNN to perform the classification process. The proposed framework is applied to database with different backgrounds, totally 120 color potato images, (80) samples used in training the network and the rest samples (40) used for testing. The proposed PDCNN framework is very effective in classifying four types of potato tubers diseases with 91.3% of efficiency.
This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t
... Show MoreThis research has discussed the origins of ESP, addressed key notions about ESP and examined issues in ESP syllabus design. The content of the paper was determined by a need identified based on my experience as an ESL instructor designing and delivering the content-based language program - Language Preparation for the Cadets and Employment in the Iraqi College of Police . These issues, where possible, have been supported by current and pertinent academic literature. It is my sincerest hope that these observations will lend insight into the challenges facing the ESL instructor acting as ESP syllabus developer.
The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m
... Show MoreThis research attempted to take advantage of modern techniques in the study of the superstructural phonetic features of spoken text in language using phonetic programs to achieve more accurate and objective results, far from being limited to self-perception and personal judgment, which varies from person to person.
It should be noted that these phonological features (Nabr, waqf, toning) are performance controls that determine the fate of the meaning of the word or sentence, but in the modern era has received little attention and attention, and that little attention to some of them came to study issues related to the composition or style Therefore, we recommend that more attention should be given to the study of
Let be an infinite dimensional separable complex Hilbert space and let , where is the Banach algebra of all bounded linear operators on . In this paper we prove the following results. If is a operator, then 1. is a hypercyclic operator if and only if D and for every hyperinvariant subspace of . 2. If is a pure, then is a countably hypercyclic operator if and only if and for every hyperinvariant subspace of . 3. has a bounded set with dense orbit if and only if for every hyperinvariant subspace of , .
