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 to detect complex biological communities with high quality. Secondly, the variability in the capability of PSO to extract community structure in biological networks is studied when different types of crossover operators are used. Finally, to reduce the computational time needed to solve this problem, especially when detecting complex communities in large-scale biological networks, we have implemented parallel computing to execute the algorithm. The performance of the proposed algorithm was tested and evaluated on two real biological networks. The experimental results showed the effective performance of the proposed algorithm when using single-point crossover operator, and its superiority over other counterpart algorithms. Moreover, the use of parallel computing in the proposed algorithm representation has greatly reduced the computational time required for its execution.
Over the past few decades, the surveying fieldworks were usually carried out based on classical positioning methods for establishing horizontal and vertical geodetic networks. However, these conventional positioning techniques have many drawbacks such as time-consuming, too costly, and require massive effort. Thus, the Global Navigation Satellite System (GNSS) has been invented to fulfill the quickness, increase the accuracy, and overcome all the difficulties inherent in almost every surveying fieldwork. This research assesses the accuracy of local geodetic networks using different Global Navigation Satellite System (GNSS) techniques, such as Static, Precise Point Positioning, Post Processing Kinematic, Session method, a
... Show MoreThe physical sports sector in Iraq suffers from the problem of achieving sports achievements in individual and team games in various Asian and international competitions, for many reasons, including the lack of exploitation of modern, accurate and flexible technologies and means, especially in the field of information technology, especially the technology of artificial neural networks. The main goal of this study is to build an intelligent mathematical model to predict sport achievement in pole vaulting for men, the methodology of the research included the use of five variables as inputs to the neural network, which are Avarage of Speed (m/sec in Before distance 05 meters latest and Distance 05 meters latest, The maximum speed achieved in t
... Show MoreTo ensure fault tolerance and distributed management, distributed protocols are employed as one of the major architectural concepts underlying the Internet. However, inefficiency, instability and fragility could be potentially overcome with the help of the novel networking architecture called software-defined networking (SDN). The main property of this architecture is the separation of the control and data planes. To reduce congestion and thus improve latency and throughput, there must be homogeneous distribution of the traffic load over the different network paths. This paper presents a smart flow steering agent (SFSA) for data flow routing based on current network conditions. To enhance throughput and minimize latency, the SFSA distrib
... Show MoreA range of macrocyclic dinuclear metal (II) dithiocarbamate-based complexes are reported. The preparation of complexes was accomplished from either mixing of the prepared ligand with a metal ion or through a template one-pot reaction. The preparation of the bisamine precursor was achieved through several synthetic steps. The free ligand; potassium 2,2'-(biphenyl-4,4'-diylbis(azanediyl))bis(1-chloro-2-oxoethane-2,1diyl)bis(cyclohexylcarbamodithioate) (L) was yielded from the addition of CS2 to a bis-amine precursor in KOH medium.A variety of analytical and physical methods were implemented to characterise ligand and its complexes. The analyses were based on spectroscopic techniques (FTIR, UV-Vis, mass spectroscopy and 1H, 13C-NMR sp
... Show MoreDetecting 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
... Show Moremajor goal of the next-generation wireless communication systems is the development of a reliable high-speed wireless communication system that supports high user mobility. They must focus on increasing the link throughput and the network capacity. In this paper a novel, spectral efficient system is proposed for generating and transmitting twodimensional (2-D) orthogonal frequency division multiplexing (OFDM) symbols through 2- D inter-symbol interference (ISI) channel. Instead of conventional data mapping techniques, discrete finite Radon transform (FRAT) is used as a data mapping technique due to the increased orthogonality offered. As a result, the proposed structure gives a significant improvement in bit error rate (BER) performance. Th
... Show MoreIn this paper, we employ the maximum likelihood estimator in addition to the shrinkage estimation procedure to estimate the system reliability (
An Optimal Algorithm for HTML Page Building Process
Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh
... Show More