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

arXiv 2022年

作者： Si, Chongjie Jia, Yuheng Wang, Ran Zhang, Min-Ling Feng, Yanghe Qu, Chongxiao The Chien-Shiung Wu College Southeast University Nanjing210096 China The MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Engineering Southeast University Nanjing210096 China Ministry of Education China School of Computing & Information Sciences Caritas Institute of Higher Education Hong Kong The Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China The School of Mathematical Science Shenzhen University Shenzhen518060 China Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China The College of Systems Engineering National University of Defense Technology China The 52nd Research Institute of China Electronics Technology Group China

Exploiting label correlations is important to multi-label classification. Previous methods capture the high-order label correlations mainly by transforming the label matrix to a latent label space with low-rank matrix factorization. However, the label matrix is generally a full-rank or approximate full-rank matrix, making the low-rank factorization inappropriate. Besides, in the latent space, the label correlations will become implicit. To this end, we propose a simple yet effective method to depict the high-order label correlations explicitly, and at the same time maintain the high-rank of the label matrix. Moreover, we estimate the label correlations and infer model parameters simultaneously via the local geometric structure of the input to achieve mutual enhancement. Comparative studies over twelve benchmark data sets validate the effectiveness of the proposed algorithm in multi-label classification. The exploited high-order label correlations are consistent with common sense empirically. Our code is publicly available at https://***/Chongjie-Si/HOMI. Copyright © 2022, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

ReCoSa: Detecting the relevant contexts with self-attention for multi-turn dialogue generation

arXiv

引用

arXiv 2019年

作者： Zhang, Hainan Y., Lan L., Pang J., Guo X., Cheng CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

In multi-turn dialogue generation, response is usually related with only a few contexts. Therefore, an ideal model should be able to detect these relevant contexts and produce a suitable response accordingly. However, the widely used hierarchical recurrent encoder-decoder models just treat all the contexts indiscriminately, which may hurt the following response generation process. Some researchers try to use the cosine similarity or the traditional attention mechanism to find the relevant contexts, but they suffer from either insufficient relevance assumption or position bias problem. In this paper, we propose a new model, named ReCoSa, to tackle this problem. Firstly, a word level LSTM encoder is conducted to obtain the initial representation of each context. Then, the self-attention mechanism is utilized to update both the context and masked response representation. Finally, the attention weights between each context and response representations are computed and used in the further decoding process. Experimental results on both Chinese customer services dataset and English Ubuntu dialogue dataset show that ReCoSa significantly outperforms baseline models, in terms of both metric-based and human evaluations. Further analysis on attention shows that the detected relevant contexts by ReCoSa are highly coherent with human's understanding, validating the correctness and interpretability of ReCoSa. Copyright © 2019, The Authors. All rights reserved.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Mesh Variational Autoencoders with Edge Contraction Pooling

Mesh Variational Autoencoders with Edge Contraction Pooling

引用

IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)

作者： Yu-Jie Yuan Yu-Kun Lai Jie Yang Qi Duan Hongbo Fu Lin Gao Institute of Computing Technology CAS Beijing Key Laboratory of Mobile Computing and Pervasive Device School of Computer Science and Informatics Cardiff University UK SenseTime Research City University of Hong Kong Shenzhen Research Institute of Big Data Shenzhen

ISBN: (数字)9781728193601

ISBN: (纸本)9781728193618

3D shape analysis is an important research topic in computer vision and graphics. While existing methods have generalized image-based deep learning to meshes using graph-based convolutions, the lack of an effective pooling operation restricts the learning capability of their networks. In this paper, we propose a novel pooling operation for mesh datasets with the same connectivity but different geometry, by building a mesh hierarchy using mesh simplification. For this purpose, we develop a modified mesh simplification method to avoid generating highly irregularly sized triangles. Our pooling operation effectively encodes the correspondence between coarser and finer meshes in the hierarchy. We then present a variational auto-encoder (VAE) structure with the edge contraction pooling and graph-based convolutions, to explore probability latent spaces of 3D surfaces and perform 3D shape generation. Our network requires far fewer parameters than the original mesh VAE and thus can handle denser models thanks to our new pooling operation and convolutional kernels. Our evaluation also shows that our method has better generalization ability and is more reliable in various applications, including shape generation and shape interpolation.

