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

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Wan, Qizhi Wan, Changxuan Hu, Rong Liu, Dexi Xu, Wenwu Xu, Kang Zou, Meihua Liu, Tao Yang, Jie Xiong, Zhenwei School of Computer and Artificial Intelligence Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering China

ISBN: (纸本)9798891761681

To meet application needs, event extraction has shifted from simple entities to unconventional entities serving as event arguments. However, current corpora with unconventional entities as event arguments are limited in event types and lack rich multi-events and shared arguments. Financial commentary not only describes the basic elements of an event but also states the background, scope, manner, condition, result, and tool used for the event, as well as the tense, intensity, and emotions of actions or state changes. Therefore, it is not suitable to develop event types that include only a few specific roles, as these cannot comprehensively capture the event's semantics. Also, there are affluent complex entities serving as event arguments, multiple events, and shared event arguments. To advance the practicality of event extraction technology, this paper first develops a general open event template from the perspective of understanding the meaning of events, aiming to comprehensively reveal useful information about events. This template includes 21 event argument roles, divided into three categories: core event roles, situational event roles, and adverbial roles. Then, based on the constructed event template, Chinese financial commentaries are collected and manually annotated to create a corpus OEE-CFC supporting open event extraction. This corpus includes 17,469 events, 44,221 arguments, 3,644 complex arguments, and 5,898 shared arguments. Finally, based on the characteristics of OEE-CFC, we design four types of prompts, and two models for event argument extraction are developed, with experiments conducted on the prompts. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

knowledge Graph for China's Genealogy1

引用

IEEE Transactions on knowledge and data engineering 2023年第1期35卷 634-646页

作者： Wu, Xindong Jiang, Tingting Zhu, Yi Bu, Chenyang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Anhui Hefei230009 China Hefei University of Technology Research Institute of Big Knowledge Anhui Hefei230009 China Mininglamp Technology Mininglamp Academy of Sciences Beijing100102 China Hefei University of Technology School of Computer Science and Information Engineering Anhui Hefei230009 China Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Anhui Hefei230009 China

Genealogical knowledge graphs depict the relationships of family networks and the development of family histories. They can help researchers to analyze and understand genealogical data, search for genealogical descendant paths, and explore the origins of a family. However, the heterogenous, autonomous, complex, and evolving natures of genealogical data bring challenges to the development of contemporary genealogical knowledge graph models. Applying existing methods to genealogical data may be improper because general knowledge graph models lack in-depth domain knowledge. In this paper, we propose a genealogical knowledge graph model named Huapu-KG that combines HAO intelligence (human intelligence + artificial intelligence + organizational intelligence) to implement the construction and applications of genealogical knowledge graphs. Furthermore, challenges in constructing genealogical knowledge graphs are demonstrated, and experiments conducted on real-world genealogical datasets verify the feasibility and effectiveness of our proposed model. © 1989-2012 IEEE.

关键词： History

来源：评论

学校读者我要写书评

暂无评论

Access control of blockchain based on dual-policy attribute-based encryption 22

Access control of blockchain based on dual-policy attribute-...

引用

22nd IEEE International Conference on High Performance Computing and Communications, 18th IEEE International Conference on Smart City and 6th IEEE International Conference on data Science and Systems, HPCC-SmartCity-DSS 2020

作者： Han, Daojun Chen, Jinyu Zhang, Lei Shen, Yatian Wang, Xueheng Gao, Yihua Institute of Data and Knowledge Engineering School of Computer and Information Engineering Henan University Kaifeng China Henan University Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Kaifeng China

ISBN: (纸本)9781728176499

In scenarios where multiple parties such as the Internet of Things and Supply Chains participate in data sharing and computing, when accessing data, users not only need to accept the forward access control of the data owner, but also needs to perform reverse access control on the data, so as to realize two-way access control. In the traditional blockchain, all users can participate in accounting and view transaction data, and only protect user privacy through 'pseudo-Anonymity'. The access rights of different users cannot be distinguished, which cannot meet the user's two-way access control needs. However, most of the existing blockchain-based access control schemes are one-way access control, which cannot meet the needs of users for two-way access control in scenarios such as the Internet of Things and Supply Chains. Therefore, it is particularly important to design a two-way access control mechanism suitable for application in the blockchain. On this basis, this paper proposes a dual strategy attribute-based encryption (ABE) scheme for distributed outsourcing. This scheme combines two existing schemes, ciphertext-policy ABE and key-policy ABE, and proposes two access structures and a structure of attribute sets. The primary access structure and the secondary attributes are stored in the ciphertext, and the secondary access structure and the primary attributes are stored in the user's private key. Only when the primary attribute set satisfies the primary access structure and the secondary attribute set satisfies the secondary access structure can the user unlock the ciphertext. This scheme has no single authorization center;instead, blockchain nodes jointly participate in authorization. In addition, the proposed scheme outsources the encryption and decryption of the ciphertext to blockchain nodes to reduce the computing pressure on users and can adapt to the decentralized environment of the blockchain and provide users with two-way access control services. Finally,

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Quality aware privacy protection for location-based services

