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

Community detection is one of the most fundamental applications in understanding the structure of complicated networks. Furthermore, it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships. Networking structures are highly sensitive in social networks, requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks. In addition, they miss out on accurately identifying clusters. Since single-objective optimization cannot always generate accurate and comprehensive results, as multi-objective optimization can.Therefore,we utilized two objective

The speech recognition system has been widely used by many researchers using different
methods to fulfill a fast and accurate system. Speech signal recognition is a typical
classification problem, which generally includes two main parts: feature extraction and
classification. In this paper, a new approach to achieve speech recognition task is proposed by
using transformation techniques for feature extraction methods; namely, slantlet transform
(SLT), discrete wavelet transforms (DWT) type Daubechies Db1 and Db4. Furthermore, a
modified artificial neural network (ANN) with dynamic time warping (DTW) algorithm is
developed to train a speech recognition system to be used for classification and recognition
purposes. T

The bandwidth requirements of telecommunication network users increased rapidly during the last decades. Optical access technologies must provide the bandwidth demand for each user. The passive optical access networks (PONs) support a maximum data rate of 100 Gbps by using the Orthogonal Frequency Division Multiplexing (OFDM) technique in the optical access network. In this paper, the optical broadband access networks with many techniques from Time Division Multiplexing Passive Optical Networks (TDM PON) to Orthogonal Frequency Division Multiplex Passive Optical Networks (OFDM PON) are presented. The architectures, advantages, disadvantages, and main parameters of these optical access networks are discussed and reported which have many ad

In this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained

Artificial Neural Networks (ANN) is one of the important statistical methods that are widely used in a range of applications in various fields, which simulates the work of the human brain in terms of receiving a signal, processing data in a human cell and sending to the next cell. It is a system consisting of a number of modules (layers) linked together (input, hidden, output). A comparison was made between three types of neural networks (Feed Forward Neural Network (FFNN), Back propagation network (BPL), Recurrent Neural Network (RNN). he study found that the lowest false prediction rate was for the recurrentt network architecture and using the Data on graduate students at the College of Administration and Economics, Univer

The topic of the research on the Observatory of the Walls on Jurisprudential Matters in the Hanafi Fiqh, by Imam San’a Allah bin Ali bin Khalil Al-Ala’iyya Wai al-Naqshbandi, al-Rumi, who died in 1137 AH, which includes seven chapters, the first section of it concerning division and related matters, and the second section in the adaptation It is the apportionment of benefits in common objects, the third section, which pertains to lines, surfaces, and bodies, the fourth section, which concerns the inclined wall and certification, and the fifth section, which concerns the provisions of the walls and its claims, and the sixth section, which concerns the door of roads and doors, the opening of the skylight, the sails of the wing, the can

Background: The Titanium and its alloys are suitable for dental implant and medical applications. Biocompatibility of the materials is a major factor in determining the success of the implant and has a great impact on their rate of osseointegration. The aim of this study was to evaluate the biocompatibility and cytotoxicity of Ti2AlC in comparison to CPTi & Ti6Al7Nb in rabbits. Materials and Methods: 10 male New Zealand White rabbits, weighing (2-2.5 kg), aged (10-12 months) were used in this study. Cylindrical implants were prepared from the study materials (CPTi, Ti6Al7Nb and Ti2AlC) with (8mm) height and (3mm) diameter for the evaluation of tissue response and disc specimens were prepared with (6 mm) diameter and (2 mm) thickness for ev

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi