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

arXiv 2024年

作者： Gong, Cheng Chen, Yao Luo, Qiuyang Lu, Ye Li, Tao Zhang, Yuzhi Sun, Yufei Zhang, Le College of Software Nankai University China College of Computer Science Nankai University China National University of Singapore Singapore School of Information and Communication Engineering University of Electronic Science and Technology of China China HAIHE Lab of ITAI China Tianjin Key Laboratory of Network and Data Security Technology China Key Laboratory of Data and Intelligent System Security Ministry of Education

Multi-exit network is a promising architecture for efficient model inference by sharing backbone networks and weights among multiple exits. However, the gradient conflict of the shared weights results in sub-optimal accuracy. This paper introduces Deep Feature Surgery (DFS), which consists of feature partitioning and feature referencing approaches to resolve gradient conflict issues during the training of multi-exit networks. The feature partitioning separates shared features along the depth axis among all exits to alleviate gradient conflict while simultaneously promoting joint optimization for each exit. Subsequently, feature referencing enhances multi-scale features for distinct exits across varying depths to improve the model accuracy. Furthermore, DFS reduces the training operations with the reduced complexity of backpropagation. Experimental results on Cifar100 and ImageNet datasets exhibit that DFS provides up to a 50.00% reduction in training time and attains up to a 6.94% enhancement in accuracy when contrasted with baseline methods across diverse models and tasks. Budgeted batch classification evaluation on MSDNet demonstrates that DFS uses about 2× fewer average FLOPs per image to achieve the same classification accuracy as baseline methods on Cifar100. The code is available at https: //***/GongCheng1919/dfs. Copyright © 2024, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal meets Wavelet: Disentangled Traffic Flow Forecasting via Efficient Spectral Graph Attention network

arXiv

引用

arXiv 2021年

作者： Fang, Yuchen Qin, Yanjun Luo, Haiyong Zhao, Fang Xu, Bingbing Wang, Chenxing Zeng, Liang School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications China Research Center for Ubiquitous Computing Systems Institute of Computing Technology Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Tsinghua University China

Traffic forecasting is crucial for public safety and resource optimization, yet is very challenging due to three aspects: i) current existing works mostly exploit intricate temporal patterns (e.g., the short-term thunderstorm and long-term daily trends) within a single method, which fail to accurately capture spatio-temporal dependencies under different schemas;ii) the under-exploration of the graph positional encoding limit the extraction of spatial information in the commonly used full graph attention network;iii) the quadratic complexity of the full graph attention introduces heavy computational needs. To achieve the effective traffic flow forecasting, we propose an efficient spectral graph attention network with disentangled traffic sequences. Specifically, the discrete wavelet transform is leveraged to obtain the low- and high-frequency components of traffic sequences, and a dual-channel encoder is elaborately designed to accurately capture the spatio-temporal dependencies under long- and short-term schemas of the low- and high-frequency components. Moreover, a novel wavelet-based graph positional encoding and a query sampling strategy are introduced in our spectral graph attention to effectively guide message passing and efficiently calculate the attention. Extensive experiments on four real-world datasets show the superiority of our model, i.e., the higher traffic forecasting precision with lower computational cost. Copyright © 2021, The Authors. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Long-Distance Entanglement Purification for Quantum Communication

引用

Physical Review Letters 2021年第1期126卷 010503-010503页

作者： Xiao-Min Hu Cen-Xiao Huang Yu-Bo Sheng Lan Zhou Bi-Heng Liu Yu Guo Chao Zhang Wen-Bo Xing Yun-Feng Huang Chuan-Feng Li Guang-Can Guo CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei 230026 People’s Republic of China CAS Center For Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei 230026 People’s Republic of China Institute of Quantum Information and Technology Nanjing University of Posts and Telecommunications Nanjing 210003 People’s Republic of China School of Science Nanjing University of Posts and Telecommunications Nanjing 210003 People’s Republic of China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing 210003 People’s Republic of China