关键词： Three-dimensional displays Shape Strain Interpolation Neural networks Machine learning

来源：评论

学校读者我要写书评

暂无评论

GREYONE: data flow sensitive fuzzing 20

GREYONE: data flow sensitive fuzzing

引用

Proceedings of the 29th USENIX Conference on Security Symposium

作者： Shuitao Gan Chao Zhang Peng Chen Bodong Zhao Xiaojun Qin Dong Wu Zuoning Chen State Key Laboratory of Mathematical Engineering and Advanced Computing Institute for Network Science and Cyberspace Tsinghua University and Beijing National Research Center for Information Science and Technology ByteDance AI lab Institute for Network Science and Cyberspace Tsinghua University National Research Center of Parallel Computer Engineering and Technology

ISBN: (纸本)9781939133175

data flow analysis (e.g., dynamic taint analysis) has proven to be useful for guiding fuzzers to explore hard-to-reach code and find vulnerabilities. However, traditional taint analysis is labor-intensive, inaccurate and slow, affecting the fuzzing efficiency. Apart from taint, few data flow features are *** this paper, we proposed a data flow sensitive fuzzing solution GREYONE. We first utilize the classic feature taint to guide fuzzing. A lightweight and sound fuzzing-driven taint inference (FTI) is adopted to infer taint of variables, by monitoring their value changes while mutating input bytes during fuzzing. With the taint, we propose a novel input prioritization model to determine which branch to explore, which bytes to mutate and how to mutate. Further, we use another data flow feature constraint conformance, i.e., distance of tainted variables to values expected in untouched branches, to tune the evolution direction of *** implemented a prototype of GREYONE and evaluated it on the LAVA data set and 19 real world programs. The results showed that it outperforms various state-of-the-art fuzzers in terms of both code coverage and vulnerability discovery. In the LAVA data set, GREYONE found all listed bugs and 336 more unlisted. In real world programs, GREYONE on average found 2.12X unique program paths and 3.09X unique bugs than state-of-the-art evolutionary fuzzers, including AFL, VUzzer, CollAFL, Angora and Honggfuzz, Moreover, GREYONE on average found 1.2X unique program paths and 1.52X unique bugs than a state-of-the-art symbolic exeuction assisted fuzzer QSYM. In total, it found 105 new security bugs, of which 41 are confirmed by CVE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Controlling risk of web question answering

arXiv

引用

arXiv 2019年

作者： Su, Lixin Guo, Jiafeng Fan, Yixing Lan, Yanyan Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Web question answering (QA) has become an indispensable component in modern search systems, which can significantly improve users’ search experience by providing a direct answer to users’ information need. This could be achieved by applying machine reading comprehension (MRC) models over the retrieved passages to extract answers with respect to the search query. With the development of deep learning techniques, state-of-the-art MRC performances have been achieved by recent deep methods. However, existing studies on MRC seldom address the predictive uncertainty issue, i.e., how likely the prediction of an MRC model is wrong, leading to uncontrollable risks in real-world Web QA applications. In this work, we first conduct an in-depth investigation over the risk of Web QA. We then introduce a novel risk control framework, which consists of a qualify model for uncertainty estimation using the probe idea, and a decision model for selectively output. For evaluation, we introduce risk-related metrics, rather than the traditional EM and F1 in MRC, for the evaluation of risk-aware Web QA. The empirical results over both the real-world Web QA dataset and the academic MRC benchmark collection demonstrate the effectiveness of our approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-based Fast Authentication and Collaborative Video data Forwarding Scheme for Vehicular networks

