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

arXiv 2023年

作者： Ren, Weicheng Li, Zixuan Jin, Xiaolong Bai, Long Su, Miao Liu, Yantao Guan, Saiping Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Nested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively. Nested events involve a kind of Pivot Elements (PEs) that simultaneously act as arguments of outer-nest events and as triggers of inner-nest events, and thus connect them into nested structures. This special characteristic of PEs brings challenges to existing NEE methods, as they cannot well cope with the dual identities of PEs. Therefore, this paper proposes a new model, called PerNee, which extracts nested events mainly based on recognizing PEs. Specifically, PerNee first recognizes the triggers of both inner-nest and outer-nest events and further recognizes the PEs via classifying the relation type between trigger pairs. The model uses prompt learning to incorporate information from both event types and argument roles for better trigger and argument representations to improve NEE performance. Since existing NEE datasets (e.g., Genia11) are limited to specific domains and contain a narrow range of event types with nested structures, we systematically categorize nested events in the generic domain and construct a new NEE dataset, called ACE2005-Nest. Experimental results demonstrate that PerNee consistently achieves state-of-the-art performance on ACE2005-Nest, Genia11, and Genia13. The ACE2005-Nest dataset and the code of the PerNee model are available at https://***/waysonren/PerNee. Copyright © 2023, The Authors. All rights reserved.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Few-shot Link Prediction on Hyper-relational Facts

arXiv

引用

arXiv 2023年

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Hyper-relational facts, which consist of a primary triple (head entity, relation, tail entity) and auxiliary attribute-value pairs, are widely present in real-world Knowledge Graphs (KGs). Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact, which helps populate and enrich KGs. However, existing LPHFs studies usually require an amount of high-quality data. They overlook few-shot relations, which have limited instances, yet are common in real-world scenarios. Thus, we introduce a new task, Few-Shot Link Prediction on Hyper-relational Facts (FSLPHFs). It aims to predict a missing entity in a hyper-relational fact with limited support instances. To tackle FSLPHFs, we propose MetaRH, a model that learns Meta Relational information in Hyper-relational facts. MetaRH comprises three modules: relation learning, support-specific adjustment, and query inference. By capturing meta relational information from limited support instances, MetaRH can accurately predict the missing entity in a query. As there is no existing dataset available for this new task, we construct three datasets to validate the effectiveness of MetaRH. Experimental results on these datasets demonstrate that MetaRH significantly outperforms existing representative models. Copyright © 2023, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Joint Class-Balanced Client Selection and Bandwidth Allocation for Cost-Efficient Federated Learning in Mobile Edge computing Networks

引用

IEEE Transactions on Mobile computing 2025年第7期24卷 5681-5698页

作者： Tang, Jian Li, Xiuhua Li, Hui Li, Penghua Wang, Xiaofei Leung, Victor C. M. Chongqing University School of Big Data & Software Engineering Chongqing400000 China Chongqing University of Posts and Telecommunications School of Automation Chongqing400065 China Tianjin University College of Intelligence and Computing Tianjin300072 China Shenzhen MSU-BIT University Artificial Intelligence Research Institute Shenzhen518172 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T1Z4 Canada

Federated Learning (FL) has significant potential to protect data privacy and mitigate network burden in mobile edge computing (MEC) networks. However, due to the system and data heterogeneity of mobile clients (MCs), client selection and bandwidth allocation is key for achieving cost-efficient FL in MEC networks with limited bandwidth. To address these challenges, we investigate the issue of joint client selection and bandwidth allocation for reducing the cost (i.e., latency and energy consumption) of FL training. We formulate the problem and decompose it into a holistic subproblem to reduce the number of rounds and a partial subproblem to reduce the costs of FL each round. We propose a joint class-balanced client selection and bandwidth allocation (CBCSBA) framework to address the whole problem. Specifically, for the holistic subproblem, CBCSBA combines MCs into groups, each having data distribution as close as possible to class-balanced distribution;For the partial subproblem, CBCSBA reduces costs by exploratively selecting a group and sequentially optimizing the latency and energy consumption of MCs within the group. Experimental results show that CBCSBA outperforms the baseline frameworks in reducing latency by 28.2% and energy consumption by 25.3% on average in the considered four datasets. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Study on the Application of Machine Learning Algorithms in the Prognosis of Ovarian Cancer

引用

Open Biomedical Engineering Journal 2023年 17卷

作者： Sindhu, S. Hemavathi, D. Sornalakshmi, K. Sujatha, G. Srividhya, S. Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology Tamil Nadu Kattankulathur 603203 India Department of Networking and Communications School of Computing SRM Institute of Science and Technology Tamil Nadu Kattankulathur 603203 India

