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

Defending Against Adversarial Examples Via Modeling Adversarial Noise

International Journal of computer Vision 2025年 1-18页

作者： Zhou, Dawei Wang, Nannan Han, Bo Liu, Tongliang Gao, Xinbo State Key Laboratory of Integrated Services Networks Xidian University Xi’an China TMLR Group Department of Computer Science Hong Kong Baptist University Hong Kong SAR China Sydney AI Center School of Computer Science Faculty of Engineering The University of Sydney Darlington Australia School of Electronic Engineering Organization Xidian University Xi’an China

Adversarial examples have become a major threat to the reliable application of deep learning models. Meanwhile, this issue promotes the development of adversarial defenses. Adversarial noise contains well-generalizing and misleading features, which can manipulate predicted labels to be flipped maliciously. Motivated by this, we study modeling adversarial noise for defending against adversarial examples by learning the transition relationship between adversarial labels (i.e., flipped labels caused by adversarial noise) and natural labels (i.e., real labels of natural samples). In this work, we propose an adversarial defense method from the perspective of modeling adversarial noise. Specifically, we construct an instance-dependent label transition matrix to represent the label transition relationship for explicitly modeling adversarial noise. The label transition matrix is obtained from the input sample by leveraging a label transition network. By exploiting the label transition matrix, we can infer the natural label from the adversarial label and thus correct wrong predictions misled by adversarial noise. Additionally, to enhance the robustness of the label transition network, we design an adversarial robustness constraint at the transition matrix level. Experimental results demonstrate that our method effectively improves the robust accuracy against multiple attacks and exhibits great performance in detecting adversarial input samples.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DAPEW: Towards robust collaborative filtering with graph contrastive learning

引用

Knowledge-Based Systems 2025年 318卷

作者： Zhu, Kuiyu Qin, Tao Liu, Haoxing Wang, Chenxu Wang, Pinghui School of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China MOE Key Laboratory for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China

Graph Contrastive Learning (GCL) has shown excellent performance in Collaborative Filtering (CF), one of the most widely used techniques in efficient recommender systems. However, existing GCL-based CF methods suffer from node degree disparity, feature oversmoothing, difficulty in distinguishing hard negative samples, and semantic loss. To address these problems, this paper proposes a novel graph contrastive learning method for robust CF, named Degree-Aware Propagation and Entropy-Weighted contrastive loss (DAPEW). DAPEW introduces a degree-aware propagation mechanism to dynamically adjust the influence of initial embeddings, adjacency matrix products, and degree matrix products on the final embeddings, which can effectively handle node degree disparity and alleviate feature oversmoothing. DAPEW also designs an entropy-weighted contrastive loss, which introduces entropy weights to better distinguish hard negative samples and enhance the model's discriminative ability and robustness. Experimental results show that DAPEW outperforms the existing GCL-based CF methods on several real-world datasets. Compared with existing GCL-based methods, DAPEW improves Recall@40 and NDCG@40 by 0.24%∼25.88% and 0.14%∼26.18% across four different datasets, respectively. © 2025 Elsevier B.V.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

Using Depth-Enhanced Spatial Transformation for Student Gaze...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Miao, Haonan Zhao, Peizheng Sun, Yuqi Nan, Fang Zhang, Xiaolong Wu, Yaqiang Tian, Feng School of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China School of Advanced Technology Xi'an Jiaotong-Liverpool University Suzhou215123 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798350368741

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students' gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods. © 2025 IEEE.

关键词： classroom depth-enhanced 2D space dual-view gaze target estimation spatial transformation

来源：评论

学校读者我要写书评

暂无评论

Movable Frequency Diverse Array for Wireless Communication Security

引用

IEEE Transactions on Communications 2025年

作者： Cheng, Zihao Si, Jiangbo Li, Zan Liu, Pengpeng Huang, Yangchao Al-Dhahir, Naofal Xidian University State Key Laboratory of Integrated Services Networks Xian710071 China AFEU College of Information and Navigation China University of Texas at Dallas Department of Electrical and Computer Engineering RichardsonTX75080 United States

Frequency diverse array (FDA) is a promising antenna technology to achieve physical layer security by varying the frequency of each antenna at the transmitter. However, when the channels of the legitimate user and eavesdropper are highly correlated, FDA is limited by the frequency constraint and cannot provide satisfactory security performance. In this paper, we propose a novel movable FDA (MFDA) antenna technology where the positions of antennas can be dynamically adjusted in a given finite region. Specifically, we aim to maximize the secrecy capacity by jointly optimizing the antenna beamforming vector, antenna frequency vector and antenna position vector. To solve this non-convex optimization problem with coupled variables, we develop a two-stage alternating optimization (AO) algorithm based on block successive upper-bound minimization (BSUM) method. Moreover, to evaluate the security performance provided by MFDA, we introduce two benchmark schemes, i.e., phased array (PA) and FDA. Simulation results demonstrate that MFDA can significantly enhance security performance compared to PA and FDA. In particular, when the frequency constraint is strict, MFDA can further increase the secrecy capacity by adjusting the positions of antennas instead of the frequencies. © 1972-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Low RCS High-Gain Broadband Substrate Integrated Waveguide Antenna Based on Elliptical Polarization Conversion Metasurface

