检索结果-内蒙古大学图书馆

A user-adaptive privacy-preserving authentication of IoMT using zero knowledge proofs with ECC

Multimedia Tools and Applications 2025年 1-32页

作者： Misra, Garima Hazela, Bramah Chaurasia, Brijesh Kumar Department of Computer Science and Engineering Amity School of Engineering and Technology Lucknow Amity University Uttar Pradesh India Department of Computer Science & Engineering Pranveer Singh Institute of Technology Utter Pradesh Kanpur India

The Internet of Things (IoT) has developed into a crucial component for meeting the connection needs of the current smart healthcare systems. The Internet of Medical Things (IoMT) consists of medical devices that are connected to patients in order to sense their medical parameters and exchange that information with healthcare professionals so they can deliver remote healthcare services. The need to protect the patient’s private information from being misused makes IoMT security an urgent issue that merits further study. Elliptic Curve cryptography (ECC), a popular substitute for traditional public key encryption like RSA, has several advantages. ECC is a prime contender for implementation on constrained devices with confined memory and speed, as well as wireless communication protocols that use low power like IoMT environment. The economic complexity of the current security protocols makes them inappropriate, hence new security protocols must be developed for resource-constrained and diverse IoT networks. This work suggests an authenticated key agreement protocol for the IoMT that is based on elliptic curve encryption based zero-knowledge proof (ZKP) protocols. The proposed mechanism completes in order of milliseconds up to 300 ms for 160 bits. The research will include the comparison between computational delays in traditional protocols and ZKP-ECC protocol. This paper provides a protocol to obtain privacy of data in IoMT environment on the basis of zero knowledge phenomenon and anonymous communication by ZKP-ECC. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Renaissance of Fuzzy and Fast Matching Entity with DSHS Algorithm

引用

SN computer science 2024年第6期5卷 734页

作者： Kari, Venkatram Amalanathan, Geetha Mary School of Computer Science and Engineering Vellore Institute of Technology University

Entity matching is a crucial aspect of data management systems, requiring the identification of real-world entities from diverse expressions. Despite the human ability to recognize equivalences among entities, machines struggle due to variations in expression. This challenge underscores the necessity for a robust framework capable of matching entities based on their attributes. While previous studies have explored transformation techniques, NLP, and deep learning, they often fall short in accuracy and scalability or overlook internal constraints. Such shortcomings result in costly rework and compromised business decisions. To address these issues, proposed “Deep Semantic Homophonic Synonymy” (DSHS) algorithm, a hybrid approach integrating rule-based, NLP, and deep learning techniques. By employing semantic matching, rule-based preprocessing, NLP enrichment, phonetic analysis, abbreviation variations, and spelling corrections, the DSHS algorithm effectively overcomes entity matching challenges. This solution, comprising six modules including Preprocessing, Transformation, Translation, Word Embedding, Attribute Similarity, and Classification, outperforms existing EM models in terms of accuracy and scalability. This solution is a comprehensive entity matching, offering significant advancements in the field and providing a reliable framework for resolving complex matching requirements. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2024.

关键词： Data pipeline Data sync up MDDR Message queue Schema registry

来源：评论

学校读者我要写书评

暂无评论

Continuous Query-based Data Trading

引用

Performance Evaluation Review 2024年第1期52卷 73-74页

作者： Cheng, Jin Ding, Ningning Lui, John C.S. Huang, Jianwei School of Science and Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society The Chinese University of Hong Kong Shenzhen Shenzhen China Department of Electrical and Computer Engineering Northwestern University Evanston United States Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Hong Kong

In the era of big data, traditional data trading methods designed for one-time queries on static databases fail to meet the demands of continuous query-based trading on streaming data, often resulting in repeated and inaccurate charges due to neglecting computation sharing in continuous query execution. To address this, we introduce CQTrade, the first trading framework tailored for continuous queries, which incorporates computation sharing across different time windows and queries, enhancing integration with existing trading systems. Our contributions include a theoretical analysis of computation-sharing techniques, the development of a general optimization problem to maximize seller revenue adaptable to various techniques, and the proposal of a branch-and-price algorithm to handle the problem's complexity. Our evaluation shows that the proposed framework improves the success rate of data trading by 12.8% and boosts the seller's revenue by an average of 28.7%, compared to the one-time query-based data trading methods used in the current data market. © 2024 Owner/Author.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Automatic lung cancer detection using hybrid particle snake swarm optimization with optimized mask RCNN

