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

31st International Conference on Computational Linguistics, COLING 2025

作者： Cheng, Jingwei Guo, Mingxiao Zhang, Fu School of Computer Science and Engineering Northeastern University China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University China

ISBN: (纸本)9798891761964

Multimodal Entity Alignment (MMEA) aims to identify equivalent entities across different multimodal knowledge graphs (MMKGs) by integrating structural information, entity attributes, and visual data, thereby promoting knowledge sharing and deep multimodal data integration. However, existing methods often overlook the deeper connections between multimodal data. They primarily focus on the interactions between neighboring entities in the structural modality while neglecting the interactions between entities in the visual and attribute modalities. To address this, we propose a structure-guided multimodal entity alignment method (SGMEA), which prioritizes structural information from knowledge graphs to enhance the visual and attribute modalities. By fusing multimodal representations, SGMEA improves the accuracy of entity alignment. Experimental results demonstrate that SGMEA achieves state-of-the-art performance across multiple datasets, validating its effectiveness and superiority in practical applications. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

CE-DA: Custom Embedding and Dynamic Aggregation for Zero-Shot Relation Extraction 31

CE-DA: Custom Embedding and Dynamic Aggregation for Zero-Sho...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhang, Fu Liu, He Li, Zehan Cheng, Jingwei School of Computer Science and Engineering Northeastern University China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University China

ISBN: (纸本)9798891761964

Zero-shot Relation Extraction (ZSRE) aims to predict novel relations from sentences with given entity pairs, where the relations have not been encountered during training. Prototype-based methods, which achieve ZSRE by aligning the sentence representation and the relation prototype representation, have shown great potential. However, most existing works focus solely on improving the quality of prototype representations, neglecting sentence representations, and lacking interaction between different types of relation side information. In this paper, we propose a novel ZSRE framework named CE-DA, which includes two modules: Custom Embedding and Dynamic Aggregation. We employ a two-stage approach to obtain customized embeddings of sentences. In the first stage, we train a sentence encoder through unsupervised contrastive learning, and in the second stage, we highlight the potential relations between entities in sentences using carefully designed entity emphasis prompts to further enhance sentence representations. Additionally, our dynamic aggregation method assigns different weights to different types of relation side information through a learnable network to enhance the quality of relation prototype representations. In contrast to traditional methods that treat the importance of all side information equally, our dynamic aggregation method further strengthens the interaction between different types of relation side information. Our method demonstrates competitive performance across various metrics on two ZSRE datasets. © 2025 Association for Computational Linguistics.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Re-Cent: A Relation-Centric Framework for Joint Zero-Shot Relation Triplet Extraction 31

Re-Cent: A Relation-Centric Framework for Joint Zero-Shot Re...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Li, Zehan Zhang, Fu Lyu, Kailun Cheng, Jingwei Peng, Tianyue School of Computer Science and Engineering Northeastern University China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University China

ISBN: (纸本)9798891761964

Zero-shot Relation Triplet Extraction (ZSRTE) aims to extract triplets from the context where the relation patterns are unseen during training. Due to the inherent challenges of the ZSRTE task, existing extractive ZSRTE methods often decompose it into named entity recognition and relation classification, which overlooks the interdependence of two tasks and may introduce error propagation. Motivated by the intuition that crucial entity attributes might be implicit in the relation labels, we propose a Relation-Centric joint ZSRTE method named Re-Cent. This approach uses minimal information, specifically unseen relation labels, to extract triplets in one go through a unified model. We develop two span-based extractors to identify the subjects and objects corresponding to relation labels, forming span-pairs. Additionally, we introduce a relation-based correction mechanism that further refines the triplets by calculating the relevance between span-pairs and relation labels. Experiments demonstrate that Re-Cent achieves state-of-the-art performance with fewer parameters and does not rely on synthetic data or manual labor. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Carbon dots-based dopamine sensors:Recent advances and challenges

引用

Chinese Chemical Letters 2024年第12期35卷 95-103页

作者： Chenghao Liu Xiaofeng Lin Jing Liao Min Yang Min Jiang Yue Huang Zhizhi Du Lina Chen Sanjun Fan Qitong Huang Key Laboratory of Prevention and Treatment of Cardiovascular and Cerebrovascular Diseases of Ministry of Education Key Laboratory of Biomaterials and Biofabrication in Tissue Engineering of Jiangxi ProvinceKey Laboratory of Biomedical Sensors of GanzhouSchool of Medical and Information EngineeringSchool of PharmacyScientific Research CenterGannan Medical UniversityGanzhou 341000China Department of Chemistry and Biochemistry The Ohio State UniversityColumbusOH 43210United States

