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

Preparing a commercial quantum key distribution system for certification against implementation loopholes

Physical Review Applied 2024年第4期22卷 044076页

作者： Vadim Makarov Alexey Abrikosov Poompong Chaiwongkhot Aleksey K. Fedorov Anqi Huang Evgeny Kiktenko Mikhail Petrov Anastasiya Ponosova Daria Ruzhitskaya Andrey Tayduganov Daniil Trefilov Konstantin Zaitsev Skolkovo Moscow 121205 Russia Vigo Quantum Communication Center NTI Center for Quantum Communications Department of Physics Faculty of Science Institute for Quantum Computing Department of Physics and Astronomy Quantum technology foundation (Thailand) Bangkok 10110 Thailand QRate Skolkovo Moscow 143026 Russia Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology Moscow 119991 Russia atlanTTic Research Center School of Telecommunication Engineering Department of Signal Theory and Communications Moscow 101000 Russia

A commercial quantum key distribution (QKD) system needs to be formally certified to enable its wide deployment. The certification should include the system’s robustness against known implementation loopholes and attacks that exploit them. Here we ready a fiber-optic QKD system for this procedure. The system has a prepare-and-measure scheme with decoy-state BB84 protocol, polarization encoding, a qubit source rate of 312.5 MHz, and is manufactured by QRate. We detail its hardware and postprocessing. We analyze the hardware for known implementation loopholes, search for possible new loopholes, and discuss countermeasures. We then amend the system design to address the highest-risk loopholes identified. We also work out technical requirements on the certification lab and outline its possible structure.

关键词： Quantum communication Quantum cryptography Quantum protocols

来源：评论

学校读者我要写书评

暂无评论

Modeling Neural Networks Training Process with Markov Decision Process 2

Modeling Neural Networks Training Process with Markov Decisi...

引用

2nd International Conference on Artificial Intelligence and computer Engineering, ICAICE 2021

作者： Bai, Yantao Liu, Wanwei Mao, Xinjun Liang, Zhen National University of Defense Technology Key Laboratory of Software Engineering for Complex Systems Changsha China College of Computer Science National University of Defense Technology Changsha China Institute for Quantum Information National University of Defense Technology State Key Laboratory of High Performance Computing Changsha China

ISBN: (纸本)9781665421867

With the development of computer technology, statistics-based machine learning method has made great break-throughs, and also improved the development of artificial intelligence. Nevertheless, as a very influential model, neural networks are still treated as 'black boxes'. The results of neural networks are extremely sensitive to the training samples, which lead to great challenges to the controllability of the algorithm. With the wide application of machine learning, demand for interpretability and controllability of neural networks algorithms is increasing. As a result, various scholars have tried to explain and verify neural networks algorithms based on formal methods in recent years. In this paper, a method (called MNNTP) is presented to model the training process of neural networks by using a Markov decision process (MDP). Through MNNTP, the neural networks are abstracted into the form of MDP, which makes notable contributions for verifying some mathematical properties of the neural networks. © 2021 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Task-Aware Dynamic Transformer for Efficient Arbitrary-Scale Image Super-Resolution 27

Task-Aware Dynamic Transformer for Efficient Arbitrary-Scale...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Xu, Tianyi Zhou, Yijie Hu, Xiaotao Zhang, Kai Zhang, Anran Qiu, Xingye Xu, Jun School of Statistics and Data Science Nankai University Tianjin China College of Computer Science Nankai University Tianjin China School of Intelligence Science and Technology Nanjing University Suzhou China Tencent Data Platform Beijing China Zhejiang University Hangzhou China Systems Engineering Research Institute China State Shipbuilding Corporation Limited Beijing China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9781643685489

Arbitrary-scale super-resolution (ASSR) aims to learn a single model for image super-resolution at arbitrary magnifying scales. Existing ASSR networks typically comprise an off-the-shelf scale-agnostic feature extractor and an arbitrary scale upsampler. These feature extractors often use fixed network architectures to address different ASSR inference tasks, each of which is characterized by an input image and an upsampling scale. However, this overlooks the difficulty variance of super-resolution on different inference scenarios, where simple images or small SR scales could be resolved with less computational effort than difficult images or large SR scales. To tackle this difficulty variability, in this paper, we propose a Task-Aware Dynamic Transformer (TADT) as an input-adaptive feature extractor for efficient image ASSR. Our TADT consists of a multi-scale feature extraction backbone built upon groups of Multi-Scale Transformer Blocks (MSTBs) and a Task-Aware Routing Controller (TARC). The TARC predicts the inference paths within feature extraction backbone, specifically selecting MSTBs based on the input images and SR scales. The prediction of inference path is guided by a new loss function to trade-off the SR accuracy and efficiency. Experiments demonstrate that, when working with three popular arbitrary-scale upsamplers, our TADT achieves state-of-the-art ASSR performance when compared with mainstream feature extractors, but with relatively fewer computational costs. The code is available at https://***/Tillyhere/TADT. © 2024 The Authors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using Mobile Sinks in WSN: Computational Complexity and a Theoretical Bound

