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

Privacy-Preserving Edge-Aided Eigenvalue Decomposition in Internet of Things

IEEE Internet of Things Journal 2025年第12期12卷 19901-19914页

作者： Zhao, Xiaotong Zhang, Hanlin Lin, Jie Liang, Fan Kong, Fanyu Xu, Hansong Hua, Kun Qingdao University College of Computer Science and Technology Qingdao266071 China Xian Jiaotong University School of Electronic and Information Engineering Xian710049 China Sam Houston State University Department of Computer Science HuntsvilleTX77340 United States Shandong University School of Software Jinan250101 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China California Polytechnic State University Department of Electrical Engineering San Luis ObispoCA93407 United States

Eigenvalue decomposition (EVD) is a fundamental yet time-consuming operation with extensive applications in IoT. When the matrix dimension reaches millions, resource-limited IoT devices struggle to perform such computationally expensive operations. Edge computing, with its plentiful computing resources, offers an effective solution to this problem. However, privacy concerns arise because outsourced tasks may contain sensitive user data. In this paper, we propose the first privacy-preserving, edge-assisted EVD outsourcing scheme that securely enables users to outsource EVD tasks to edge servers. We design a privacy-preserving matrix transformation method to encode the original data, ensuring that edge servers cannot access users' private information. Additionally, we design a verification scheme that enables the user to verify the correctness of the results returned by the edge servers. Our protocol supports parallel computation by multiple edge servers, thus enhancing the efficiency of EVD. The feasibility of our proposed scheme is demonstrated through both theoretical and experimental perspectives. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

ICCG:low-cost and efficient consistency with adaptive synchronization for metadata replication

引用

Frontiers of computer science 2025年第1期19卷 53-70页

作者： Chenhao ZHANG Liang WANG Jing SHANG Zhiwen XIAO Limin XIAO Meng HAN Bing WEI Runnan SHEN Jinquan WANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyberspace Security Hainan UniversityHaikou 570228China China Mobile Information Technology Center Beijing 100033China

The rapid growth in the storage scale of wide-area distributed file systems (DFS) calls for fast and scalable metadata management. Metadata replication is the widely used technique for improving the performance and scalability of metadata management. Because of the POSIX requirement of file systems, many existing metadata management techniques utilize a costly design for the sake of metadata consistency, leading to unacceptable performance overhead. We propose a new metadata consistency maintenance method (ICCG), which includes an incremental consistency guaranteed directory tree synchronization (ICGDT) and a causal consistency guaranteed replica index synchronization (CCGRI), to ensure system performance without sacrificing metadata consistency. ICGDT uses a flexible consistency scheme based on the state of files and directories maintained through the conflict state tree to provide an incremental consistency for metadata, which satisfies both metadata consistency and performance requirements. CCGRI ensures low latency and consistent access to data by establishing a causal consistency for replica indexes through multi-version extent trees and logical time. Experimental results demonstrate the effectiveness of our methods. Compared with the strong consistency policies widely used in modern DFSes, our methods significantly improve the system performance. For example, in file creation, ICCG can improve the performance of directory tree operations by at least 36.4 times.

关键词： metadata management metadata replication consistency directory tree replica index

来源：评论

学校读者我要写书评

暂无评论

UEBCS: software Development Technology Based on Component Selection 1

引用

18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023

作者： Zhao, Yingnan Qi, Xuezhao Li, Jian Lu, Dan College of Computer Science and Technology Harbin Engineering University Harbin150009 China Harbin Institute of Technology Software Engineering Co. Ltd. Harbin China

ISBN: (数字)9789819998937

ISBN: (纸本)9789819998920

Current software development has moved away from the traditional manual workshop model and emphasizes improving software product quality. To address the issue of repetitive work, software reuse techniques can be adopted to continually enhance the quality and efficiency of software development. software reuse primarily involves reutilizing existing software knowledge during the software development process, effectively reducing maintenance costs incurred during development and controlling the overall software development expenses. software components are an effective form of supporting software product reuse and serve as the core technology for enabling software reuse. Component-based software engineering techniques emphasize the use of reusable software "components" to design and construct programs, aiming to assemble these components within a software architecture to achieve software reuse and improve the quality and productivity of software products. However, selecting the most suitable components from the results of component retrieval requires understanding the different usages of each component in the retrieval results. The existing methods suffer from excessive reliance on manual approaches and errors caused by inter-component relationships. Therefore, this paper proposes a component selection technique called UEBCS (Usage Example-Based Component Selection). This technique leverages steps such as clustering analysis and hierarchical classification to achieve optimal component selection. UEBCS has shown excellent results in terms of both efficiency and accuracy in selecting components. This method provides technical support for software developers in the software development process and holds significant practical significance for enhancing software development quality and efficiency, as well as promoting the deepening development of the software industry. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

