Search

A great amount of data is being created these days, which is kept in massive datasets with different irrelevant attributes that are unrelated to the goal notion. Feature selection deals with the selection of the most pertinent features that also aid to increase the classification accuracy. The topic of feature selection is viewed as a multiobjective optimization problem with two goals: improving the classification accuracy and reducing the number of features used. Drone Squadron Optimization (DSO) is one of the most recent artifact-inspired optimization algorithms; having two key components: semi-autonomous drones that hover over a terrain and a command center that manages the drones. In this paper, two binary variants of the DSO are proposed to deal with the feature selection problem. The proposed binary algorithms are applied on 21 different benchmark datasets with five state-of-the-art algorithms, i.e., Grey Wolf Optimizer (GWO), Particle Swarm Optimization (PSO), Flower Pollination Algorithm (FPA), Genetic Algorithm (GA) and Ant Lion Optimization (ALO). Different assessment indicators are used to assess the diversification and intensification of the optimization algorithms. When compared to current state-of-the-art wrapper-based algorithms, the suggested binary techniques are more efficient in scanning the dimension space and picking the most useful characteristics for categorization tasks, resulting in the lowest classification error rate.

Opportunistic networks (OppNet) a new paradigm emerges after the great advancement of wireless technology and MANETs (Mobile Ad-hoc Networks). Store-Carry-forward phenomena is used to route the messages in OppNets; therefore, it is called delay tolerant network (DTNs). OppNet is such a heterogeneous flexible network that works in hurricane affected regions and volcanoes environment. The objective of this article is to determine, evaluate, elect and synthesize all terrific quality research work on the basis of Research Questions (RQ) which is significant to use for opportunistic routing. Systematic literature review on state-of-the-art researches on routing protocols are presented with comparative analysis. To eliciting relevant work for review, advanced exploration is conducted on contrasting digital libraries. This work gives the opportunity to the readers to understand what has been done in field of Opportunistic Routing (OR), what parameters effect the performance of protocol, name of the organization; who works in this field. At last, issues, challenges, and upcoming future terms of this network are discussed.

Assuring the coverage towards the predefined set of targets, power-constrained wireless sensor networks (WSNs) consist of sensing devices (i.e., sensor nodes) that are associated with limited battery life and fixed sensing range. All the sensors are collectively responsible for covering these sets of objects. The standard target coverage problem is the one where continuous coverage is provided over a predefined set of targets for the maximum possible duration so that the scarce resource (battery power) can be optimally utilized. Therefore, in order to incorporate quality of service (QoS) in the network and ensure smooth monitoring of the desired target set, the paper addresses target Q-Coverage, which is one of the variants of standard target coverage problem where a target is covered by at least Q-sensors (pre-defined number) in every cover set. A cover set is a subset of sensors which cover whole targets in a single iteration. In this paper, a greedy heuristic based technique, i.e., maximum coverage small lifetime (MCSL) has been proposed, which restricts the usages of those sensors that poorly cover targets and promotes the usage of those sensors that have maximum coverage and energy. Simulations are performed on static wireless sensor network with varying Q values to test the efficiency of the proposed method. The performance of the proposed heuristic is compared with optimal upper bound based on network lifetime, and results prove that performance is improvised by 94%. The obtained results are further compared with the existing approaches to prove the superiority of the proposed work via extensive experimentations.

In recent days, unmanned aerial vehicles (UAVs) becomes more familiar because of its versatility, automation abilities, and low cost. Dynamic scene classification gained significant interest among the UAV-based surveillance systems, e.g., high-voltage power line and forest fire monitoring, which facilitate the object detection, tracking process and drastically enhances the outcome of visual surveillance. This paper proposes a new optimal deep learning-based scene classification model captured by UAVs. The proposed model involves a residual network-based features extraction (RNBFE) which extracts features from the diverse convolution layers of a deep residual network. In addition, the several parameters in RNBFE lead to many configuration errors due to manual parameter tuning. So, self-adaptive global best harmony search (SGHS) algorithm is employed for tuning the parameters of the RNBFE. The resultant feature vectors undergo classification by the use of latent variable support vector machine (LVSVM) model. The presented optimal RNBFE (ORNBFE) model has been tested using two open access datasets namely UC Merced (UCM) Land Use Dataset and WHU-RS Dataset. The presented technique attains maximum scene classification accuracy over the other recently proposed methods.

Amalgamation of Re-Charging and Load Balancing are introduced here to overcome the problem of quick battery energy depletion and jamming in Wireless Sensor Networks. The primary approach (Re-Charging) is to maintain the desired energy level at each node in the network. The second method guarantees jamming-free communication in the network. To maintain the required energy level of the nodes, the SenCar visits the chosen anchor point along the pre-defined trajectory. At the chosen point, SenCar tests all the nodes within its coverage and re-energize all the nodes that have the energy level below the threshold value (3 Joules). Then, the SenCar moves on to the next anchor point and so on until the pre-defined trajectory completes. Finally, the implementation of the proposed mechanism proves the performance enhancement of Wireless Sensor Networks in terms of Throughput, Energy Level, and Packet Delivery Ratio.