arXiv

引用

arXiv 2025年

作者： Zhao, Cuiqin Shen, Dongya Duan, Yanming Wang, Yuting Xiao, Huihui Luo, Longxiang College of Big Data and Computer Science Hechi University Yizhou546300 China The Yunnan Provincial Engineering Laboratory of Cloud Wireless Access & Heterogeneous Networks Yunnan University Kunming650091 China

Designed an elliptical polarization conversion metasurface (PCM) for Ka-band applications, alongside a high-gain substrate integrated waveguide (SIW) antenna. The PCM elements are integrated into the antenna design in a chessboard array configuration, with the goal of achieving effective reduction in the antenna's radar cross section (RCS). Both the PCM elements and antenna structure exhibit a simple design. The top layer of the metasurface (MS) elements employs an elliptical pattern symmetric along the diagonal, enabling efficient conversion of linearly polarized waves. The antenna component, on the other hand, consists of a broadband dipole antenna fed by SIW slot coupling. Verified through simulations, the polarization conversion bandwidth of this PCM unit reaches 80.38% where polarization conversion ratio (PCR) exceeds 90% (25.3-59.3GHz), demonstrating exceptional conversion performance. When the dipole antenna is combined with the PCM, its -10dB impedance bandwidth reaches to 15.09% (33.7-39.2GHz), with a maximum realized gain of 9.1dBi. Notably, the antenna loaded with the chessboard PCM structure effectively disperses the energy of scattered echoes around, significantly reducing the concentration of scattered energy in the direction of the incident wave, thereby achieving an effective reduction in *** Codes 14J60 © 2025, CC BY.

关键词： Directional patterns (antenna)

来源：评论

学校读者我要写书评

暂无评论

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Incremental Semi-Supervised Learning for Data Streams Classification in Internet of Things

引用

IEEE Transactions on Network and Service Management 2025年

作者： Jiang, Jun Wang, Bin Tang, Quan Zhong, Guoxiang Tang, Xuhao Rodrigues, Joel J. P. C. Pengcheng Laboratory Department of New Networks Shenzhen China South China University of Technology School of Computer Science and Engineering Guangzhou510006 China Lusófona University COPELABS Campo Grande 376 Lisbon1749-024 Portugal

Data stream classification is widely used in Internet of Things (IoT) scenarios such as health monitoring, anomaly detection and online diagnosis. Due to the continuous data stream changing dynamically over time, it is impossible to classify all the data simultaneously. Moreover, labeling each sample in practical data stream applications is time-and resource-consuming. The realistic situation is that only a few instances in a data stream are labeled. Therefore, classifying data streams with limited labels has become challenging in IoT scenarios. In this paper, we propose an incremental dynamic weighted semi-supervised method for classifying IoT data streams. Considering the dynamics and continuity in data streams, we use a chunk-based approach to learn the features in the data stream and assign weights to the classifier dynamically. Moreover, we deploy incremental learning methods to continuously learn from the sampled labeled data stream to update the classifier model, which can take advantage of newly incoming labeled data to improve learning performance. Experimental evaluations on seven IoT datasets show that the proposed method outperforms semi-supervised methods in accuracy, precision, and geometric mean (Gmean) by 10% and 5% over supervised methods, respectively. © 2004-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Low-Latency and High-Reliability Data Forwarding for In-Vehicle Time-Sensitive networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Sun, Haitong Zhang, Haijun Guan, Wanqing Liu, Xiangnan Ma, Hui Leung, Victor C.M. Hebei Key Laboratory of Space-Air-Ground Intelligent Communication China Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services University of Science and Technology Beijing Beijing100083 China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm11428 Sweden Department of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China