A Security Model of Multihospital FHIR Database Authorization Based on Secret Sharing and Blockchain

引用

IEEE Internet of Things Journal 2024年第6期11卷 10325-10335页

作者： Yang, Ching-Nung Li, Peng Cheng, Hsiang-Han Kuo, Hsin-Chuan Lu, Ming-Chan Xiong, Lizhi National Dong Hwa University Department of Computer Science and Information Engineering Hualien97401 Taiwan North China Electric Power University Department of Mathematics and Physics Hebei Key Laboratory of Physics and Energy Technology Baoding071003 China Nanjing University of Information Science and Technology School of Computer and Software Nanjing210044 China

Secret sharing (SS) is a threshold technology that shares a secret value by generating and distributing n shares in the way that a set of any k shares can recover the secret. On the other hand, blockchain is a decentralized system establishing a secure data structure for storing data in the form of a hash chain. Combining SS and blockchain is definitely a promising paradigm in the data security field. Recently, the fast healthcare interoperability resources (FHIRs) standard is defined for medical data exchange across various medical institutions. In this article, we combine SS, ElGamal's encryption/decryption, and blockchain to propose a multihospital FHIR database authorization (MFDA). To achieve a secure MFDA, the group-based SS (GSS) and the notion using GSS on exponent (referred to as EGSS) are proposed. The secrets of GSS and EGSS have the discrete logarithm problem (DLP) relation, on which the secrets can be used as ElGamal's private key and public key, respectively. Also, their shares will have DLP relation. By uploading public shares of EGSS on blockchain and using private shares of GSS in a private network, we can recover ElGamal's public key from a deployed smart contract on blockchain and recover ElGamal's private key from a qualified set. Meantime, when recovering private key, the private shares of GSS can be authenticated by public shares on blockchain to check tampering and corrupted of private shares during the communication in a private network. Theorems, examples, and experiments demonstrate that the proposed MFDA has efficient and secure database authorization. © 2014 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Central Aggregator Intrusion Detection System for Denial of Service Attacks

引用

computers, Materials & Continua 2023年第2期74卷 2363-2377页

作者： Sajjad Ahmad Imran Raza MHasan Jamal Sirojiddin Djuraev Soojung Hur Imran Ashraf Department of Computer Science COMSATS University IslamabadLahore CampusLahore54000Pakistan Department of Software Engineering New Uzbekistan UniversityTashkent100007Uzbekistan Department of Information and Communication Engineering Yeungnam UniversityGyeongsan-si38541Korea

Vehicle-to-grid technology is an emerging field that allows unused power from Electric Vehicles(EVs)to be used by the smart grid through the central *** the central aggregator is connected to the smart grid through a wireless network,it is prone to cyber-attacks that can be detected and mitigated using an intrusion detection ***,existing intrusion detection systems cannot be used in the vehicle-to-grid network because of the special requirements and characteristics of the vehicle-to-grid *** this paper,the effect of denial-of-service attacks of malicious electric vehicles on the central aggregator of the vehicle-to-grid network is investigated and an intrusion detection system for the vehicle-to-grid network is *** proposed system,central aggregator–intrusion detection system(CA-IDS),works as a security gateway for EVs to analyze andmonitor incoming traffic for possible DoS *** are registered with a Central Aggregator(CAG)to exchange authenticated messages,and malicious EVs are added to a blacklist for violating a set of predefined policies to limit their interaction with the CAG.A denial of service(DoS)attack is simulated at CAG in a vehicle-to-grid(V2G)network manipulating various network parameters such as transmission overhead,receiving capacity of destination,average packet size,and channel *** proposed system is compared with existing intrusion detection systems using different parameters such as throughput,jitter,and *** analysis shows that the proposed system has a higher throughput,lower jitter,and higher accuracy as compared to the existing schemes.