引用

Multimedia Tools and Applications 2024年第31期83卷 76807-76831页

作者： Sudha, R. Maheswari, K. M. Uma Department of Computer Science and Engineering School of computing College of engineering and technology SRM Institute of Science and Technology Kattankulathur India Department of Computing Technologies School of Computing College of engineering and technology SRM Institute of Science and Technology Kattankulathur India

As a result of its aggressive nature and late identification at advanced stages, lung cancer is one of the leading causes of cancer-related deaths. Lung cancer early diagnosis is a serious and difficult challenge that is crucial to a person's survival. The first diagnosis of the malignant nodules is typically made using chest radiography (X-rays) and computed tomography (CT) scans;however, the potential presence of benign nodules results in incorrect conclusions. The early phases of both benign and malignant nodules exhibit striking similarities. In this paper, a novel deep learning-based model is proposed for the precise diagnosis of malignant nodules. The proposed approach consists of two stages namely, pre-processing and lung nodule detection. Initially, the Lung CT scan images are collected from the dataset. Then, to remove the noise present in the input image, we apply an adaptive median filter. Then, to enhance the image, Contrast Limited Adaptive Histogram Equalization (CLAHE) is applied. After pre-processing, the image is given to the optimized mask RCNN classifier to detect the malignant and benign nodules. To enhance the performance of the Mask RCNN classifier, the hyper-parameters are optimally selected using hybrid particle snake swarm optimization (PS2OA). The proposed PS2OA is a hybridization of particle swarm optimization (PSO) and snake swarm optimization (SSO). The performance of the proposed approach is analyzed based on different metrics and effectiveness compared with state-of-the-art works. The proposed approach attained the maximum accuracy of 97.67%. This work aimed at assisting radiologists to detect and diagnose small-size pulmonary nodules more accurately. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Research on lightweight pavement disease detection model based on YOLOv7

引用

Journal of Intelligent and Fuzzy Systems 2024年第4期46卷 10573-10589页

作者： Wang, Chishe Li, Jun Wang, Jie Zhao, Weikang School of Computer Science and Engineering Anhui University of Science and Technology Huainan China Jinling Institute of Technology Nanjing China

Rapid urbanization has made road construction and maintenance imperative, but detecting road diseases has been time-consuming with limited accuracy. To overcome these challenges, we propose an efficient YOLOv7 road disease detection model. Our approach involves integrating MobilieNetV3 as the backbone feature extraction network to reduce the network's parameters and computational requirements. Additionally, we introduce the BRA attention module into the spatial pyramid pooling module to eliminate redundant information and enhance the network's feature representation capability. Moreover, we utilize the F-ReLU activation function in the backbone network, expanding the convolutional layers' receptive field range. To optimize the model's boundary loss, we employ the Wise-IoU loss function, which places more emphasis on the quality of ordinary samples and enhances the overall performance and generalization ability of the network. Experimental results demonstrate that our improved detection algorithm achieves a higher recall rate and mean average precision (mAP) on the public dataset (RDD) and the NJdata dataset in Nanjing's urban area. Specifically, compared to YOLOv7, our model increases the recall rate and mAP on RDD by 3.3% and 2.6%, respectively. On the NJdata dataset, our model improves the recall rate and mAP by 1.9% and 1.3%, respectively. Furthermore, our model reduces parameter and computational requirements by 30% and 22.5%, respectively, striking a balance between detection accuracy and speed. In conclusion, our road disease detection model presents an effective solution to address the challenges associated with road disease detection in urban areas. It offers improved accuracy, efficiency, and generalization capabilities compared to existing models. © 2024 - IOS Press. All rights reserved.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

Domain generalization with semi-supervised learning for people-centric activity recognition

引用

science China(Information sciences) 2025年第1期68卷 171-188页

作者： Jing LIU Wei ZHU Di LI Xing HU Liang SONG Academy for Engineering & Technology Fudan University Shanghai East-bund Research Institute on Networking Systems of AI School of Optoelectronic Information and Computer Engineering University of Shanghai for Science & Technology

