Software defect prediction (SDP) in the initial period of the software development life cycle (SDLC) remains a critical and important assignment. SDP is essentially studied during few last decades as it leads to assure the quality of software systems. The quick forecast of defective or imperfect artifacts in software development may serve the development team to use the existing assets competently and more effectively to provide extraordinary software products in the given or narrow time. Previously, several canvassers have industrialized models for defect prediction utilizing machine learning (ML) and statistical techniques. ML methods are considered as an operative and operational approach to pinpoint the defective modules, in which moving parts through mining concealed patterns amid software metrics (attributes). ML techniques are also utilized by several researchers on healthcare datasets. This study utilizes different ML techniques software defect prediction using seven broadly used datasets. The ML techniques include the multilayer perceptron (MLP), support vector machine (SVM), decision tree (J48), radial basis function (RBF), random forest (RF), hidden Markov model (HMM), credal decision tree (CDT), K-nearest neighbor (KNN), average one dependency estimator (A1DE), and Naïve Bayes (NB). The performance of each technique is evaluated using different measures, for instance, relative absolute error (RAE), mean absolute error (MAE), root mean squared error (RMSE), root relative squared error (RRSE), recall, and accuracy. The inclusive outcome shows the best performance of RF with 88.32 average accuracy and 2.96 rank value, second-best performance is achieved by SVM with 87.99 average accuracy and 3.83 rank values. Moreover, CDT also shows 87.88 average accuracy and 3.62 rank values, placed on the third position. The comprehensive outcomes of research can be utilized as a reference point for new research in the SDP domain, and therefore, any assertion concerning the enhancement in prediction over any new technique or model can be benchmarked and proved.

The Internet of Energy (IoE) is a topic that industry and academics find intriguing and promising, since it can aid in developing technology for smart cities. This study suggests an innovative energy system with peer-to-peer trading and more sophisticated residential energy storage system management. It proposes a smart residential community strategy that includes household customers and nearby energy storage installations. Without constructing new energy-producing facilities, users can consume affordable renewable energy by exchanging energy with the community energy pool. The community energy pool can purchase any excess energy from consumers and renewable energy sources and sell it for a price higher than the feed-in tariff but lower than the going rate. The energy pricing of the power pool is based on a real-time link between supply and demand to stimulate local energy trade. Under this pricing structure, the cost of electricity may vary depending on the retail price, the number of consumers, and the amount of renewable energy. This maximizes the advantages for customers and the utilization of renewable energy. A Markov decision process (MDP) depicts the recommended power to maximize consumer advantages, increase renewable energy utilization, and provide the optimum option for the energy trading process. The reinforcement learning technique determined the best option in the renewable energy MDP and the energy exchange process. The fuzzy inference system, which takes into account infinite opportunities for the energy exchange process, enables Q-learning to be used in continuous state space problems (fuzzy Q-learning). The analysis of the suggested demand-side management system is successful. The efficacy of the advanced demand-side management system is assessed quantitatively by comparing the cost of power before and after the deployment of the proposed energy management system.

With the massive spike in the use of Online Social Network Sites (OSNSs) platforms such as Web 2.0, microblogs services and online blogs, etc., valuable information in the form of sentiment, thoughts, opinions, as well as epidemic outbreaks, etc. are transferred. With the OSNSs being widely accessible, this work aims at proposing a novel approach for disease (dengue or flu) detection based on social media posts. For this purpose, an automated approach is designed with the help of LSTM (Long Short Term Memory) and word embedding techniques. Then the performance of the proposed approach is validated using a set of standard evaluation matrices. In addition, the effectiveness of the selected models is evaluated with performance measurement techniques. The accuracy of the proposed research approach is evaluated using two word embedding techniques; Word2Vec with Skip-gram (SG) and Word2Vec with Continuous-bag-of-words (CBOW). Based on the results conducted in this paper the LSTM Word2Vec with CBOW achieved better results compared to LSTM with Word2Vec SG features embedding technique. Our findings prove that the proposed method yields 94% accuracy compared to state-of-the-art approaches. Consequently, LSTM performed better than other leading methods in the detection of disease-infected people in tweets. In the end, spatial analysis is performed to identify the disease infected region.

With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2‐based performance study, and the results show that CCBR outperforms ad hoc on‐demand distance vector (AODV) in terms of packet delivery ratio, end‐to‐end delay, and routing overhead by 4% to 9%.

Postquantum cryptography for elevating security against attacks by quantum computers in the Internet of Everything (IoE) is still in its infancy. Most postquantum based cryptosystems have longer keys and signature sizes and require more computations that span several orders of magnitude in energy consumption and computation time, hence the sizes of the keys and signature are considered as another aspect of security by green design. To address these issues, the security solutions should migrate to the advanced and potent methods for protection against quantum attacks and offer energy efficient and faster cryptocomputations. In this context, a novel security framework Lightweight Postquantum ID-based Signature (LPQS) for secure communication in the IoE environment is presented. The proposed LPQS framework incorporates a supersingular isogeny curve to present a digital signature with small key sizes which is quantum-resistant. To reduce the size of the keys, compressed curves are used and the validation of the signature depends on the commutative property of the curves. The unforgeability of LPQS under an adaptively chosen message attack is proved. Security analysis and the experimental validation of LPQS are performed under a realistic software simulation environment to assess its lightweight performance considering embedded nodes. It is evident that the size of keys and the signature of LPQS is smaller than that of existing signature-based postquantum security techniques for IoE. It is robust in the postquantum environment and efficient in terms of energy and computations.