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.
Most of the Internet of Things (IoT), cell phones, and Radio Frequency Identification (RFID) applications need high speed in the execution and processing of data. this is done by reducing, system energy consumption, latency, throughput, and processing time. Thus, it will affect against security of such devices and may be attacked by malicious programs. Lightweight cryptographic algorithms are one of the most ideal methods Securing these IoT applications. Cryptography obfuscates and removes the ability to capture all key information patterns ensures that all data transfers occur Safe, accurate, verified, legal and undeniable. Fortunately, various lightweight encryption algorithms could be used to increase defense against various at
... Show MoreDiagram of CFIA system: (A) Fe 3+ line; (B) SCN − line; (C) A.A carrier; (D) sample valve; (E) mixing/reaction coil quenched by A.A; (F) blue LED detector.
In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot
... Show MoreDirectional Compact Geographic Forwarding (DCGF) routing protocol promises a minimal overhead generation by utilizing a smart antenna and Quality of Service (QoS) aware aggregation. However, DCGF was tested only in the attack-free scenario without involving the security elements. Therefore, an investigation was conducted to examine the routing protocol algorithm whether it is secure against attack-based networks in the presence of Denial-of-Service (DoS) attack. This analysis on DoS attack was carried out using a single optimal attacker, A1, to investigate the impact of DoS attack on DCGF in a communication link. The study showed that DCGF does not perform efficiently in terms of packet delivery ratio and energy consumption even on a sin
... Show MoreThe present paper aims at evaluating the vailability quality and future horizons of potable water in the city of Shatra as a model. This is done in accordance with certain subjective and objective factors alongside the classification map of Shatra as a residential area. This system follows geographical studies specialized in urban construction. The problem of the present paper as well as the data approaching that problem have been chosen from the records of 2018. The researcher offered (919) questionnaire forms to be answered by a sample of dwellers in that area. Besides, the researcher also followed lab analysis of water samples collected from districts in the city of Shatra. GIS technology was also used to arrive at the real water shar
... Show MoreThe synthesized ligand [4-chloro-5-(N-(5,5-dimethyl-3-oxocyclohex-1-en-1-yl)sulfamoyl)-2-((furan-2-ylmethyl)amino)benzoic acid] (H2L1) was identified utilizing Fourier transform infrared spectroscopy (FT-IR), 1 H, 13 C – NMR, (C.H.N), Mass spectra, UVVis methods based on spectroscopy. To detect mixed ligand complexes, analytical and spectroscopic approaches such as micro-analysis, conductance, UV-Visible, magnetic susceptibility, and FT-IR spectra were utilized. Its mixed ligand complexes [M(L1)(Q)Cl2] [ where M= Co(II), Ni(II) , and Cd(II)] and complexes [Pd(L1)(Q)] and [Pt(L1)(Q)Cl2]; [H2L1] =β-enaminone ligand =L1 and Q= 8-Hydroxyquinoline = L2]. The results showed that the complexes were synthesised utilizing the molar ratio M: L1
... Show MoreIntended for getting good estimates with more accurate results, we must choose the appropriate method of estimation. Most of the equations in classical methods are linear equations and finding analytical solutions to such equations is very difficult. Some estimators are inefficient because of problems in solving these equations. In this paper, we will estimate the survival function of censored data by using one of the most important artificial intelligence algorithms that is called the genetic algorithm to get optimal estimates for parameters Weibull distribution with two parameters. This leads to optimal estimates of the survival function. The genetic algorithm is employed in the method of moment, the least squares method and the weighted
... Show More<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T
... Show MoreIn this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.