Abstract High utility itemset mining is a crucial research area that focuses on identifying combinations of itemsets from databases that possess a utility value higher than a user-specified threshold. However, most existing algorithms assume that the databases are static, which is not realistic for real-life datasets that are continuously growing with new data. Furthermore, existing algorithms only rely on the utility value to identify relevant itemsets, leading to even the earliest occurring combinations being produced as output. Although some mining algorithms adopt a support-based approach to account for itemset frequency, they do not consider the temporal nature of itemsets. To address these challenges, this paper proposes the Scented Utility Miner (SUM) algorithm that uses a reinduction strategy to track the recency of itemset occurrence and mine itemsets from incremental databases. The paper provides a novel approach for mining high utility itemsets from dynamic databases and presents several experiments that demonstrate the effectiveness of the proposed approach.

User authentication is a necessary mechanism to communicate securely for mobile networks. Recently, Xie et al. have discussed a three-factor authentication (3FA) scheme using elliptic curve cryptography (ECC) for mobile networks and claimed that it is secure even if the user's two factors are known to the attacker. However, in this paper, we cryptanalyse their scheme and find the offline password guessing and user impersonation attacks in it. We also propose a secure 3FA scheme for mobile networks using ECC by removing the weaknesses of their scheme. We show the formal security verification of the proposed scheme using the ProVerif tool. We discuss its informal security analysis to show that it is resistant to the various known attacks. We also present its performance analysis along with the related schemes in terms of computational cost and security features, and show that it offers more security features as compared to the related schemes.

Road detection and extraction have gained momentum in recent past years with crucial applications such as urban planning, autonomous driving, automated map update, providing aid to rescue missions, etc. The current methodologies generate the disconnected road segments, cause boundary loss, and also they are incapable of handling the imbalanced class distribution problems. In this paper, we propose a fully convolutional architecture, named as refined DSE-LinkNet, to extract the connected and precise road maps. We use a pre-trained encoder by combining the layers of the two very efficient and light-weight CNN models: DenseNet and SE-Net that makes the proposed model more expressive with faster convergence. We introduce a new module, Fusion block, in our architecture that enhances its precise localisation as well as classification ability by capturing multilevel as well as multiscale features. To address the imbalanced class distribution problem, a new aggregate loss function is proposed by integrating binary cross-entropy, Jaccard coefficient, and Lovasz sigmoid loss functions. The experiments are performed on a publicly available dataset, DeepGlobe Road Extraction Challenge 2018, to show its efficacy over the D-LinkNet, winner of DeepGlobe Challenge 2018, by achieving IoU of 0.69 with lesser number of parameters and better computational complexity.

The potential of the Internet-of-Medical-Things (IoMT) technology for interconnecting the biomedical sensors in e-health has ameliorated the people's living standards. Another technology recognized in the recent e-healthcare is outsourcing the medical data to the cloud. There are, however, several stipulations for adopting these two technologies. The most difficult is the privacy of medical data and the challenge resulting from the resource constraint environment of sensor devices. In this article, we present the state-of-the-art secure and efficient cloud-centric IoMT-enabled smart healthcare system with public verifiability. The system novelty implements an escrow-free identity-based aggregate signcryption (EF-IDASC) scheme to secure data transmission, which is also proposed in this article. The proposed smart healthcare system fetches the medical data from multiple sensors implanted on the patient's body, signcrypts and aggregates them under the proposed EF-IDASC scheme, and outsources the data on the medical cloud server via smartphone. The system does not reveal any information about the identity and medical data of the patient. We further analyze the performance of the proposed smart healthcare system in terms of energy consumption. Moreover, we compare the performance of the proposed EF-IDASC scheme with other related schemes.

Abstract In this paper, we propose a robust median filtering detection scheme utilizing the conditional joint distribution of high‐order differences. The higher‐order differences provide additional information about the correlation between a pixel and its neighbors. The relationship between a pixel and its neighbors becomes more prominent in median‐filtered images as compared with non‐median filtered images. We evaluate the performance of our method and compare it with the state of the art median filtering detection techniques on multiple databases in various environments. We use a linear discriminant classifier based on Moore–Penrose pseudoinverse matrix for classifying the median and non‐median filtered images. Experimentally, we find that our method is more effective for all types of images including uncompressed and highly compressed JPEG low‐resolution images. We also evaluate the performance of our method on Gaussian‐filtered, averaging‐filtered, and median‐filtered images of the BOWS2 and UCID databases. Copyright © 2016 John Wiley & Sons, Ltd.

Among all the data broadcasting schemes, the harmonic scheme has been reported to provide the best performance for user latency; however, it does not always deliver the video data to the users in time. To provide the video data reliably, its two main variants, i.e., cautious and quasi-harmonic schemes have been proposed. These variants require a video to be divided into large number of subsegments that leads to a problem of management complexity. Besides the manageability problem, these variants require more bandwidth than the original harmonic scheme. The cautious and the quasi-harmonic schemes need, respectively, 0.50*b and 0.1771*b more bandwidth than the original harmonic scheme in limiting case. In this paper, we propose a new broadcasting scheme that is named as the geometrico-harmonic scheme. This scheme provides the video data to the users in time unlike the original harmonic scheme, and also its bandwidth requirement is very much same as that of the original harmonic scheme. In comparison to the cautious and the quasi-harmonic schemes, it has better performance for the user latency and the buffer space. For disk transfer rate, its performance is same as that of the cautious harmonic scheme, but in comparison the quasi-harmonic scheme, it performs better

The harmonic broadcasting scheme has the best performance for the user latency. It, however, does not always provide the video data in time to the users. To provide the video data reliably, its two main variants - cautious and quasi-harmonic schemes have been proposed. They require more bandwidth than the harmonic scheme. The cautious and quasi-harmonic schemes need 0.50 b and 0.1771 b more bandwidth, respectively, than the harmonic scheme in limiting case. In this paper, a new broadcasting scheme: geometrico-harmonic scheme with continuous redundancy is proposed. This scheme provides the video data in time unlike the harmonic scheme, and its bandwidth requirement can be had as close to that of the harmonic scheme as we please. Moreover, the extra bandwidth required in this scheme can be evaluated at any point of time, that is, it can be estimated for a fractional size of a segment and/or subsegment. The bandwidth is a scarce resource and its requirement for any fractional size of segments (or subsegments) may be helpful while dealing with the variable bandwidth rate-encoded videos. In the proposed scheme, the user latency can be made arbitrarily close to that of the harmonic scheme. In comparison to the cautious and the quasi-harmonic schemes, it has better performance for the user latency as well as the buffer storage. For disk transfer rate, it performs better than the quasi-harmonic scheme and in comparison to the cautious harmonic scheme its performance is same