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

Efficient quantum state transmission via perfect quantum network coding

science China(Information sciences) 2019年第1期62卷 191-204页

作者： Zhen-Zhen LI Gang XU Xiu-Bo CHEN Zhiguo QU Xin-Xin NIU Yi-Xian YANG Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Guizhou Provincial Key Laboratory of Public Big Data Guizhou University Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology

Quantum network coding with the assistance of auxiliary resources can achieve perfect transmission of the quantum state. This paper suggests a novel perfect network coding scheme to efficiently solve the quantum k-pair problem, in which only a few assisting resources are introduced. Specifically, only one pair of maximally entangled state needs to be pre-shared between two intermediate nodes, and only O(k) of classical information is transmitted though the network. Moreover, the classical communication used in our protocol does not cause transmission congestion, providing better adaptability to large-scale quantum k-pair *** relevant analyses and comparisons, we demonstrate that our proposed scheme saves resources and has good application value, thereby showing its high efficiency. Furthermore, the proposed scheme achieves 1-max flow quantum communication, and the achievable rate region result is extended from its counterpart over the butterfly network.

关键词： perfect quantum network coding quantum k-pair problem efficient quantum state transmission communication efficiency achievable rate region

来源：评论

学校读者我要写书评

暂无评论

XAI-PSSGAN: Perception-Enhanced Spectrum Shift Generative Adversarial network with Explainable AI System for NIR-II Fluorescence Molecular Imaging

XAI-PSSGAN: Perception-Enhanced Spectrum Shift Generative Ad...

引用

IEEE International Symposium on Biomedical Imaging

作者： Lidan Fu Binchun Lu Lingbing Li Xiaojing Shi Jie Tian Zhenhua Hu CAS Key Laboratory of Molecular Imaging Institute of Automation Chinese Academy of Sciences Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China Department of Precision Instrument Tsinghua University Beijing China Interventional Radiology Department Chinese PLA General Hospital Beijing China Beijing Advanced Innovation Center for Big Data-based Precision Medicine School of Engineering Medicine Beihang University Beijing China Engineering Research Center of Molecular and Neuro Imaging of Ministry of Education School of Life Science and Technology Xidian University Xi'an China National Key Laboratory of Kidney Diseases Beijing China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Fluorescence imaging in the second near-infrared window (NIR-II) facilitates the real-time optical contrast for in vivo biomedical imaging. However, the detection noise is an inevitable byproduct of the real-time imaging process. Additionally, fluorescent probes currently approved for clinical use remain limited within the wavelength of NIR-IIa (1000–1300 nm). NIR-IIb (1500–1700 nm) imaging has the potential to deliver higher resolution than NIR-IIa, but relies on toxic fluorescent probes not approved for human use. To support clinical high-precision imaging, we propose a NIR-II fluorescence enhanced imaging method based on perception-enhanced spectrum shift generative adversarial network with explainable AI systems (xAI-PSSGAN). The proposed method tackles the problem of limited unpaired data training, and generates NIR-IIb resembling images with enhanced resolution and reduced noise. Experimental results demonstrate that proposed method effectively improves the imaging quality and surpasses competing alternatives, which is of great significance to promote the high-quality NIR-II imaging in clinical practice.

关键词： Training Image resolution Explainable AI Statistical analysis Noise Imaging Fluorescence Generative adversarial networks Real-time systems Probes

来源：评论

学校读者我要写书评

暂无评论

Sparse word embeddings using l1 regularized online learning 25

Sparse word embeddings using l1 regularized online learning

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Sun, Fei Guo, Jiafeng Lan, Yanyan Xu, Jun Xueqi, Cheng CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Recently, Word2Vec tool has attracted a lot of interest for its promising performances in a variety of natural language processing (NLP) tasks. However, a critical issue is that the dense word representations learned in Word2Vec are lacking of interpretability. It is natural to ask if one could improve their interpretability while keeping their performances. Inspired by the success of sparse models in enhancing interpretability, we propose to introduce sparse constraint into Word2Vec. Specifically, we take the Continuous Bag of Words (CBOW) model as an example in our study and add the l regularizer into its learning objective. One challenge of optimization lies in that stochastic gradient descent (SGD) cannot directly produce sparse solutions with l regularizer in online training. To solve this problem, we employ the Regularized Dual Averaging (RDA) method, an online optimization algorithm for regularized stochastic learning. In this way, the learning process is very efficient and our model can scale up to very large corpus to derive sparse word representations. The proposed model is evaluated on both expressive power and interpretability. The results show that, compared with the original CBOW model, the proposed model can obtain state-of-the-art results with better interpretability using less than 10% non-zero elements.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Enhanced Self-Supervised Prototypical network for Few-Shot Event Detection

