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

arXiv 2021年

作者： Pang, Yunsheng Zhao, Yunxiang Li, Dongsheng The University of Melbourne National Lab for Parallel and Distributed Processing College of Computer National University of Defense Technology

Graph pooling that summaries the information in a large graph into a compact form is essential in hierarchical graph representation learning. Existing graph pooling methods either suffer from high computational complexity or cannot capture the global dependencies between graphs before and after pooling. To address the problems of existing graph pooling methods, we propose Coarsened Graph Infomax Pooling (CGIPool) that maximizes the mutual information between the input and the coarsened graph of each pooling layer to preserve graph-level dependencies. To achieve mutual information neural maximization, we apply contrastive learning and propose a self-attention-based algorithm for learning positive and negative samples. Extensive experimental results on seven datasets illustrate the superiority of CGIPool comparing to the state-of-the-art methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Trust-worth multi-representation learning for audio classification with uncertainty estimation

引用

The Journal of the Acoustical Society of America 2023年第3_SUPPLEMENT期153卷 A125-A125页

作者： Kele Xu Kang You Ming Feng Boqing Zhu National Key Lab. of Parallel and Distributed Processing (PDL) 107 Yanwachi Changsha 410073 China kelele.xu@*** Tongji Univ. Shanghai China National Key Lab. of Parallel and Distributed Processing (PDL) Changsha China

Multi-view learning has been explored for audio classification tasks, exploiting different representations of audio signals, ranging from MFCC, CQT, to raw signals. The quality of each view may vary for different audio signals, and the appropriate uncertainty quantification for each view has not been fully explored. In this work, we explore a trusted multi-view learning framework for classification tasks in order to fully incorporate different views. Our framework consists of three parallel branches of Transformer architectures (Gammatone spectrogram, log-Mel and CQT) and they are combined using the uncertainty estimation of different branch. In addition to computing the classification probabilities, the uncertainty of each representation can also be obtained using the framework. We firstly calculate the evidence based on feature vectors to obtain the probabilities and the uncertainty of classification problems for Gammatone, log-Mel and CQT branch. By integrating the confidence from each of the different representations using the Dempster–Shafer theory, the classification framework can provide higher accuracy and confidence. To demonstrate the effectiveness of the proposed framework, we conduct the experiments on the GTZAN dataset. The obtained results show that our method can reach the accuracy of 83.0%, which significantly outperforms single representation-based methods while providing uncertainty estimation for different views.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FINT: FIELD-AWARE INTERACTION NEURAL NETWORK FOR CTR PREDICTION

arXiv

引用

arXiv 2021年

作者： Zhao, Zhishan Yang, Sen Liu, Guohui Feng, Dawei Xu, Kele iQIYI Inc. China National Key Lab of Parallel and Distributed Processing Changsha China National University of Defense Technology Changsha China

As a critical component for online advertising and marketing, click-through rate (CTR) prediction has drawn lots of attention from both industry and academia. Recently, deep learning has become the mainstream methodological choice for CTR. Despite sustainable efforts have been made, existing approaches still pose several challenges. On the one hand, high-order interaction between the features is under-explored. On the other hand, high-order interactions may neglect the semantic information from the low-order fields. In this paper, we proposed a novel prediction method, named FINT, that employs the Field-aware INTeraction layer which explicitly captures high-order feature interactions while retaining the low-order field information. To empirically investigate the effectiveness and robustness of the FINT, we perform extensive experiments on the three realistic databases: KDD2012, Criteo and Avazu. The obtained results demonstrate that the FINT can significantly improve the performance compared to the existing methods, without increasing the amount of computation required. Moreover, the proposed method brought about 2.72% increase to the advertising revenue of iQIYI, a big online video app through A/B testing. To better promote the research in CTR field, we released our code as well as reference implementation at: https://***/zhishan01/FINT. © 2021, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Atomic-action-based Contrastive Network for Weakly Supervised Temporal Language Grounding

Atomic-action-based Contrastive Network for Weakly Supervise...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Hongzhou Wu Yifan Lyu Xingyu Shen Xuechen Zhao Mengzhu Wang Xiang Zhang Zhigang Luo Parallel and Distributed Processing Lab National University of Defense Technology Changsha China Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China School of Computer National University of Defense Technology Changsha China Institute for Quantum Information and the State Key Lab of High Performance Computing National University of Defense Technology Changsha China

