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

Quantum memory assisted entangled state verification with local measurements

Physical Review Research 2025年第1期7卷 013003-013003页

作者： Siyuan Chen Wei Xie Ping Xu Kun Wang Hefei National Research Center for Physical Sciences at the Microscale and School of Physical Sciences University of Science and Technology of China Hefei 230026 China College of Physics Jilin University Changchun 130012 China School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha 410073 China

We consider the quantum memory assisted quantum state verification task, where an adversary prepares independent multipartite entangled states and sends them to the local verifiers, who then store several copies in the quantum memory and measure them collectively to make a decision. We establish an exact analytic formula for optimizing two-copy state verification, where the verifiers store two copies, and give a globally optimal two-copy strategy for multiqubit graph states involving only Bell measurements. When the verifiers can store arbitrarily many copies, we present a dimension expansion technique that designs efficient verification strategies for this case, showcasing its application to efficiently verifying Greenberger-Horne-Zeilinger (GHZ)-like states. These strategies become increasingly advantageous with growing memory resources, ultimately approaching the theoretical limit of efficiency. Our findings demonstrate that quantum memories enhance state verification efficiency, shedding light on error-resistant strategies and practical applications of large-scale quantum memory assisted verification.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

DFMC:Feature-Driven Data-Free Knowledge Distillation

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Zhang, Zherui Xu, Rongtao Wang, Changwei Xu, Wenhao Chen, Shunpeng Xu, Shibiao Xu, Guangyuan Guo, Li Beijing University of Posts and Telecommunications School of Artificial Intelligence Beijing100876 China Chinese Academy of Sciences State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Beijing100190 China Qilu University of Technology Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250316 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Data-Free Knowledge Distillation (DFKD) enables knowledge transfer from teacher networks without access to the real dataset. However, generator-based DFKD methods often suffer from insufficient diversity or low-confidence in synthetic images, negatively impacting student network performance. This paper introduces DFMC, a generative feature-driven framework to mitigate the inherent limitations of DFKD. We propose exploiting semantic description between generative feature domains to guide augmentation strategies, avoiding random abstract inputs caused by inconsistent semantic quality. Then, by applying noise to the generative features, we produce contrastive learning pairs indirectly, limiting the sampling range of the feature domain to encourage the student network to learn domain-invariant features. Finally, we guide the student network to deeply mimic the teacher’s layer-wise implicit classification behavior for the augmented synthetic images. Extensive experiments across various datasets and downstream tasks demonstrate the effectiveness of DFMC, achieving significant improvements while preventing student networks from overfitting to semantic ambiguous images. © 1991-2012 IEEE.

关键词： Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Towards Depth-continuous Scene Representation with Displacement Field for Robust Light Field Depth Estimation

引用

IEEE Transactions on Multimedia 2025年

作者： Chen, Rongshan Sheng, Hao Yang, Da Cong, Ruixuan Cui, Zhenglong Wang, Sizhe Wang, Tun Zhao, Mingyuan Beihang University State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China Beihang University Key Laboratory of Data Science and Intelligent Computing International Innovation Institute 166 Shuanghongqiao Street Pingyao Town Yuhang District Hangzhou31 1115 China Macao Polytechnic University Faculty of Applied Sciences Macao999078 China

The light field (LF) captures both the spatial and angular information of scenes, enabling accurate depth estimation. However, previous deep learning methods typically model surface depth only while ignoring the continuous nature of depth in 3D scenes. In this paper, we use the displacement field (DF) to describe this continuous property, and propose a novel depth-continuous scene representation for robust LF depth estimation. Experiments demonstrate that our representation enables the network to generate highly detailed depth maps with fewer parameters and faster speeds. Specifically, inspired by the signed distance field in 3D object descriptions, we aim to exploit the intrinsic depth-continuous property of 3D scenes via DF and define a novel depth-continuous scene representation. Then, we introduce a simple, yet general, learning framework for depth-continuous scene embedding, and the proposed network, DepthDF, achieves state-of-the-art performance on both synthetic and real-world LF datasets, ranking 1st on the HCI 4D light field benchmark. Furthermore, previous LF depth estimation methods can also be seamlessly integrated into this framework. Finally, we extend this framework beyond LF depth estimation to various tasks, including multiview stereo depth inference, LF superresolution, and LF salient object detection. Our experiments demonstrate an improved performance when continuous scene representation is applied, suggesting that our framework can potentially provide insights for more fields. © 1999-2012 IEEE.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