Ovarian cancer is the third leading type of cancer found in women in India and ranks seventh globally. Several studies have shown that the population affected by ovarian cancer is profound to increase in the future. It is necessary to take steps for identifying cancer at the early stages to avoid mortality and recurrence. This chapter aims to survey the different ways machine learning models have been used in the prognosis of ovarian cancer-to predict the disease progression, recurrence, and mortality rate;analysis of genomic data sets;correlations and pattern analysis, and finding risk factors. The effective analytics on the imaging and other forms of data available from the patient’s electronic health records could unveil the possibilities of better or early diagnosis of ovarian cancer. The chapter will summarize the taxonomy of the various ways in which machine learning helps in ovarian cancer diagnosis, early detection, and treatment. In addition to surveying the current state-of-the-art application of machine learning algorithms for ovarian cancer diagnosis, the chapter aims to provide future research directions. © 2023 The Author(s). Published by Bentham science Publisher.

关键词： Cancer Correlation analysis Machine learning Ovarian cancer diagnosis Pattern analysis Prediction

来源：评论

学校读者我要写书评

暂无评论

Machine Learning and OpenCV: A Powerful Combination for Driver Drowsiness Detection

Machine Learning and OpenCV: A Powerful Combination for Driv...

引用

International Conference on Communication, computing and Internet of Things (IC3IoT)

作者： A Siva Kumar Pv Gopirajan Jayaraj Ramasamy Beulah Jackson Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology Kattankulathur Chennai India Department of Computational Intelligence School of Computing SRM Institute of Science and Technology Kattankulathur Campus Chennai India Department of IT Faculty of Engineering and Technology Botho University Botswana-Africa Department of Electronics and Communication Engineering Vel Tech Rangarajan Dr. Sagunthala R & D Institute of Science and Technology Chennai India

ISBN: (数字)9798350352689

ISBN: (纸本)9798350352696

Driver fatigue is a significant contributor to road accidents worldwide, and there is a need for efficient driver drowsiness detection systems to prevent such accidents. Computer vision techniques like OpenCV have recently been utilized to develop such strategies. This proposed work investigates the use of machine learning models and OpenCV Python package for driver drowsiness detection. The proposed system uses a camera to continuously capture the driver’s face and applies image processing techniques to identify drowsiness. The system detects blinks by monitoring the driver’s eyes and measuring the frequency and duration of eyelid closures. The real-time experiments conducted with the proposed method showed high accuracy in detecting drowsiness, and the system can be implemented in various settings, including cars and heavy vehicles. Ultimately, the system has some potential to reduce accidents caused by driver fatigue, thereby enhancing road safety.

关键词： Support vector machines Face recognition Machine learning Feature extraction Fatigue Real-time systems Vectors

来源：评论

学校读者我要写书评

暂无评论

Block-gram: Mining Knowledgeable Features for Smart Contract Vulnerability Detection 7th

Block-gram: Mining Knowledgeable Features for Smart Contrac...

引用

7th International Conference on Smart computing and Communication, SmartCom 2022

作者： Li, Tao Wang, Haolong Fang, Yaozheng Jian, Zhaolong Wang, Zichun Xie, Xueshuo Tianjin Key Laboratory of Network and Data Security Technology Tianjin China College of Computer Science Nankai University Tianjin China Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province Hangzhou China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031281235

Effective vulnerability detection of large-scale smart contracts is critical because smart contract attacks frequently bring about tremendous economic loss. However, code analysis requiring traversal paths and learning methods requiring many features training is too time-consuming to detect large-scale on-chain contracts. This paper focuses on improving detection efficiency by reducing the dimension of the features, combined with expert knowledge. We propose a feature extraction method Block-gram to form low-dimensional knowledgeable features from the bytecode. We first separate the metadata and convert the runtime code to opcode sequence, dividing the opcode sequence into segments according to some instructions (jump, etc.). Then, we mine extensible Block-gram features for learning-based model training, consisting of 4-dimensional block features and 8-dimensional attribute features. We evaluate these knowledge-based features using seven state-of-the-art learning algorithms to show that the average detection latency speeds up 25 to 650 times, compared with the features extracted by N-gram. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Reversible data Hiding in Encrypted Images Based on Multi-Predictor and Quad-tree Block Encoding 2022

Reversible Data Hiding in Encrypted Images Based on Multi-Pr...

引用

7th International Conference on Intelligent Information Technology, ICIIT 2022

作者： Zhang, Huiqi Li, Lin Li, Qingyan School Of Science Jimei University Xiamen361021 China Computer Engineering College Jimei University Xiamen361021 China Digital Fujian Big Data Modeling And Intelligent Computing Institute Jimei University Xiamen361021 China

ISBN: (纸本)9781450396172

With the rapid development of the Internet, people's awareness of privacy protection is also gradually improved. Reversible data hiding of encrypted image is a technique that encrypts the original image and allows the embedding of secret data without knowing the original image information. This method can accurately extract the secret data and reconstruct the original image completely. In this paper, a reversible data hiding algorithm of encrypted image based on multi-predictor and quad-tree block encoding is proposed. First, the original image is divided into 8×8 non-overlapping blocks. Then, multi-predictor is used to predict each block to get the prediction error image, then block scrambling is used to encrypt it. Since the pixel values of the encrypted image are small integer closes to zero, the quad-tree block encoding method can be used to embed a large amount of data. Experimental results show that the embedding rate of this method is better than that of some new algorithms. © 2022 ACM.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Unifying Multitrack Music Arrangement via Reconstruction Fine-Tuning and Efficient Tokenization