关键词： Denial of service attack vehicle to grid network network security network throughput

来源：评论

学校读者我要写书评

暂无评论

Ensemble based unsupervised anomaly detection with concept drift adaptation for time series data 10

Ensemble based unsupervised anomaly detection with concept d...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Li, Danlei Nair, Nirmal Wang, Kevin I-Kai Sakurai, Kouichi University of Auckland Department of Electrical Computer and Software Engineering Auckland New Zealand Kyushu University Department of Informatics Faculty of Information Science and Electrical Engineering Fukuoka Japan

ISBN: (纸本)9798331520861

Anomaly detection is the identification of instances that substantially deviate from the majority of the data and do not conform to a well-defined normal behavior. Investigating time series anomalies has become increasingly popular in recent years due to widely deployed IoT devices and sensors. Although most existing methods apply image anomaly detection algorithms directly on time series and commonly assume the data is IID (independent and identically distributed). However, in most realworld applications, the underlying data distribution alters over time. Changes in data over time are referred to as concept drift and can significantly degrade the efficacy of an anomaly detection model. Existing research also indicates that the majority of anomaly detection frameworks ignored concept drift, resulting in poor long-term model performance. This paper presents an ensemble-based, unsupervised anomaly detection framework that is adaptive to the concept drift in time series data. Both distribution and performance-based techniques are used to detect concept drift and update the model to ensure the framework's longterm performance reliability. The proposed method is evaluated using a real-world univariate time series data that captures sea surface temperature data over a 2 -year period. By comparing our proposed framework to other state-of-the-art algorithms, we demonstrate our proposed method has obvious benefits in accuracy and long-term stability. © 2024 IEEE.

关键词： Anomaly detection Concept drift adaptation Ensemble method Time series Unsupervised method

来源：评论

学校读者我要写书评

暂无评论

Decentralized Ransomware Recovery Network: Enhancing Resilience and Security Through Secret Sharing Schemes 9

Decentralized Ransomware Recovery Network: Enhancing Resilie...

引用

9th International Conference on Internet of Things, Big Data and Security, IoTBDS 2024

作者： Ali, Sijjad Wang, Jia Leung, Victor Chung Ming Ali, Asad College of Computer Science and Software Engineering Shenzhen University Yuehai Campus Guangdong China College of Electronics and information Engineering Shenzhen University Yuehai Campus Guangdong China

ISBN: (纸本)9789897586996

Ransomware attacks present multiple threats to individuals such as businesses and organizations, causing data loss, financial stress, and operational interruptions. Traditional measures to mitigate ransomware threats usually include backups and secure applications. However, these countermeasures may not protect against sophisticated attacks. The purpose of this article is to explore a decentralized approach for recovering from multiple ransomware attacks. A decentralized secure approach is employed by the decentralized ransomware recovery network (DRRN) as a platform for sharing data privacy. Backup and restoration of encryption keys on shared domains are performed in the event of a ransomware attack. By paying for ransomware, users can encrypt their files. Additionally, the technical design of the DRRN and its management, as well as ransomware attacks are explored in our studies. A hybrid approach is utilized to evaluate its effectiveness and implications for cybersecurity and data protection. Finally, we assert that our proposed scheme is more secure and effective in the DRRN environment. © 2024 by SCITEPRESS – science and Technology Publications, Lda.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Graph Transfer Learning for Category-aware Cross-Domain Sequential Recommendation 25

Heterogeneous Graph Transfer Learning for Category-aware Cro...

引用

34th ACM Web Conference, WWW 2025

作者： Xu, Zitao Chen, Xiaoqing Pan, Weike Ming, Zhong College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen University Shenzhen Technology University Shenzhen China

ISBN: (纸本)9798400712746

