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

VFGCN: A Vertical Federated Learning Framework With Privacy Preserving for Graph Convolutional network

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Wang, Gang Li, Qingming Liu, Ximeng Yan, Xiaoran Dong, Qingkuan Wu, Huiwen Kong, Xiangjie Zhou, Li Zhejiang Lab HangZhou 310000 China Zhejiang University College of Computer Science and Technology Hangzhou 310058 China Fuzhou University Key Laboratory of Information Security of Network Systems College of Computer and Big Data Fuzhou 350108 China Xidian University State Key Laboratory of Integrated Services Networks Xi'an 710071 China Zhejiang University of Technology College of Computer Science and Technology Hangzhou 310023 China Dalian University of Technology School of Software Dalian 116620 China

Due to the robust representational capabilities of graph data, employing graph neural networks for its processing has demonstrated superior performance over conventional deep learning algorithms. Graph data encompasses abundant features and structural information;however, its large-scale collection is often challenging in practice. This difficulty arises because data predominantly exists in isolated compartments, making it arduous to harmonize information across various organizations or to enable multiple organizations to collaborate effectively while safeguarding local data privacy. In light of an extreme data distribution scenario, where each client possesses distinct nodes with partially overlapping segments yet divergent data features, we introduce a dual-cloud server architecture. This framework encompasses the design of four secure subprotocols: ReEnc (secure re-encryption), SecPSI (secure outsourcing of PSI), SecWeight (secure weight calculation), and SecAgg (secure aggregation). Together, these components facilitate a vertical federated learning framework for graph convolutional networks, ensuring privacy preservation. We provide a security proof for the entire system and extensive evaluation on three benchmark datasets (Cora, Citeseer, and Pubmed) illustrates that our Vertical Federated Graph Convolutional network (VFGCN) surpasses existing privacy-preserving methodologies. © 2004-2012 IEEE.

关键词： Federated learning GCN homomorphic encryption privacy-preserving

来源：评论

学校读者我要写书评

暂无评论

Low-rank tucker decomposition for multi-view outlier detection based on meta-learning

引用

Information Fusion 2025年 123卷

作者： Wei Lin Kun Xie Jiayin Li Shiping Wang Li Xu College of Computer and Cyber Security Fujian Normal University Fuzhou China Fujian Provincial Key Lab of Network Security and Cryptology Fujian Normal University Fuzhou China College of Computer Science and Electronics Engineering Hunan University Changsha China College of Computer and Data Science Fuzhou University Fuzhou China

