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

arXiv 2022年

作者： Li, Zixuan Hou, Zhongni Guan, Saiping Jin, Xiaolong Peng, Weihua Bai, Long Lyu, Yajuan Li, Wei Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Baidu Inc China

A Temporal Knowledge Graph (TKG) is a sequence of KGs with respective timestamps, which adopts quadruples in the form of (subject, relation, object, timestamp) to describe dynamic facts. TKG reasoning has facilitated many real-world applications via answering such queries as (query entity, query relation, ?, future timestamp) about future. This is actually a matching task between a query and candidate entities based on their historical structures, which reflect behavioral trends of the entities at different timestamps. In addition, recent KGs provide background knowledge of all the entities, which is also helpful for the matching. Thus, in this paper, we propose the Historical Structure Matching (HiSMatch) model. It applies two structure encoders to capture the semantic information contained in the historical structures of the query and candidate entities. Besides, it adopts another encoder to integrate the background knowledge into the model. TKG reasoning experiments on six benchmark datasets demonstrate the significant improvement of the proposed HiSMatch model, with up to 5.6% performance improvement in MRR, compared to the state-of-the-art baselines. Copyright © 2022, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning

arXiv

引用

arXiv 2022年

作者： Li, Zixuan Guan, Saiping Jin, Xiaolong Peng, Weihua Lyu, Yajuan Zhu, Yong Bai, Long Li, Wei Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Baidu Inc China

A Temporal Knowledge Graph (TKG) is a sequence of KGs corresponding to different timestamps. TKG reasoning aims to predict potential facts in the future given the historical KG sequences. One key of this task is to mine and understand evolutional patterns of facts from these sequences. The evolutional patterns are complex in two aspects, length-diversity and time-variability. Existing models for TKG reasoning focus on modeling fact sequences of a fixed length, which cannot discover complex evolutional patterns that vary in length. Furthermore, these models are all trained offline, which cannot well adapt to the changes of evolutional patterns from then on. Thus, we propose a new model, called Complex Evolutional network (CEN), which uses a length-aware Convolutional Neural network (CNN) to handle evolutional patterns of different lengths via an easy-to-difficult curriculum learning strategy. Besides, we propose to learn the model under the online setting so that it can adapt to the changes of evolutional patterns over time. Extensive experiments demonstrate that CEN obtains substantial performance improvement under both the traditional offline and the proposed online settings. Copyright © 2022, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

A commentary of Digital contact tracing in MIT technology Review 2021

引用

Fundamental Research 2021年第6期1卷 838-839页

作者： Xueqi Cheng CAS Key Laboratory of Network Data Science and Technology Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China

In 2020,the COVID-19 pandemic has brought“digital contact tracing”to the forefront of public *** the context of COVID-19,technology has offered public health investigators a new capability for locating infected individuals,i.e.,digital contact *** this technology,investigators were able to track the location of patients without relying on their memory,which alleviated disease surveillance *** practical application of this technology is known as“Exposure Notification.”Developers were able to complete the creation and operation of this digital contact tracing system within a few weeks,and they made the code open-source to ensure that Apple and Android users worldwide could utilize it.

关键词： Developer Android individual

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Continuous Distributed Processing of Software Defined Radar

Continuous Distributed Processing of Software Defined Radar

引用

2021 CIE International Conference on Radar, Radar 2021

作者： Li, Bing Qiu, Qiang Gong, Shiqi Liu, Yongjun Lei, Yu Institute of Computing Technology CAS Key Lab of Network Data Science and Technology Chinese Academy of Sciences Beijing China State Key Laboratory of Internet of Things for Smart City University of Macau Macau China Xidian University National Laboratory of Radar Signal Processing Xi'an China Golaxy Data Technology Co. Ltd. Beijing China

ISBN: (纸本)9781665498142

Software-defined radar has been an active research field for more than ten years. However, the low performance and low scalability of the traditional processing techniques of SDR make it hard to deal with complex radar tasks. The stream processing engine is a software that supports low latency and high scalability distributed data processing. It is widely used in log, image, and video processing scenarios but rarely used in radar applications. This paper reviews processing software-defined radar data by using the stream processing engine, and we illustrate the differences between processing log data and radar data. Furthermore, we discuss some optimizations for stream processing engines to get better performance in the radar data processing. © 2021 IEEE.

关键词： distributed processing Software-defined radar stream processing engine

来源：评论

学校读者我要写书评

暂无评论

Adversarial Camouflage for Node Injection Attack on Graphs

arXiv

引用

arXiv 2022年