Dopamine,a pivotal excitatory neurotransmitter,plays a crucial role in metabolic,cardiovascular,renal,central nervous,and endocrine *** dopamine within the human body can cause various ***,the precise quantification of dopamine levels,both in vivo and in vitro,holds paramount significance for clinical applications and physiological *** dots(CDs)exhibit a plethora of remarkable properties,including a substantial specific surface area,robust electrical conductivity,commendable biocompatibility,minimal toxicity,and high *** these unique characteristics,CDs demonstrate substantial potential for fluorescent sensors,colorimetric sensors,and electrochemical sensors for dopamine *** review systematically examined the challenges and prospects for the utilization of CDs-based fluorescent sensors,electrochemical biosensors,and colorimetric sensors for monitoring dopamine levels in recent *** findings unveil promising avenues for further advancements in the field of dopamine detection.

关键词： Dopamine Carbon dots Fluorescent sensors Colorimetric sensors Electrochemical sensors

来源：评论

学校读者我要写书评

暂无评论

On Isodual Double Toeplitz Codes

引用

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2,the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

来源：评论

学校读者我要写书评

暂无评论

Non-intrusive Load Monitoring Based Data-Free Incremental Electrical Appliance Identification 8th

Non-intrusive Load Monitoring Based Data-Free Incremental El...

引用

8th International Conference on Energy and Environmental Science, ICEES 2024

作者： Zhou, Rui Fang, Xiaohan The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electrical Engineering and Automation Anhui University Hefei230601 China

ISBN: (纸本)9783031639005

In the realm of modern energy management systems, Non-Intrusive Load Monitoring (NILM) technology provides an innovative solution for power suppliers. It allows for remote monitoring and analysis of users’ electricity consumption patterns without requiring direct access to each device. This technology works by collecting comprehensive energy data at the user’s meter entry point and using algorithms to differentiate and identify the energy consumption characteristics of each device. However, with the increasing number of smart devices used by residential and commercial users, traditional NILM methods face the challenge of dealing with more complex and diverse electricity usage patterns. To address these challenges, we propose a novel incremental NILM framework. This framework has the ability to independently learn new load categories without load data, which is crucial for adapting in real-time to the changing variety of load devices, while also effectively addressing user privacy concerns. We introduce a VI-SCRM for extracting V-I trajectory features, incorporating a reconstruction convolution module. This method reduces the redundancy of V-I trajectory features and eliminates insignificant features, thereby improving algorithm efficiency. Additionally, this approach streamlines the model training process and prevents the model from ‘forgetting’ previously acquired knowledge. By implementing this framework in NILM, the system can continually adjust to new types of devices. Our experimental results confirm the effectiveness of this approach and highlight its potential advantages in practical applications. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Object Detection in SAR images via Gaussian Flow Class-Balanced Differential Aggregation 2

Few-Shot Object Detection in SAR images via Gaussian Flow Cl...

引用

2nd IEEE International Conference on Signal, Information and Data Processing, ICSIDP 2024

作者： Zhao, Po Chen, Jie Zhang, Chaochen Ma, Ke Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electronics and Information Engineering Hefei230601 China

ISBN: (纸本)9798331515669

Currently, few-shot object detection (FSOD) methods for synthetic aperture radar (SAR) images are severely understudied. The high confidentiality and scarcity of SAR data, coupled with the susceptibility of targets in SAR images to significant changes in orientation, make existing models sensitive to variations in novel class examples. This sensitivity leads to challenges in extracting class prototypes and accurately estimating class centers for novel classes. To solve the above issues, we propose a few-shot object detection algorithm for SAR images via Gaussian Flow Class-Balanced Differential Aggregation. Specifically, we first design a class-balanced difference feature aggregation module to solve the problems of difficult class distribution estimation and inaccurate class center estimation of novel classes in SAR images. Second, the contextual information perception module is designed to extract the most representative support features into fine-grained prototypes and aggregate them with the query features using the matching paradigm to solve the imbalance between foreground targets and background in SAR images. Finally, experimental results on MSAR-AIR dataset indicate that our model realizes the best detection properties on SAR images compared to existing models. © 2024 IEEE.

