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

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

ISBN: (纸本)9781954085527

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Nighttime traffic object detection via adaptively integrating event and frame domains

引用

Fundamental Research 2024年

作者： Jiang, Yu Wang, Yuehang Zhao, Minghao Zhang, Yongji Qi, Hong The College of Computer Science and Technology Jilin University Changchun 130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China The College of Earth Sciences Jilin University Changchun 130012 China

Intelligent perception is crucial in Intelligent Transportation Systems (ITS), with vision cameras as critical components. However, traditional RGB cameras exhibit a significant decline in performance when capturing nighttime traffic scenes, limiting their effectiveness in supporting ITS. In contrast, event cameras possess a high dynamic range (140 dB vs. 60 dB for traditional cameras), enabling them to overcome frame degradation in low-light conditions. Recently, multimodal learning paradigms have made substantial progress in various vision tasks, such as image-text retrieval. Motivated by this progress, we propose an adaptive selection and fusion detection method that leverages both event and RGB frame domains to optimize nighttime traffic object detection jointly. To address the challenge of unbalanced multimodal data fusion, we design a learnable adaptive selection and fusion module. This module performs feature ranking and fusion in the channel dimension, allowing efficient multimodal fusion. Additionally, we construct a novel multi-level feature pyramid network based on multimodal attention fusion. This network extracts potential features to enhance robustness in detecting nighttime traffic objects. Furthermore, we curate a dataset for nighttime traffic scenarios comprising RGB frames and corresponding event streams. Through experiments, we demonstrate that our proposed method outperforms current state-of-the-art techniques in event-based, frame-based, and event and frame fusion methods. This highlights the effectiveness of integrating the event and frame domains in enhancing nighttime traffic object detection. © 2023 The Authors

关键词： Event camera Intelligent transportation Multimodal learning Nighttime object detection

来源：评论

学校读者我要写书评

暂无评论

A Novel Local Search Algorithm Based on Connectivity Method and Vertex Penalty Mechanism for Minimum Weighted Connected Dominating Set Problem

SSRN

引用

SSRN 2024年

作者： Li, Ruizhi He, Jintao Yin, Minghao Hu, Shuli Ding, Nan Jilin University of Finance and Economics Changchun130117 China Northeast Normal University Changchun130117 China Business Big Data Research Center of Jilin Province Changchun130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

The minimum weighted connected dominating set problem is a classical NP-hard problem with wide applications in practice. In this paper, an efficient local search algorithm is proposed to solve this problem. In this algorithm, firstly, an initial solution construction method based on greedy randomized adaptive strategy is adopted, which can balance the quality and the diversity of the initial solutions. Second, two new scoring functions, Ascore and Cscore, are proposed to increase the diversity of deleted vertices. Third, a new connectivity method is proposed so that the algorithm no longer relies on the shortest path between two connected components. Fourth, a vertex penalty mechanism is introduced, which helps the algorithm to jump out of the local optimum effectively. Fifth, two scoring functions, Ascore and Cscore, are combined with the vertex penalty mechanism to propose an effective vertex selection method, which helps the algorithm to select suitable vertices to be added to or removed from the current candidate solution. Finally, the propsoed local search algorithm is compared with seven state-of-the-art algorithms on three types of benchmark instances. The experimental results show that the algorithm exhibits better performance on these three types of classical benchmark instances. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Tc-Sepm: Characterizing Soft Error Resilience of Cnns on Tensor Cores from Program and Microarchitecture Perspectives

SSRN

引用

SSRN 2023年

作者： Wei, Xiaohui Zhou, Changbao Yue, Hengshan Zhou, Joey Tianyi College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China Singapore138632 Singapore Singapore138632 Singapore