People-centric activity recognition is one of the most critical technologies in a wide range of real-world applications,including intelligent transportation systems, healthcare services, and brain-computer interfaces. Large-scale data collection and annotation make the application of machine learning algorithms prohibitively expensive when adapting to new tasks. One way of circumventing this limitation is to train the model in a semi-supervised learning manner that utilizes a percentage of unlabeled data to reduce the labeling burden in prediction tasks. Despite their appeal, these models often assume that labeled and unlabeled data come from similar distributions, which leads to the domain shift problem caused by the presence of distribution gaps. To address these limitations, we propose herein a novel method for people-centric activity recognition,called domain generalization with semi-supervised learning(DGSSL), that effectively enhances the representation learning and domain alignment capabilities of a model. We first design a new autoregressive discriminator for adversarial training between unlabeled and labeled source domains, extracting domain-specific features to reduce the distribution gaps. Second, we introduce two reconstruction tasks to capture the task-specific features to avoid losing information related to representation learning while maintaining task-specific consistency. Finally, benefiting from the collaborative optimization of these two tasks, the model can accurately predict both the domain and category labels of the source domains for the classification task. We conduct extensive experiments on three real-world sensing datasets. The experimental results show that DGSSL surpasses the three state-of-the-art methods with better performance and generalization.

关键词： activity recognition deep learning domain generalization semi-supervised learning adversarial training

来源：评论

学校读者我要写书评

暂无评论

Support vector machine with discriminative low-rank embedding

引用

CAAI Transactions on Intelligence Technology 2024年第5期9卷 1249-1262页

作者： Guangfei Liang Zhihui Lai Heng Kong Computer Vision Institute College of Computer Science and Software EngineeringShenzhen UniversityShenzhenChina Shenzhen Institute of Artificial Intelligence and Robotics for Society ShenzhenChina Department of Breast and Thyroid Surgery BaoAn Central Hospital of ShenzhenShenzhenChina

Support vector machine(SVM)is a binary classifier widely used in machine ***,neglecting the latent data structure in previous SVM can limit the performance of SVM and its *** address this issue,the authors propose a novel SVM with discriminative low-rank embedding(LRSVM)that finds a discriminative latent low-rank subspace more suitable for SVM *** extension models of LRSVM are introduced by imposing different orthogonality constraints to prevent computational inaccuracies.A detailed derivation of the authors’iterative algorithms are given that is essentially for solving the SVM on the low-rank ***,some theorems and properties of the proposed models are presented by the *** is worth mentioning that the subproblems of the proposed algorithms are equivalent to the standard or the weighted linear discriminant analysis(LDA)*** indicates that the projection subspaces obtained by the authors’algorithms are more suitable for SVM classification compared to those from the LDA *** convergence analysis for the authors proposed algorithms are also ***,the authors conduct experiments on various machine learning data sets to evaluate the *** experiment results show that the authors’algorithms perform significantly better than other algorithms,which indicates their superior abilities on classification tasks.

关键词： iterative methods machine leaning support vector machunes

来源：评论

学校读者我要写书评

暂无评论

Exploring diversity and time-aware recommendations: an LSTM-DNN model with novel bidirectional dynamic time warping algorithm

引用

Soft Computing 2025年第4期29卷 2003-2013页

作者： Li, Te Chen, Liqiong Sun, Huaiying Hou, Mengxia Lei, Yunjie Zhi, Kaiwen School of Computer and Engineering East China University of Science and Technology Meilong road Shanghai200237 China School of Computer Science and Information Engineering Shanghai Institute of Technology Haiquan road Shanghai201400 China School of Chemistry and Environmental Engineering Shanghai Institute of Technology Haiquan road Shanghai201400 China

With the advent of the Web 3.0 era, the amount and types of data in the network have sharply increased, and the application scenarios of recommendation algorithms are continuously expanding. Location recommendation has gradually become one of the popular application scenarios in recommendation algorithms. Traditional recommendation algorithms not only ignore the temporal attribute of data when recommending information to users, but also blindly pursue the recommendation accuracy, which will cause certain "information cocoon room" problems. Therefore, this article treats user historical data as a time series and proposes an LSTM-DNN model based on the novel bidirectional Dynamic Time Warping (DTW) algorithm. Firstly, in response to the issue of different users consuming different amounts of information, this article proposes a novel bidirectional DTW algorithm to calculate the similarity between different users. Secondly, this article supplements the user dataset from three perspectives: "utilization" and "exploration" of information, and spatiotemporal attributes of data, which alleviates the problem of data sparsity and cold start in the dataset to a certain extent. Moreover, it effectively enhances the diversity of recommendation results. Finally, this paper constructs an Long Short-Term Memory-Deep Neural Networks (LSTM-DNN) to dynamically obtain user interests and preferences, and proposes a new metric Cumulative Self-System Diversity (CSSD) to measure the diversity of algorithm recommendation results. Experiments have shown that the model effectively enhances the diversity of recommendation results while ensuring recommendation accuracy. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