引用

Chinese Journal of Electronics 2023年第1期20卷 147-150页

作者： Yu Gu Yusheng Ji Hongyang Chen Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China State Key Laboratory of Networking and Switching Technology Beijing China Information Systems Architecture Science Research Division NII Tokyo Japan Institute of Industrial Science University of Tokyo Tokyo Japan

In this paper, we study the lifetime optimization problem in wireless sensor networks using mobile sink nodes. This problem is inherently difficult since we need to consider both sink scheduling and data routing. Through a simple case study we develop a novel notation named the Placement pattern (PP) to bound traffic patterns with candidate locations. This significantly decreases the number of elements needed to be scheduled. Based on the PP, we mathematically formulate this optimization problem as a Mixed-integer non-linear programming (MINLP), which is very tough and time consuming to solve. By proving that the problem is NP-complete, we point out that instead of seeking an optimal algorithm, heuristic algorithms, especially those with performance guarantee, would be much more desirable to develop. Furthermore, in order to help identify performance gains of heuristic algorithms proposed in the future, we develop a Linear programming (LP) formulation which serves as an upper bound by adopting a reformulation and relaxation technique.

关键词： Wireless sensor networks Upper bound Heuristic algorithms Traffic control Programming Performance gain Routing

来源：评论

学校读者我要写书评

暂无评论

Meta Actor-Critic Framework for Multi-Agent Reinforcement Learning 4

Meta Actor-Critic Framework for Multi-Agent Reinforcement Le...

引用

4th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2021

作者： Huang, Jiateng Huang, Wanrong Wu, Dan Lan, Long Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology China Artifcial Intelligence Research Center National Innovation Institute of Defense Technology China College of Computer and Hefei Interdisciplinary Center National University of Defense Technology China

ISBN: (纸本)9781450384087

In recent years, multi-agent reinforcement learning has received sustained attention in the last few years. The typical Actor-Critic methods learn mappings directly from observation to action without understanding the tasks themselves. In this paper, we present a meta actor-critic framework for meta-actor critique based on observational learning processes and the additional loss of meta-learning actors to accelerate and improve multi-agent learning across agents' experiences. Within our framework, all agents are deliberately designed to share the same meta-critic loss to achieve the optimum actor learning progress. Meanwhile, by minimizing the loss of meta-actors, the meta actor learns the features of the meta-observation, leading to better actions. We implemented the MADDPG and MATD3 algorithms in our proposed framework and empirically demonstrated the superiority of our framework on two kinds of multi-agent tasks. In addition, the framework can be flexibly incorporated into various contemporary multi-agent Actor-Critic methods. © 2021 ACM.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Interpersonal Relationship Analysis with Dyadic EEG Signals via Learning Spatial-Temporal Patterns 4th

Interpersonal Relationship Analysis with Dyadic EEG Signals...

引用

4th International Workshop on Human Brain and Artificial Intelligence, HBAI 2024

作者： Ji, Wenqi Liu, Fang Du, Xinxin Liu, Niqi Zhou, Chao Yu, Minjing Guo, Xinyue Zhao, Guozhen Liu, Yong-Jin Department of Computer Science and Technology Tsinghua University Beijing100084 China State Key Laboratory of Media Convergence and Communication Communication University of China Beijing100024 China Institute of Software Chinese Academy of Sciences Beijing100190 China College of Intelligence and Computing Tianjin University Tianjin300072 China CAS Key Laboratory of Behavioral Science Institute of Psychology Beijing100049 China

ISBN: (纸本)9789819640003

Interpersonal relationship quality is pivotal in social and occupational contexts. Existing analysis of interpersonal relationships mostly rely on subjective self-reports, whereas objective quantification remains challenging. In this paper, we propose a novel social relationship analysis framework using spatio-temporal patterns derived from dyadic EEG signals, which can be applied to quantitatively measure team cooperation in corporate team building, and evaluate interpersonal dynamics between therapists and patients in psychiatric therapy. First, we constructed a dyadic-EEG dataset from 72 pairs of participants with two relationships (stranger or friend) when watching emotional videos simultaneously. Then we proposed a deep neural network on dyadic-subject EEG signals, in which we combine the dynamic graph convolutional neural network for characterizing the interpersonal relationships among the EEG channels and 1-dimension convolution for extracting the information from the time sequence. To obtain the feature vectors from two EEG recordings that well represent the relationship of two subjects, we integrate deep canonical correlation analysis and triplet loss for training the network. Experimental results show that the social relationship type (stranger or friend) between two individuals can be effectively identified through their EEG data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Exploiting Completeness and Uncertainty of Pseudo Labels for Weakly Supervised Video Anomaly Detection

Exploiting Completeness and Uncertainty of Pseudo Labels for...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Chen Zhang Guorong Li Yuankai Qi Shuhui Wang Laiyun Qing Qingming Huang Ming-Hsuan Yang State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences Australian Institute for Machine Learning The University of Adelaide Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS University of California Merced