Cross-domain sequential recommendation (CDSR) is proposed to alleviate the data sparsity issue while capturing users’ sequential preferences. However, most existing methods do not explore the item transition patterns across different domains and can also not be applied to a multi-domain scenario. Moreover, previous methods rely on overlapping users as bridges to transfer knowledge, which struggles to capture the complex associations across domains without sufficient overlapping users. In this paper, we introduce item attributes into CDSR, and propose a heterogeneous graph transfer learning method to address these issues. Specifically, we construct a cross-domain heterogeneous graph to allow the association of user, item, and category nodes from different domains, and enhance the flexibility of the model by enabling message propagation between more nodes through edge expansion based on the semantic similarity and co-occurrence probability. In addition, we devise meta-paths from different perspectives for nodes at item, user and category levels to guide information aggregation, which can transfer knowledge across domains and reduce the reliance on the number of overlapping users. We further design attention modules to capture users’ dynamic preferences from the item sequences they have interacted with in each domain, and explore the transition patterns within category sequences which reflect users’ coarse-grained preferences. Finally, we perform knowledge transfer across different domains, and predict the most likely items that users will interact with in each domain. Extensive empirical studies on three real-world datasets indicate that our HGTL significantly outperforms the state-of-the-art baselines in all cases. © 2025 Copyright held by the owner/author(s).

关键词： Transfer learning

来源：评论

学校读者我要写书评

暂无评论

Parameter-Efficient Federated Cooperative Learning for 3D Object Detection in Autonomous Driving

引用

IEEE Internet of Things Journal 2025年第12期12卷 20314-20325页

作者： Chi, Fangyuan Wang, Yixiao Nasiopoulos, Panos Leung, Victor C.M. University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada Toronto AI Lab LG Electronics TorontoONM5V 1M3 Canada Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China

In the rapidly evolving field of autonomous driving, accurately detecting and understanding dynamic environments remains a challenge. Federated learning (FL) offers a promising approach by integrating decentralized models from multiple Connected Autonomous Vehicles (CAVs) to enhance the performance of Deep Learning (DL) based object detection methods. However, traditional FL faces hurdles such as extensive data synchronization requirements, limited data variance, and high communication costs. This paper introduces a federated cooperative learning framework that addresses these challenges by combining data from both CAVs and Roadside Units (RSUs). The framework combines local cooperative perception with global federated learning through a parameter-efficient federated learning adapter (PEFLA) and a lazy communication (LazyComm) strategy, improving DL-based object detection capabilities across diverse driving scenarios while significantly reducing bandwidth requirements. We also present a novel multi-agent-multi-town dataset V2X-Fed, specifically developed to validate the effectiveness of our approach under various conditions. Notably, our framework retains 97.51% of the detection accuracy achieved by full-model federated learning, while utilizing only 1.4% of the bandwidth typically required, demonstrating substantial improvements over conventional federated learning strategies. This study underscores the potential of our tailored approach to substantially enhance autonomous vehicle technologies with minimal resource utilization. © 2014 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

DKGV: A Dynamic Knowledge Graph Visualization Method Based on Force-Directed Layout 19

DKGV: A Dynamic Knowledge Graph Visualization Method Based o...

引用

19th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry, VRCAI 2024

作者： Zhou, Hong Huang, Sunjie Zheng, Yushan Liu, Jinyan Chen, Yang Chen, Xiangyuan Li, Jun College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Academy of Inspection and Quarantine Shenzhen China Shenzhen University Shenzhen China

ISBN: (纸本)9798400713484

The dynamic knowledge graph is a data structure that adds temporal information to the nodes and edges of a traditional knowledge graph. It describes the changing processes of entities and relationships over time, thereby enriching and updating the expression of knowledge. The dynamic knowledge graph possesses characteristics such as time and labels;it is not only a knowledge graph but also a type of dynamic graph containing heterogeneous information. To address the issue that traditional dynamic graph visualization methods do not account for heterogeneous information in the layout, leading to a relatively random distribution of node labels in the visualization results, this paper proposes DKGV, a dynamic knowledge graph visualization method based on a force-directed layout. DKGV utilizes an improved GCN to generate the initial layout of the dynamic knowledge graph data, performs static force-directed layout iterative processing, and conducts dynamic force-directed layout calculations on the dynamic knowledge graph. Finally, it employs a force-directed layout with boundaries to support three-dimensional temporal display after view transformation. Experimental results show that DKGV can maintain the stability of the node layout during the evolution of the dynamic knowledge graph while making the overall layout more regular to better display the relationships between entities. © 2024 ACM.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：