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

ProtoEM: A Prototype-Enhanced Matching Framework for Event Relation Extraction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hu, Zhilei Li, Zixuan Xu, Daozhu Bai, Long Jin, Cheng Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China State Key Laboratory of Geo-Information Engineering Xi’an710054 China Xi’an Research Institute of Surveying and Mapping Xi’an710054 China

Event Relation Extraction (ERE) aims to extract multiple kinds of relations among events in texts. However, existing methods singly categorize event relations as different classes, which are inadequately capturing the intrinsic semantics of these relations. To comprehensively understand their intrinsic semantics, in this paper, we obtain prototype representations for each type of event relation and propose a Prototype-Enhanced Matching (ProtoEM) framework for the joint extraction of multiple kinds of event relations. Specifically, ProtoEM extracts event relations in a two-step manner, i.e., prototype representing and prototype matching. In the first step, to capture the connotations of different event relations, ProtoEM utilizes examples to represent the prototypes corresponding to these relations. Subsequently, to capture the interdependence among event relations, it constructs a dependency graph for the prototypes corresponding to these relations and utilized a Graph Neural network (GNN)-based module for modeling. In the second step, it obtains the representations of new event pairs and calculates their similarity with those prototypes obtained in the first step to evaluate which types of event relations they belong to. Experimental results on the MAVEN-ERE dataset demonstrate that the proposed ProtoEM framework can effectively represent the prototypes of event relations and further obtain a significant improvement over baseline models. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

Few-shot Open Relation Extraction with Gaussian Prototype and Adaptive Margin

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Guo, Tianlin Zhang, Lingling Wang, Jiaxin Lei, Yunkuo Li, Yifei Wang, Haofen Liu, Jun School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China School of Computer Science and Technology Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi’an710049 China College of Design and Innovation Tongji University Shanghai200092 China

Few-shot relation extraction with none-of-the-above (FsRE with NOTA) aims at predicting labels in few-shot scenarios with unknown classes. FsRE with NOTA is more challenging than the conventional few-shot relation extraction task, since the boundaries of unknown classes are complex and difficult to learn. Meta-learning based methods, especially prototype-based methods, are the mainstream solutions to this task. They obtain the classification boundary by learning the sample distribution of each class. However, their performance is limited because few-shot overfitting and NOTA boundary confusion lead to misclassification between known and unknown classes. To this end, we propose a novel framework based on Gaussian prototype and adaptive margin named GPAM for FsRE with NOTA, which includes three modules, semi-factual representation, GMM-prototype metric learning and decision boundary learning. The first two modules obtain better representations to solve the few-shot problem through debiased information enhancement and Gaussian space distance measurement. The third module learns more accurate classification boundaries and prototypes through adaptive margin and negative sampling. In the training procedure of GPAM, we use contrastive learning loss to comprehensively consider the effects of range and margin on the classification of known and unknown classes to ensure the model's stability and robustness. Sufficient experiments and ablations on the FewRel dataset show that GPAM surpasses previous prototype methods and achieves state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

Fil-Cad: A Fault Detection Method for Iiot Based on Federated Incremental Learning with Class Accuracy Distillation

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Liu, Yanhua Fang, Wenyu Huang, Wei Wang, Xiaofeng Zhao, Baokang Liu, Ximeng College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Fault detection is a research topic attracting much attention in IIoT. However, the continuous accumulation and growth of IIoT data leads to the catastrophic forgetting problem in the fault detection model and data heterogeneity, which creates a bottleneck for the performance and generalization of federated learning in fault detection. To improve the fault detection performance of federated learning models in data incremental scenarios, we propose a federatedincremental-learning-based fault detection method for IIoT, namely FIL-CAD. Firstly, comparing the knowledge distillation, the accuracies of different data classes in the global and local models are chosen as the model lightweight learning features, and the loss function is weighted. Secondly, we introduce the concept of data learning depth. It computes different model weights in the aggregation based on their degrees of data sample learning and model training participation and obtains the global model through weighted aggregation. Additionally, FIL-CAD supports the combination of differential privacy to protect data privacy. The proposed method is compared with four benchmark methods on four datasets, which include CWRU and MFPT bearing datasets. Then, the experimental results show that FIL-CAD performs optimally in accuracy and F1-Score, and the average accuracy is improved by 1.32%-18.52%, demonstrating the superiority of FIL-CAD. © 2024, The Authors. All rights reserved.