Weakly supervised video anomaly detection aims to identify abnormal events in videos using only video-level labels. Recently, two-stage self-training methods have achieved significant improvements by self-generating pseudo labels and self-refining anomaly scores with these labels. As the pseudo labels play a crucial role, we propose an enhancement framework by exploiting completeness and uncertainty properties for effective self-training. Specifically, we first design a multi-head classification module (each head serves as a classifier) with a diversity loss to maximize the distribution differences of predicted pseudo labels across heads. This encourages the generated pseudo labels to cover as many abnormal events as possible. We then devise an iterative uncertainty pseudo label refinement strategy, which improves not only the initial pseudo labels but also the updated ones obtained by the desired classifier in the second stage. Extensive experimental results demonstrate the proposed method performs favorably against state-of-the-art approaches on the UCF-Crime, TAD, and XD-Violence benchmark datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Alleviating Datapath Conflicts and Design Centralization in Graph Analytics Acceleration

arXiv

引用

arXiv 2022年

作者： Lin, Haiyang Yan, Mingyu Wang, Duo Zou, Mo Tu, Fengbin Ye, Xiaochun Fan, Dongrui Xie, Yuan State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China University of California at Santa Barbara CA United States

Previous graph analytics accelerators have achieved great improvement on throughput by alleviating irregular off-chip memory accesses. However, on-chip side datapath conflicts and design centralization have become the critical issues hindering further throughput improvement. In this paper, a general solution, Multiple-stage Decentralized Propagation network (MDP-network), is proposed to address these issues, inspired by the key idea of trading latency for throughput. Besides, a novel High throughput Graph analytics accelerator, HiGraph, is proposed by deploying MDP-network to address each issue in practice. The experiment shows that compared with state-of-the-art accelerator, HiGraph achieves up to 2.2× speedup (1.5× on average) as well as better scalability. Copyright © 2022, The Authors. All rights reserved.

关键词： Acceleration

来源：评论

学校读者我要写书评

暂无评论

ID-Guard: A Universal Framework for Combating Facial Manipulation via Breaking Identification

arXiv

引用

arXiv 2024年

作者： Qu, Zuomin Lu, Wei Luo, Xiangyang Wang, Qian Cao, Xiaochun The School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Institute of Artificial Intelligence Sun Yat-sen University Guangzhou510006 China The State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450002 China The School of Cyber Science and Engineering Wuhan University Wuhan430072 China The School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Shenzhen518107 China

—The misuse of deep learning-based facial manipulation poses a potential threat to civil rights. To prevent this fraud at its source, proactive defense technology was proposed to disrupt the manipulation process by adding invisible adversarial perturbations into images, making the forged output unconvincing to the observer. However, their non-directional disruption of the output may result in the retention of identity information of the person in the image, leading to stigmatization of the individual. In this paper, we propose a novel universal framework for combating facial manipulation, called ID-Guard. Specifically, this framework requires only a single forward pass of an encoder-decoder network to generate a cross-model universal adversarial perturbation corresponding to a specific facial image. To ensure anonymity in manipulated facial images, a novel Identity Destruction Module (IDM) is introduced to destroy the identifiable information in forged faces targetedly. Additionally, we optimize the perturbations produced by considering the disruption towards different facial manipulations as a multitask learning problem and design a dynamic weights strategy to improve cross-model performance. The proposed framework reports impressive results in defending against multiple widely used facial manipulations, effectively distorting the identifiable regions in the manipulated facial images. In addition, our experiments reveal the ID-Guard’s ability to enable disrupted images to avoid face inpaintings and open-source image recognition systems. Copyright © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Characterizing the spatial potential of a surface electrode ion trap

arXiv

引用

arXiv 2023年

作者： Qin, Qingqing Chen, Ting Zhang, Xinfang Ou, Baoquan Zhang, Jie Wu, Chunwang Xie, Yi Wu, Wei Chen, Pingxing College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Mechanism and Technology of Quantum Information Hunan Changsha410073 China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science National University of Defense Technology Changsha410073 China

The accurate characterization of the spatial potential generated by a planar electrode in a surface-type Paul trap is of great interest. To achieve this, we employ a simple yet highly precise parametric expression to describe the spatial field of a rectangular-shaped electrode. Based on this, an optimization method is introduced to precisely characterize the axial electric field intensity created by the powered electrode and the stray field. In contrast to existing methods, various types of experimental data, such as the equilibrium position of ions in a linear string, equilibrium positions of single trapped ions and trap frequencies, are utilized for potential estimation in order to mitigate systematic errors. This approach offers significant flexibility in voltage settings for data collection, making it particularly well-suited for surface electrode traps where ion probe trapping height may vary with casual voltage settings. In our demonstration, we successfully minimized the discrepancy between experimental observations and model predictions to an impressive extent. The relative errors of secular frequencies were suppressed within ±0.5%, and the positional error of ions was limited to less than 1.2 µm, all surpassing those achieved by existing methodologies. Copyright © 2023, The Authors. All rights reserved.

关键词： Electrodes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：