Detecting protein complexes in protein-protein interaction (PPI) networks is a challenging problem in computational biology. To uncover a PPI network into a complex structure, different meta-heuristic algorithms have been proposed in the literature. Unfortunately, many of such methods, including evolutionary algorithms (EAs), are based solely on the topological information of the network rather than on biological information. Despite the effectiveness of EAs over heuristic methods, more inherent biological properties of proteins are rarely investigated and exploited in these approaches. In this paper, we proposed an EA with a new mutation operator for complex detection problems. The proposed mutation operator is formulate

In the current study, two sites were selected from the city of Adhamiya, central Baghdad. The first site is the Adhamiya Corniche, which includes a sample of river water and the second includes domestic sewage in the same area. The total density of benthic invertebrates was 775 ind/m2, which is divided into 15 taxa. Biological indices were found, such as the stability index, the abundance index, the biodiversity index (Shannon’s index), the homogeneity index, and the invader’s guide. The result showed an increase in the density of benthic invertebrates, as well as an increase in the diversity of these organisms.

This study aims to reveal the similarities and differences between Iraqi and Malay university learners and their genders in producing the supportive moves of criticism. To this end, 30 Iraqi and 30 Malay university learners have participated in this study. A Discourse Completion Test (DCT) and a Focus Group Interview (FGI) are conducted to elicit responses from the participants. Nguyen’s (2005) classification of criticism supportive moves is adapted to code the data. The data are analysed qualitatively and quantitatively. Overall, the findings unveil that both groups use similar categories of supportive moves, but Iraqis produce more of these devices than Malays in their criticisms. Although both females and males of both groups use id

This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

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