引用

12th International Conference on database Systems for Advanced Applications, DASFAA 2007

作者： Zhen, Xiao Xiaofeng, Meng Jianliang, Xu School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE Department of Computer Science Hong Kong Baptist University

ISBN: (纸本)9783540717027

Protection of users' privacy has been a central issue for location-based services (LBSs). In this paper, we classify two kinds of privacy protection requirements in LBS: location anonymity and identifier anonymity. While the location cloaking technique under the k-anonymity model can provide a good protection of users' privacy, it reduces the resolution of location information and, hence, may degrade the quality of service (QoS). To strike a balance between the location privacy and QoS, we present a quality-aware anonymity model for protecting location privacy while meeting user specified QoS requirements. In the model, a mobile user can specify the minimum anonymity level requirement upon location privacy as well as the maximum cloaking latency and the maximum cloaking region size requirements upon QoS. In accordance with the model, we develop an efficient directed-graph based cloaking algorithm to achieve both high-quality location anonymity and identifier anonymity. The performance objective is to maximize the cloaking success rate under the privacy and QoS constraints. Furthermore, we introduce an option of using dummy locations to achieve a 100% cloaking success rate at the cost of communication overhead. Experimental results show the effectiveness of our cloaking algorithm under various privacy and QoS requirements. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Tracking (position)

来源：评论

学校读者我要写书评

暂无评论

High Dynamic Collaborative Team Query via Multi-Fuzzy-Constrained Graph Pattern Matching 9

High Dynamic Collaborative Team Query via Multi-Fuzzy-Constr...

引用

9th International Conference on Cloud Computing and Big data Analytics, ICCCBDA 2024

作者： Hu, Tao Zhang, Zan Bu, Chenyang Li, Lei Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9798350373554

Graph pattern matching is a technique widely used in various fields such as protein structure analysis, social group querying, and expert localization. This technique involves finding matching subgraphs in large social networks that align with the patterns specified in the pattern graph. In this paper, we focus on a specific sub-problem in social group querying, known as the cooperative team query, which arises from practical applications, where the nodes in the pattern graph and the data graph represent team member entities, while the edges represent their social relationships. We note that the requirements of many teams in the real world are dynamic, necessitating iterative computation for graph pattern matching using traditional methods. To address this challenge in highly dynamic systems, we propose a graph pattern matching method based on core pattern graph matching cache. This approach involves extracting the core pattern graph, and comprising core team members based on the characteristics of cooperative teams. The core graph-based matching cache enables the second half of the algorithm to operate on an order-of-magnitude smaller graph, significantly improving efficiency. Additionally, the multi-threaded approach fully leverages hardware resources, synchronizing multiple matching result of the core pattern graph to reduce matching time. Experimental results on three real social network datasets demonstrate that our proposed algorithm, Core Pattern Graph Matching Cache-based Multi-threaded Exploration (CCMTE), significantly outperforms existing methods in terms of efficiency. © 2024 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

RGB-D SLAM Method Based on Feature Association in Dynamic Environment 6

RGB-D SLAM Method Based on Feature Association in Dynamic En...

引用

6th Asian Conference on Artificial Intelligence Technology, ACAIT 2022

作者： Fang, Baofu Wang, Hao Wang, Hao Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9781665453110

Simultaneous localization and mapping (SLAM) is one of the current research hotspots. However, in visual SLAM for dynamic environments, inaccurate detection of object motion states and incomplete dynamic region culling will lead to large localization errors. To address these issues, this paper proposes an RGB-D SLAM method based on feature association. The method has strongly correlated features in time and space according to the input image sequence. Using the moving probability of the feature points in the previous frame, the movement of the feature points in the current frame is calculated in combination with the dynamic corner points screened in the current frame. Then, the motion state of the object is determined according to the proportion of different feature points. Then combined with semantic information and object depth information, the fast search method is used to obtain accurate dynamic regions. Finally, the selected effective feature points are used to estimate the camera pose and establish a static map of the environment. This paper evaluates the robustness and accuracy of our method on the TUM dataset and real environment, and the results show that our method can significantly improve the system tracking effect and reduce the system tracking error compared with other SLAM methods in dynamic environments. © 2022 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Semantic SLAM Based on Compensated Segmentation and Geometric Constraints in Dynamic Environments 6

Semantic SLAM Based on Compensated Segmentation and Geometri...