Knowledge-Enhanced Self-Supervised Prototypical Network for ...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences China

Prototypical network based joint methods have attracted much attention in few-shot event detection, which carry out event detection in a unified sequence tagging framework. However, these methods suffer from the inaccurate prototype representation problem, due to two main reasons: the number of instances for calculating prototypes is limited;And, they do not well capture the relationships among event prototypes. To deal with this problem, we propose a Knowledge-Enhanced self-supervised Prototypical network, called KE-PN, for few-shot event detection. KE-PN adopts hybrid rules, which can automatically align event types to an external knowledge base, i.e., FrameNet, to obtain more instances. It proposes a self-supervised learning method to filter out noisy data from enhanced instances. KE-PN is further equipped with an auxiliary event type relationship classification module, which injects the relationship information into representations of event prototypes. Extensive experiments on three benchmark datasets, i.e., FewEvent, MAVEN, and ACE2005 demonstrate the state-of-the-art performance of KE-PN. © 2022 Association for Computational Linguistics.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Event Coreference Resolution with their Paraphrases and Argument-aware Embeddings 28

Event Coreference Resolution with their Paraphrases and Argu...

引用

28th International Conference on Computational Linguistics, COLING 2020

作者： Zeng, Yutao Jin, Xiaolong Guan, Saiping Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781952148279

Event coreference resolution aims to classify all event mentions that refer to the same real-world event into the same group, which is necessary to information aggregation and many downstream applications. To resolve event coreference, existing methods usually calculate the similarities between event mentions and between specific kinds of event arguments. However, they fail to accurately identify paraphrase relations between events and may suffer from error propagation while extracting event components (i.e., event mentions and their arguments). Therefore, we propose a new model based on Event-specific Paraphrases and Argument-aware Semantic Embeddings, thus called EPASE, for event coreference resolution. EPASE recognizes deep paraphrase relations in an event-specific context of sentences and can cover event paraphrases of more situations, bringing about a better generalization. Additionally, the embeddings of argument roles are encoded into event embedding without relying on a fixed number and type of arguments, which results in the better scalability of EPASE. Experiments on both within- and cross-document event coreference demonstrate its consistent and significant superiority compared to existing methods. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Achieving reliable and anti-collusive outsourcing computation and verification based on blockchain in 5G-enabled IoT

引用

Digital Communications and networks 2022年第5期8卷 644-653页

作者： Linjie Wang Youliang Tian Jinbo Xiong School of Data Science Tongren UniversityTongren554300China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou UniversityGuiyang550025China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber SecurityFujian Normal UniversityFuzhou350117China

Widespread applications of 5G technology have prompted the outsourcing of computation dominated by the Internet of Things(IoT)cloud to improve transmission efficiency,which has created a novel paradigm for improving the speed of common connected objects in ***,although it makes it easier for ubiquitous resource-constrained equipment that outsources computing tasks to achieve high-speed transmission services,security concerns,such as a lack of reliability and collusion attacks,still exist in the outsourcing *** this paper,we propose a reliable,anti-collusion outsourcing computation and verification protocol,which uses distributed storage solutions in response to the issue of centralized storage,leverages homomorphic encryption to deal with outsourcing computation and ensures data ***,we embed outsourcing computation results and a novel polynomial factorization algorithm into the smart contract of Ethereum,which not only enables the verification of the outsourcing result without a trusted third party but also resists collusion *** results of the theoretical analysis and experimental performance evaluation demonstrate that the proposed protocol is secure,reliable,and more effective compared with state-of-the-art approaches.

关键词： Outsourcing computation Ethereum Smart contract Public verification Homomorphic encryption

来源：评论

学校读者我要写书评

暂无评论

A New Pipeline for Knowledge Graph Reasoning Enhanced by Large Language Models Without Fine-Tuning

A New Pipeline for Knowledge Graph Reasoning Enhanced by Lar...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Chen, Zhongwu Bai, Long Li, Zixuan Huang, Zhen Jin, Xiaolong Dou, Yong National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798891761643