High-quality long-distance entanglement is essential for both quantum communication and scalable quantum networks. Entanglement purification is to distill high-quality entanglement from low-quality entanglement in a noisy environment and it plays a key role in quantum repeaters. The previous significant entanglement purification experiments require two pairs of low-quality entangled states and were demonstrated in tabletop. Here we propose and report a high-efficiency and long-distance entanglement purification using only one pair of hyperentangled state. We also demonstrate its practical application in entanglement-based quantum key distribution (QKD). One pair of polarization spatial-mode hyperentanglement was distributed over 11 km multicore fiber (noisy channel). After purification, the fidelity of polarization entanglement arises from 0.771 to 0.887 and the effective key rate in entanglement-based QKD increases from 0 to 0.332. The values of Clauser-Horne-Shimony-Holt inequality of polarization entanglement arises from 1.829 to 2.128. Moreover, by using one pair of hyperentanglement and deterministic controlled-NOT gates, the total purification efficiency can be estimated as 6.6×103 times than the experiment using two pairs of entangled states with spontaneous parametric down-conversion sources. Our results offer the potential to be implemented as part of a full quantum repeater and large-scale quantum network.

关键词： Entanglement manipulation Optical quantum information processing Quantum communication Quantum optics Quantum protocols

来源：评论

学校读者我要写书评

暂无评论

Roland: Robust In-band Parallel Communication for Magnetic MIMO Wireless Power Transfer System

Roland: Robust In-band Parallel Communication for Magnetic M...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Wangqiu Zhou Hao Zhou Xiang Cui Xinyu Wang Xiaoyan Wang Zhi Liu LINKE Lab School of Computer Science and Technology University of Science and Technology of China CAS Key Laboratory of Wireless-Optical Communications University of Science and Technology of China Deqing Alpha Innovation Institute Huzhou China Graduate School of Science and Engineering Ibaraki University Ibaraki Japan Department of Computer and Network Engineering The University of Electro-Communications Tokyo Japan

In recent years, receiver (RX) feedback communication has attracted increasing attention to enhance the charging performance for magnetic resonant coupling (MRC) based wireless power transfer (WPT) systems. People prefer to adopt the in-band implementation with minimal overhead costs. However, the influence of RX-RX coupling couldn’t be directly ignored like that in the RFID field, i.e., strong couplings and relay phenomenon. In order to solve these two critical issues, we propose a Robust layer-level in-band parallel communication protocol for MIMO MRC-WPT systems (called Roland). Technically, we first utilize the observed channel decomposability to construct group-level channel relationship graph for eliminating the interference caused by strong RX-RX couplings. Then, we generalize such method to deal with the RX dependency due to relay phenomenon. Finally, we conduct extensive experiments on a prototype testbed to evaluate the effectiveness of the proposed scheme. The results demonstrate that our Roland could provide ≥95% average decoding accuracy for concurrent feedback communication of 14 devices. Compared with the state-of-the-art solution, the proposed protocol Roland can achieve an average decoding accuracy improvement of 20.41%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Teaching and Learning of Representations on Graphs 23

Self-Supervised Teaching and Learning of Representations on ...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Fu, Zhenqiang Sun, Lu Wang, Xianpeng Xu, Gang Yan, Xiaoran Xia, Feng Key Laboratory for Ubiquitous Network Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China State Key Laboratory of Marine Resource Utilization in South China Sea School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Recent years have witnessed significant advances in graph contrastive learning (GCL), while most GCL models use graph neural networks as encoders based on supervised learning. In this work, we propose a novel graph learning model called GraphTL, which explores self-supervised teaching and learning of representations on graphs. One critical objective of GCL is to retain original graph information. For this purpose, we design an encoder based on the idea of unsupervised dimensionality reduction of locally linear embedding (LLE). Specifically, we map one iteration of the LLE to one layer of the network. To guide the encoder to better retain the original graph information, we propose an unbalanced contrastive model consisting of two views, which are the learning view and the teaching view, respectively. Furthermore, we consider the nodes that are identical in muti-views as positive node pairs, and design the node similarity scorer so that the model can select positive samples of a target node. Extensive experiments have been conducted over multiple datasets to evaluate the performance of GraphTL in comparison with baseline models. Results demonstrate that GraphTL can reduce distances between similar nodes while preserving network topological and feature information, yielding better performance in node classification. © 2023 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Ads-Cnn: Adaptive dataflow Scheduling for Lightweight Cnn Accelerator on Fpgas