The analysis and mining of multi-view data have gained widespread attention, making multi-view anomaly detection a prominent research area. Despite notable advancements in the performance of existing multi-view anomaly detection methods, they still face certain limitations. (1) The existing methods fail to fully leverage the low-rank structure of multi-view data, which results in a lack of necessary interpretability when uncovering the latent relationships between views. (2) In the recovery of the consensus structure, the current methods achieve this merely through a simple aggregation process, lacking in-depth exploration and interaction between the potential structures of each view. To address these challenges, we propose the L ow- R ank T ucker D ecomposition based on M eta-Learning (LRTDM) for multi-view outlier detection. First, the low-rank Tucker decomposition is employed to reveal the low-rank structure of the multi-view self-expressive tensor. The factor matrices and core tensor effectively preserve and encode the latent structure of each view. This structured representation can efficiently capture the potential shared features between views, allowing for a more refined analysis of each individual view. Furthermore, meta-learning is utilized to define the learning and fusion of view-specific latent features as a nested optimization problem, which is solved alternately using a two-layer optimization scheme. Finally, anomalies are detected through the consensus matrix recovered from the latent representations and the error matrix during the self-expressive tensor learning process. Extensive experiments conducted on five publicly available datasets demonstrate the effectiveness of our approach. The results show that our algorithm improves detection accuracy by 2% to 10% compared to state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semantic and Emotional Dual Channel for Emotion Recognition in Conversation

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Zhenyu Zhang, Zhibo Cheng, Yuhu Zhang, Tong Wang, Xuesong Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China China University of Mining and Technology Engineering Research Center of Intelligent Control for Underground Space Ministry of Education Xuzhou Key Laboratory of Artificial Intelligence and Big Data School of Information and Control Engineering Xuzhou221116 China South China University of Technology Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Emotion recognition in conversation (ERC) aims at accurately identifying emotional states expressed in conversational content. Existing ERC methods, although relying on semantic understanding, often encounter challenges when confronted with incomplete or misleading semantic information. In addition, when dealing with the interaction between emotional and semantic information, existing methods are often difficult to effectively distinguish the complex relationship between the two, which affects the accuracy of emotion recognition. To address the problems of semantic misdirection and emotional cross-talk encountered by traditional models when confronted with complex conversational data, we propose a semantic and emotional dual channel (SEDC) strategy for emotion recognition in conversations to process emotional and semantic information independently. Under this strategy, emotion information provides an auxiliary recognition function when the semantics are unclear or lacking, enhancing the accuracy of the model. Our model consists of two modules: the emotion processing module accurately captures the emotional features of each utterance through contrastive learning, and then constructs a dialogue emotion propagation map to simulate the emotional information conveyed in the dialogue;the semantic processing module combines an external knowledge base to enhance the semantic expression of the dialogue through knowledge enhancement strategies. This divide-and-conquer approach allows us to more deeply analyze the emotional and semantic dimensions of complex dialogues. Experimental results on the IEMOCAP, EmoryNLP, MELD, and DailyDialog datasets show that our approach significantly outperforms existing techniques and effectively improves the accuracy of dialogue emotion recognition. Our code is available at https://***/r/SEDC-FCF1. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

New results on quantum boomerang attacks

引用

Quantum Information Processing 2023年第4期22卷 1-27页

作者： Zou, Hongkai Zou, Jian Luo, Yiyuan College of Computer and Data Science Fuzhou University Fuzhou China Key Lab of Information Security of Network Systems Fuzhou University Fuzhou China School of Information Sciences and Technology Huizhou University Huizhou China

At SAC 2021, Frixons et al. proposed quantum boomerang attacks that can effectively recover the keys of block ciphers in the quantum setting. Based on their work, we further consider how to quantize the generic boomerang attacks proposed by Biham et al. at FSE 2002, so as to obtain more generic quantum boomerang attacks. Similar to Frixons et al.’s work, we only consider quantum key recovery attacks in the single-key setting. With the help of some famous quantum algorithms, this paper presents two methods to convert the attacks of Biham et al. into some new quantum key recovery attacks. In order to proof our methods, we apply our new ideas to attack Serpent-256 and ARIA-196. To sum up, for Serpent-256, we give valid 9-round and 10-round quantum key recovery attacks respectively. The quantum time complexity of 9-round and 10-round of Serpent-256 is 2 115.43 and 2 126.6 respectively. Furthermore, we show a valid quantum key attack on 6-round ARIA-196 which has a time complexity of 2 89.8 with negligible memory. The time complexity of the above quantum attacks are better than the corresponding classical attacks and quantum generic key recovery attack via Grover’s algorithm. © 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Ramp Scheme Based on CRT for Polynomial Ring over Finite Field

引用

Journal of Systems Science & Complexity 2023年第1期36卷 129-150页

作者： DING Jian KE Pinhui LIN Changlu WANG Huaxiong College of Computer and Cyber Security Fujian Normal UniversityFuzhou 350007China School of Mathematics and Big Data Chaohu UniveristyHefei 238024China School of Mathematics and Statistics and Fujian Provincial Key Lab of Network Security and CryptologyFujian Normal UniversityFuzhou 350007China School of Physical and Mathematical Sciences Nanyang Technological UniversitySingapore 639798Singapore

