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

WRI International Conference on Communications and Mobile Computing, CMC

作者： HongWei Zhou JinHui Yuan Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China School of Information Renmin University of China Beijing China Institute of Electronic Technology Zhengzhou Information Engineering University of China Zhengzhou China

Trusted platform module (TPM) has little computation capability, and it is the performance bottleneck of remote attestation. In the scenario where the server is the attestation-busy entity which answers attestation requirement frequently, the massive delay is inevitable. Without the modification to TPM, we propose Batch Integrity Report Protocol (BIRP) to overcome the performance bottleneck. B-IRP bundles these requirements in interval as a batch requirement, and creates the response messages for these requirements with one expensive TPM operation. Discussion shows that B-IRP has improved the performance without loss of security.

关键词： Protocols Servers Security Software Software measurement Computer architecture Delay

来源：评论

学校读者我要写书评

暂无评论

Iterative context-aware graph inference for visual dialog

arXiv

引用

arXiv 2020年

作者： Guo, Dan Wang, Hui Zhang, Hanwang Zha, Zheng-Jun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Nanyang Technological University University of Science and Technology of China

Visual dialog is a challenging task that requires the comprehension of the semantic dependencies among implicit visual and textual contexts. This task can refer to the relation inference in a graphical model with sparse contexts and unknown graph structure (relation descriptor), and how to model the underlying context-aware relation inference is critical. To this end, we propose a novel Context-Aware Graph (CAG) neural network. Each node in the graph corresponds to a joint semantic feature, including both object-based (visual) and history-related (textual) context representations. The graph structure (relations in dialog) is iteratively updated using an adaptive top-K message passing mechanism. Specifically, in every message passing step, each node selects the most K relevant nodes, and only receives messages from them. Then, after the update, we impose graph attention on all the nodes to get the final graph embedding and infer the answer. In CAG, each node has dynamic relations in the graph (different related K neighbor nodes), and only the most relevant nodes are attributive to the context-aware relational graph inference. Experimental results on VisDial v0.9 and v1.0 datasets show that CAG outperforms comparative methods. Visualization results further validate the interpretability of our method. Copyright © 2020, The Authors. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Smart Contract Vulnerability Detection Based on Semantic Graph and Residual Graph Convolutional Networks with Edge Attention

SSRN

引用

SSRN 2022年

作者： Chen, Da Feng, Lin Fan, Yuqi Shang, Siyuan Wei, Zhenchun The Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230009 China

It is imperative to assure the security of smart contracts via intelligent vulnerability detection tools before deploying smart contracts on blockchains. The existing deep learning-based approaches fail to effectively capture the rich syntax and semantic information embedded in smart contracts. In this paper, we detect smart contract vulnerabilities at the function level by constructing a novel semantic graph (SG) for each function and learning the SGs using a new graph convolutional network EA-RGCN. Our proposed method consists of three stages. In the first stage, we create the SG which characterizes rich data-data, instruction-instruction and instruction-data relationships in the function code. In the second stage, we propose EA-RGCN which contains three parts: node and edge representation via word2vec, content feature extraction with a residual GCN (RGCN) module, and semantic feature extraction using an edge attention (EA) module. Finally, we concatenate the code content features and the semantic features to obtain the global code feature and use a Multilayer Perceptron (MLP) to identify whether the function is vulnerable. We conduct experiments on the dataset constructed from real-world smart contracts. Experimental results demonstrate that the proposed semantic graph and the EA-RGCN model can achieve superior performance. © 2022, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

DRAG: Dynamic Region-Aware GCN for Privacy-Leaking Image Detection

arXiv

引用

arXiv 2022年

