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

Quantum-to-quantum Bernoulli factory problem

Physical Review A 2018年第3期97卷 032303-032303页

作者： Jiaqing Jiang Jialin Zhang Xiaoming Sun CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China

Given a coin with unknown bias p∈[0,1], can we exactly simulate another coin with bias f(p)? The exact set of simulable functions has been well characterized 20 years ago. In this paper, we ask the quantum counterpart of this question: Given the quantum coin |p〉=p|0〉+1−p|1〉, can we exactly simulate another quantum coin |f(p)〉=f(p)|0〉+1−f(p)|1〉? We give the full characterization of simulable quantum state k0(p)|0〉+k1(p)|1〉 from quantum coin |p〉=p|0〉+1−p|1〉, and present an algorithm to transform it. Surprisingly, we show that simulable sets in the quantum-to-quantum case and classical-to-classical case have no inclusion relationship with each other.

关键词： Quantum algorithms Quantum computation Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Temporal Refinement Graph Convolutional network for Skeleton-Based Action Recognition

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第4期5卷 1586-1598页

作者： Zhuang, Tianming Qin, Zhen Ding, Yi Deng, Fuhu Chen, Leduo Qin, Zhiguang Raymond Choo, Kim-Kwang University of Electronic Science and Technology of China Network and Data Security Key Laboratory of Sichuan Province Chengdu Sichuan610054 China University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu Sichuan610054 China School of Advanced Technology Suzhou Jiangsu215123 China University of Texas at San Antonio Department of Information Systems and Cyber Security San AntonioTX78249 United States

Human skeleton data, which has served in the aspect of human activity recognition, ought to be the most representative biometric characteristics due to its intuitivity and visuality. The state-of-the-art approaches mainly focus on improving modeling spatial correlations within graph topologies. However, the interframes motional representations are also of vital importance, and we argue that they are worth paying attention to and exploring. Therefore, a temporal refinement module with contrastive learning mechanism is proposed, fuzing as a complementary to the conventional spatial graph convolution layer. In addition, in order to further exploiting the interframe variances and generalizing graph convolutional network (GCN) operation to temporal dimension, a temporal-correlation matrix is introduced to effectively capture dynamic dependencies within frame-pairs, enhancing semantic feature representation. Moreover, since GCN is a typical local operator which lacks of capability to fully model the long-term relations along spatial and temporal variation, to move beyond the limitation, a spatial-temporal cascaded aggregation (STCA) module is designed to enlarge the receptive filter scale. The overall recognition framework consists of three above novelties, which is capable of achieving remarkable performance by evaluating on benchmark datasets (i.e., NTU RGB+D 60, NTU RGB+D 120, PKU-MMD, and Kinetics Skeleton 400). Extensive experiments demonstrate the effectiveness of the proposed framework, e.g., performing recognition accuracy rate of 90.9% and 96.8% on NTU RGB+D 60, 87.9% and 88.9% on NTU RGB+D 120. © 2020 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Privacy-Preserving data Aggregation Scheme Supporting Arbitrary Statistical Functions in IoT

引用

China Communications 2022年第6期19卷 91-104页

作者： Haihui Liu Jianwei Chen Liwei Lin Ayong Ye Chuan Huang College of Computer and Cyber Security Fujian Normal UniversityFuzhou 350117China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal UniversityFuzhou 350117China School of Computer Science and Mathematics Fujian University of TechnologyFuzhou 350118China Digital Fujian Institute of Big Data Security Technology Fujian Normal UniversityFuzhou 350117China

