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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Vector Quantization: A Case Study on Robust Medical Semantic Segmentation

SSRN

引用

SSRN 2024年

作者： Lang, Yijun Liu, Pingping Zhao, Hongwei Zhou, Qiuzhan College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Mechanical Science and Engineering Jilin University Changchun130025 China College of Communication Engineering Jilin University Changchun130022 China

Pixel-wise medical image segmentation is essential for accurate disease diagnosis and analysis. Although these models exhibit high accuracy and impressive performance, they often face issues of trustworthiness due to their sensitivity to minor perturbations in the original images, which can cause significant deviations in segmentation tasks. To address these challenges, we focus on enhancing both the accuracy and the robustness of these systems against adversarial perturbations. We introduce a robust projection-head that utilizes a non-parametric method, Vector Quantization Momentum (VQM), to increase the hypothesis margin in the input space and reduce disturbances in the feature space. Additionally, we propose a new loss function, Anchor-based Vector Quantization (AVQ), designed to achieve denser pixel-prototype embedding. Our evaluation, using two white-box adversarial attack algorithms across two datasets, demonstrates a defense improvement of up to 1..46%. © 2024, The Authors. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Data-Efficient CLIP-Powered Dual-Branch Networks for Source-Free Unsupervised Domain Adaptation

arXiv

引用

arXiv 2024年

作者： Li, Yongguang Cao, Yueqi Li, Jindong Wang, Qi Wang, Shengsheng College of Software Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Artificial Intelligence Jilin University Changchun130012 China Engineering Research Center of Knowledge-Driven Human-Machine Intelligence Ministry of Education Jilin University Changchun130012 China

Source-free Unsupervised Domain Adaptation (SF-UDA) aims to transfer a model’s performance from a labeled source domain to an unlabeled target domain without direct access to source samples, addressing critical data privacy concerns. However, most existing SF-UDA approaches assume the availability of abundant source domain samples, which is often impractical due to the high cost of data annotation. To address the dual challenges of limited source data and privacy concerns, we introduce a data-efficient, CLIP-powered dual-branch network (CDBN). This architecture consists of a cross-domain feature transfer branch and a target-specific feature learning branch, leveraging high-confidence target domain samples to transfer text features of source domain categories while learning target-specific soft prompts. By fusing the outputs of both branches, our approach not only effectively transfers source domain category semantic information to the target domain but also reduces the negative impacts of noise and domain gaps during target training. Furthermore, we propose an unsupervised optimization strategy driven by accurate classification and diversity, preserving the classification capability learned from the source domain while generating more confident and diverse predictions in the target domain. CDBN achieves near state-of-the-art performance with far fewer source domain samples than existing methods across 31.transfer tasks on seven datasets. © 2024, CC BY.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Clustering Based Collaborative Filtering Algorithm for Time-Aware POI Recommendation 3

A Fuzzy Clustering Based Collaborative Filtering Algorithm f...

引用

2020 3rd International Conference on Modeling, Simulation and Optimization Technologies and Applications, MSOTA 2020

作者： Yin, Minghao Liu, Yanheng Zhou, Xu Sun, Geng College of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China Center for Computer Fundamental Education Jilin University Changchun Jilin China

Location based social network develops and gets widely concern along with the population and widespread use of mobile. Point of interest(POI) recommendation become one of the most widely application among location-based service. To get better POI recommendation performance, a fuzzy clustering based collaborative filtering algorithm (FCCF) for time-Aware POI recommendation is proposed in this paper. It first constructs the user feature vector from users' check-in behaviours. Individual's check-in behaviour can be under the influence of location region and time slots, so user's feature consists of two parts. One is the vising frequency of each user in different location regions, and the other is the vising frequency of each user in different time slots. Next fuzzy c-means is adopted due to its simplicity to group users according to user feature vector. Then the user similarity computation can be limited in the similar small user groups. In the end, a collaborative filtering algorithm is applied to recommend a number of top-N POIs at a given time for the target user. Some experiments are conducted and the comparative results on Foursquare and Gowalla show that FCCF has higher precision and recall value than the comparative algorithms. © Published under licence by IOP Publishing Ltd.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

2D-3D Feature Co-Embedding Network with Sparse Annotation for 3D Medical Image Segmentation

