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

IEEE advanced Information Management,Communicates,Electronic and Automation Control Conference (IMCEC)

作者： Xue Li Jinlong Fei Zan Qi Zhuo Lv Heng Jiang State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Information Engineering University Zhengzhou China National Digital Switching System Engineering Technological Research Center PLA Information Engineering University Zhengzhou China

ISBN: (纸本)9781665479691

Existing deep learning-based encrypted traffic recognition methods can achieve high precision identification performance while protecting user privacy, but almost all of them focus on closed sets, in which training data and test data come from the same label space. However, the real network environment is open, and it is necessary for traffic identification systems to deal with previously unseen categories. To classify known categories at a fine granularity and identify unknown ones, we propose a novel open-set recognition method for encrypted traffic. The decision boundary sample generation method based on constrained Generative Adversarial Networks is presented to generate samples from low-density regions in the known data space. Furthermore, an end-to-end open-set classifier is built using the accurate and diverse simulative samples of unknown classes through intra-class partition and boundary sample generation. Finally, the effectiveness of the proposed method is validated through numerical experiments.

关键词： Data privacy Automation Training data Generative adversarial networks Robustness Information management Cryptography

来源：评论

学校读者我要写书评

暂无评论

Efficient Cache Strategy for Face Recognition System 20

Efficient Cache Strategy for Face Recognition System

引用

5th International Conference on Big Data and computing, ICBDC 2020

作者： Zong, Guoxiao Li, Qingbao Zhang, Ping Zhang, Guimin Zhu, Xinbing State Key Laboratory of Mathematical Engineering and Advanced Computing NO.62 Science Avenue ZhengzhouCN 450001 China

ISBN: (纸本)9781450375474

Recently, the need for real-time deep learning applications, such as face recognition system, implement on the embedded devices is increasing. At the system level, caching system is one of the most effective ways to reduce response time. However, embedded front-end devices can hardly guarantee effective system overhead for complex cache system while deploying deep learning model. In this paper, this paper presented an efficient cache strategy for deep learning applications such as face recognition system. This paper first established a distributed embedded system model to describe to functions of the face recognition systems. Then, this paper figures out the goal and idea of optimizing the cache design theoretically. Finally, our cache strategy is experimented and verified better than the traditional methods. © 2020 ACM.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Self-recoverable Adversarial Examples: A New Effective Protection Mechanism in Social Networks

arXiv

引用

arXiv 2022年

作者： Zhang, Jiawei Wang, Jinwei Wang, Hao Luo, Xiangyang Nanjing University of Information Science and Technology Nanjing China Nanjing University of Science and Technology Nanjing China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhenzhou China

Malicious intelligent algorithms greatly threaten the security of social users’ privacy by detecting and analyzing the uploaded photos to social network platforms. The destruction to DNNs brought by the adversarial attack sparks the potential that adversarial examples serve as a new protection mechanism for privacy security in social networks. However, the existing adversarial example does not have recoverability for serving as an effective protection mechanism. To address this issue, we propose a recoverable generative adversarial network to generate sel f -recouerable aduersarial examples. By modeling the adversarial attack and recovery as a united task, our method can minimize the error of the recovered examples while maximizing the attack ability, resulting in better recoverability of adversarial examples. To further boost the recoverability of these examples, we exploit a dimension reducer to optimize the distribution of adversarial perturbation. The experimental results prove that the adversarial examples generated by the proposed method present superior recoverability, attack ability, and robustness on different datasets and network architectures, which ensure its effectiveness as a protection mechanism in social networks. Copyright © 2022, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Entirety of Quantum Uncertainty and Its Experimental Verification

引用

Chinese Physics Letters 2021年第7期38卷 11-16页

作者： Jie Xie Li Zhou Aonan Zhang Huichao Xu Man-Hong Yung Ping Xu Nengkun Yu Lijian Zhang National Laboratory of Solid State Microstructures College of Engineering and Applied Sciences and School of PhysicsNanjing UniversityNanjing 210093China Collaborative Innovation Center of Advanced Microstructures Nanjing UniversityNanjing 210093China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China Shenzhen Institute for Quantum Science and Engineering and Department of Physics Southern University of Science and TechnologyShenzhen 518055China Shenzhen Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Institute for Quantum Information&State Key Laboratory of High Performance Computing College of ComputerNational University of Defense TechnologyChangsha 410073China Centre for Quantum Software and Information School of SoftwareFaculty of Engineering and Information TechnologyUniversity of Technology SydneyNSWAustralia

As a foundation of quantum physics,uncertainty relations describe ultimate limit for the measurement uncertainty of incompatible ***,uncertainty relations are formulated by mathematical bounds for a specific *** we present a method for geometrically characterizing uncertainty relations as an entire area of variances of the observables,ranging over all possible input *** find that for the pair of position and momentum operators,Heisenberg's uncertainty principle points exactly to the attainable area of the variances of position and ***,for finite-dimensional systems,we prove that the corresponding area is necessarily semialgebraic;in other words,this set can be represented via finite polynomial equations and inequalities,or any finite union of such *** particular,we give the analytical characterization of the areas of variances of(a)a pair of one-qubit observables and(b)a pair of projective observables for arbitrary dimension,and give the first experimental observation of such areas in a photonic system.

