Parkinson’s disease (PD) is a chronic neurological condition causing an assortment of motor and cognitive prodromes. Each individual’s PD symptoms develop differently due to the variability of the ailment. This study aims to introduce the KNN Imputed Spearman’s Rank and Jaccard Convolutional Deep Neural Learning (KISRJCDNL) technique for automating early PD diagnosis depending on speech analysis. This work enhances disease diagnosis performance through preprocessing and early, precise PD detection. Several information collected from the given dataset are initially taken as input. Then, the preprocessing stage converts raw data into a structured format. Afterward, Spearman’s Rank Feature Selective and Jaccard Index–based Convolutional Deep Neural Learning Classifier with four layers, one input layer, one output layer, and two hidden layers, are deployed for diagnosing PD by efficiently performing the data classification. Experimental evaluation uses the Early Biomarkers of the PD dataset by different factors. Findings support the claim that the proposed KISRJCDNL technique enhances accuracy by 14%, reducing feature selection time, error rate, overall time, and space complexity by 16%, 43%, 36%, and 22% compared to the existing deep learning methods.

Cloud computing (CC) is a network‐based concept where users access data at a specific time and place. The CC comprises servers, storage, databases, networking, software, analytics, and intelligence. Cloud security is the cybersecurity authority dedicated to securing cloud computing systems. It includes keeping data private and safe across online‐based infrastructure, applications, and platforms. Securing these systems involves the efforts of cloud providers and the clients that use them, whether an individual, small‐to‐medium business, or enterprise uses. Security is essential for protecting data and cloud resources from malicious activity. A cloud service provider is utilized to provide secure data storage services. Data integrity is a critical issue in cloud computing. However, using data storage services securely and ensuring data integrity in these cloud servers remain an issue for cloud users. We introduce a unique piecewise regressive Kupyna cryptographic hash blockchain (PRKCHB) technique to secure cloud services with higher data integrity to solve these issues. The proposed PRKCHB method involves user registration, cryptographic hash blockchain, and regression analysis. Initially, the registration process for each cloud user is performed. After registering user particulars, Davies–Meyer Kupyna’s cryptographic hash blockchain generates the hash value of data in each block. When a user requests data from the server, a piecewise regression function is used to validate their identity. Furthermore, the Gaussian kernel function recognizes authorized or unauthorized users for secure cloud information transmission. The regression function results in original data by enhanced integrity in the cloud. An analysis of the proposed PRKCHB technique evaluates different existing methods implemented in Python. The results contain different metrics: data confidentiality rate, data integrity rate, authentication time, storage overhead, and execution time. Compared to conventional techniques, findings corroborate the assertion that the proposed PRKCHB technique improves data confidentiality and integrity by up to 9% and 9% while lowering storage overhead, authentication time, and execution time by 10%, 12%, and 12%.

Abstract Vehicularad hocnetworks (VANETs) can support a wide range of future cooperative safety and efficiency applications. However, the node density and high demand for wireless media in these networks can lead to theTimeslot Boundary Synchronization Problem, in which increased transmission collisions occur due to back‐off timer synchronization. This paper proposes an enhancement to the wireless access in vehicular environments (WAVE) communications architecture to address this problem, called RAndom Propagation Initiation Delay for the Distributed Coordination Function (RAPID DCF). The effectiveness of RAPID DCF is evaluated through simulations of both single‐hop and multi‐hop emergency messages. In these simulations, RAPID DCF was able to improve message delivery rates by as much as 35% and reduce multi‐hop message latency by as much as 18%. Copyright © 2010 John Wiley & Sons, Ltd.

In this paper, we present a data-driven approach for ranking association rules (ARs) based on interestingness. The occurrence of unrelated or weakly related item-pairs in an AR is interesting. In the retail market-basket context, items may be related through various relationships arising due to mutual interaction, 'substitutability' and 'complementarity.' Item-relatedness is a composite of these relationships. We introduce three relatedness measures for capturing relatedness between item-pairs. These measures use the concept of junction embedding to appropriately weigh the relatedness contributions due to complementarity and substitutability between items. We propose an interestingness coefficient by combining the three relatedness measures. We compare this with two objective measures of interestingness and show the intuitiveness of the proposed interestingness coefficient.