作者： Yang, Guang Cao, Juan Sheng, Qiang Qi, Peng Li, Xirong Li, Jintao Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The daily practice of sharing images on social media raises a severe issue about privacy leakage. To address the issue, privacy-leaking image detection is studied recently, with the goal to automatically identify images that may leak privacy. Recent advance on this task benefits from focusing on crucial objects via pretrained object detectors and modeling their correlation. However, these methods have two limitations: 1) they neglect other important elements like scenes, textures, and objects beyond the capacity of pretrained object detectors;2) the correlation among objects is fixed, but a fixed correlation is not appropriate for all the images. To overcome the limitations, we propose the Dynamic Region-Aware Graph Convolutional Network (DRAG) that dynamically finds out crucial regions including objects and other important elements, and models their correlation adaptively for each input image. To find out crucial regions, we cluster spatially-correlated feature channels into several region-aware feature maps. Further, we dynamically model the correlation with the self-attention mechanism and explore the interaction among the regions with a graph convolutional network. The DRAG achieved an accuracy of 87% on the largest dataset for privacy-leaking image detection, which is 10 percentage points higher than the state of the art. The further case study demonstrates that it found out crucial regions containing not only objects but other important elements like textures. The code and more details are in https://***/guang-yanng/DRAG. © 2022, CC BY.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Deep Semantic-Enhanced Event Detection via Symmetric Graph Convolutional Network

Deep Semantic-Enhanced Event Detection via Symmetric Graph C...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Chenchen Sun Xingrui Zhuo Zhenya Lu Chenyang Bu Gongqing Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Event detection, an important research topic of information extraction, aims to automatically identify and classify event instances from the text. Previous studies have introduced methods combining syntactic information and graph convolutional networks into the field of event detection and verified their effectiveness. However, such methods often ignore the high-order information on the syntactic tree with noisy words, which limits their classification quality. In this paper, we propose a deep symmetric graph convolutional network to organically integrate high-order and low-order syntactic information to strengthen the semantic features of sentences. Specifically, we design a skip connection with attention gating mechanism, which selects valuable low-order syntactic information under the supervision of high-order syntactic information to strengthen the aggregation of high-order and low-order syntactic information. Then, a graph perturbation mechanism is proposed to discard noisy nodes on the syntactic graph to reduce the noisy information in the high-order syntactic information. We conducted extensive experiments on the widely used ACE 2005 benchmark, and the experimental results demonstrate that our method significantly outperforms state-of-the-art methods. Then, a graph perturbation mechanism is proposed to discard noisy nodes on the syntactic graph to reduce the noisy information in the high-order syntactic information. We conducted extensive experiments on the widely used ACE 2005 benchmark, and the experimental results demonstrate that our method significantly outperforms state-of-the-art methods. We conducted extensive experiments on the widely used ACE 2005 benchmark, and the experimental results demonstrate that our method significantly outperforms state-of-the-art methods. Then, a graph perturbation mechanism is proposed to discard noisy nodes on the syntactic graph to reduce the noisy information in the high-order syntactic information.

关键词： knowledge engineering Event detection Perturbation methods Semantics Syntactics Benchmark testing Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Performance study on logging to another main memory database

Performance study on logging to another main memory database

引用

International Conference on New Trends in Information and Service Science, NISS

作者： Xiongpai Qin Xiaoyun Zhou Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China Department of Computer Science and Technology Xuzhou Normal University Jiangsu 221008 China

In update intensive main memory database applications, huge volume of log records is generated, to maintain the ACID properties of the database system, the log records should be persistent efficiently. Delegating logging of one main memory database to another main memory database is proposed. The scheme is elaborated in detail in terms of architecture, logging & safeness levels, checkpointing, and recovery. Strict durability and relax durability are provided. When some form of non-volatile memory is used to temporarily holding log records, not only logging efficiency is improved, but also the scheme could guarantee full ACID of the system. We also propose using parallel logging to speedup log persistence by writing logs to multiple disks in parallel. Since interconnection network techniques progress by leaps and bounds, the scheme eliminates the concern about whether the system's overall performance may be slowed down by bandwidth and latency limitations. Experiment results demonstrate the feasibility of the proposal.

