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 aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

    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

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages

Intrusion Detection Systems (IDS) is the main defense mechanism deployed by the current networks to prevent cyber threats. Recurrent Neural Network (RNN) are also a novel IDS structure that replaces the conventional training and testing mechanism. The strategy encodes network traffic data as biological sequences using amino acid codons in such a fashion that the RNN is capable of effectively analyzing temporal and sequence data patterns. RNN architecture design adopts embedding layers to handle codon representations and Long Short-Term Memory (LSTM) layers to perform sequential data learning, which is followed by a fully connected network to perform classification functions, which preserve high feature extraction and classification

The experiment was conducted in field of the University of Baghdad, Jadryia region, Baghdad to measure vibration and performance efficiency of grass mower (machine cutting grass). Vibration in three axes are longitudinal X , lateral Y and vertical Z in four places of mower machine during cutting grass and Practical Productivity, Efficiency and Fuel Consumption measured in this experiment . Factorial design (3 x 2) used, mower speeds included 1.9 3.6 and 6.4 km/hr and engine load included idling and full load according to randomized complete design were used in this experiment. Least Significant Design (LSD) 0.05 was used to compare the mean of treatment. Result were showed that the mower speed 6.4 km/hr recorded high productivity (0.6557 ha

Mobile ad-hoc networks (MANETs) are composed of mobile nodes communicating through wireless medium, without any fixed centralized infrastructure. Providing quality of service (QoS) support to multimedia streaming applications over MANETs is vital. This paper focuses on QoS support, provided by the stream control transmission protocol (SCTP) and the TCP-friendly rate control (TFRC) protocol to multimedia streaming applications over MANETs. In this study, three QoS parameters were considered jointly: (1) packet delivery ratio (PDR), (2) end-to-end delay, (3) and throughput. Specifically, the authors analyzed and compared the simulated performance of the SCTP and TFRC transport protocols for delivering multimedia streaming over MANETs.