SSRN

引用

SSRN 2023年

作者： Wan, Yi Xie, Xianzhong Chen, Junfan Xie, Kunpeng Yi, Dezhi Lu, Ye Gai, Keke The College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Haiyunjiexun Technology Co. Ltd Chongqing China The College of Computer Science Nankai University Tianjin300350 China The College of Cyber Science Nankai University Tianjin300350 China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China State Key Laboratory of Processors ICT CAS Beijing China School of Cyberspace Science and Technology BIT Beijing China

Lightweight convolutional neural networks (CNNs) enable lower inference latency and data traffic, which are suitable for deployment on resource-constrained edge devices such as field-programmable gate arrays (FPGAs). However, repeated data access to off-chip synchronous dynamic random-access memory (SDRAM) is required during inference, which seriously results in a reduction in inference speed and system power efficiency. In this paper, we propose an adaptive dataflow scheduling method for lightweight CNN accelerator on FPGAs named ADS-CNN. The key idea of ADS-CNN is to efficiently utilize on-chip resources and reduce the amount of SDRAM access. To achieve the reuse of logical resources, we designed a time division multiplexing calculation engine in ADS-CNN. We developed a configurable module for the convolution controller, and the adaptability is reflected in the data reuse of different convolution layers, which reduces the off-chip access. Furthermore, we made rational use of on-chip memory blocks as buffers based on the configuration of different layers in lightweight CNNs. On the resource-constrained Intel CycloneV SoC 5CSEBA6 FPGA platform, we evaluated six common lightweight CNN models to demonstrate the performance advantages of ADS-CNN. The evaluation results indicate that, compared with accelerators using traditional tiling strategy dataflow, our ADS-CNN can achieve up to 1.29× acceleration gains with a 23.7% overall dataflow scale compression. © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Peer is Your Pillar: A data-unbalanced Conditional GANs for Few-shot Image Generation

arXiv

引用

arXiv 2023年

作者： Li, Ziqiang Wang, Chaoyue Rui, Xue Xue, Chao Leng, Jiaxu Li, Bin Big Data and Decision Lab University of Science and Technology of China China The University of Sydney Australia JD Explore Academic China School of computer science Chongqing University of Posts and Telecommunications China CAS Key Laboratory of Technology in Geo-spatial Information Processing and Application System China

Few-shot image generation aims to train generative models using a small number of training images. When there are few images available for training (e.g. 10 images), Learning From Scratch (LFS) methods often generate images that closely resemble the training data while Transfer Learning (TL) methods try to improve performance by leveraging prior knowledge from GANs pre-trained on large-scale datasets. However, current TL methods may not allow for sufficient control over the degree of knowledge preservation from the source model, making them unsuitable for setups where the source and target domains are not closely related. To address this, we propose a novel pipeline called Peer is your Pillar (PIP), which combines a target few-shot dataset with a peer dataset to create a data-unbalanced conditional generation. Our approach includes a class embedding method that separates the class space from the latent space, and we use a direction loss based on pre-trained CLIP to improve image diversity. Experiments on various few-shot datasets demonstrate the advancement of the proposed PIP, especially reduces the training requirements of few-shot image generation. © 2023, CC BY.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Proposal of a free-space-to-chip pipeline for transporting single atoms

arXiv

引用

arXiv 2023年