关键词： observable union operators

来源：评论

学校读者我要写书评

暂无评论

NEXT:a neural network framework for next POI recommendation

引用

Frontiers of Computer Science 2020年第2期14卷 314-333页

作者： Zhiqian ZHANG Chenliang LI Zhiyong WU Aixin SUN Dengpan YE Xiangyang LUO Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of EducationSchool of Cyber Science and EngineeringWuhan UniversityWuhan 430072China Department of Computer Science The University of Hong KongPokfulam RoadHong Kong 999077China School of Computer Science and Engineering Nanyang Technological UniversitySingapore 639798Singapore State Key Lab of Mathematical Engineering and Advanced Computing Zhengzhou 450001China

The task of next POI recommendations has been studied extensively in recent ***,developing a unified recommendation framework to incorporate multiple factors associated with both POIs and users remains challenging,because of the heterogeneity nature of these ***,effective mechanisms to smoothly handle cold-start cases are also a difficult *** by the recent success of neural networks in many areas,in this paper,we propose a simple yet effective neural network framework,named NEXT,for next POI *** is a unified framework to learn the hidden intent regarding user's next move,by incorporating different factors in a unified ***,in NEXT,we incorporate meta-data information,e.g.,user friendship and textual descriptions of POIs,and two kinds of temporal contexts(i.e.,time interval and visit time).To leverage sequential relations and geographical influence,we propose to adopt DeepWalk,a network representation learning technique,to encode such *** evaluate the effectiveness of NEXT against other state-of-the-art alternatives and neural networks based *** results on three publicly available datasets demonstrate that NEXT significantly outperforms baselines in real-time next POI *** experiments show inherent ability of NEXT in handling cold-start.

关键词： POI neural networks POI recommendation

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving and Byzantine Robust Collaborative Federated Learning Method Design

A Privacy Preserving and Byzantine Robust Collaborative Fede...

引用

IEEE International Conference on Communications (ICC)

作者： Nuocheng Yang Sihua Wang Mingzhe Chen Changchuan Yin Christopher G. Brinton Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Collaborative federated learning (CFL) enables device cooperation in training shared machine learning models without reliance on a parameter server. However, the absence of a parameter server also impacts vulnerabilities associated with adversarial attacks, including privacy inference and Byzantine attacks. In this context, this paper introduces a novel CFL framework that enables each device to individually determine the subset of devices to transmit FL parameters to over the wireless network, based on its neighboring devices' location, current loss, and connection information, to achieve privacy protection and robust aggregation. This is formulated as an optimization problem whose goal is to minimize CFL training loss while satisfying the privacy preservation, robust aggregation, and transmission delay requirements. To solve this problem, a proximal policy optimization (PPO)-based reinforcement learning (RL) algorithm integrated with a graph neural network (GNN) is proposed. Compared to traditional algorithms that use global information with high computational complexity, the proposed GNN-RL method can be deployed on devices based on neighboring information with lower computational overhead. Simulation results show that the proposed algorithm can protect data privacy and increase identification accuracy by 15% compared to an algorithm in which devices are partially clustered for model aggregation.

关键词： Training Privacy Federated learning Simulation Collaboration Clustering algorithms Propagation losses

来源：评论

学校读者我要写书评

暂无评论

KANsformer for Scalable Beamforming

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Xie, Xinke Lu, Yang Chi, Chong-Yung Chen, Wei Ai, Bo Niyato, Dusit Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation Beijing100044 China Beijing Jiaotong University School of Computer Science and Technology Beijing100044 China National Tsing Hua University Institute of Communications Engineering Department of Electrical Engineering Hsinchu30013 Taiwan Beijing Jiaotong University School of Electronics and Information Engineering Beijing100044 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

This paper proposes an unsupervised deep-learning (DL) approach by integrating Transformer and Kolmogorov-Arnold networks (KAN) termed KANsformer to realize scalable beamforming for mobile communication systems. Specifically, we consider a classic multi-input single-output energy efficiency maximization problem subject to the total power budget. The proposed KANsformer first extracts hidden features via a multi-head self-attention mechanism and then reads out the desired beamforming design via KAN. Numerical results are provided to evaluate the KANsformer in terms of generalization performance, transfer learning and ablation experiment. Overall, the KANsformer outperforms the existing benchmark DL approaches, and is adaptable to the variation in the number of mobile users with real-time and near-optimal inference. © 1967-2012 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

NLGT: Neighborhood-based and Label-enhanced Graph Transformer Framework for Node Classification 39

