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

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

Optimizing Human Pose Estimation Through Focused Human and Joint Regions

学校读者我要写书评

暂无评论

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

UAV-assisted Joint Mobile Edge Computing and Data Collection via Matching-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wang, Boxiong Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Niyato, Dusit 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 Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) and data collection (DC) have been popular research issues. Different from existing works that consider MEC and DC scenarios separately, this paper investigates a multi-UAV-assisted joint MEC-DC system. Specifically, we formulate a joint optimization problem to minimize the MEC latency and maximize the collected data volume. This problem can be classified as a non-convex mixed integer programming problem that exhibits long-term optimization and dynamics. Thus, we propose a deep reinforcement learning-based approach that jointly optimizes the UAV movement, user transmit power, and user association in real time to solve the problem efficiently. Specifically, we reformulate the optimization problem into an action space-reduced Markov decision process (MDP) and optimize the user association by using a two-phase matching-based association (TMA) strategy. Subsequently, we propose a soft actor-critic (SAC)-based approach that integrates the proposed TMA strategy (SAC-TMA) to solve the formulated joint optimization problem collaboratively. Simulation results demonstrate that the proposed SAC-TMA is able to coordinate the two subsystems and can effectively reduce the system latency and improve the data collection volume compared with other benchmark algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

Shortcut Learning in In-Context Learning: A Survey

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Song, Rui Li, Yingji Shi, Lida Giunchiglia, Fausto Xu, Hao College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Information Engineering and Computer Science University of Trento Italy

Shortcut learning refers to the phenomenon where models employ simple, non-robust decision rules in practical tasks, which hinders their generalization and robustness. With the rapid development of Large Language Models (LLMs) in recent years, an increasing number of studies have shown the impact of shortcut learning on LLMs. This paper provides a novel perspective to review relevant research on shortcut learning in In-Context Learning (ICL). It conducts a detailed exploration of the types of shortcuts in ICL tasks, their causes, available benchmarks, and strategies for mitigating shortcuts. Based on the corresponding observations, we summarize the unresolved issues in existing research and attempts to outline the future research landscape of shortcut learning. © 2024, CC BY.

关键词： Contrastive Learning

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

A Lightweight Api Recommendation Method for App Development Based on Multi-Objective Evolutionary Algorithm

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Li, Xun Liu, Lei Liu, Yuzhou Liu, Huaxiao College of Computer Science and Technology Jilin University Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun Jilin University Jilin130012 China

Context: API is important in daily programming activities during app development, but finding appropriate APIs is time-consuming for developers. To simplify this process, many researchers pay attention to overcoming the task-API knowledge gap using semantic information mined from the large-scale dataset for API recommendation. However, only semantic information is not enough since API descriptions and developer's query may not share similar words, meanwhile, large-scale data mining brings huge time cost and causes knowledge fixed problem (i.e. data cannot be timely updated). This limits the efficiency of existing API commendation methods. Objective: In this work, we aim at proposing a lightweight API recommendation method for app development based on the data in app store. Method: We model API recommendation as a multi-objective optimization problem by considering both structural and semantic information of API, and use the genetic algorithm to gain optimal solutions for overcoming limitations of the small-scale dataset. Specially, we collect APK files of related apps and API descriptions to establish a lightweight dataset, and extract the structural and semantic information of API from them with graph embedding and NLP techniques respectively. Then, we get the recommended APIs satisfying structural and semantic objectives according to the developers’ target functionality with a genetic algorithm. Finally, we give the interpretation of our recommendation information to help developers understand the results easily. Results and Conclusion: We conduct a series of experiments based on apps in Google Play and Q&As in Stack Overflow. The results show that Precision@N of our recommendation can be up to 0.89, MAP@N is up to 0.50, and MRR reaches 0.69, and our method achieves such good performance only utilizing less than 1/19 of the project number of our compared machine learning method. Besides, we conduct a survey and most of the participants confirm the understandabilit

关键词： Multiobjective optimization

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

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

SpatioTemporal Learning for Human Pose Estimation in Sparsely-Labeled Videos

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Jiao, Yingying Wang, Zhigang Wu, Sifan Fan, Shaojing Liu, Zhenguang Xu, Zhuoyue Wu, Zheqi 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 School of Computing National University of Singapore Singapore The State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China

Human pose estimation in videos remains a challenge, largely due to the reliance on extensive manual annotation of large datasets, which is expensive and labor-intensive. Furthermore, existing approaches often struggle to capture long-range temporal dependencies and overlook the complementary relationship between temporal pose heatmaps and visual features. To address these limitations, we introduce STDPose, a novel framework that enhances human pose estimation by learning spatiotemporal dynamics in sparsely-labeled videos. STDPose incorporates two key innovations: 1) A novel Dynamic-Aware Mask to capture long-range motion context, allowing for a nuanced understanding of pose changes. 2) A system for encoding and aggregating spatiotemporal representations and motion dynamics to effectively model spatiotemporal relationships, improving the accuracy and robustness of pose estimation. STDPose establishes a new performance benchmark for both video pose propagation (i.e., propagating pose annotations from labeled frames to unlabeled frames) and pose estimation tasks, across three large-scale evaluation datasets. Additionally, utilizing pseudo-labels generated by pose propagation, STDPose achieves competitive performance with only 26.7% labeled data. Copyright © 2025, The Authors. All rights reserved.

关键词： Large datasets