As one knows, an event often consists of several actions while each action is atomic. Inspired by this insight, we propose a novel framework named Atomic-action-based Contrastive Network model (ACN) for weakly supervised temporal language grounding task to localize the query-related event moment in an untrimmed video, without access to any temporal annotations. Specifically, ACN first determines the accurate moment boundary of each action in a query-agnostic way. This can adequately exploit homogeneous visual cues while impeding the heterogeneity of the query from hurting the atomicity of visual action, i.e., action boundary. To effectively localize the query-related event, we seek the discriminative words in the given query, and explore a composite-grained contrastive module to retrieve those corresponding atomic actions in the common latent space across modalities. This boosts feature discrimination of visual event segment to remove irrelevant action video segments. Experiments on two popular datasets show the efficacy of our model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving Ultrasound Tongue Contour Extraction Using U-Net and Shape Consistency-Based Regularizer

Improving Ultrasound Tongue Contour Extraction Using U-Net a...

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Ming Feng Yin Wang Kele Xu Huaimin Wang Bo Ding Tongji University Shanghai China National Key Lab of Parallel and Distributed Processing Changsha China College of Computer National University of Defense Technology Changsha China

B-mode ultrasound tongue imaging is widely used to visualize the tongue motion, due to its appearing properties. Extracting the tongue surface contour in the B-mode ultrasound image is still a challenge, while it is a prerequisite for further quantitative analysis. Recently, deep learning-based approach has been adopted in this task. However, the standard deep models fail to address faint contour when the ultrasound wave goes parallel to the tongue surface. To address the faint or missing contours in the sequence, we explore the shape consistency-based regularizer, which can take sequential information into account. By incorporating the regularizer, the deep model not only can extract frame-specific contours, but also can enforce the similarity between the contours extracted from adjacent frames. Extensive experiments are conducted both on the synthetic and real ultrasound tongue imaging dataset and the results demonstrate the effectiveness of proposed method. To better promote the research in this field, we have released our code at.

关键词： Image segmentation Tongue Ultrasonic imaging Surface waves Shape Statistical analysis Imaging

来源：评论

学校读者我要写书评

暂无评论

Feature and Performance Comparison of FaaS Platforms

Feature and Performance Comparison of FaaS Platforms

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Penghui Ma Peichang Shi Guodong Yi National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems College of Computer Science National University of Defense Technology Changsha China Xiangjiang Lab Changsha China School of Advanced Interdisciplinary Studies Hunan University Of Technology and Business Changsha China

With serverless computing offering more efficient and cost-effective application deployment, the diversity of serverless platforms presents challenges to users, including platform lock-in and costly migration. Moreover, due to the black box nature of function computing, traditional performance benchmarking methods are not applicable, necessitating new studies. This article presents a detailed comparison of six major public cloud function computing platforms and introduces a benchmarking framework for function computing performance. This framework aims to help users make comprehensive comparisons and select the most suitable platform for their specific needs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-task Pre-training Language Model for Semantic Network Completion

arXiv

引用

arXiv 2022年

作者： Li, Da Yang, Sen Xu, Kele Yi, Ming He, Yukai Wang, Huaimin Tencent Beijing100084 China Beijing Institute of Microbiology and Epidemiology Beijing100071 China State Key Laboratory of Pathogen and Biosecurity Beijing100071 China National University of Defense Technology Changsha410073 China National Key Lab of Parallel and Distributed Processing Changsha410073 China

Semantic networks, such as the knowledge graph, can represent the knowledge leveraging the graph structure. Although the knowledge graph shows promising values in natural language processing, it suffers from incompleteness. This paper focuses on knowledge graph completion by predicting linkage between entities, which is a fundamental yet critical task. Semantic matching is a potential solution for link prediction as it can deal with unseen entities, while the translational distance based methods struggle with the unseen entities. However, to achieve competitive performance as translational distance based methods, semantic matching based methods require large-scale datasets for the training purpose, which are typically unavailable in practical settings. Therefore, we employ the language model and introduce a novel knowledge graph architecture named LP-BERT, which contains two main stages: multi-task pre-training and knowledge graph fine-tuning. In the pre-training phase, three tasks are taken to drive the model to learn the relationship information from triples by predicting either entities or relations. While in the fine-tuning phase, inspired by contrastive learning, we design a triple-style negative sampling in a batch, which greatly increases the proportion of negative sampling while keeping the training time almost unchanged. Furthermore, we propose a new data augmentation method utilizing the inverse relationship of triples to improve the performance and robustness of the model. To demonstrate the effectiveness of our proposed framework, we conduct extensive experiments on three widely-used knowledge graph datasets, WN18RR, FB15k-237, and UMLS. The experimental results demonstrate the superiority of our methods, and our approach achieves state-of-the-art results on the WN18RR and FB15k-237 datasets. Significantly, the Hits@10 indicator is improved by 5% from the previous state-of-the-art result on the WN18RR dataset while reaching 100% on the UMLS dataset. Copy

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

