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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Performance to Detecting Topic Shift of Large Language Models: A Study 9

Evaluating the Performance to Detecting Topic Shift of Large...

引用

9th International Conference on Intelligent Computing and Signal Processing, ICSP 2024

作者： Tian, Pingfang Liu, Deting Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Institute of Scientific and Technical Information of China The Key Laboratory of the Rich Media Knowledge Organisation and Service of Digital Publishing Content Beijing100038 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Wuhan430065 China

ISBN: (纸本)9798350376548

Topic shift detection aims to identify whether there is a change in the current topic of conversation or if a change is needed. The study found previous work did not evaluate the performance of large language models like ChatGPT on the task of topic shift. Therefore, this paper's main task and innovation lie in analyzing ChatGPT's performance on topic shift detection. To provide a more comprehensive evaluation, we conducted topic shift detection tasks on ChatGPT from three aspects: single utterances, adjacent utterances, and contextual levels. Additionally, to gauge the performance of large language models, we conducted experiments on multiple small-scale models and compared the results of the two models. Experimental results on the publicly available English TIAGE dataset showed that small-scale models exhibited lower recall in all three aspects, while ChatGPT performed better in the recall. This suggests that compared to small-scale models, large models are more capable of accurately detecting topic shifts. However, large models also exhibited lower precision, indicating that while ChatGPT can recognize content differences in utterances, its judgment on whether these different contents belong to the same topic is poor. © 2024 IEEE.

关键词： adjacent utterances level ChatGPT contextual level single utterances level topic shift detection

来源：评论

学校读者我要写书评

暂无评论

Mining opinion word from customer review

International Journal of Database Theory and Application

引用

International Journal of database Theory and Application 2016年第2期9卷 129-136页

作者： Tengjiao, Jiang Minjuan, Zhong Shumei, Liao Siwen, Luo School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

Online customer review is considered as a significant informative resource which is useful for both potential customer and product manufacturers. As a result, it is one of the most challenging tasks to mine customer reviews automatically and to provide users with opinion summary. Product features and opinion word play the most important roles in the customers' opinions mining. In this paper, we dedicate our work to opinion word mining. We proposed an approach for opinion word identification based on the association rule mining algorithm. The method makes full use of co-occurrence syntactic characteristic between product features and opinion word. Firstly, the product feature is identified by two-stage filtering scheme, and secondly the opinion word is extracted through association rule mining. The final experiment results show that the proposed method could not only obtain the product features related to domain characteristics, but identify the opinion word effectively. Meanwhile, our approach possesses much higher precision and recall than Hu's work.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Edit Distance Algorithm with Block Swap

An Edit Distance Algorithm with Block Swap

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Tian Xia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resource Management Renmin University of China. Beijing 100872 China

The edit distance between two given strings X and Y is the minimum number of edit operations that transform X into Y. In ordinary course, string editing is based on character insert, delete, and substitute operations. It has been suggested that extending this model with block edits would be useful in applications such as DNA sequence comparison and sentence similarity computation. However, the existing algorithms have generally focused on the normalized edit distance, and seldom of them consider the block swap operations at a higher level. In this paper, we introduce an extended edit distance algorithm which permits insertions, deletions, and substitutions at character level, and also permits block swap operations. Experimental results on randomly generated strings verify the algorithm's rationality and efficiency. The main contribution of this paper is that we present an algorithm to compute the lowest edit cost for string transformation with block swap in polynomial time, and propose a breaking points selection algorithm to improve the computation speed.

关键词： Edit distance edit operation block swap string matching.

来源：评论

学校读者我要写书评

暂无评论

From knowledge Graph Development to Serving Industrial knowledge Automation:A Review 41

From Knowledge Graph Development to Serving Industrial Knowl...

引用

第41届中国控制会议