关键词： Fault detection

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm 29

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Ge...

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zeng, Yan Huang, Chengchuang Ni, Yijie Zhou, Chunbao Zhang, Jilin Wang, Jue Zhou, Mingyao Xue, Meiting Zhang, Yunquan Hangzhou Dianzi University School of Computer Science and Technology Hangzhou310018 China Ministry of Education Key Laboratory for Modeling and Simulation of Complex Systems Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Hangzhou Dianzi University School of ITMO Joint Institute Hangzhou310018 China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing100086 China HuaWei China Institute of Computing Technology of the Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100086 China

ISBN: (纸本)9798350330717

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network's dataflow graph and device cluster's topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method. © 2023 IEEE.

关键词： Auto-Parallel Distributed machine learning Genetic algorithm Integer linear programming Model parallelism

2D-DOA Estimation for Polarized Massive Antenna Array: Geometric and Algorithmic Guidelines

学校读者我要写书评

暂无评论

IEEE Transactions on Vehicular technology 2025年

作者： Wen, Fangqing Wang, Han Gui, Guan Yuen, Chau Sari, Hikmet Adachi, Fumiyuki China Three Gorges University Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering Yichang443002 China Hubei University of Automotive Technology Institute of Vehicle Information Control and Network Technology Shiyan442002 China Yichun University College of Physical Sciences and Engineering Technology Yichun336000 China City University of Macau Faculty of Data Science China Nanjing University of Posts and Telecommunications College of Telecommunications and Information Engineering Nanjing210003 China Nanyang Technological University School of Electrical and Electronics Engineering 639798 Singapore Sendai980-8572 Japan

The utilization of an Electromagnetic Vector Sensor (EMVS) array presents valuable insights in wireless communications and radars by incorporating the advantages of spatial, temporal, and polarization diversities. This study focuses on addressing the problem of estimating the Two-Dimensional (2D) Direction-of-Arrival (DOA) for an arbitrarily spaced EMVS array. Firstly, the Cramer-Rao Bounds (CRB) for estimating the 2D-DOA and polarized parameters are derived, which provides design guideline for array geometry. As suggested by the CRB, a sparse planar EMVS array is a more appealing choice compared to the popular coprime EMVS array. Thereafter, a Parallel Factor (PARAFAC)-based weighted phase fitting algorithm is presented, designed to fully explore the aperture of the conformal array as well as capitalize on the tensorial structure inherent in array data. The proposed PARAFAC algorithm not only provides a closed-form solution for conformal arrays but also exhibits superior accuracy in 2D-DOA estimation compared to existing approaches. Numerical results corroborate the theoretical advantages of the proposed array geometry and PARAFAC algorithm. © 1967-2012 IEEE.

关键词： Cramer-Rao bounds

KA$^{2}$2SE: Key-Aggregation Authorized Searchable Encryption Scheme for data Sharing in Wireless Sensor networks

学校读者我要写书评

暂无评论

IEEE Transactions on Services Computing 2024年第1期18卷 226-238页

作者： Haijiang Wang Jianting Ning Wei Wu Chao Lin Kai Zhang School of Information and Electronic Engineering Zhejiang University of Science and Technology Zhejiang China School of Cyber Science and Engineering Wuhan University Wuhan China Faculty of Data Science City University of Macau Macau China College of Education Sciences Hong Kong University of Science and Technology Guangzhou China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou China Guangdong Key Laboratory of Blockchain Security Guangzhou University Guangzhou China College of Computer Science and Technology Shanghai University of Electric Power Shanghai China

As a promising technology, key-aggregation searchable encryption with constant computation overhead is especially suitable for sensor nodes with limited computation resources in wireless sensor networks. However, in most of the existing key-aggregation searchable encryption schemes, the authorized aggregation key is generated in a deterministic way. As a result, these schemes suffer from “ Key Forge Attack ” and “ Trapdoor Forge Attack ” that we proposed and hence fail to support the security property as they claimed (which is an important goal to be achieved in key-aggregation searchable encryption schemes). To fix these flaws, in this paper, we identify the security challenges related to key-aggregation searchable encryption and propose a lightweight key-aggregation authorized searchable encryption scheme based on attribute-based encryption, called KA $^{2}$ SE. It enables a data owner to share encrypted data with an authorized query user by issuing only a single authorized aggregation key, and the authorized query user only needs to submit a single trapdoor to the cloud server to perform keyword search. We formulate the security definitions for KA $^{2}$ SE and prove its security. Finally, empirical evaluations demonstrate that KA $^{2}$ SE is computationally efficient in comparison with existing schemes.

关键词： Encryption Cryptography Keyword search Wireless sensor networks Servers Privacy Cloud computing Security Probabilistic logic Authorization

Multi-Strategy Bus Deviation-Driven Layer Assignment Algorithm

学校读者我要写书评