To satisfy the low delay, low jitter, and high success rate requirements for in-vehicle networks, IEEE 802.1 Task Group proposed Time-Sensitive Networking (TSN), which has aroused increasing attention in managing time-critical services in networks. This paper resolves the following issue: how to minimize the worst-case response time (WCRT) of frame forwarding in TSN under no-wait scenarios to guarantee low-latency transmission, stability, and high success rate for in-vehicle TSN networks? Currently, some work resolves this problem by leveraging integer linear programming, and others apply heuristic methods to avoid the time complexity problem, but the success rate is affected since they are prone to get trapped in local optima. To reach a balance between time-complexity and success rate, a scheme named Frame Dynamic Priority Scheduling Mechanism (FDPSM) is proposed, where the frame dynamic priority levels are set up and frames are scheduled accordingly. The target is to maximize the success rate and minimize the WCRT for in-vehicle networks. We evaluate the proposed mechanism from aspects such as traffic forwarding time, size of windows, number of hops, and the network load, together with success rate and the simulation results demonstrate the advantages of the FDPSM for in-vehicle TSN networks. © 2025 IEEE. All rights reserved,

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Unknown-Aware Bilateral Dependency Optimization for Defending Against Model Inversion Attacks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Peng, Xiong Liu, Feng Wang, Nannan Lan, Long Liu, Tongliang Cheung, Yiu-Ming Han, Bo Hong Kong Baptist University Department of Computer Science Hong Kong The University of Melbourne School of Computing and Information Systems Australia Xidian University State Key Laboratory of Integrated Services Networks School of Telecommunications Engineering Shaanxi Xi'an710071 China National University of Defense Technology State Key Laboratory of High Performance Computing School of Computer Hunan Changsha410000 China The University of Sydney Sydney AI Centre School of Computer Science Faculty of Engineering Australia

By abusing access to a well-trained classifier, model inversion (MI) attacks pose a significant threat as they can recover the original training data, leading to privacy leakage. Previous studies mitigated MI attacks by imposing regularization to reduce the dependency between input features and outputs during classifier training, a strategy known as unilateral dependency optimization. However, this strategy contradicts the objective of minimizing the supervised classification loss, which inherently seeks to maximize the dependency between input features and outputs. Consequently, there is a trade-off between improving the model's robustness against MI attacks and maintaining its classification performance. To address this issue, we propose the bilateral dependency optimization strategy (BiDO), a dual-objective approach that minimizes the dependency between input features and latent representations, while simultaneously maximizing the dependency between latent representations and labels. BiDO is remarkable for its privacy-preserving capabilities. However, models trained with BiDO exhibit diminished capabilities in out-of-distribution (OOD) detection compared to models trained with standard classification supervision. Given the open-world nature of deep learning systems, this limitation could lead to significant security risks, as encountering OOD inputs—whose label spaces do not overlap with the in-distribution (ID) data used during training-is inevitable. To address this, we leverage readily available auxiliary OOD data to enhance the OOD detection performance of models trained with BiDO. This leads to the introduction of an upgraded framework, unknown-aware BiDO (BiDO+), which mitigates both privacy and security concerns. As a highlight, with comparable model utility, BiDO-HSIC+ reduces the FPR95 by 55.02% and enhances the AUCROC by 9.52% compared to BiDO-HSIC, while also providing superior MI robustness. © 1979-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Secure Integrated Sensing and SWIPT via Active IRS

引用

IEEE Transactions on Wireless Communications 2025年

作者： Xu, Jinlei Zhang, Jifa Liu, Mingqian Zhao, Nan Al-Dhahir, Naofal Wang, Xianbin Dalian University of Technology School of Information and Communication Engineering Dalian116024 China Xidian University State Key Laboratory of Integrated Service Networks Shanxi Xian710071 China University of Texas at Dallas Department of Electrical and Computer Engineering RichardsonTX75083 United States Western University Department of Electrical and Computer Engineering LondonONN6A 5B9 Canada

To achieve sustainable communication and sensing, simultaneous wireless information and power transfer (SWIPT) has been introduced into integrated sensing and communication (ISAC). However, this combination brings significant security challenges due to signal multiplexing and spectrum sharing. In this paper, an active intelligent reflecting surface (IRS) assisted secure integrated sensing and SWIPT system is proposed with the power splitting (PS) model adopted. To maximize the harvested power while satisfying the constraints of sidelobe level ratio and secrecy rate, a problem is formulated to jointly optimize the transmit beamforming, artificial noise (AN) vectors, PS ratios, and amplification factors and phase shifts of active IRS, which is difficult to solve due to the coupled variables. To this end, we decompose it into two sub-problems, and propose two alternating optimization (AO) algorithms to solve them. First, an AO algorithm based on semi-definite relaxation (SDR) is developed. Specifically, we develop a two-layer algorithm to obtain the transmit beamforming matrix, AN covariance matrix and PS ratios, and utilize the penalty-based method to design the coefficients of active IRS. To reduce the complexity caused by the high-dimensional matrix operation of SDR, an AO algorithm based on successive convex approximation (SCA) is proposed, which can approximate the original problem as a sequence of convex counterparts via the first-order Taylor expansion. Simulation results show that the SCA-based AO algorithm can achieve the performance close to that of SDR with lower complexity. © 2002-2012 IEEE.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：