A Blockchain-based Fast Authentication and Collaborative Vid...

引用

IEEE/IFIP International Conference on Embedded and Ubiquitous computing, EUC

作者： Weihui Qiu Xin Yang Ming Wei Wei Ren Tianqing Zhu School of Computer Science China University of Geosciences Wuhan P.R. China Wuhan Institute of Marine Electric Propulsion CSSC P.R. China Key Laboratory of Network Assessment Technology CAS Chinese Academy of Sciences Institute of Information Engineering Beijing P.R. China Guizhou Provincial Key Laboratory of Public Big Data Guizhou University Guiyang P.R. China

ISBN: (纸本)9781665400374

Internet of Things (IoT) current present two trends with respect to ubiquity and mobility. The number of devices increases remarkably and most forthcoming devices are mobile, e.g., Internet of Vehicles (IoV). In large scale mobile IoT, the management of device identification, fast authentication, and certification of public keys experiences upcoming difficulties. Centralized security architecture may not be suitable and in contrast cross-domain security architecture will tackle the ubiquity and mobility better. We note that blockchain is a new decentralized architecture equipped with basic cryptographic settings, which provides new tools such as token and guarantees many security properties such as block integrity. In this paper we design a blockchain-based fast authentication video data forwarding scheme for IoV. Compared with existing protocols, it has the advantages of decentralization, high authentication efficiency, strong trust, and resistance to common attacks. We evaluate our scheme with real experiments over Hyperledger Fabric and the authentication delay is manageable (e.g, 4 seconds in IoV).

关键词： Resistance Protocols Authentication Public key Computer architecture Near field communication Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Meta-Path Hierarchical Heterogeneous Graph Convolution network for High Potential Scholar Recognition

Meta-Path Hierarchical Heterogeneous Graph Convolution Netwo...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yiqing Wu Ying Sun Fuzhen Zhuang Deqing Wang Xiangliang Zhang Qing He Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology University of Chinese Academy of Sciences Beijing China School of Computer Science and Engineering Beihang University China King Abdullah University of Science and Technology Saudi Arabia

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Recognizing high potential scholars has become an important problem in recent years. However, conventional scholar evaluating methods based on hand-crafted metrics can not profile the scholars in a dynamic and comprehensive way. With the development of online academic databases, large-scale academic activity data become available, which implies detailed information on the scholars' achievement and academic activities. Inspired by the recent success of deep graph neural networks (GNNs), we propose a novel solution to recognize high potential scholars on the dynamic heterogeneous academic network. Specifically, we propose a novel Mate-path Hierarchical Heterogeneous Graph Convolution network (MHHGCN) to effectively model the heterogeneous graph information. MHHGCN hierarchically aggregates entity and relational information on a set of meta-paths, and can alleviate the information loss problem in the previous heterogenous GNN models. Then to capture the dynamic scholar feature, we combine MHHGCN with Long Short Term Memory (LSTM) network with attention mechanism to model the temporal information and predict the potential scholar. Extensive experimental results on real-world high potential scholar data demonstrate the effectiveness of our approach. Moreover, the model shows high interpretability by visualization of the attention layers.

关键词： Measurement Convolution Aggregates data visualization Predictive models Graph neural networks Long short term memory

来源：评论

学校读者我要写书评

暂无评论

Dynamic MCMC sampling

arXiv

引用

arXiv 2019年

作者： Feng, Weiming He, Kun Sun, Xiaoming Yin, Yitong State Key Laboratory for Novel Software Technology Nanjing University CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

