Building a system to identify individuals through their speech recording can find its application in diverse areas, such as telephone shopping, voice mail and security control. However, building such systems is a tricky task because of the vast range of differences in the human voice. Thus, selecting strong features becomes very crucial for the recognition system. Therefore, a speaker recognition system based on new spin-image descriptors (SISR) is proposed in this paper. In the proposed system, circular windows (spins) are extracted from the frequency domain of the spectrogram image of the sound, and then a run length matrix is built for each spin, to work as a base for feature extraction tasks. Five different descriptors are generated from the run length matrix within each spin and the final feature vector is then used to populate a deep belief network for classification purpose. The proposed SISR system is evaluated using the English language Speech Database for Speaker Recognition (ELSDSR) database. The experimental results were achieved with 96.46 accuracy; showing that the proposed SISR system outperforms those reported in the related current research work in terms of recognition accuracy.
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 study aimed at analyzing and studying the strategic and geopolitical importance of the Sahel region, which increased the regional competition for the resources of the region, especially the energy resources that have been and continue to be one of the axes of conflict and competition between these forces.
The researcher tried to review the competition between the international force, France, the United States of America, China, Algeria and Libya, and the African coast. We note that there is a positive correlation between the severity of the conflict and the intensity of the competition of the major powers to control the countries of the region and the extent of political and economic stability These countries are directly affecte
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 , .
