Corruption, in all its categories and forms, is regarded as the nowadays virus which has greatly spread in most institutes and society, a matter that cause a great waste of resources.

      According to the reports of international transparency Institute, Iraq is regarded as one of the greatest countries in corruption.

      Regardless of the reasons and forms of corruption, the retreat in work – values and ethics are the main reasons behind that.

      Being the main source of providing qualified staff "educators" for the working market, the high education institutes face great challenges in standing against corruption inside and outside

New speaker identification test’s feature, extracted from the differentiated form of the wave file, is presented. Differentiation operation is performed by an operator similar to the Laplacian operator. From the differentiated record’s, two parametric measures have been extracted and used as identifiers for the speaker; i.e. mean-value and number of zero-crossing points.

Through this study, the following has been proven, if  is an algebraically paranormal operator acting on separable Hilbert space, then  satisfies the ( ) property and  is also satisfies the ( ) property for all . These results are also achieved for  ( ) property.    In addition, we prove that for a polaroid operator with finite ascent then after the property ( ) holds for  for all.

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E

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

This paper introduces the Multistep Modified Reduced Differential Transform Method (MMRDTM). It is applied to approximate the solution for Nonlinear Schrodinger Equations (NLSEs) of power law nonlinearity. The proposed method has some advantages. An analytical approximation can be generated in a fast converging series by applying the proposed approach. On top of that, the number of computed terms is also significantly reduced. Compared to the RDTM, the nonlinear term in this method is replaced by related Adomian polynomials prior to the implementation of a multistep approach. As a consequence, only a smaller number of NLSE computed terms are required in the attained approximation. Moreover, the approximation also converges rapidly over a