arXiv

引用

arXiv 2024年

作者： Ou, Longshen Zhao, Jingwei Wang, Ziyu Xia, Gus Wang, Ye Sound and Music Computing Lab School of Computing NUS Singapore Institute of Data Science NUS Singapore Integrative Sciences and Engineering Programme NUS Graduate School Singapore Music X Lab MBZUAI United Arab Emirates NYU Shanghai China

Automatic music arrangement streamlines the creation of musical variants for composers and arrangers, reducing reliance on extensive music expertise. However, existing methods suffer from inefficient tokenization, underutilization of pretrained music language models (LMs), and suboptimal fidelity and coherence in generated arrangements. This paper introduces an efficient multitrack music tokenizer for unconditional and conditional symbolic music generation, along with a unified sequence-to-sequence reconstruction fine-tuning objective for pre-trained music LMs that balances task-specific needs with coherence constraints. Our approach achieves state-of-the-art results on band arrangement, piano reduction, and drum arrangement, surpassing task-specific models in both objective metrics and perceptual quality. Additionally, we demonstrate that generative pretraining significantly contributes to the performance across these arrangement tasks, especially when handling long segments with complex alignment. Copyright © 2024, The Authors. All rights reserved.

关键词： Musical instruments

来源：评论

学校读者我要写书评

暂无评论

NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search

NeuVSA: A Unified and Efficient Accelerator for Neural Vecto...

引用

IEEE Symposium on High-Performance Computer Architecture

作者： Ziming Yuan Lei Dai Wen Li Jie Zhang Shengwen Liang Ying Wang Cheng Liu Huawei Li Xiaowei Li Jiafeng Guo Peng Wang Renhai Chen Gong Zhang State Key Lab of Processors Institute of Computing TechnologyCAS University of Chinese Academy of Sciences School of Computer and Information Technology Shanxi University School of Computer Science Peking University Zhongguancun National Laboratory Beijing Key Lab of Network Data Science and Technology Institute of Computing Technology CAS Huawei Technologies Co. Ltd. China

ISBN: (数字)9798331506476

ISBN: (纸本)9798331506483

Neural Vector Search (NVS) has exhibited superior search quality over traditional key-based strategies for information retrieval tasks. An effective NVS architecture requires high recall, low latency, and high throughput to enhance user experience and cost-efficiency. However, implementing NVS on existing neural network accelerators and vector search accelerators is sub-optimal due to the separation between the embedding stage and vector search stage at both algorithm and architecture levels. Fortunately, we unveil that Product Quantization (PQ) opens up an opportunity to break separation. However, existing PQ algorithms and accelerators still focus on either the embedding stage or the vector search stage, rather than both simultaneously. Simply combining existing solutions still follows the beaten track of separation and suffers from insufficient parallelization, frequent data access conflicts, and the absence of scheduling, thus failing to reach optimal recall, latency, and throughput. To this end, we propose a unified and efficient NVS accelerator dubbed NeuVSA based on algorithm and architecture co-design philosophy. Specifically, on the algorithm level, we propose a learned PQ-based unified NVS algorithm that consolidates two separate stages into the same computing and memory access paradigm. It integrates an end-to-end joint training strategy to learn the optimal codebook and index for enhanced recall and reduced PQ complexity, thus achieving smoother acceleration. On the architecture level, we customize a homogeneous NVS accelerator based on the unified NVS algorithm. Each sub-accelerator is optimized to exploit all parallelism exposed by unified NVS, incorporating a structured index assignment strategy and an elastic on-chip buffer to alleviate buffer conflicts for reduced latency. All sub-accelerators are coordinated using a hardware-aware scheduling strategy for boosted throughput. Experimental results show that the joint training strategy improves recall

关键词： Training Quantization (signal) Philosophical considerations Graphics processing units Computer architecture Throughput Vectors User experience System-on-chip Indexes

来源：评论

学校读者我要写书评

暂无评论

Attack-in-the-Chain: Bootstrapping Large Language Models for Attacks Against Black-Box Neural Ranking Models 39

Attack-in-the-Chain: Bootstrapping Large Language Models for...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Liu, Yu-An Zhang, Ruqing Guo, Jiafeng de Rijke, Maarten Fan, Yixing Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China University of Amsterdam Amsterdam Netherlands

ISBN: (纸本)157735897X

Neural ranking models (NRMs) have been shown to be highly effective in terms of retrieval performance. Unfortunately, they have also displayed a higher degree of sensitivity to attacks than previous generation models. To help expose and address this lack of robustness, we introduce a novel ranking attack framework named Attack-in-the-Chain, which tracks interactions between large language models (LLMs) and NRMs based on chain-of-thought (CoT) prompting to generate adversarial examples under black-box settings. Our approach starts by identifying anchor documents with higher ranking positions than the target document as nodes in the reasoning chain. We then dynamically assign the number of perturbation words to each node and prompt LLMs to execute attacks. Finally, we verify the attack performance of all nodes at each reasoning step and proceed to generate the next reasoning step. Empirical results on two web search benchmarks show the effectiveness of our method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：