The Markov chain Monte Carlo (MCMC) methods are the primary tools for sampling from Gibbs distributions arising by various graphical models, e.g. Markov random fields (MRF). Traditional MCMC sampling algorithms are focused on a classic static setting, where the input is fixed. In this paper we study the problem of sampling from a MRF when the graphical model itself is changing dynamically with time. The problem is well motivated by the growing volume and velocity of data in today's applications of the MCMC methods. For the two major MCMC approaches, respectively for the approximate and perfect sampling, namely, the Gibbs sampling and the coupling from the past (CFTP), we give dynamic versions for the respective MCMC sampling algorithms. On MRF with n variables and bounded maximum degrees, these dynamic sampling algorithms can maintain approximate samples within 1/Poly(n) total variation errors, or perfect samples, while the MRF is dynamically changing. Furthermore, the dynamic sampling algorithms are efficient with O(n) space cost, and O(log2 n) incremental time cost upon each local update to the input MRF, as long as certain decay conditions are satisfied in each step by natural couplings of the corresponding single-site chains. These decay conditions were well known in the literature of couplings for rapid mixing of Markov chains, and now for the first time, are used to imply efficient dynamic sampling algorithms. Consequently, we have efficient dynamic (approximate or perfect) sampling algorithms with O(n) space cost and O (log2 n) incremental time cost, for the following models when the maximum degree is bounded: generalMRF satisfying the Dobrushin-Shlosman condition (for approximate sampling);Ising model with temperature β where e-2|β| > 1 - 2 β+1 (for both approximate and perfect samplings);hardcore model with fugacity λ 2λ (for approximate sampling);or q > 2Δ2 + 3Δ (for perfect sampling). These results show that the coupling of single-site Markov chains that

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

MatchZoo: A Learning, Practicing, and Developing System for Neural Text Matching

arXiv

引用

arXiv 2019年

作者： Guo, Jiafeng Fan, Yixing Ji, Xiang Cheng, Xueqi University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Beijing Institute of Technology University Beijing China

Text matching is the core problem in many natural language processing (NLP) tasks, such as information retrieval, question answering, and conversation. Recently, deep leaning technology has been widely adopted for text matching, making neural text matching a new and active research domain. With a large number of neural matching models emerging rapidly, it becomes more and more difficult for researchers, especially those newcomers, to learn and understand these new models. Moreover, it is usually difficult to try these models due to the tedious data pre-processing, complicated parameter configuration, and massive optimization tricks, not to mention the unavailability of public codes sometimes. Finally, for researchers who want to develop new models, it is also not an easy task to implement a neural text matching model from scratch, and to compare with a bunch of existing models. In this paper, therefore, we present a novel system, namely MatchZoo, to facilitate the learning, practicing and designing of neural text matching models. The system consists of a powerful matching library and a user-friendly and interactive studio, which can help researchers: 1) to learn state-of-the-art neural text matching models systematically, 2) to train, test and apply these models with simple configurable steps;and 3) to develop their own models with rich APIs and assistance. Copyright © 2019, The Authors. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Signed graph attention networks

arXiv

引用

arXiv 2019年

作者： Huang, Junjie Shen, Huawei Hou, Liang Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Graph or network data is ubiquitous in the real world, including social networks, information networks, traffic networks, biological networks and various technical networks. The non-Euclidean nature of graph data poses the challenge for modeling and analyzing graph data. Recently, Graph Neural network (GNNs) are proposed as a general and powerful framework to handle tasks on graph data, e.g., node embedding, link prediction and node classification. As a representative implementation of GNNs, Graph Attention networks (GATs) are successfully applied in a variety of tasks on real datasets. However, GAT is designed to networks with only positive links and fails to handle signed networks which contain both positive and negative links. In this paper, we propose Signed Graph Attention networks (SiGATs), generalizing GAT to signed networks. SiGAT incorporates graph motifs into GAT to capture two well-known theories in signed network research, i.e., balance theory and status theory. In SiGAT, motifs offer us the flexible structural pattern to aggregate and propagate messages on the signed network to generate node embeddings. We evaluate the proposed SiGAT method by applying it to the signed link prediction task. Experimental results on three real datasets demonstrate that SiGAT outperforms feature-based method, network embedding method and state-of-the-art GNN-based methods like signed graph convolutional network (SGCN). Copyright © 2019, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：