关键词： few-shot learning object detection synthetic aperture radar variational feature learning

来源：评论

学校读者我要写书评

暂无评论

A Riemannian Exponential Augmented Lagrangian Method for computing the Projection Robust Wasserstein Distance 37

A Riemannian Exponential Augmented Lagrangian Method for Com...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Jiang, Bo Liu, Ya-Feng Ministry of Education Key Laboratory of NSLSCS School of Mathematical Sciences Nanjing Normal University Nanjing210023 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9781713899921

Projection robust Wasserstein (PRW) distance is recently proposed to efficiently mitigate the curse of dimensionality in the classical Wasserstein distance. In this paper, by equivalently reformulating the computation of the PRW distance as an optimization problem over the Cartesian product of the Stiefel manifold and the Euclidean space with additional nonlinear inequality constraints, we propose a Riemannian exponential augmented Lagrangian method (REALM) for solving this problem. Compared with the existing Riemannian exponential penalty-based approaches, REALM can potentially avoid too small penalty parameters and exhibit more stable numerical performance. To solve the subproblems in REALM efficiently, we design an inexact Riemannian Barzilai-Borwein method with Sinkhorn iteration (iRBBS), which selects the stepsizes adaptively rather than tuning the stepsizes in efforts as done in the existing methods. We show that iRBBS can return an Ε-stationary point of the original PRW distance problem within O(Ε-3) iterations, which matches the best known iteration complexity result. Extensive numerical results demonstrate that our proposed methods outperform the state-of-the-art solvers for computing the PRW distance. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Denoising Rationalization for Multi-hop Fact Verification via Multi-granular Explainer

Denoising Rationalization for Multi-hop Fact Verification vi...

引用

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

作者： Si, Jiasheng Zhu, Yingjie Lu, Wenpeng Zhou, Deyu China School of Computer Science and Engineering Southeast University China Ministry of Education China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing China

ISBN: (纸本)9798891761681

The success of deep learning models on multi-hop fact verification has prompted researchers to understand the behavior behind their veracity. One feasible way is erasure search: obtaining the rationale by entirely removing a subset of input without compromising verification accuracy. Despite extensive exploration, current rationalization methods struggle to discern nuanced composition within the correlated evidence, which inevitably leads to noise rationalization in multi-hop scenarios. To address this issue, this paper proposes the consistent multi-granular rationale extraction method, aiming to realize the denoising rationalization for multi-hop fact verification. Specifically, given a pretrained veracity prediction model, two independent external explainers are introduced and trained collaboratively to enhance the discriminating ability by imposing varied constraints. Meanwhile, three key properties (Fidelity, Consistency, Salience) are introduced to regularize the denoising and faithful rationalization process. Additionally, a new Noiselessness metric is proposed to measure the purity of the rationales. Experimental results on three multi-hop fact verification datasets show that the proposed approach outperforms 12 baselines. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Online Queue-Aware Service Migration and Resource Allocation in Mobile Edge computing

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8063-8078页

作者： Du, An Jia, Jie Chen, Jian Wang, Xingwei Huang, Ming Northeastern University School of Computer Science and Engineering Engineering Research Center of Security Technology of Complex Network System Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Northeastern University School of Computer Science and Engineering Shenyang110819 China

Mobile edge computing (MEC) integrated with Network Functions Virtualization (NFV) helps run a wide range of services implemented by Virtual Network Functions (VNFs) deployed at MEC networks. This emerging paradigm offers flexible edge resource management for Internet Service Providers (ISPs) and improves service satisfaction of diverse applications. However, a critical challenge lies in processing extremely unpredictable and bursty traffic flow, especially in event-trigger sensing tasks. In this paper, we study queue-aware service migration and resource allocation in an MEC network, where different devices with different arrival patterns request different network services. To this end, we first formulate a novel long-term operation cost minimization problem subject to the stability of multiple queues by adopting a simultaneous migration scheme and determining resource allocation dynamically. To address the problem efficiently, we propose an online control framework to make decisions without any prior system information. We first adopt the Lyapunov optimization technique to decompose the long-term optimization problem into multi-per-slot subproblems. Then, we adopt a decoupled optimization algorithm based on the coordinate descent method and augmented Lagrangian method to solve the offline mixed integer non-linear programming (MINLP) subproblems. Extensive results reveal that the proposed online optimization framework can efficiently balance queue stability and cost consumption. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：