DRL-Based Time-Varying Workload Scheduling With Priority and Resource Awareness

引用

IEEE Transactions on Network and Service Management 2025年

作者： Liu, Qifeng Fan, Qilin Zhang, Xu Li, Xiuhua Wang, Kai Xiong, Qingyu Chongqing University School of Big Data and Software Engineering Chongqing400044 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing400044 China Nanjing University School of Electronic Science and Engineering Nanjing210023 China Haihe Laboratory of Information Technology Application Innovation Tianjin300072 China Harbin Institute of Technology School of Computer Science and Technology Weihai264209 China Shandong Key Laboratory of Industrial Network Security Weihai264209 China

With the proliferation of cloud services and the continuous growth in enterprises' demand for dynamic multi-dimensional resources, the implementation of effective strategy for time-varying workload scheduling has become increasingly significant. In this paper, we propose a deep reinforcement learning (DRL)-based method for time-varying workload scheduling, aiming to allocate resources efficiently across servers in the cluster. Specifically, we integrate a classifier and queue scorer to construct a priority queue that exploits temporal resource utilization patterns across different workload classes. Then, we design parallel graph attention layers to capture the dimensional features and temporal dynamics of cloud server cluster. Moreover, we propose a DRL algorithm to generate scheduling strategies that can adapt to dynamic environments. Validation on real-world traces from Google cluster demonstrates that our method outperforms existing approaches in key metrics of cloud server cluster management. © 2004-2012 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Trainbow: a new trusted virtual machine based platform

引用

中国高等学校学术文摘·计算机科学 2010年第1期4卷 47-64页

作者： Yuzhong SUN Yongbing HUANG Yunwei GAO Haifeng FANG Ying SONG Lei DU Kai ZHANG Hongyong ZANG Yaqiong LI Yajun YANG Ran AO Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Graduate University of Chinese Academy of Sciences Beijing 100190China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Graduate University of Chinese Academy of Sciences Beijing 100190China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Department of Computer Science and Technology Xi'an Jiaotong University Xi'an 710049China Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190China Graduate University of Chinese Academy of Sciences Beijing 100190China

Currently, with the evolution of virtualization technology, cloud computing mode has become more and more popular. However, people still concern the issues of the runtime integrity and data security of cloud computing platform, as well as the service efficiency on such computing platform. At the same time, according to our knowledge, the design theory of the trusted virtual computing environment and its core system software for such network-based computing platform is at the exploratory stage. In this paper, we believe that efficiency and isolation are the two key proprieties of the trusted virtual computing environment. To guarantee these two proprieties, based on the design principle of splitting, customizing, reconstructing, and isolation-based enhancing to the platform, we introduce TRainbow, a novel trusted virtual computing platform developing by our research *** the two creative mechanisms, that is, capacity flowing amongst VMs and VM-based kernel reconstructing, TRainbow provides great improvements (up to 42%) in service performance and isolated reliable computing environment for Internet-oriented, large-scale, concurrent services.

关键词： computing platform virtual machine capacity service computing trust chain isolation

来源：评论

学校读者我要写书评

暂无评论

Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Dong, Xuewen Li, Jiachen Li, Shujun You, Zhichao Qu, Qiang Kholodov, Yaroslav Shen, Yulong The School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi’an710071 China The School of Computing Kent Interdisciplinary Research Centre in Cyber Security University of Kent CanterburyCT2 7NF United Kingdom Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China The Intelligent Transportation Systems Lab Innopolis University Innopolis Russia The School of Computer Science and Technology Xidian University China