NLGT: Neighborhood-based and Label-enhanced Graph Transforme...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Xu, Xiaolong Zhou, Yibo Xiang, Haolong Li, Xiaoyong Zhang, Xuyun Qi, Lianyong Dou, Wanchun School of Software Nanjing University of Information Science and Technology China Yunnan Key Laboratory of Service Computing Yunan University of Finance and Economics China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services China Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology China College of Meteorology and Oceanography National University of Defense Technology China School of Computing Macquarie University Australia College of Computer Science and Technology China University of Petroleum (East China) China State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)157735897X

Graph Neural Networks (GNNs) are widely applied on graph-level tasks, such as node classification, link prediction and graph generation. Existing GNNs mostly adopt a message-passing mechanism to aggregate node information with their neighbors, which often makes node information similar after rounds of aggregations and leads to oversmoothing. Although recent works have made improvements by combining different message aggregation methods or introducing semantic encodings as priors, these message-passing based GNNs still fail to combat oversmoothing after multiple iterations of node aggregation. Besides, the feature extraction ability of these methods is restricted because of the graph sparsity that hinders the aggregation of node information. To deal with the above two issues, we propose Neighborhood-based and Label-enhanced Graph Transformer (NLGT), a novel and effective framework for graph learning. Specifically, we present a label-enhanced feature fusion mechanism that integrate the shallow node features and label embeddings as enhanced features. Moreover, we design a neighborhood-based mask attention mechanism to alleviate the negative effects caused by the sparsity of the graph. In the predicting stage, we aggregate the prediction results from multiple sampled sub-graphs and apply voting mechanisms to enhance the accuracy and robustness of our framework. Finally, extensive experiments are conducted on four open benchmark datasets, which demonstrate the effectiveness and robustness of our proposed framework compared with existing state-of-the-art methods. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A differential public PUF design for lightweight authentication 16

A differential public PUF design for lightweight authenticat...

引用

2021 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design, SMACD 2021 and 16th Conference on PhD Research in Microelectronics and Electronics, PRIME 2021

作者： Duan, Shengyu Sai, Gaole School of Computer Engineering and Science Shanghai University Shanghai200444 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Guangdong Provincial Key Lab of Robotics and Intelligent System Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China CAS Key Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institutes of Advanced Technology China

ISBN: (纸本)9783800755899

Physical Unclonable Functions (PUFs) have emerged as a promising primitive to provide a hardware keyless security mechanism for integrated circuit applications. Public PUFs (PPUFs) address the crucial PUF vulnerability of requiring databases to store the secrete reference information. This paper investigates one of the PPUF families, differential PPUF (dPPUF), which exploits complexly interacted logic to create time gap between actual execution and simulation, and to prevent simulation attacks. Conventional dPPUFs have high costs. We observe the repressers have large impact on simulation time, but take a great proportion in current dPPUF structure. We thereby present a represser network with specially designed interconnection and shared logic, to maintain a high circuit complexity and to reduce the area cost. We show the proposed dPPUF has similar resilience over simulation attacks as the conventional design. Area cost can be reduced by up to 44%, and thus the proposed design can be used for lightweight authentication. © VDE VERLAG GMBH.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

IRS-Enhanced Anti-Jamming Precoding Against DISCO Physical Layer Jamming Attacks

IRS-Enhanced Anti-Jamming Precoding Against DISCO Physical L...

引用

IEEE International Conference on Communications (ICC)

作者： Huan Huang Hongliang Zhang Yi Cai Yunjing Zhang A. Lee Swindlehurst Zhu Han Electronic Information School Soochow University Suzhou China State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Peking University Beijing China Department of Electrical and Computer Engineering University of Houston Houston USA Center for Pervasive Communications and Computing University of California Irvine USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Illegitimate intelligent reflective surfaces (IRSs) can pose significant physical layer security risks on multi-user multiple-input single-output (MU-MISO) systems. Recently, a DISCO approach has been proposed an illegitimate IRS with random and time-varying reflection coefficients, referred to as a “disco” IRS (DIRS). Such DIRS can attack MU-MISO systems without relying on either jamming power or channel state information (CSI), and classical anti-jamming techniques are in-effective for the DIRS-based fully-passive jammers (DIRS-based FPJs). In this paper, we propose an IRS-enhanced anti-jamming precoder against DIRS-based FPJs that requires only statistical rather than instantaneous CSI of the DIRS-jammed channels. Specifically, a legitimate IRS is introduced to reduce the strength of the DIRS-based jamming relative to the transmit signals at a legitimate user (LU). In addition, the active beamforming at the legitimate access point (AP) is designed to maximize the signal-to-jamming-plus-noise ratios (SJNRs). Numerical results are presented to evaluate the effectiveness of the proposed IRS-enhanced anti-jamming precoder against DIRS-based FPJs.

关键词： Array signal processing Precoding Computational modeling Interference MISO communication Physical layer security Reflection coefficient

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：