As an architectural CNN accelerator integrated into NVIDIA's GPUs, existing research mainly focus on improving the performance of Tensor Core. However, the highly integrated Tensor Cores are vulnerable to transient faults (i.e., soft errors), causing catastrophic consequences in safety-critical applications like automatic driving. Thus, it is imperative to estimate the reliability of CNNs on Tensor Cores. However, it is expensive to obtain a statistically significant resilience profile of CNNs on Tensor Cores with the existing fault injection(FI)-based reliability estimation methods. To this end, we build TC-SEPM to predict the error resilience of CNNs on Tensor Cores instead of FI methods. To ensure the accuracy of TC-SEPM, we first investigate resilience-related features from microarchitecture and program perspectives. Then, leveraging these heuristic features, we train machine learning models to learn the hidden relationship between error resilience and the investigated features, enabling us to predict the impact of soft errors in Tensor Cores on CNN output. Experimental results show that TC-SEPM achieves high accuracy for individual soft error resiliency prediction and overall program resilience estimation while its overhead is only 1/27 of FI methods. Additionally, TC-SEPM can provide valuable insights for programmers or architects to design more robust CNN models on Tensor Cores. © 2023, The Authors. All rights reserved.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

Traffic jam prediction based on analysis of residents spatial activities

Traffic jam prediction based on analysis of residents spatia...

引用

2020 International Conference on Computer Information and Big Data Applications, CIBDA 2020

作者： Lv, Zhijin Fu, Hao Tang, Wei Chen, Xiaoxu College of Software Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China

ISBN: (纸本)9781728198378

The prediction of urban traffic congestion has always been one of the important contents in the research of intelligent transportation systems. The difficulty in predicting urban traffic congestion is that urban traffic operation is essentially a collection of spatial activity planning for residents under certain conditions. The huge group of residents themselves has great complexity and uncertainty. Traditional neural networks mostly focus on road characteristic data and road condition data, and lack of in-depth exploration of the fundamental factors of traffic congestion for residents' travel. So we propose a traffic congestion prediction model based on the analysis of residents' spatial activities. Starting from the residents' activities, the simulation of urban traffic operation conditions can more realistically reflect the traffic congestion situation of the city at specific times and roads, and quickly generate model results. The experimental results show that the model analyzed by residents' spatial activities runs fast and has high prediction accuracy. The results are in line with the actual situation and have strong practical value. © 2020 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

COVID-19 knowledge Graph for Drug and Vaccine Development

COVID-19 Knowledge Graph for Drug and Vaccine Development

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Lan Huang Hongrui Guan Yanchun Liang Renchu Guan Xiaoyue Feng The Key Laboratory for Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China Zhuhai Sub Laboratory Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Zhuhai College of Science and Technology Zhuhai China

ISBN: (纸本)9781665429825

The worldwide spread of COVID-19 has made a severe impact on human health and life. It has shown rapid propagation, long in vitro survival, and a long incubation period. More seriously, COVID-19 is more susceptible to variation, as it is an RNA virus. Mutations of COVID-19 have been reported in multiple countries worldwide, which makes drug and vaccine development a significant challenge. To search for potential drugs and vaccines and reveal the atlas of COVID-19 evolution, we extract information from massive unstructured data and construct a COVID-19 knowledge graph using the COVID-19 data. Based on machine learning approaches, we infer and predict novel coronavirus pneumonia-related diseases, drug action targets, etc. to speculate on new and more effective treatment methods. In addition, to study transcriptome of SARS-CoV-2, new ideas can be provided to biomedical experts with flexible responses to viral variation. An in-depth analysis of the COVID-19 pathomechanism at the pharmaceutical, genetic, and protein levels provides effective means and tools for novel coronavirus pneumonia vaccines, drug development, and therapeutic program design.

关键词： COVID-19 Drugs Proteins Protein engineering Pulmonary diseases RNA Machine learning

来源：评论

学校读者我要写书评

暂无评论

Efficient and Privacy-Preserving Weighted Nearby-Fit Spatial keyword Query in Cloud

引用

IEEE Internet of Things Journal 2025年

作者： Sun, Lili Lu, Rongxing Zheng, Yandong Zhang, Yonggang Tao, Yi Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China University of New Brunswick Faculty of Computer Science FrederictonNBE3B 5A3 Canada Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Jilin University College of Software Changchun130012 China

