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.
Regarding the security of computer systems, the intrusion detection systems (IDSs) are essential components for the detection of attacks at the early stage. They monitor and analyze network traffics, looking for abnormal behaviors or attack signatures to detect intrusions in real time. A major drawback of the IDS is their inability to provide adequate sensitivity and accuracy, coupled with their failure in processing enormous data. The issue of classification time is greatly reduced with the IDS through feature selection. In this paper, a new feature selection algorithm based on Firefly Algorithm (FA) is proposed. In addition, the naïve bayesian classifier is used to discriminate attack behaviour from normal behaviour in the network tra
... Show More<span>Dust is a common cause of health risks and also a cause of climate change, one of the most threatening problems to humans. In the recent decade, climate change in Iraq, typified by increased droughts and deserts, has generated numerous environmental issues. This study forecasts dust in five central Iraqi districts using machine learning and five regression algorithm supervised learning system framework. It was assessed using an Iraqi meteorological organization and seismology (IMOS) dataset. Simulation results show that the gradient boosting regressor (GBR) has a mean square error of 8.345 and a total accuracy ratio of 91.65%. Moreover, the results show that the decision tree (DT), where the mean square error is 8.965, c
... Show MoreAn application of neural network technique was introduced in modeling the point efficiency of sieve tray, based on a
data bank of around 33l data points collected from the open literature.Two models proposed,using back-propagation
algorithm, the first model network consists: volumetric liquid flow rate (QL), F foctor for gas (FS), liquid density (pL),
gas density (pg), liquid viscosity (pL), gas viscosity (pg), hole diameter (dH), weir height (hw), pressure (P) and surface
tension between liquid phase and gas phase (o). In the second network, there are six parameters as dimensionless
group: Flowfactor (F), Reynolds number for liquid (ReL), Reynolds number for gas through hole (Reg), ratio of weir
height to hole diqmeter
In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of
... Show MoreHetero junctions are fabricated by depositing antimony (Sb) and Al films on n-type single crystal(c-Si) wafers by the method of vacuum evaporation with thickness (0.25µm), with rate of deposition equals to 2.77 Å/sec, all samples are annealed in a vacuum for one hour at 473K. The tests have shown that all the films have polycrystalline structure for all Sb films. The barrier heights in (Sb/c-Si) junction was found to be equal 0.825eV, but(Al/c-Si) junction ohmic contact. Current-voltage measurements confirm this behaviour.
Fluid-structure interaction method is performed to predict the dynamic characteristics of axial fan system. A fluid-structure interface physical environment method (monolithic method) is used to couple the fluid flow solver with the structural solver. The integration of the three-dimensional Navier-Stokes equations is performed in the time Doman, simultaneously to the integration of the three dimensional structural model. The aerodynamic loads are transfer from the flow to structure and the coupling step is repeated within each time step, until the flow solution and the structural solution have converged to yield a coupled solution of the aeroelastic set of equations. Finite element method is applied to solve numerically
... Show MoreIris recognition occupies an important rank among the biometric types of approaches as a result of its accuracy and efficiency. The aim of this paper is to suggest a developed system for iris identification based on the fusion of scale invariant feature transforms (SIFT) along with local binary patterns of features extraction. Several steps have been applied. Firstly, any image type was converted to grayscale. Secondly, localization of the iris was achieved using circular Hough transform. Thirdly, the normalization to convert the polar value to Cartesian using Daugman’s rubber sheet models, followed by histogram equalization to enhance the iris region. Finally, the features were extracted by utilizing the scale invariant feature
... Show MoreAudio classification is the process to classify different audio types according to contents. It is implemented in a large variety of real world problems, all classification applications allowed the target subjects to be viewed as a specific type of audio and hence, there is a variety in the audio types and every type has to be treatedcarefully according to its significant properties.Feature extraction is an important process for audio classification. This workintroduces several sets of features according to the type, two types of audio (datasets) were studied. Two different features sets are proposed: (i) firstorder gradient feature vector, and (ii) Local roughness feature vector, the experimentsshowed that the results are competitive to
... Show MoreThese days, the world is facing a global environmental and sustainability problem due to the increasing generation of large amounts of waste through construction and demolition work, which causes a serious problem for the environment. Therefore, this research was conducted to get rid of the waste disposal problems, including old glass and concrete, which were used as recycled fine aggregates. Seven different mixtures were prepared. The first mixture was with the used sand, which is glass sand, and it was adopted as a reference mixture (ORPC), and three mixtures were prepared for each of the recycled materials (waste concrete and glass) and partially replaced by glass sand in different proportions (25, 50, and 75) %. Some
... Show More