Smart manufacturing is pivotal in the context of Industry 4.0, as it integrates advanced technologies like the Internet of Things (IoT) and automation to streamline production processes and improve product quality, paving the way for a competitive industrial landscape. Machines have become network-based through the IoT, where integrated and collaborated manufacturing system responds in real time to meet demand fluctuations for personalized customization. Within the network-based manufacturing system (NBMS), mobile industrial robots (MiRs) are vital in increasing operational efficiency, adaptability, and productivity. However, with the advent of IoT-enabled manufacturing systems, security has become a serious challenge because of the communication of various devices acting as mobile nodes. This paper proposes the framework for a newly personalized customization factory, considering all the advanced technologies and tools used throughout the production process. To encounter the security concern, an IoT-enabled NBMS is selected as the system model to tackle a black hole attack (BHA) using the NTRUEncrypt cryptography and the ad hoc on-demand distance-vector (AODV) routing protocol. NTRUEncrypt performs encryption and decryption while sending and receiving messages. The proposed technique is simulated by network simulator NS-2.35, and its performance is evaluated for different network environments, such as a healthy network, a malicious network, and an NTRUEncrypt-secured network based on different evaluation metrics, including throughput, goodput, end-to-end delay, and packet delivery ratio. The results show that the proposed scheme performs safely in the presence of a malicious node. The implications of this study are beneficial for manufacturing industries looking to embrace IoT-enabled subtractive and additive manufacturing facilitated by mobile industrial robots. Implementation of the proposed scheme ensures operational efficiency, enables personalized customization, and protects confidential data and communication in the manufacturing ecosystem.

Multiple sclerosis (MS) is a chronic and autoimmune disease that forms lesions in the central nervous system. Quantitative analysis of these lesions has proved to be very useful in clinical trials for therapies and assessing disease prognosis. However, the efficacy of these quantitative analyses greatly depends on how accurately the MS lesions have been identified and segmented in brain MRI. This is usually carried out by radiologists who label 3D MR images slice by slice using commonly available segmentation tools. However, such manual practices are time consuming and error prone. To circumvent this problem, several automatic segmentation techniques have been investigated in recent years. In this paper, we propose a new framework for automatic brain lesion segmentation that employs a novel convolutional neural network (CNN) architecture. In order to segment lesions of different sizes, we have to pick a specific filter or size 3 3 or 5 5. Sometimes, it is hard to decide which filter will work better to get the best results. Google Net has solved this problem by introducing an inception module. An inception module uses , , and max pooling filters in parallel fashion. Results show that incorporating inception modules in a CNN has improved the performance of the network in the segmentation of MS lesions. We compared the results of the proposed CNN architecture for two loss functions: binary cross entropy (BCE) and structural similarity index measure (SSIM) using the publicly available ISBI-2015 challenge dataset. A score of 93.81 which is higher than the human rater with BCE loss function is achieved.

Feature selection is critical in reducing the size of data and improving classifier accuracy by selecting an optimum subset of the overall features. Traditionally, each feature is given a score against a particular category (such as using Mutual Information) and the task of feature selection comes down to choosing the top k ranked features with the best average score across all categories. However, this approach has two major drawbacks. Firstly, the maximum or average score of a feature with a class might not necessarily determine its discriminating strength among samples of other classes. Secondly, most feature selection methods only use the scores to select the discriminating features from the corpus without taking into account the redundancy of information provided by the selected features. In this paper, we propose a new feature ranking score measure called the Discriminative Mutual Information (DMI) score. This score helps to select features that distinguish samples of one category against all other categories. Moreover, Non-Redundant Feature Selection (NRFS) heuristic is also proposed that explicitly takes the problem of feature redundancy into account when selecting the features set. The performance of our approach is investigated and compared with other feature selection techniques on datasets derived from high-dimensional text corpora using multiple classification algorithms. The results show that the proposed method leads to better classification micro-F1 score as compared to other state-of-the-art methods. In particular, the proposed method shows great improvement when the number of selected features are small as well as an overall higher robustness to label noise.

In this paper we introduce and evaluate a novel machine learning based approach to reduce the complexity of Intra macroblock (MB) coding. The proposed approach is based on the hypothesis that MB coding mode decisions in H.264/AVC video have a correlation with the intensities of adjacent MBs and sub-MBs. This paper also discusses and analyzes different approaches of using machine learning in Intra prediction. We discuss, amongst other features, slices, Intra prediction scheme for H.264 and data mining. We use data mining algorithms to develop decision trees for H.264 coding mode decisions. The proposed approach reduces the H.264/AVC MB mode computation process into a decision tree lookup with very low complexity. The proposed algorithm is implemented in reference software by modifying the source code and is compared with the JM reference software for H.264/AVC.