Chinese Reminder Theorem(CRT)for integers has been widely used to construct secret sharing schemes for different scenarios,but these schemes have lower information rates than that of Lagrange interpolation-based *** ASIACRYPT 2018,Ning,et *** a perfect(r,n)-threshold scheme based on CRT for polynomial ring over finite field,and the corresponding information rate is one which is the greatest case for a(r,n)-threshold ***,for many practical purposes,the information rate of Ning,et *** is low and perfect security is too much *** this work,the authors generalize the Ning,et al.(r,n)-threshold scheme to a(t,r,n)-ramp scheme based on CRT for polynomial ring over finite field,which attains the greatest information rate(r−t)for a(t,r,n)-ramp ***,for any given 2≤r_(1)

关键词： Chinese Reminder Theorem polynomial ring ramp scheme threshold changeable secret sharing

来源：评论

学校读者我要写书评

暂无评论

STGAT: A Spatio-Temporal Graph Attention network for Travel Demand Prediction

STGAT: A Spatio-Temporal Graph Attention Network for Travel ...

引用

2023 International Conference on networking and network Applications, NaNA 2023

作者： Zhang, Tao Yi Wang, YuBo Wei, ZhiCheng Key Lab of Network and Information Security China College of Computer and Cyberspace Security China Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics & Security Hebei Normal University Hebei Province Shijiazhuang China

ISBN: (纸本)9798350327380

Forecasting travel demand is a challenging task due to the complex spatial dependencies and dynamic temporal correlation of the traffic data. Furthermore, a limited representation of the given spatial graph structure may restrict the model's ability to effectively learn spatial-temporal dependencies. To extract latent semantic features from traffic data, this paper proposes a method to construct a traffic graph using the Markov cluster algorithm. The traffic semantic correlation matrix is constructed based on a traffic graph to obtain the deep semantic information. Specifically, this study proposes a Spatio-Temporal Graph Attention network(STGAT) for travel demand prediction. STGAT uses a graph attention layer based on the Node2Vec graph embedding algorithm, two convolutional layers based on the Markov cluster algorithm, and a long short-term memory network to capture spatial-temporal dependencies. Experimental results on the NYC Taxi dataset and the Chengdu online car dataset demonstrate that STGAT achieved state-of-the-art performance compared to other baseline models. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Community discovery method based on complex network of data fusion based on the super network perspective

引用

International Journal of Computers and Applications 2021年第4期43卷 383-390页

作者： Pei, Li School of Computer Science & Technology Xi‘an University of Posts and Telecommunications Xi‘an China Shaanxi Key Laboratory of Network Data Intelligent Processing Xi‘an University of Posts and Telecommunications Xi‘an China Ministry of Education Key Lab For Intelligent Networks and Network Security Xi‘an Jiaotong University Xi‘an China

To enhance the computational efficiency and precision of community discovery, a community discovery algorithm with the mixed label based on the minimum description length (MDI) of information compression is proposed in this paper. Firstly, the community detection is converted to the information compression problem of seeking for an effective network structure and the quality evaluation function is constructed based on the MDL criterion. Secondly, the community discovery algorithm with heuristic mixed label movement is constructed based on the label node movement algorithm and Louvain community addition algorithm so as to reduce the quality evaluation function. Finally, the simulation experiment in the standard test set and API capture Sina microblog dataset shows that the proposed algorithm is superior to the selected comparison algorithm in computational efficiency and precision. © 2018 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A Deep Reinforcement Learning Approach for Online Taxi Dispatching

A Deep Reinforcement Learning Approach for Online Taxi Dispa...

引用

2023 International Conference on networking and network Applications, NaNA 2023

作者： Wang, YuBo Zhang, TaoYi Wei, ZhiCheng Key Lab of Network and Information Security China College of Computer and Cyber Security China Hebei Prov. Eng. Res. Center for Supply Chain Big Data Analytics Security Hebei Normal University Hebei Province Shijiazhuang China

ISBN: (纸本)9798350327380

