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

     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

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

Abstract                                                         

The issue of the protection of the environment is a shared responsibility between several destinations and sectors, and constitutes a main subject in which they can achieve sustainable development. In the sectors of government programs can be set up towards the establishment of the government sector to the green environment, so to be the implementati

Static Synchronous Series Compensator (SSSC) is a well known device for effectively regulating the active power flow in a power system. In this paper, the SSSC linearized power flow equations are incorporated into Newton-Raphson algorithm in a MATLAB written program to investigate the control of active poweer flow and the transient stability of a five bus and a thirty bus IEEE test systems, during abnormal conduction (three phase fault near buses). A comparison of the results obtained for the base case without SSSC and with it to investigate the effectiveness of the device on both of the active power flow and the transient stability.

Background: Cytology is one of the important diagnostic tests done on effusion fluid. It can detect malignant cells in up to 60% of malignant cases. The most important benign cell present in these effusions is the mesothelial cell. Mesothelial atypia can be striking andmay simulate metastatic carcinoma. Many clinical conditions may produce such a reactive atypical cells as in anemia,SLE, liver cirrhosis and many other conditions. Recently many studies showed the value of computerized image analysis in differentiating atypical cells from malignant adenocarcinoma cells in effusion smears. Other studies support the reliability of the quantitative analysisand morphometric features and proved that they are objective prognostic indices. Method

          The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key