DERNNet:Dual Encoding Recurrent Neural Network Based Secure Optimal Routing in WSN

引用

computer Systems science & engineering 2023年第5期45卷 1375-1392页

作者： A.Venkatesh S.Asha School of Computer Science and Engineering Vellore Institute of TechnologyChennaiIndia Centre for Cyber Physical Systems&School of Computer Science and Engineering Vellore Institute of TechnologyChennaiIndia

A Wireless Sensor Network(WSN)is constructed with numerous sensors over geographical *** basic challenge experienced while designing WSN is in increasing the network lifetime and use of low *** sensor nodes are resource constrained in nature,novel techniques are essential to improve lifetime of nodes in *** energy is considered as an important resource for sensor node which are battery powered *** WSN,energy is consumed mainly while data is being transferred among nodes in the *** research works are carried out focusing on preserving energy of nodes in the network and made network to live ***,this network is threatened by attacks like vampire attack where the network is loaded by fake ***,Dual Encoding Recurrent Neural network(DERNNet)is proposed for classifying the vampire nodes s node in the ***,the Grey Wolf Optimization(GWO)algorithm helps for transferring the data by determining best solutions to optimally select the aggregation points;thereby maximizing battery/lifetime of the network *** proposed method is evaluated with three standard approaches namely Knowledge and Intrusion Detection based Secure Atom Search Routing(KIDSASR),Risk-aware Reputation-based Trust(RaRTrust)model and Activation Function-based Trusted Neighbor Selection(AF-TNS)in terms of various *** existing methods may lead to wastage of energy due to vampire attack,which further reduce the lifetime and increase average energy consumed in the ***,the proposed DERNNet method achieves 31.4%of routing overhead,23%of end-to-end delay,78.6%of energy efficiency,94.8%of throughput,28.2%of average latency,92.4%of packet delivery ratio,85.2%of network lifetime,and 94.3%of classification accuracy.

关键词： Wireless sensor network vampire nodes lifetime optimal routing energy encryption decryption trust value optimization

来源：评论

学校读者我要写书评

暂无评论

TSCompiler: efficient compilation framework for dynamic-shape models

引用

science China(Information sciences) 2024年第10期67卷 67-84页

作者： Xiang LUO Chen ZHANG Chenbo GENG Yanzhi YI Jiahui HU Renwei ZHANG Zhen ZHANG Gianpietro CONSOLARO Fan YANG Tun LU Ning GU Li SHANG School of Computer Science Fudan University School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University School of Computer Science and Technology Harbin Institute of Technology Huawei Technologies Co. Ltd. Huawei Paris Research Center School of Microelectronics Fudan University

Today's deep learning models face an increasing demand to handle dynamic shape tensors and computation whose shape information remains unknown at compile time and varies in a nearly infinite range at runtime. This shape dynamism brings tremendous challenges for existing compilation pipelines designed for static models which optimize tensor programs relying on exact shape values. This paper presents TSCompiler, an end-to-end compilation framework for dynamic shape models. TSCompiler first proposes a symbolic shape propagation algorithm to recover symbolic shape information at compile time to enable subsequent optimizations. TSCompiler then partitions the shape-annotated computation graph into multiple subgraphs and fine-tunes the backbone operators from the subgraph within a hardware-aligned search space to find a collection of high-performance schedules. TSCompiler can propagate the explored backbone schedule to other fusion groups within the same subgraph to generate a set of parameterized tensor programs for fused cases based on dependence analysis. At runtime, TSCompiler utilizes an occupancy-targeted cost model to select from pre-compiled tensor programs for varied tensor shapes. Extensive evaluations show that TSCompiler can achieve state-of-the-art speedups for dynamic shape models. For example, we can improve kernel efficiency by up to 3.97× on NVIDIA RTX3090, and 10.30× on NVIDIA A100 and achieve up to five orders of magnitude speedups on end-to-end latency.

关键词： machine learning tensor compilers dynamic shape operator fusion code generation auto-tuning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：