作者： Guangxuan Song Dongmei Fu Dawei Zhang Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical EngineeringUniversity of Science and Technology Beijing Beijing Engineering Research Center of Industrial Spectrum Imaging School of Automation and Electrical EngineeringUniversity of Science and Technology Beijing Shunde Graduate School of University of Science and Technology Beijing Beijing Advanced Innovation Center for Materials Genome Engineering Institute for Advanced Materials and TechnologyUniversity of Science and Technology Beijing National Materials Corrosion and Protection Data Center University of Science and Technology Beijing

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

knowledge is essential for the management,scheduling,and operation of all industrial *** automation refers to the automation of knowledge-based work,which is a disruptive technology of the *** in the era of big data,KG inherits the good interpretability of traditional symbolism system approaches and becomes one of the feasible and important directions to realize industrial knowledge *** paper begins with the origin of KGs,introduces the characteristics of KGs,and reviews the state of the art of KG through the cases of KG constructed and applied in general and vertical *** paper also focuses on the research progress of KG applications in industry,by identifying the current challenges of KG in industrial applications,and highlighting the substantial potential of KG to serve knowledge automation.

关键词： knowledge knowledge Graph(KG) knowledge Automation Symbolism Industry

来源：评论

学校读者我要写书评

暂无评论

Multiple vehicle-like target tracking based on the velodyne lidar?

Multiple vehicle-like target tracking based on the velodyne ...

引用

8th IFAC Symposium on Intelligent Autonomous Vehicles, IAV 2013

作者： Zhang, Liang Li, Qingquan Li, Ming Mao, Qingzhou Nüchter, Andreas State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan Hubei 430079 China Shenzhen Key Laboratory of Spatial-temporal Smart Sensing and Services Shenzhen University Shenzhen Guangdong 518052 China Engineering Research Center for Spatio-Temporal Data Smart Acquisition and Application Ministry of Education of China Wuhan University Wuhan Hubei 430079 China Automation and Machine Vision Group Jacobs University Bremen 28759 Germany

ISBN: (纸本)9783902823366

This paper proposes a novel multiple vehicle-like target tracking method based on a Velodyne HDL64E light detection and ranging (LiDAR) system. The proposed method combines multiple hypothesis tracking (MHT) algorithm with dynamic point cloud registration (DPCR), which is able to solve the multiple vehicle-like target tracking in highly dynamic urban environments without any auxiliary information from GPS or IMU. Specifically, to track targets consistently, the DPCR is developed to calculate accurately the pose of the ego-vehicle for the transformation of raw measurements taken in the moving coordinate systems into a static absolute coordinate system;while in turn, MHT helps to improve the performance of DPCR by discriminating and removing the dynamic points from the scene. Furthermore, the proposed MHT method is also able to solve the occlusion problem existing in the point cloud. Experiments on sets of urban environments prove that the presented method is effective and robust, even in highly dynamic environments. © 2013 IFAC.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Malicious Web Pages Detection Based on Abnormal Visibility Recognition

Malicious Web Pages Detection Based on Abnormal Visibility R...

引用

International Conference on E-Business and Information System Security, EBISS

作者： Bin Liang Jianjun Huang Fang Liu Dawei Wang Daxiang Dong Zhaohui Liang Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China School of Information Renmin University of China Beijing China Renmin University of China Beijing CN

In recent years, Web sites have already become the attackers' main target. When attackers embed malicious code in the Web pages, they generally change the display mode of the corresponding HTML tags to make the display effect of malicious code invisible or almost invisible to the browser users. In this paper, the concept of abnormal visibility is proposed to describe the display feature setting of malicious code embedded. According to the concept, a malicious code detection method based on abnormal visibility recognition is designed and a prototype system is implemented. Compared to traditional methods and systems, the method has higher efficiency and less maintenance cost. Besides, a special-purpose JavaScript interpreter is implemented to get the execution output of browser-end scripts that are often used to generate malicious code dynamically by attackers. Experiments show that this system can detect most of the malicious Web pages efficiently and at the same time locate the malicious code in the source code accurately.

关键词： Web pages Displays Java Prototypes HTML Costs Invasive software Fingerprint recognition Laboratories data engineering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：