引用

6th Asian Conference on Artificial Intelligence Technology, ACAIT 2022

作者： Fang, Baofu Zhou, Shuai Wang, Hao Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9781665453110

Most of the existing slam algorithms are designed based on the assumption of a static environment, this strong assumption limits the practical application of most slam systems. The main reason is that moving objects will cause feature mismatch in the pose estimation process, which in turn affects the accuracy of localization and mapping. In this paper, we propose a SLAM algorithm in a dynamic environment. First, we use the BlendMask network to detect potential moving objects to generate masks for dynamic objects. The geometrically constrained joint optical flow method is used to detect dynamic feature points. Secondly, aiming at the failure of semantic segmentation network segmentation, a missed detection compensation algorithm based on the invariance of adjacent frame speed is proposed. Finally, a keyframe selection strategy is proposed to construct a semantic octree graph containing only static objects. We evaluate our algorithm on TUM RGB-D and real scene datasets. The experimental results show that the algorithm has high accuracy and real-time performance. © 2022 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Services analysis in apparel quotation system based on SOA

Services analysis in apparel quotation system based on SOA

引用

International Conference on Management and Service Science, MASS 2009

作者： Li, Qian Chen, Yu Lanfang, Zhang Information School and Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781424446391

Based on the analysis of quote business processes, as well as the characteristics of SOA, a quotation system is brought forward based on SOA for apparel international trade, in order to enhance the Quote's diversity, accuracy as well as efficiency. This paper puts great importance on analyzing how to define, extract, as well as implement services, not only for needs from quotation business process, but also from quotation business goals. Based on the analysis of services, finally, an apparel quotation architecture is described in details. ©2009 IEEE.

关键词： International trade

来源：评论

学校读者我要写书评

暂无评论

Constructing corpus for query-oriented XML text summarization

Constructing corpus for query-oriented XML text summarizatio...

引用

International Conference on Management of E-Commerce and E-Goverment

作者： Wu, Shihan Liu, Dexi Jiao, Xianpei Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang Jiangxi China

ISBN: (纸本)9780769542454

XML Retrieval is becoming the focus study of the field of Information Retrieval and database. Summarization of the results which come from the XML search engines will alleviate the read burden of user's. However, as the basis of this study, the construction of the query-oriented XML text summarization corpus has not yet received enough attention. In this paper, we introduce our works on constructing this kind of corpus, including the selection of topics and XML elements/documents, construction process and the feature of the constructed corpus. Up to now, the corpus has 25 English query topics, including 422 elements for summarization, and 32 Chinese topics which including 402 elements. For each topic, 4 pieces of extracted summaries and 4 pieces of generated summaries are made manually by 4 experts. © 2010 IEEE.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection with evolutionary sparsity

引用

Neural Networks 2025年 189卷 107512页

作者： Shixuan Zhou Yi Xiang Han Huang Pei Huang Chaoda Peng Xiaowei Yang Peng Song School of Software Engineering South China University of Technology Guangzhou 510006 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China Key Laboratory of Big Data and Intelligent Robot (SCUT) Ministry of Education Guangzhou 510006 China Guangdong Engineering Center for Large Model and GenAI Technology Guangzhou 510006 China School of Information Science Guangdong University of Finance and Economics Guangzhou 510006 China School of Mathematics and Informatics South China Agricultural University Guangzhou 510006 China School of Computer and Control Engineering Yantai University Yantai 264005 China

The ℓ 2 , 0 -norm is playing an increasingly important role in unsupervised feature selection. However, existing algorithm for optimization problem with ℓ 2 , 0 -norm constraint has two problems: First, they cannot automatically determine the sparsity, also known as the number of key features. Second, they have the risk of converging towards local optima, therefore selecting trivial (less informative) features. To address these problems, this paper proposes an unsupervised feature selection method with evolutionary sparsity (EVSP), which integrates the feature selection process with a sparse projection matrix and population search mechanisms into a unified unsupervised feature selection framework. Specifically, the level of sparsity is encoded as population individuals, and subsequently, a multi-objective evolutionary algorithm based on binary encoding is introduced to recursively determine the optimal level of sparsity, thus unsupervisedly guiding the learning of an optimal row-sparse projection matrix. Moreover, by utilizing the feature weights learned through sparse projection, a two-stage strategy called the mutation-repair operator is designed to steer the evolution of the population, aiming to generate high-quality candidate solutions. Comprehensive experiments on eleven benchmark datasets, with a maximum dimensionality of 10304 features and a maximum size of 9298 samples, demonstrate that the proposed EVSP method can effectively determine the optimal sparsity level, significantly outperforming several state-of-the-art methods.

关键词： Multi-objective evolution Sparse projection Unsupervised feature selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：