作者： Liu, Aiping Liu, Jiawei Kang, Zhanfei Chen, Guang-Jie Xu, Xin-Biao Ren, Xifeng Guo, Guang-Can Wang, Qin Zou, Chang-Ling Institute of Quantum Information and Technology Nanjing University of Posts and Telecommunications Nanjing210003 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei230026 China Broadband Wireless Communication and Sensor Network Technology Key Lab of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing210003 China CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei230026 China

A free-space-to-chip pipeline is proposed to efficiently transport single atoms from a magneto-optical trap to an on-chip evanescent field trap. Due to the reflection of the dipole laser on the chip surface, the conventional conveyor belt approach can only transport atoms close to the chip surface but with a distance of about one wavelength, which prevents efficient interaction between the atom and the on-chip waveguide devices. Here, based on a two-layer photonic chip architecture, a diffraction beam of the integrated grating with an incident angle of the Brewster angle is utilized to realize free-space-to-chip atom pipeline. Numerical simulation verified that the reflection of the dipole laser is suppressed and that the atoms can be brought to the chip surface with a distance of only 100 nm. Therefore, the pipeline allows a smooth transport of atoms from free space to the evanescent field trap of waveguides and promises a reliable atom source for a hybrid photonic-atom chip. © 2023, CC BY.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Unifying and Improving Graph Convolutional Neural networks with Wavelet Denoising Filters 23

Unifying and Improving Graph Convolutional Neural Networks w...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Li, Xiaona Han, Huijin Yan, Xiaoran Sun, Lu Ning, Zhaolong Xia, Feng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Graph convolutional neural network (GCN) is a powerful deep learning framework for network data. However, variants of graph neural architectures can lead to drastically different performance on different tasks. Model comparison calls for a unifying framework with interpretability and principled experimental procedures. Based on the theories from graph signal processing (GSP), we show that GCN's capability is fundamentally limited by the uncertainty principle, and wavelets provide a controllable trade-off between local and global information. We adapt wavelet denoising filters to the graph domain, unifying popular variants of GCN under a common interpretable mathematical framework. Furthermore, we propose WaveThresh and WaveShrink which are novel GCN models based on proven denoising filters from the signal processing literature. Empirically, we evaluate our models and other popular GCNs under a more principled procedure and analyze how trade-offs between local and global graph signals can lead to better performance in different datasets. © 2023 ACM.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Secure Deduplication Against Frequency Analysis Attacks

Secure Deduplication Against Frequency Analysis Attacks

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Hang Chen Guanxiong Ha Yuchen Chen Haoyu Ma Chunfu Jia College of Cyber Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Zhejiang Lab Hangzhou China The School of Cyber Engineering Xidian University Xi’an China

Message-locked Encryption (MLE) is the most common approach used in encrypted deduplication systems. However, the systems based on MLE are vulnerable to frequency analysis attacks, because MLE encrypts the identical plain texts into the identical ciphertexts, which is deterministic. The state-of-the- art defense scheme, which named TED, lacks key verification and uses a single key server to record frequency information. Once the key server is compromised, TED will be vulnerable to brute-force attacks. In addition, TED's key generation algorithm needs to be designed more exquisitely to strengthen protection, and its security indicator is not comprehensive. We propose SDAF, which supports key verification and enhanced protection against frequency analysis attacks. Based on chameleon hash, SDAF realizes key verification to prevent malicious key servers from generating fake encryption keys. In order to disturb the frequency information, SDAF introduces reservoir sample to generate uniformly distributed encryption keys, and uses multiple key servers, which interact with each other via multi-party PSI and rotate spontaneously to avoid the single point of failure. Moreover, a new indicator Kurtosis is pointed out to evaluate the security against frequency analysis attacks. We implement the prototypes of SDAF. The experiments of the real-world data sets show that, compared with the existing schemes, SDAF can better resist frequency analysis attacks with lower time overheads.

关键词： Maximum likelihood estimation Time-frequency analysis data privacy Art Prototypes Resists Reservoirs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：