作者： Tao, Shuchang Cao, Qi Shen, Huawei Wu, Yunfan Hou, Liang Sun, Fei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China 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

Node injection attacks on Graph Neural networks (GNNs) have received increasing attention recently, due to their ability to degrade GNN performance with high attack success rates. However, our study indicates that these attacks often fail in practical scenarios, since defense/detection methods can easily identify and remove the injected nodes. To address this, we devote to camouflage node injection attack, making injected nodes appear normal and imperceptible to defense/detection methods. Unfortunately, the non-Euclidean structure of graph data and the lack of intuitive prior present great challenges to the formalization, implementation, and evaluation of camouflage. In this paper, we first propose and define camouflage as distribution similarity between ego networks of injected nodes and normal nodes. Then for implementation, we propose an adversarial CAmouflage framework for Node injection Attack, namely CANA, to improve attack performance under defense/detection methods in practical scenarios. A novel camouflage metric is further designed under the guide of distribution similarity. Extensive experiments demonstrate that CANA can significantly improve the attack performance under defense/detection methods with higher camouflage or imperceptibility. This work urges us to raise awareness of the security vulnerabilities of GNNs in practical applications. Copyright © 2022, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Embedding Based Graph Convolutional network for Link Prediction

Knowledge Graph Embedding Based Graph Convolutional Network ...

引用

International Conference on Advanced Cloud and Big data (CBD)

作者： Qiang Wu Qing He Henan Institute of Advanced Technology Zhengzhou University Zhengzhou P.R. China Key Lab of Intelligent Information Processing of Chinese Academy of Science (CAS) Institute of Computing Technology CAS Beijing China University of Chinese Academy of Science Beijing China

Knowledge Graph Embedding (KGE) aims to capture the inherent structural information within knowledge graphs (KGs) by means of representation learning. This is of paramount importance for various downstream tasks, including personalized recommendations, intelligent search, and relation extraction. Graph Convolutional networks (GCNs), a type of neural network, have recently demonstrated significant success in modeling data structured as graphs. However, these models often overlook the intricate interrelation information between neighboring nodes, which can offer valuable insights for enhancing node embeddings. In this article, we present a knowledge graph embedding based graph convolutional network for link prediction. First, we utilize embeddings to represent entities and relations. Second, we perform circular correlation on subject embedding and relation embedding to generate two matrix and achieve full fusion of embedding at the element level. Third, we generate self-attention vectors using one of the matrices and perform the Hadamard product with the other matrix. Thereafter, new node features are generated through graph convolutional networks and residual unit. Finally, we use the scoring function to score the candidate triples. The experimental results demonstrate that our model achieves improved performance compared with a wide variety of baseline models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IVE: Accelerating Enumeration-Based Subgraph Matching via Exploring Isolated Vertices

IVE: Accelerating Enumeration-Based Subgraph Matching via Ex...

引用

International Conference on data Engineering

作者： Zite Jiang Shuai Zhang Xingzhong Hou Mengting Yuan Haihang You State Key Lab of Processors Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijinz China Zhongguancun Laboratory Beijing China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

The performance of the enumeration-based sub-graph matching, which searches all isomorphic subgraphs in the data graph, is crucial to various applications. The upper bound of the complexity for the enumeration-based method is exponential to the number of query graph vertices, denoted as $n$ . We propose a novel subgraph matching algorithm called the Isolated Vertices Exploration (IVE). The IVE leverages isolated vertices during the reordering and enumeration phases, thereby significantly accelerating the subgraph matching process. During the enumeration, the isolated vertices can be matched by using a quick bipartite graph matching algorithm. Consequently, the complexity of matching the remaining non-isolated vertices is exponential to the number of non-isolated vertices, denoted as $n^{\prime}$ . For the reordering, we designed the Maximum Deleted Edges (MDE) to minimize $n^{\prime}$ . MDE iteratively selects the query vertex with the maximum edges. According to the experimental results, $n^{\prime}$ is less than $0.8n$ for 99.8% of arbitrary graphs. Moreover, IVE outperforms the state-of-the-art algorithms in various scenarios with different sizes, sparsities and fields, achieving a performance speedup of up to 80.3x.

关键词： Backtracking Upper bound Design methodology data engineering Complexity theory Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

arXiv

引用

arXiv 2024年

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado SpringsCO United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China JinYinHu Laboratory Wuhan China

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

International Conference on Software Engineering (ICSE)

作者： Zhen Li Ning Wang Deqing Zou Yating Li Ruqian Zhang Shouhuai Xu Chao Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jin YinHu Laboratory Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado Springs Colorado USA Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.

关键词： Deep learning Detectors Open source software Software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：