In the modern digital landscape, integrating geographic locations and textual descriptions within a geo-textual dataset enhances location-based services (LBS) via spatial keyword queries, as these queries combine spatial and textual information to deliver more precise and personalized results. Additionally, the advent of cloud computing allows data owners to outsource data management and services to the cloud, boosting scalability but introducing efficiency challenges due to complex encryption. Although many schemes have been proposed for spatial keyword queries on encrypted geo-textual data, none supports matching a query keyword set with the keyword sets of multiple objects, a common query type in LBS. Imagine a user seeking to rent a house close to his/her workplace, with easy access to conveniences like supermarkets. By using nearby-fit spatial keyword queries, we can match the desired house with a house-type target object and its nearby amenities, offering more practical and flexible recommendations than traditional spatial keyword queries. Hence, in this paper, we introduce an efficient and privacy-preserving scheme called the Privacy-preserving Weighted Nearby-fit Spatial keyword (PWNSK) query scheme. First, we design a target-oriented spatial keyword (TOSK) tree for data organization and a TOSK tree based WNSK query algorithm for efficient pruning by simultaneously utilizing locations, keywords, and distances from nearby objects to target objects. For privacy, we develop several protocols, including one for polynomial coefficient re-encoding, based on polynomial coefficient encoding and fully homomorphic encryption. Building on these protocols, we introduce our PWNSK scheme. A thorough security analysis confirms its robustness, while extensive experiments also showcase its effectiveness. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Learning Generalizable Agents via Saliency-Guided Features Decorrelation

arXiv

引用

arXiv 2023年

作者： Huang, Sili Sun, Yanchao Hu, Jifeng Guo, Siyuan Chen, Hechang Chang, Yi Sun, Lichao Yang, Bo Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education China School of Artificial Intelligence Jilin University China Department of Computer Science University of Maryland College Park United States Lehigh University BethlehemPA United States

In visual-based Reinforcement Learning (RL), agents often struggle to generalize well to environmental variations in the state space that were not observed during training. The variations can arise in both task-irrelevant features, such as background noise, and task-relevant features, such as robot configurations, that are related to the optimal decisions. To achieve generalization in both situations, agents are required to accurately understand the impact of changed features on the decisions, i.e., establishing the true associations between changed features and decisions in the policy model. However, due to the inherent correlations among features in the state space, the associations between features and decisions become entangled, making it difficult for the policy to distinguish them. To this end, we propose Saliency-Guided Features Decorrelation (SGFD) to eliminate these correlations through sample reweighting. Concretely, SGFD consists of two core techniques: Random Fourier Functions (RFF) and the saliency map. RFF is utilized to estimate the complex non-linear correlations in high-dimensional images, while the saliency map is designed to identify the changed features. Under the guidance of the saliency map, SGFD employs sample reweighting to minimize the estimated correlations related to changed features, thereby achieving decorrelation in visual RL tasks. Our experimental results demonstrate that SGFD can generalize well on a wide range of test environments and significantly outperforms state-of-the-art methods in handling both task-irrelevant variations and task-relevant variations. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Multi-objective Optimization Approach for Secure Communications Based on Collaborative Beamforming in UAV Networks

A Multi-objective Optimization Approach for Secure Communica...

引用

IEEE Conference on Wireless Communications and Networking

作者： Xinrong Guo Fang Mei Geng Sun Tingting Zheng College of Software Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Electrical and Computer Engineering University of Waterloo Waterloo Canada

With the rapid development of wireless communication, unmanned aerial vehicle (UAV) networks have received extensive attention and been applied in many fields, but some challenges exist in their applications, such as the issue of security when implementing communication. In this paper, a virtual antenna array (VAA) is formed in multiple UAV units using collaborative beamforming (CB) technology. Under the interference of multiple eavesdroppers, secure communication with the ground base station (BS) is achieved. To achieve better performance, we formulate a multi-objective optimization problem for UAV network security communication (SCMOP), and jointly optimize the positions and excitation current weights of UAVs to set the null values in the direction of known eavesdroppers, reduce the sidelobe levels (SLLs) and enhance the directivity of the main lobe (ML). Since the formulated SCMOP is an NP-hard problem, we propose an improved the third non-dominated sorting genetic algorithm (IMNSGA-III) with chaos operator and crossover and mutation operators to solve the problem in this paper. The simulation results show that the IMNSGA-III can solve the SCMOP well and obtain the best results compared with other benchmark algorithms.

关键词： Chaos Wireless communication Array signal processing Null value Collaboration Autonomous aerial vehicles Statistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：