2D-3D Feature Co-Embedding Network with Sparse Annotation fo...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Mingzhu Zhu Shuyu Guo Ziwei Wang Jianhang Jiao Tian Bai 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 Software Jilin University Changchun China Department of Orthopedics The Second Norman Bethune Hospital of Jilin University Changchun China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Supervised methods on 3D medical image segmentation need large amounts of annotated data, but annotating is time-consuming. Also, existing 3D segmentation methods capture more global structural information but overlook local detailed features, which negatively impacts the segmentation of small tissues. In this paper, we propose a novel weakly-supervised 2D-3D Feature Co-Embedding Network (2D-3D CoENet) that includes 2D and 3D encoding layers, simultaneously extracting 2D local detailed and 3D global structural features. To reduce annotation costs, we use fewer labeled slices as ground truth and pseudo-labels are generated by 2D-3D CoENet for other slices. Additionally, multi-view learning is introduced to capture more 2D local detailed information, and a Multi-view Semantic Consistency loss (MSC loss) is proposed to constrain features from multiple perspectives. To further enhance the local detailed texture features, we propose an Edge Enhancement Module (EEM) in the 3D segmentation network to enhance the edge detail features. Our experimental results on the SKI1. dataset and OAI ZIB dataset demonstrate that our method outperforms the SOTA weakly-supervised segmentation methods. Moreover, our approach achieves results that are comparable to the fully-supervised upper bound results.

关键词： Image segmentation Three-dimensional displays Costs Upper bound Annotations Image edge detection Semantics Feature extraction Encoding Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Elucidating Spatial Complex Structures from Mass Spectrometry Imaging with Deep Multimodal Model 1

Elucidating Spatial Complex Structures from Mass Spectrometr...

引用

1.t IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Cui, Jiangnan Xia, Junjie Li, Xuan Wang, Yan Qiu, Fufang Xu, Yaochen Xu, Keren Zuo, Chunman School of Computer Science and Technology Institute of Artificial Intelligence Donghua University Shanghai China College of Computer Science and Technology Jilin University Changchun China Huashan Hospital Department of Neurosurgery Shanghai China Shanghai Institute of Biochemistry and Cell Biology Center for Excellence in Molecular Cell Science Chinese Academy of Sciences Cas Key Laboratory of Systems Biology Shanghai China Institute of Artificial Intelligence Donghua University Shanghai China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

ISBN: (纸本)9798350358780

Spatial mass spectrometry imaging (SMSI) technology has enabled the characterization of biomolecule patterns within the tissue microenvironment, yet its analyses suffer from substantial noise. The lack of effective methods for exploiting multi-view features (e.g., spatial location) has hindered their elucidation ability for tissue heterogeneity. Here, we propose MSG, a multimodal modal that integrates histology, spatial location, and MSI data, in deciphering tissue structure by graph neural network. Specifically, MSG learns low-dimensional representations by aggregating histomorphological features from neighboring tiles via graph attention autoencoder. MSG outperforms other methods in identifying spatial domains and denoising data. The subsequent domain-guided differential expression analysis of the denoised data enables the identification of ions with significantly enriched patterns within the recognized domains. MSG exhibits its versatility in handling SMSI data from various platforms. © 2023 IEEE.

关键词： Data integration

来源：评论

学校读者我要写书评

暂无评论

CMRM: Collaborative Multi-agent Reinforcement Learning for Multi-objective Traffic Signal Control

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Nie, Lei Qi, Dandan Liu, Bingyi Li, Peng Bao, Haizhou He, Heng Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430065 China Wuhan University of Technology School of Computer Science and Artificial Intelligence Wuhan430070 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China

Efficient traffic signal control is a cost-effective way to ease urban traffic congestion. Multi-agent reinforcement learning (MARL) has become a widely adopted method for optimizing traffic signal control (TSC). However, existing MARL-based methods often focus on a single optimization objective, lacking a comprehensive consideration of traffic efficiency, environmental pollution, and traffic safety. Simultaneously, these methods often fail to effectively capture the dynamic and complex interactions among agents in multi-intersection scenarios, which negatively impacts traffic efficiency. In this article, we propose a collaborative MARL-based method for multi-objective TSC, called CMRM. First, we introduce a multi-objective reward mechanism that integrates traffic efficiency, environmental impact, and safety to guide agents toward more comprehensive optimization. Second, we design a cooperation enhancement module (CEM) based on the graph attention mechanism to dynamically capture neighboring agents’ state information. This mitigates the partial observability problem in independent proximal policy optimization (IPPO) and enhances the model’s ability to capture dynamic and complex interactions among agents. Finally, we assess the performance of the proposed CMRM method using SUMO on two real traffic networks. Experimental results demonstrate that our method significantly improves traffic efficiency while reducing environmental pollution and enhancing traffic safety, compared to the best performing baseline, our method reduces CO2 emission by approximately 1..53% and 9.57%, and lowers vehicle collision risks by 44.39% and 42.85% in two different traffic networks. © 1.75-201. IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：