暂无评论

Multi-Strategy Bus Deviation-Driven Layer Assignment Algorit...

Electronics Design Automation (ISEDA), International Symposium of

作者： Yantao Yu Zepeng Li Jiarui Chen Xing Huang Genggeng Liu Ning Xu College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China School of Computer Science Northwestern Polytechnical University Xian China School of Information Engineering Wuhan University of Technology Wuhan China

ISBN: (数字)9798350352030

ISBN: (纸本)9798350352047

In modern very large-scale integration (VLSI) design, the solution quality of the bus routing is a crucial factor that determines the timing and power of circuit, and finally affects the performance and yield of chips. Taking bus deviation as the main optimization objective, an effective multi-strategy bus deviation-driven layer assignment algorithm is proposed to solve the timing-matching problem of bus routing. First, a net priority determination method that integrates multiple features is presented to determine the layer assignment order, thus obtaining a routing sequence which can weigh the wirelength and bus deviation well. Second, an effective single net layer assignment algorithm is proposed to assign each net based on dynamic programming, thus reducing the number of vias. Third, a layer shifting strategy based on the bus lookup table is designed to effectively balance total wirelength and bus deviation by sacrificing a certain number of vias. Experimental results, compared to existing work, show that the proposed algorithm can achieve significant optimization on the bus deviation and total wirelength, and finally obtain the best results in terms of the bus deviation, which is the most important optimization objective for bus routing.

关键词： Design automation Heuristic algorithms Very large scale integration Routing Timing Pins Dynamic programming

The Security and Privacy of Mobile Edge Computing: An Artificial Intelligence Perspective

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Cheng Yuan, Zenghui Zhou, Pan Xu, Zichuan Li, Ruixuan Wu, Dapeng Oliver Hubei Engineering Research Center on Big Data Security Key Laboratory of Distributed System Security of Hubei Province School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Software The Key Laboratory for Ubiquitous Network Service Software of Liaoning Province Dalian University of Technology Dalian116024 China Intelligent and Distributed Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science City University of Hong Kong Kowloon999077 Hong Kong

Mobile Edge Computing (MEC) is a new computing paradigm that enables cloud computing and information technology (IT) services to be delivered at the network’s edge. By shifting the load of cloud computing to individual local servers, MEC helps meet the requirements of ultralow latency, localized data processing, and extends the potential of Internet of Things (IoT) for end-users. However, the crosscutting nature of MEC and the multidisciplinary components necessary for its deployment have presented additional security and privacy concerns. Fortunately, Artificial Intelligence (AI) algorithms can cope with excessively unpredictable and complex data, which offers a distinct advantage in dealing with sophisticated and developing adversaries in the security industry. Hence, in this paper we comprehensively provide a survey of security and privacy in MEC from the perspective of AI. On the one hand, we use European Telecommunications Standards Institute (ETSI) MEC reference architecture as our based framework while merging the Software Defined network (SDN) and network Function Virtualization (NFV) to better illustrate a serviceable platform of MEC. On the other hand, we focus on new security and privacy issues, as well as potential solutions from the viewpoints of AI. Finally, we comprehensively discuss the opportunities and challenges associated with applying AI to MEC security and privacy as possible future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： network security

PrintListener: Uncovering the Vulnerability of Fingerprint Authentication via the Finger Friction Sound

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhou, Man Su, Shuao Wang, Qian Li, Qi Zhou, Yuting Ma, Xiaojing Li, Zhengxiong School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Cyber Science and Engineering Wuhan University China Institute for Network Sciences and Cyberspace Tsinghua University China Department of Computer Science and Engineering University of Colorado Denver United States Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China

Fingerprint authentication has been extensively employed in contemporary identity verification systems owing to its rapidity and cost-effectiveness. Due to its widespread use, fingerprint leakage may cause sensitive information theft, enormous economic and personnel losses, and even a potential compromise of national security. As a fingerprint that can coincidentally match a specific proportion of the overall fingerprint population, MasterPrint rings the alarm bells for the security of fingerprint authentication. In this paper, we propose a new side-channel attack on the minutiae-based Automatic Fingerprint Identification System (AFIS), called PrintListener, which leverages users’ fingertip swiping actions on the screen to extract fingerprint pattern features (the first-level features) and synthesizes a stronger targeted PatternMasterPrint with potential second-level features. The attack scenario of PrintListener is extensive and covert. It only needs to record users’ fingertip friction sound and can be launched by leveraging a large number of social media platforms. Extensive experimental results in real-world scenarios show that Printlistener can significantly improve the attack potency of MasterPrint. © 2024, CC0.

关键词： Friction