The Internet of Things(IoT)has profoundly impacted our lives and has greatly revolutionized our *** terminal devices in an IoT data aggregation application sense real-time data for the remote cloud server to achieve intelligent ***,the high frequency of collecting user data will raise people concerns about personal *** recent years,many privacy-preserving data aggregation schemes have been ***,most existing schemes cannot support either arbitrary aggregation functions,or dynamic user group management,or fault *** this paper,we propose an efficient and privacy-preserving data aggregation *** the scheme,we design a lightweight encryption method to protect the user privacy by using a ring topology and a random location *** this basis,the proposed scheme supports not only arbitrary aggregation functions,but also flexible dynamic user ***,the scheme achieves faulttolerant capabilities by utilizing a future data buffering *** analysis reveals that the scheme can achieve the desired security properties,and experimental evaluation results show the scheme's efficiency in terms of computational and communication overhead.

关键词： Internet of Things data aggregation privacy protection arbitrary aggregation functions

来源：评论

学校读者我要写书评

暂无评论

LINKAGE: Listwise Ranking among Varied-Quality References for Non-Factoid QA Evaluation via LLMs

arXiv

引用

arXiv 2024年

作者： Yang, Sihui Bi, Keping Cui, Wanqing Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China

Non-Factoid (NF) Question Answering (QA) is challenging to evaluate due to diverse potential answers and no objective criterion. The commonly used automatic evaluation metrics like ROUGE or BERTScore cannot accurately measure semantic similarities or answers from different perspectives. Recently, Large Language Models (LLMs) have been resorted to for NFQA evaluation due to their compelling performance on various NLP tasks. Common approaches include pointwise scoring of each candidate answer and pairwise comparisons between answers. Inspired by the evolution from pointwise to pairwise to listwise in learning-to-rank methods, we propose a novel listwise NFQA evaluation approach, that utilizes LLMs to rank candidate answers in a list of reference answers sorted by descending quality. Moreover, for NF questions that do not have multi-grade or any golden answers, we leverage LLMs to generate the reference answer list of various quality to facilitate the listwise evaluation. Extensive experimental results on three NFQA datasets, i.e., ANTIQUE, the TREC-DL-NF, and WebGLM show that our method has significantly higher correlations with human annotations compared to automatic scores and common pointwise and pairwise approaches. Our code and dataset can be found at https://***/babyyang525/ LINKAGE-Listwise-NFQA-Evaluation. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of content confidentiality check system 3

Design and implementation of content confidentiality check s...

引用

3rd International Conference on Electronic Information Engineering, Big data, and Computer technology, EIBDCT 2024

作者： Song, Yanyan Chen, Menghong Pi, Chunying Nie, Peng College of Computer Science Nankai University Tianjin300350 China College of Cyber Science Nankai University Tianjin300350 China College of Cyber Science Tianjin Key Laboratory of Network and Data Security Technology Nankai University Tianjin300350 China

ISBN: (纸本)9781510680449

Nowadays, companies use databases for information storage and it is inevitable that there will be confidential information which can cause severe crises and public relations problems if leaked. In order to solve this problem, we designed and implemented a content confidentiality check system for database. In this paper, the first section introduces the module design of the system. The second section introduces the key technology implementation of the system, which includes how to detect sensitive words and user password strength. The third section shows the running interface and detection results of the system. In short, this system helps users to realize a more convenient self inspection of the confidential content stored in their database, aiming to provide a strong guarantee for data storage security. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Graph based Tensor Recovery for Accurate Internet Anomaly Detection

Graph based Tensor Recovery for Accurate Internet Anomaly De...

引用

2018 IEEE Conference on Computer Communications, INFOCOM 2018

作者： Xie, Kun Li, Xiaocan Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Department of Electrical and Computer Engineering State University of New York at Stony Brook United States Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781538641286