Conventional Knowledge Graph Reasoning (KGR) models learn the embeddings of KG components over the structure of KGs, but their performances are limited when the KGs are severely incomplete. Recent LLM-enhanced KGR models input KG structural information into LLMs. However, they require fine-tuning on open-source LLMs and are not applicable to closed-source LLMs. Therefore, in this paper, to leverage the knowledge in LLMs without fine-tuning to assist and enhance conventional KGR models, we propose a new three-stage pipeline, including knowledge alignment, KG reasoning and entity reranking. Specifically, in the alignment stage, we propose three strategies to align the knowledge in LLMs to the KG schema by explicitly associating unconnected nodes with semantic relations. Based on the enriched KGs, we train structure-aware KGR models to integrate aligned knowledge to original knowledge existing in KGs. In the reranking stage, after obtaining the results of KGR models, we rerank the top-scored entities with LLMs to recall correct answers further. Experiments show our pipeline can enhance the KGR performance in both incomplete and general situations. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Evaluating natural language generation via unbalanced optimal transport 29

Evaluating natural language generation via unbalanced optima...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Chen, Yimeng Lan, Yanyan Xiong, Ruibin Pang, Liang Ma, Zhiming Cheng, Xueqi University of Chinese Academy of Sciences China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology CAS China Academy of Mathematics and Systems Science CAS China

ISBN: (纸本)9780999241165

Embedding-based evaluation measures have shown promising improvements on the correlation with human judgments in natural language generation. In these measures, various intrinsic metrics are used in the computation, including generalized precision, recall, F-score and the earth mover's distance. However, the relations between these metrics are unclear, making it difficult to determine which measure to use in real applications. In this paper, we provide an in-depth study on the relations between these metrics. Inspired by the optimal transportation theory, we prove that these metrics correspond to the optimal transport problem with different hard marginal constraints. However, these hard marginal constraints may cause the problem of incomplete and noisy matching in the evaluation process. Therefore we propose a family of new evaluation metrics, namely Lazy Earth Mover's Distances, based on the more general unbalanced optimal transport problem. Experimental results on WMT18 and WMT19 show that our proposed metrics have the ability to produce more consistent evaluation results with human judgements, as compared with existing intrinsic metrics. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

An ensemble method for job recommender systems 10

An ensemble method for job recommender systems

引用

10th ACM Conference on Recommender Systems Challenge, RecSys Challenge 2016

作者： Zhang, Chenrui Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781450348010

In this paper, we present an ensemble method for job recommendation to ACM RecSys Challenge 2016. Given a user, the goal of a job recommendation system is to predict those job postings that are likely to be relevant to the user1. Firstly, we analyze the train dataset and find several interesting patterns. Secondly, we describe our solution, which is an ensemble of two filters, combining the merits of traditional collaborative filtering and content-based filtering. Our approach finally achieved a score of 1632828.82, ranked at the 10th place on the public leaderboard. © 2016 ACM.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Dynamic-K recommendation with personalized decision boundary 23rd

Dynamic-K recommendation with personalized decision boundary

引用

23rd China conference on Information Retrieval, CCIR 2017

作者： Gao, Yan Guo, Jiafeng Lan, Yanyan Liao, Huaming CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319686981

In this paper, we investigate the recommendation task in the most common scenario with implicit feedback (e.g., clicks, purchases). State-of-the-art methods in this direction usually cast the problem as to learn a personalized ranking on a set of items (e.g., webpages, products). The top-N results are then provided to users as recommendations, where the N is usually a fixed number pre-defined by the system according to some heuristic criteria (e.g., page size, screen size). There is one major assumption underlying this fixed-number recommendation scheme, i.e., there are always sufficient relevant items to users’ preferences. Unfortunately, this assumption may not always hold in real-world scenarios. In some applications, there might be very limited candidate items to recommend, and some users may have very high relevance requirement in recommendation. In this way, even the top-1 ranked item may not be relevant to a user’s preference. Therefore, we argue that it is critical to provide a dynamic-K recommendation, where the K should be different with respect to the candidate item set and the target user. We formulate this dynamic-K recommendation task as a joint learning problem with both ranking and classification objectives. The ranking objective is the same as existing methods, i.e., to create a ranking list of items according to users’ interests. The classification objective is unique in this work, which aims to learn a personalized decision boundary to differentiate the relevant items from irrelevant items. Based on these ideas, we extend two state-of-the-art ranking-based recommendation methods, i.e., BPRMF and HRM, to the corresponding dynamic-K versions, namely DK-BPRMF and DK-HRM. Our experimental results on two datasets show that the dynamic-K models are more effective than the original fixed-N recommendation methods. © Springer International Publishing AG 2017.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：