Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

The knowledge related with lexical items can be realized as including relations of meaning a cross words. Words that share a similarity of meaning are called to be synonymous, and words that share a contrary of meaning are called to be antonymous. Both of them are universal linguistic phenomenon that exist in terms of linguistic system of every language. The present study aims at finding out areas of difficulty that Iraqi EFL learners encounter in the use of synonymy and antonymy, both on the recognition and production levels. Also tries to detect the main reasons behind such difficulties. A diagnostic test of two parts, namely, recognition and production, is designed. The test is built to include two linguistic phenomenon which are: synony

RA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2

The effect of the magnetic abrasive finishing (MAF) method on the temperature rise (TR), and material removal rate (MRR) has been investigated in this paper. Sixteen runs were to determine the optimum temperature in the contact area (between the abrasive powder and surface of workpiece) and the MRR according to Taguchi orthogonal array (OA). Four variable technological parameters (cutting speed, finishing time, working gap, and the current in the inductor) with four levels for each parameter were used, the matrix is known as a L16 (4⁴) OA. The signal to noise ratio (S/N) ratio and analysis of the variance (ANOVA) were utilized to analyze the results using (MINITAB17) to find the optimum condition and identify the significant p

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 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

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th