Recent studies show that graph neural networks (GNNs) are vulnerable to backdoor attacks. Existing backdoor attacks against GNNs use fixed-pattern triggers and lack reasonable trigger constraints, overlooking individual graph characteristics and rendering insufficient evasiveness. To tackle the above issues, we propose ABARC, the first Adaptive Backdoor Attack with Reasonable Constraints, applying to both graph-level and node-level tasks in GNNs. For graph-level tasks, we propose a subgraph backdoor attack independent of the graph’s topology. It dynamically selects trigger nodes for each target graph and modifies node features with constraints based on graph similarity, feature range, and feature type. For node-level tasks, our attack begins with an analysis of node features, followed by selecting and modifying trigger features, which are then constrained by node similarity, feature range, and feature type. Furthermore, an adaptive edge-pruning mechanism is designed to reduce the impact of neighbors on target nodes, ensuring a high attack success rate (ASR). Experimental results show that even with reasonable constraints for attack evasiveness, our attack achieves a high ASR while incurring a marginal clean accuracy drop (CAD). When combined with the state-of-the-art defense randomized smoothing (RS) method, our attack maintains an ASR over 94%, surpassing existing attacks by more than 7%. © 2004-2012 IEEE. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Graph Contrastive Learning with Progressive Augmentations 25

Graph Contrastive Learning with Progressive Augmentations

引用

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1

作者： Yuhai Zhao Yejiang Wang Zhengkui Wang Wen Shan Miaomiao Huang Xingwei Wang School of Computer Science and Engineering Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University Shenyang Liaoning China InfoComm Technology Cluster Singapore Institute of Technology Singapore Singapore Singapore University of Social Sciences Singapore Singapore School of Computer Science and Engineering Northeastern University Shenyang Liaoning China

ISBN: (纸本)9798400712456

To be still yet still moving. - Do Hyun ChoeGraph contrastive learning (GCL) has recently gained prominence in unsupervised graph representation learning. Traditional GCL approaches generally focus on creating a single contrastive view alongside the main graph view, targeting invariant representation learning in a static framework. Our study introduces a novel manner: despite using static graphs, we aim to learn invariant representations by generating a series of evolving contrastive views with temporal coherence and multi-viewpoint insights at various granularities. In this context, we propose the Progressive Augmentation framework for Graph Contrastive Learning (PaGCL). This framework advances beyond traditional methods by producing a sequence of augmented views, each evolving from the previous one, and assigning timestamps based on piecewise smoothness. This approach enables our model to more effectively extract invariant features from these dynamic views, capturing multi-grained structural and temporal information. Our experiments on diverse benchmark datasets demonstrate that PaGCL significantly outperforms current state-of-the-art methods.

关键词： graph representation learning}

来源：评论

学校读者我要写书评

暂无评论

Meta-Transfer Learning Based Cross-Domain Gesture Recognition Using WiFi Channel State Information

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Dai, Penglin Zhou, Junfei Ma, Jialong Zhang, Hao Wu, Xiao Southwest Jiaotong University School of Computing and Artificial Intelligence Chengdu611756 China Ministry of Education Engineering Research Center of Sustainable Urban Intelligent Transportation China Tangshan Institute of Southwest Jiaotong University Tangshan063000 China Chongqing University of Posts and Telecommunications College of Computer Science and Technology Key Laboratory of Data Engineering and Visual Computing Chongqing400065 China

Gesture recognition plays a crucial role in a wide range of consumer electronics applications, including human-computer interaction and virtual reality, by enabling the identification and interpretation of human gestures. In recent times, WiFi-based gesture recognition has garnered significant attention due to its privacy protection and unobtrusive nature. However, this approach heavily depends on neural network-based models and is notably influenced by environmental conditions, such as specific location and orientation. To address these environmental impacts, we propose a network framework that leverages transfer learning and meta-learning. The primary focus is on utilizing transfer learning to train a convolutional neural network (ResNet) for feature extraction, enabling the extraction of domain-independent features specifically related to gestures, rather than being influenced by environmental factors. Additionally, we employ the meta-learning algorithm MAML to train the fully connected network for gesture classification. Following training, a small set of samples can be utilized for rapid adaptation to diverse domains, maintaining high accuracy across different domains to achieve cross-domain gesture recognition. Our performance evaluation is based on the Widar 3.0 dataset, encompassing both in-domain and cross-domain scenarios. The simulation results demonstrate that our proposed algorithm surpasses Widar3.0 and WiGRUNT by approximately 7.9% and 1.12% in gesture recognition accuracy across all scenarios. © 2025 IEEE.

关键词： Wi-Fi

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

arXiv

引用

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：