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

1st 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

来源：评论

学校读者我要写书评

暂无评论

Low-altitude Friendly-Jamming for Satellite-Maritime Communications via Generative AI-enabled Deep Reinforcement Learning

arXiv

引用

arXiv 2025年

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Niyato, Dusit Leung, Victor C.M. 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 College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

Low Earth Orbit (LEO) satellites can be used to assist maritime wireless communications for data transmission across wide-ranging areas. However, extensive coverage of LEO satellites, combined with openness of channels, can cause the communication process to suffer from security risks. This paper presents a low-altitude friendly-jamming LEO satellite-maritime communication system enabled by a unmanned aerial vehicle (UAV) to ensure data security at the physical layer. Since such a system requires trade-off policies that balance the secrecy rate and energy consumption of the UAV to meet evolving scenario demands, we formulate a secure satellite-maritime communication multi-objective optimization problem (SSMCMOP). In order to solve the dynamic and long-term optimization problem, we reformulate it into a Markov decision process. We then propose a transformer-enhanced soft actor critic (TransSAC) algorithm, which is a generative artificial intelligence-enable deep reinforcement learning approach to solve the reformulated problem, so that capturing global dependencies and diversely exploring weights. Simulation results demonstrate that the TransSAC outperforms various baselines, and achieves an optimal secrecy rate while effectively minimizing the energy consumption of the UAV. Moreover, the results find more suitable constraint values for the system. Copyright © 2025, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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 14.46%. © 2024, The Authors. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

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 17.53% and 9.57%, and lowers vehicle collision risks by 44.39% and 42.85% in two different traffic networks. © 1975-2011 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Unknown Task Selection and Worker Recruitment Using Two-Stage Multi-Armed Bandit in Crowdsensing

引用

IEEE Internet of Things Journal 2025年

作者： Song, Haoyuan Li, Peng Du, Rui Yu, Hai Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin 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 Hubei Polytechnic University School of Computer Huangshi435003 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Wuhan University School of Cyber Science and Engineering Wuhan430072 China

Mobile Crowdsensing (MCS) faces significant challenges in selecting tasks with expected high revenue and recruiting workers with expected high qualities to maximize overall utility. Existing approaches often assume the revenue of posting tasks or the quality of workers is determined, which limits their practical applicability. This paper tackles these challenges by modeling the long-term multi-task, multi-worker selection problem as a Two-Stage Multi-Armed Bandit (TS-MAB) problem under uncertainty. In each round, the MCS platform selects a long-term task from a pool and recruits the necessary workers, determining payments accordingly. We model the task selection phase as a MAB problem, and the worker recruitment phase, influenced by the task selection, as a Combinatorial MAB (CMAB) problem. We propose an extended Upper Confidence Bound (UCB)-based strategy and develop an incentive mechanism based on Auction theory, combined with TS-MAB (i.e., ATS-MAB), for unknown task selection and worker recruitment. Our mechanism theoretically guarantees truthfulness and individual rationality, with a theoretical analysis of its regret bounds. Furthermore, we introduce an adaptive incentive mechanism called AATS-MAB, which improves worker recruitment and quality updates, achieving higher total sensing quality and lower regret. Extensive simulations demonstrate the effectiveness and scalability of the proposed methods. © 2014 IEEE.

关键词： Personnel selection

来源：评论

学校读者我要写书评

暂无评论

Optimizing Human Pose Estimation Through Focused Human and Joint Regions

arXiv

引用

arXiv 2025年

作者： Jiao, Yingying Wang, Zhigang Liu, Zhenguang Fan, Shaojing Wu, Sifan Wu, Zheqi Xu, Zhuoyue College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Zhejiang Gongshang University China The State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China School of Computing National University of Singapore Singapore

Human pose estimation has given rise to a broad spectrum of novel and compelling applications, including action recognition, sports analysis, as well as surveillance. However, accurate video pose estimation remains an open challenge. One aspect that has been overlooked so far is that existing methods learn motion clues from all pixels rather than focusing on the target human body, making them easily misled and disrupted by unimportant information such as background changes or movements of other people. Additionally, while the current Transformer-based pose estimation methods has demonstrated impressive performance with global modeling, they struggle with local context perception and precise positional identification. In this paper, we try to tackle these challenges from three aspects: (1) We propose a bilayer Human-keypoint Mask module that performs coarse-to-fine visual token refinement, which gradually zooms in on the target human body and keypoints while masking out unimportant figure regions. (2) We further introduce a novel deformable cross attention mechanism and a bidirectional separation strategy to adaptively aggregate spatial and temporal motion clues from constrained surrounding contexts. (3) We mathematically formulate the deformable cross attention, constraining that the model focuses solely on the regions centered at the target person body. Empirically, our method achieves state-of-the-art performance on three large-scale benchmark datasets. A remarkable highlight is that our method achieves an 84.8 mean Average Precision (mAP) on the challenging wrist joint, which significantly outperforms the 81.5 mAP achieved by the current state-of-the-art method on the PoseTrack2017 dataset. Copyright © 2025, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CCDD: A Tractable Representation for Model Counting and Uniform Sampling

arXiv

引用

arXiv 2022年

作者： Lai, Yong Meel, Kuldeep S. Yap, Roland H.C. Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Computing National University of Singapore Singapore119077 Singapore

knowledge compilation concerns with the compilation of representation languages to target languages supporting a wide range of tractable operations arising from diverse areas of computer science. Tractable target compilation languages are usually achieved by restrictions on the internal nodes (∧ or ∨) of the NNF. In this paper, we propose a new representation language CCDD, which introduces new restrictions on conjunction nodes to capture equivalent literals. We show that CCDD supports two key queries, model counting and uniform samping, in polytime. We present algorithms and a compiler to compile propositional formulas expressed in CNF into CCDD. Experiments over a large set of benchmarks show that our compilation times are better with smaller representations than state-of-art Decision-DNNF, SDD and OBDD[∧] compilers. We apply our techniques to model counting and uniform sampling, and develop model counter and uniform sampler on CNF. Our empirical evaluation demonstrates the following significant improvements: our model counter can solve 885 instances while the prior state of the art solved only 843 instances, representing an improvement of 43 instances;and our uniform sampler can solve 780 instances while the prior state of the art solved only 648 instances, representing an improvement of 132 instances. Copyright © 2022, The Authors. All rights reserved.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：