3D face reconstruction is considered to be a useful computer vision tool, though it is difficult to build. This paper proposes a 3D face reconstruction method, which is easy to implement and computationally efficient. It takes a single 2D image as input, and gives 3D reconstructed images as output. Our method primarily consists of three main steps: feature extraction, depth calculation, and creation of a 3D image from the processed image using a Basel face model (BFM). First, the features of a single 2D image are extracted using a two-step process. Before distinctive-features extraction, a face must be detected to confirm whether one is present in the input image or not. For this purpose, facial features like eyes, nose, and mouth are extracted. Then, distinctive features are mined by using scale-invariant feature transform (SIFT), which will be used for 3D face reconstruction at a later stage. Second step comprises of depth calculation, to assign the image a third dimension. Multivariate Gaussian distribution helps to find the third dimension, which is further tuned using shading cues that are obtained by the shape from shading (SFS) technique. Thirdly, the data obtained from the above two steps will be used to create a 3D image using BFM. The proposed method does not rely on multiple images, lightening the computation burden. Experiments were carried out on different 2D images to validate the proposed method and compared its performance to those of the latest approaches. Experiment results demonstrate that the proposed method is time efficient and robust in nature, and it outperformed all of the tested methods in terms of detail recovery and accuracy.

Software-Defined Network (SDN) has become a promising network architecture in current days that provide network operators more control over the network infrastructure. The controller, also called as the operating system of the SDN, is responsible for running various network applications and maintaining several network services and functionalities. Despite all its capabilities, the introduction of various architectural entities of SDN poses many security threats and potential targets. Distributed Denial of Services (DDoS) is a rapidly growing attack that poses a tremendous threat to the Internet. As the control layer is vulnerable to DDoS attacks, the goal of this paper is to detect the attack traffic, by taking the centralized control aspect of SDN. Nowadays, in the field of SDN, various machine learning (ML) techniques are being deployed for detecting malicious traffic. Despite these works, choosing the relevant features and accurate classifiers for attack detection is an open question. For better detection accuracy, in this work, Support Vector Machine (SVM) is assisted by kernel principal component analysis (KPCA) with genetic algorithm (GA). In the proposed SVM model, KPCA is used for reducing the dimension of feature vectors, and GA is used for optimizing different SVM parameters. In order to reduce the noise caused by feature differences, an improved kernel function (N-RBF) is proposed. The experimental results show that compared to single-SVM, the proposed model achieves more accurate classification with better generalization. Moreover, the proposed model can be embedded within the controller to define security rules to prevent possible attacks by the attackers.

Recently, the increase in inexpensive and compact unmanned aerial vehicles (UAVs) and light-weight imaging sensors has led to an interest in using them in various remote sensing applications. The processes of collecting, calibrating, registering, and processing data from miniature UAVs and interpreting the data semantically are time-consuming. In UAV aerial imagery, learning effective image representations is central to the scene classification process. Earlier approaches to the scene classification process depended on feature coding methods with low-level hand-engineered features or unsupervised feature learning. These methods could produce mid-level image features with restricted representational abilities, which generally yielded mediocre results. The development of convolutional neural networks (CNNs) has made image classification more efficient. Due to the limited resources in UAVs, it is hard to fine-tune the hyperparameters and the trade-offs between classifier results and computation complexity. This paper introduces a new multi-objective optimization model for evolving state-of-the-art deep CNNs for scene classification, which generates the non-dominant solutions in an automated way at the Pareto front. We use a set of two benchmark datasets to test the performance of the scene classification model and make a detailed comparative study. The proposed method attains a very low computational time of 80 sec and maximum accuracy of 97.88% compared to all other methods. The proposed method is found to be appropriate for the effective scene classification of images captured by UAVs.

Assessment of code smell for predicting software change proneness is essential to ensure its significance in the area of software quality. While multiple studies have been conducted in this regard, the number of systems studied and the methods used in this paper are quite different, thus, causing confusion for understanding the best methodology. The objective of this paper is to approve the effect of code smell on the change inclination of a specific class in a product framework. This is the novelty and surplus of this work against the others. Furthermore, this paper aims to validate code smell for predicting class change proneness to find an error in the prediction of change proneness using code smell. Six typical machine learning algorithms (Naive Bayes Classifier, Multilayer Perceptron, LogitBoost, Bagging, Random Forest, and Decision Tree) have been used to predict change proneness using code smell from a set of 8200 Java classes spanning 14 software systems. The experimental results suggest that code smell is indeed a powerful predictor of class change proneness with multilayer perceptron being the most effective technique. The sensitivity and specificity values for all the models are well over 70% with a few exceptions.