With the development of smart city transportation systems, developing reasonable dispatching strategies for idle ride-hailing vehicles has become an urgent research problem. In this paper, we address the short-sightedness issue of existing dispatching strategies and design a ride-hailing dispatching model based on deep reinforcement learning in the Markov decision process(MDP) framework to obtain long-term dispatching strategies with foresight. Firstly, we define the basic framework of agent and optimize the dispatching strategy of ride-hailing services by defining a metric that combines instant revenue with the demand situation of the next state in the action space as a reward function. Then, we construct an order-matching system simulator based on historical order data sets to facilitate interaction between the intelligent agent and the environment. Finally, based on the Bellman optimality equation, we approximate the value function using the Eval Net and Target Net, and train the model using Temporal Difference Learning. Simulation experiments demonstrate that this approach can increase driver income, provide more services to passengers, and effectively improve the operating efficiency of the transportation network. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-Edge Cooperative Offloading Genetic Algorithm towards Environmental Monitoring System 5

A Novel Multi-Edge Cooperative Offloading Genetic Algorithm ...

引用

5th International Conference on Telecommunications and Communication Engineering, ICTCE 2022

作者： Fang, Jie Li, Wenzao Wang, Yue Sun, Xiulan College of Communication Engineering Chengdu University of Information Technology China Network and Data Security Key Lab of Sichuan Pro. University of Electronic Science and Technology of China China Institute of Data Application Research Educational Informalization and Big Data Center China

ISBN: (纸本)9781450397797

In environmental monitor architecture, the usual way of processing data is centralized. On the one hand, this leads to a long time of data processing, and with the increasing number of monitoring sensors, the pressure of data processing in data centers increases sharply. The edge computing provides a feasible solution to relieve the processing pressure and decrease the delay of data processing in data center. However, in the environmental monitor system, the edge servers are often load unbalance because of the nonuniform distribution of sensors. While, it is usually ignored in recently researches. In this paper, we proposed a cooperative offloading strategy (MECOGA) based on genetic algorithm (GA). It aims to ease the data processing pressure and reduce the data processing time in the data center. In addition, the load balance of edge servers is also one of our optimization goals. In this paper, we aim at decreasing task processing delay and improving the system load balancing. Contrast to other algorithms, our MECOGA decreases the delay near 20% before collaborative loading. And the balance variance is 15% smaller than the Balance strategy. © 2022 Association for Computing Machinery.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Robot and its living space:A roadmap for robot development based on the view of living space

引用

Digital Communications and networks 2021年第4期7卷 505-517页

作者： Xiaofeng Cai Huansheng Ning Sahraoui Dhelim Rongjuan Zhou Tao Zhang Yang Xu Yueliang Wan School of Computer and Communication Engineering University of Science and Technology Beijing Beijing 100083China Beijing Engineering Research Center for Cyberspace Data Analysis and Applications Beijing 100083China School of Foreign Studies University of Science and Technology Beijing Beijing 100083China Key Lab of Information Network Security Ministry of Public SecurityChina Run Technologies Co. LidBeijing China

Robot’s living space Human-robot relationship Robot humanization Hybrid intelligence Human-robot integrated society Robots,as the creation of humans,became an irreplaceable component in human *** the advancement of technologies,robots have become more and more intelligent and have been widely used in many fields,such as disease diagnosis,customer services,healthcare for the older people,and so *** robots made our lives much more convenient than ever before,they also brought many potential risks and challenges in technology,security,and *** better understand the development of robots,we proposed a concept of a robot’s living space and analyzed the role of robots in our *** this paper,we focus on setting a theoretical framework of the robot’s living space to further understand the human-robot *** research in this paper contains three central ***,we interpret the concept of the robot’s living space and the functions of each ***,we analyze and summarize the relative technologies which support robots living well in each ***,we provide advice and improvement measures based on a discussion of potential problems caused by the developments of *** the trend of robots humanization and human-robot society integration,we should seriously consider how to collaborate with intelligent robots to achieve hybrid *** build a harmonious human-robot integrated society,studying the robot’s living space and its relationship with humans is the prerequisite and roadmap.

关键词： Robot's living space Human-robot relationship Robot humanization Hybrid intelligence Human-robot integrated society

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：