关键词： Checkpointing database systems Transaction databases Network servers Availability Nonvolatile memory Writing Communication industry Defense industry Wood industry

来源：评论

学校读者我要写书评

暂无评论

Label Enhanced Event Detection with Collective knowledge and Heterogeneous Graph

Label Enhanced Event Detection with Collective Knowledge and...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Gongqing Wu Zhenya Lu Zhuochun Miao Xingrui Zhuo Zan Zhang Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Event Detection (ED) aims to recognize instances of specified types of event triggers in text. Existing graph neural network-based models have achieved promising progress to alleviate this problem by capturing different orders of syntactic information, but they are limited by two issues. First, the long-range syntactic information between words is not fully exploited. Second, they ignore the semantic information provided by dependency labels which provide linguistic knowledge that is useful to ED. As a result, we proposed a label-enhanced dense graph convolutional network that employs dense connectivity and Graph Transformer Networks (GTN) to learn a flexible selection of edge types and composite relations between the words. Each layer can make use of the collective knowledge of dense blocks in order to model syntactic dependencies over long distances through dense connectivity. The proposed model achieves state-of-the-art performance for ED on common datasets after extensive experiments are conducted to show its advantages.

关键词： knowledge engineering Event detection Text recognition Semantics Syntactics Linguistics Transformers

来源：评论

学校读者我要写书评

暂无评论

Article Reranking by Memory-Enhanced key Sentence Matching for Detecting Previously Fact-Checked Claims

arXiv

引用

arXiv 2021年

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021, CC BY-SA.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-Label classification with Missing Labels by Preserving Feature-Label Space Consistency

Multi-Label classification with Missing Labels by Preserving...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Zan Zhang Depeng Zhang Gongqing Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Multi-label classification deals with the problem where an instance is associated with multiple labels simultaneously. Most existing multi-label classification algorithms assume that the labels of the training data are complete. However, we can obtain only a partial label set of each instance in some real applications since labelling data is difficult or costly. Some existing works on multi-label classification with missing labels focus on exploiting label correlations to complete the original label space and simultaneously build a multi-label learning model using label specific features. However, these methods may be suboptimal since they do not preserve feature-label space consistency. In this paper, we propose a Space Consistency-based Multi-Label classification algorithm named SCML to address this issue. First, label correlation in label space is learned to augment the incomplete original label matrix to a new supplementary label matrix, and the multi-label classifier is constructed simultaneously based on the new supplementary label matrix. Then, correlation information in feature space is learned based on the probabilistic neighborhood similarities to preserve feature-label space consistency. Moreover, the proposed algorithm has an effective mechanism for learning label-specific features to improve the multi-label classification with missing labels. Extensive experiments on twelve benchmark data sets validate the effectiveness of the proposed approach for improving the generalization performance of state-of-the-art algorithms of multi-label learning with missing labels.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On charactering of information propagation in online social networks

引用

Journal of Networks 2013年第1期8卷 124-131页

作者： Han, Xiaoting Niu, Li School of Economics and Management Beihang University Beijing China Key Laboratory of Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China

Recent years have witnessed the explosive growth of online social networks (OSNs), which provide a perfect platform for observing the information propagation. Based on the theory of complex network analysis, considering each node in OSNs as an agent, an information propagation model called IP-OSN has been proposed in this paper, and numerical simulation experiments have been extensively conducted, which show the mechanism of information propagation in OSNs. It can be seen from the experimental results that along with the information spreading scope will be larger while time passing. Moreover, from the network structure perspective, some interesting findings are got. First, the number of initial known nodes has a certain impact on the information propagation speed;however it doesn't affect the number of final known and unknown nodes. Then, the number of neighbors has a great impact on the information propagation process and results. Finally, percentage of different user type is the decisive factor for information propagation either in final node number or propagation speed. This paper attempts to complement the theoretical framework of information propagation and complex networks, and thus to further promote the practice of information control in OSNs. © 2013 ACADEMY PUBLISHER.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：