Detecting anomalous traffic is a crucial task of managing networks. Many anomaly detection algorithms have been proposed recently. However, constrained by their matrix-based traffic data model, existing algorithms often suffer from low detection accuracy. To fully utilize the multi-dimensional information hidden in the traffic data, this paper takes an initiative to investigate the potential and methodologies of performing tensor factorization for more accurate Internet anomaly detection. Only considering the low-rank linearity features hidden in the data, current tensor factorization techniques would result in low anomaly detection accuracy. We propose a novel Graph-based Tensor Recovery model (Graph-TR) to well explore both low rank linearity features as well as the non-linear proximity information hidden in the traffic data for better anomaly detection. We encode the non-linear proximity information of the traffic data by constructing nearest neighbor graphs and incorporate this information into the tensor factorization using the graph Laplacian. Moreover, to facilitate the quick building of neighbor graph, we propose a nearest neighbor searching algorithm with the simple locality-sensitive hashing (LSH). We have conducted extensive experiments using Internet traffic trace data Abilene and GEANT. Compared with the state of art algorithms on matrix-based anomaly detection and tensor recovery approach, our Graph-Trcan achieve significantly lower False Positive Rate and higher True Positive Rate. © 2018 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Self-feedback LSTM regression model for real-time particle source apportionment

引用

Journal of Environmental sciences 2022年第4期34卷 10-20页

作者： Wei Wang Weiman Xu Shuai Deng Yimeng Chai Ruoyu Ma Guoliang Shi Bo Xu Mei Li Yue Li Trusted AI System Laboratory College of Computer ScienceNankai UniversityTianjin 300350China KLMDASR Tianjin Key Laboratory of Network and Data Security TechnologyTianjin 300350China State Environmental Protection Key Laboratory of Urban Ambient Air Particulate Matter Pollution Prevention and Control College of Environmental Science and EngineeringNankai UniversityTianjin 300071China Institute of Mass Spectrometry and Atmospheric Environment Guangdong Provincial Engineering Research Center for on-line source apportionment system of air pollution Jinan UniversityGuangzhou 510632China Guangdong-Hongkong-Macao Joint Laboratory of Collaborative Innovation for Environmental Quality Guangzhou 510632China

Atmospheric particulate matter pollution has attracted much wider attention *** recent years,the development of atmospheric particle collection techniques has put forwards new demands on the real-time source apportionments *** demands are summarized,in this paper,as how to set up new restraints in apportionment and how to develop a non-linear regression model to process complicated circumstances,such as the existence of secondary source and similar *** this study,we firstly analyze the possible and potential restraints in single particle source apportionment,then propose a novel three-step self-feedback long short-term memory(SF-LSTM)network for approximating the source *** proposed deep learning neural network includes three modules,as generation,scoring and refining,and regeneration *** from the scoring modules,SF-LSTM implants four loss functions representing four restraints to be followed in the apportionment,meanwhile,the regeneration module calculates the source contribution in a non-linear *** results show that the model outperforms the conventional regression methods in the overall performance of the four evaluation indicators(residual sum of squares,stability,sparsity,negativity)for the ***,in short time-resolution analyzing,SF-LSTM provides better results under the restraint of stability.

关键词： Time series Regression Self-feedback LSTM network Particle source apportionment

来源：评论

学校读者我要写书评

暂无评论

PathAFL: Path-Coverage Assisted Fuzzing 20

PathAFL: Path-Coverage Assisted Fuzzing

引用

15th ACM Asia Conference on Computer and Communications Security, ASIA CCS 2020

作者： Yan, Shengbo Wu, Chenlu Li, Hang Shao, Wei Jia, Chunfu Nankai University College of Cyber Science TianJin China Nankai University College of Artificial Intelligence TianJin China Nankai University College of Cyber Science TianJin Key Laboratory of Network and Data Security Technology TianJin300350 China

ISBN: (纸本)9781450367509