BSE-MAML: Model Agnostic Meta-Reinforcement Learning via Bayesian Structured Exploration

BSE-MAML: Model Agnostic Meta-Reinforcement Learning via Bay...

引用

IEEE International Conference on Services Computing (SCC)

作者： Haonan Wang Yiyun Zhang Dawei Feng Dongsheng Li Feng Huang National Lab for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (数字)9781728187891

ISBN: (纸本)9781728187907

Deep reinforcement learning (RL) is playing an increasingly important role in web services such as news recommendation, vulnerability detection, and personalized services. Exploration is a key component of RL, which determines whether these RL-based applications could find effective solutions eventually. In this paper, we propose a novel gradient-based fast adaptation approach for model agnostic meta-reinforcement learning via Bayesian structure exploration (BSE-MAML). BSE-MAML could effectively learn exploration strategies from prior experience by updating policy with embedding latent space via a Bayesian mechanism. Coherent stochasticity injected by latent space are more efficient than random noise, and can produce exploration strategies to perform well in novel environment. We have conducted extensive experiments to evaluate BSE-MAML. Experimental results show that BSE-MAML achieves better performance in exploration in realistic environments with sparse rewards, compared to state-of-the-art meta-RL algorithms, RL methods without learning exploration strategies, and task-agnostic exploration approaches.

关键词： Adaptation models Web services Stochastic processes Service computing Probabilistic logic Bayes methods Task analysis

来源：评论

学校读者我要写书评

暂无评论

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Symmetric Encryption for Cloud Storage

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Sy...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Panyu Wu Zhenfu Cao Jiachen Shen Xiaolei Dong Yihao Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan

Since data outsourcing poses privacy concerns with data leakage, searchable symmetric encryption (SSE) has emerged as a powerful solution that enables clients to perform query operations on encrypted data while preserving their privacy. Dynamic SSE schemes have been proposed to handle update operations. However, it is shown that updates might increase the risk of information leakage. Meanwhile, to meet the requirement of real-world applications, it is desirable to have the searchable encryption scheme which supports both multiple clients and multi-keyword queries. To address these issues, this paper proposes MMDSSE, a multi-client forward secure dynamic SSE scheme that supports multi-keyword queries. MMDSSE allows the clients narrow down the results by providing an arbitrary subset of the entire archive, and thus suitable for cloud storage environment. Security analysis and experimental evaluations show that MMDSSE is secure and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PPSS: A Privacy-Preserving Supervision Scheme Based on Blockchain

PPSS: A Privacy-Preserving Supervision Scheme Based on Block...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Ming Chen Peichang Shi Xiang Fu Feng Jiang Fei Gao Penghui Ma Jinzhu Kong National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems College of Computer Science National University of Defense Technology Changsha China Kylin Software Co.LTD Changsha China Zhejiang Lab Hangzhou China

In JointCloud Computing, multi-party participation introduces complexity and uncertainty. For all participants in JointCloud Computing, both continuous supervision and necessary privacy protection are required. Traditional supervision methods usually adopt the centralized information interaction mode, which has such defects as collusion of interests, single point of failure, privacy disclosure, etc. Building a decentralized supervision mechanism has become a new research direction. In this paper, we propose PPSS, a privacy-preserving supervision scheme based on blockchain, which decentralizes the supervision of the participants in JointCloud Computing, and combines the “double encryptions” and “threshold encryption” technologies to provide privacy protection. While making full use of the decentralization of the blockchain, a committee is established to carry out the analysis and decision-making tasks in terms of supervision and privacy protection. Experimental results indicate that PPSS can balance performance and security by reasonably configuring the committee.

关键词： Privacy Uncertainty Decision making Buildings Reliability engineering Blockchains Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：