Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

The aim of this paper is to derive a posteriori error estimates for semilinear parabolic interface problems. More specifically, optimal order a posteriori error analysis in the - norm for semidiscrete semilinear parabolic interface problems is derived by using elliptic reconstruction technique introduced by Makridakis and Nochetto in (2003). A key idea for this technique is the use of error estimators derived for elliptic interface problems to obtain parabolic estimators that are of optimal order in space and time.

Cefixime is an antibiotic useful for treating a variety ofmicroorganism infections. In the present work, tworapid, specific, inexpensive and nontoxic methods wereproposed for cefixime determination. Area under curvespectrophotometric and HPLC methods were depictedfor the micro quantification of Cefixime in highly pureand local market formulation. The area under curve(first technique) used in calculation of the cefiximepeak using a UV-visible spectrophotometer.The HPLC (2nd technique) was depended on thepurification of Cefixime by a C18 separating column250mm (length of column) × 4.6 mm (diameter)andusing methanol 50% (organic modifier) and deionizedwater 50% as a mobile phase. The isocratic flow withrate of 1 mL/min was applied, the temper

This paper presents a meta-heuristic swarm based optimization technique for solving robot path planning. The natural activities of actual ants inspire which named Ant Colony Optimization. (ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. A nonzero size for the mobile robot has been considered in the project by taking a tolerance around the obstacle to account for the actual size of the mobile robot. A new concept was added to standard Ant Colony Optimization (ACO) for further modifications. Simulations results, which carried out using MATLAB 2015(a) environment, prove that the suggested algorithm outperforms the standard version of AC