Fuzzing is an effective method to find software bugs and vulnerabilities. One of the most useful techniques is the coverage-guided fuzzing, whose key element is the tracing code coverage information. Existing coverage-guided fuzzers generally use the the number of basic blocks or edges explored to measure code coverage. Path-coverage can provide more accurate coverage information than basic block and edge coverage. However, the number of paths grows exponentially as the size of a program increases. It is almost impossible to trace all the paths of a real-world application. In this paper, we propose a fuzzing solution named PathAFL, which assists a fuzzer by path identification. It can effectively identify and utilize the important h-path, which is a new path but whose edges have all been touched previously. First, PathAFL only inserts one assembly instruction to AFL's original code to calculate the path hash, and uses a selective instrumentation strategy to reduce the tracing granularity of an execution path. Second, we design a fast filtering algorithm to choose higher weight paths from a large number of h-paths and add them to the seed queue. Third, both the seed selection algorithm and the power schedule are implemented based on the path weight. Finally we implemented PathAFL based on the popular fuzzer AFL and evaluated it on 10 well-fuzzed benchmark programs. In 24 hours, PathAFL explored 38% more paths and 9.3% more edges than AFL. Compared with CollAFL-x, the number is 25% and 5.9% correspondingly. Moreover, PathAFL found the more bugs on the LAVA-M dataset, even four unlisted bugs. The results show that PathAFL outperforms the previous fuzzers in terms of both code coverage and bug discovery. In well-tested programs, PathAFL found 8 new security bugs with 6 CVEs assigned. © 2020 ACM.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

MedX-Net: Hierarchical Transformer with Large Kernel Convolutions for 3D Medical Image Segmentation

MedX-Net: Hierarchical Transformer with Large Kernel Convolu...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Lu, Lin Zou, Qingzhi Key Laboratory of Computing Power Network and Information Se-curity Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

Due to the exceptional performance of Transform-ers in 2D medical image segmentation, recent work has also introduced them into 3D medical segmentation tasks. For instance, Swin UNETR and other hierarchical Transformers have reintroduced prior knowledge from several convolutional networks, further enhancing the volume segmentation capabilities of models. The efficacy of these hybrid methodologies is primarily attributed to the substantial quantity of parameters and the nonlocal self-attention mechanism with a large receptive field. We argue that the behavior of these methods' large receptive fields can be simulated by employing fewer parameters through the utilization of depth-wise convolutions with large kernel. Within this manuscript, we introduce a lightweight volume segmentation model called MedX-Net, which uses convolutional network modules to simulate hierarchical Transformers for robust volume segmentation. Firstly, inspired by the hierarchical Transformer module of Swin UNETR, we investigate large-kernel depth-wise convolutions with different sizes to achieve a reduced model parameter count while maintaining a large global receptive field. Secondly, we replace the multilayer perceptron (MLP) in the hierarchical Transformer module with Inverted Bottleneck with Depthwise Convolution Enhancement(DWCE) to improve model performance with fewer activation and normalization layers, further reducing the parameter count. We validate the effectiveness and efficiency of our model for volume segmentation on three public datasets: Synapse, BTCV and ACDC. On the Synapse dataset, compared to Swin UNETR, our model achieves an improvement from 83.48% to 87.21% in Dice score. Compared to the result of 86.57% achieved by nnFormer, our model achieves superior performance while reducing the model parameter count by 64%. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Object Detection Algorithm Based on Second-Order Pooling network and Gaussian Mixture Attention 5

Object Detection Algorithm Based on Second-Order Pooling Net...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Ma, Sugang Li, Ningbo Yang, Xiaobao School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications Shaanxi Xi'an China

ISBN: (纸本)9781450396899

To improve the feature representation ability of the YOLOX algorithm and obtain better detection performance, an object detection algorithm based on second-order pooling network and gaussian mixture attention is proposed. Firstly, the second-order pooling network is added after the PAFPN, and the higher-order statistical information is obtained by calculating the covariance matrix between different channels, to enhance the non-linear modeling capability. Secondly, the mixture attention based on the gaussian function is added after the SPP to model global contexts in the spatial and channel dimensions respectively, which improves the network performance with almost no extra parameters. The experimental results show that the detection accuracy of the proposed algorithm on the PASCAL VOC dataset reaches 82.6 %, which is 1.6 % higher than the YOLOX algorithm. © 2022 ACM.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：