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

This study measured and analyzed job satisfaction among faculty members at the university of Irbid College in relation to gender social status, years of experience, academic rank , qualification, the population consisted of 110 full-time Jordanian factually members. A total of 72. (61%) factually, members participated in this study. The research instrument which was developed by the researcher consisted of tow parts: personal information and the job Satisfaction Questionnaire Frequencies, percentages, means and one-way analyses of variance were employed to analyze the data. The level of significance was set at 0.05. A Secheffe method of multiple comparisons was used for follow-up investigation.      

Artificial Intelligence Algorithms have been used in recent years in many scientific fields. We suggest employing artificial TABU algorithm to find the best estimate of the semi-parametric regression function with measurement errors in the explanatory variables and the dependent variable, where measurement errors appear frequently in fields such as sport, chemistry, biological sciences, medicine, and epidemiological studies, rather than an exact measurement.

Praise be to God, who created people from one soul, and made her husband, and prayers and peace be upon His Messenger, Mercy given and the grace given, and on a machine and companions pure. Divorce cases have increased in recent years in a worrying manner, especially since divorce has unforeseen consequences at the individual and social levels. The source of concern stems from the fact that the cohesion and integrity of society starts from a family as it is the cornerstone of the social structure, which is the foundation upon which the large society is based. Marital life may suffer from problems and obstacles that are difficult to solve, so the man presents the divorce of his wife and that the phenomenon of divorce is not a result of it, b

In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.

In this paper, a method for hiding cipher text in an image file is introduced . The
proposed method is to hide the cipher text message in the frequency domain of the image.
This method contained two phases: the first is embedding phase and the second is extraction
phase. In the embedding phase the image is transformed from time domain to frequency
domain using discrete wavelet decomposition technique (Haar). The text message encrypted
using RSA algorithm; then Least Significant Bit (LSB) algorithm used to hide secret message
in high frequency. The proposed method is tested in different images and showed success in
hiding information according to the Peak Signal to Noise Ratio (PSNR) measure of the the
original ima

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

In this paper, we introduce a class of operators on a Hilbert space namely quasi-posinormal operators that contain properly the classes of normal operator, hyponormal operators, M–hyponormal operators, dominant operators and posinormal operators . We study some basic properties of these operators .Also we are looking at the relationship between invertibility operator and quasi-posinormal operator .