Opportunistic routing has emerged as one of the prominent solutions for efficient data delivery in ad hoc networks especially in highly dynamic scenarios. Opportunistic routing uses the broadcasting nature of the wireless medium to increase the number of potential forwarding nodes in the network, thereby improving the delivery rate. But most of the proposed opportunistic routing protocols suffer from increased duplicate data forwarding at the intermediate nodes in the network which leads to increase in traffic and reduced efficiency. We propose a novel method which uses acknowledgements for controlling the data forwarding by intermediate nodes and thereby eliminating most of the duplicate forwarding in the network. Simulation results show that our proposed method is much more efficient that all the major existing opportunistic protocols.

The primary purpose of this study was to determine the prevalence of drug-drug interaction (DDI) and duplicate therapy in chronic patients in a completely random study population engaged in digital health apps. In this cross-sectional study, polypharmacy checks for 100 completely anonymous patients were analyzed for the occurrence of DDIs and duplicate therapy. Logistic regression models were used to identify factors associated with DDIs and duplicate therapy. DDIs and duplicate therapy prevalence were 34% and 33%, respectively. Chi-Square test discovered a significant association between the DDIs and duplicate therapy variables. Logistic regression models showed a strong association between the number of medications taken and higher odds of DDIs occurring in our population only. In conclusion, our study shows that polypharmacy is a determining factor for the occurrence of unwanted DDIs, and the prevalence of duplicate therapy and DDIs is around 33%, increasing an issue regarding patient safety and its burden to the healthcare system.

In recent decades, with the ever-growing scale of video data, near-duplicate videos continue to emerge. Data quality issue caused by near-duplicate videos is becoming more and more prominent, which has affected the application of normal videos. Although current studies on near-duplicate video detection can be helpful to uncover data quality issues for videos, they still lack a process of automatic merging for the video data represented by high-dimensional features, which are difficult to automatically clean the near-duplicate videos to improve data quality for video datasets. At present, there are few studies on near-duplicate video data cleaning. The existing studies have the sensitive problems of video data orderliness and clustering initial center under a condition that prior distribution is unknown, which seriously affect the accuracy of near-duplicate video data cleaning. To address the above issues, an automatic near-duplicate video data cleaning method based on a consistent feature hash ring is proposed in this paper. First, a residual network with convolutional block attention modules, a long short-term memory deep network, and an attention model are integrated to construct an RCLA deep network with the multi-headed attention mechanism to extract spatiotemporal features of video data. Then, a consistent feature hash ring is constructed, which can effectively alleviate the sensitivity of video data orderliness while providing a condition of near-duplicate video merging. To reduce the sensitivity of the initial cluster centers to results of near-duplicate video cleansing, an optimized feature distance-means clustering algorithm is constructed by utilizing a mountain peak function on a consistent feature hash ring, which can implement automatic cleaning of near-duplicate video data. Finally, experiments are conducted based on a commonly used dataset named CC_WEB_VIDEO and a coal mining video dataset. Compared with some existing works, simulation results demonstrate that the performance of the proposed method.