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

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

来源：评论

学校读者我要写书评

暂无评论

Hybrid features and semantic reinforcement network for image forgery detection

Hybrid features and semantic reinforcement network for image...

引用

作者： Chen, Haipeng Chang, Chaoqun Shi, Zenan Lyu, Yingda College of Computer Science and Technology Jilin University Changchun130012 China College of Software Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Public Computer Education and Research Center Jilin University Changchun130012 China

Image forgery detection focuses more on tampering regions than image content of semantic segmentation, it is revealed that wealthier features need to be learned. Moreover, insufficient semantic information causes low efficiency of forgery detection. To address these issues, we propose a hybrid features and semantic reinforcement network (HFSRNet) for image forgery detection, which is an encoding and decoding based network. Specifically, long-short term memory with resampling features has been applied to capture traces from the image patches for finding manipulating artifacts. Consolidated features extracted from rotating residual units are further leveraged to amplify the discrepancy between un-tampered and tampered regions. We then hybridize features from them through a concatenation to further incorporate spatial co-occurrence of these two modalities. In addition, for achieving the semantic consistency between two same level features associated by across layers, semantic reinforcement is implemented on the decoding stage. HFSRNet is an end-to-end architecture that handles multiple types of image forgery including copy-move, splicing, removal. Experiments on three standard image manipulation datasets (NIST16, COVERAGE and CASIA) demonstrate that HFSRNet obtains state-of-the-art performance compared to existing models and baselines. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Interference-Aware Opportunistic Job Placement for Shared Distributed Deep Learning Clusters

SSRN

引用

SSRN 2023年

作者： Li, Hongliang Zhao, Hairui Sun, Ting Li, Xiang Xu, Haixiao Li, Keqin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education Changchun China High Performance Computing Center Jilin University Changchun China Department of Computer Science State University of New York New PaltzNY12561 United States

Distributed deep learning frameworks facilitate large deep learning workloads. These frameworks support sharing one GPU device among multiple jobs to improve resource utilization. Modern deep learning training jobs consume a large amount of GPU memory. Despite that, sharing GPU memory among jobs is still possible because a training job has iterative steps that its memory usage fluctuates over time. However, resource sharing also introduces the risk of job performance degradation. Colocated jobs sharing a GPU device may suffer from different levels of interference, mainly caused by memory oversharing. How to improve resource utilization while maintaining good job performance is a novel challenge for job placement strategies. This paper studies the job placement problem. We propose an opportunistic memory sharing model to describe the time-varying job memory requirements. Based on this model, we introduce an Opportunistic Job Placement Problem (OJPP) for shared GPU clusters that seek job placement configurations using a minimum number of GPU devices and guarantee user-defined performance requirements at the same time. We propose a greedy algorithm and a heuristic algorithm with computational complexities of O(n log n) and O(n2 log n), respectively, to solve the problem. We also propose an online adjustment algorithm with the computational complexity of O(n log n) to perform updates to job placement configurations in runtime. A machine-learning-based interference prediction method is used to prepare accurate interference estimations. Extensive experiments are conducted on a GPU cluster to verify the correctness and effectiveness of our algorithms. Compared with standalone training jobs on dedicated clusters, the proposed approach reduces resource consumption by 46% in a shared cluster, while guaranteeing over 92.97% of the job performance, in terms of average job completion time. © 2023, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

UAV-enabled Wireless Powered Communication Networks: A Joint Scheduling and Trajectory Optimization Approach

UAV-enabled Wireless Powered Communication Networks: A Joint...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Ziwen An Yanheng Liu Geng Sun Hongyang Pan Aimin Wang 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

ISBN: (数字)9781665497923

ISBN: (纸本)9781665497930

Unmanned aerial vehicle (UAV)-enabled wireless powered communication networks (WPCN) are promising technologies in Internet of Things (IoTs). However, energy-constrained devices and connectivity in complex environments are two major challenges for IoTs. We consider a UAV-enabled WPCN scenario that a UAV can connect with the ground IoT devices (IoTDs). To connect and fly faster, UAV needs to be scheduled reasonably and the corresponding trajectory should be optimized. Thus, we formulate a UAV scheduling and trajectory optimization problem (USTOP) to minimize the total time so that improving the charging and transmission efficiency. Since conventional methods are difficult to solve USTOP, we propose an improved simulated annealing (ISA) with the variable size changing mechanism, the conflict resolution mechanism and the hybrid evolution method to solve it. Simulation results verify the effectiveness and performance of ISA under different scales of the network, and the stability of the proposed algorithm is verified.

关键词： Wireless communication Computers Annealing Simulation Simulated annealing Autonomous aerial vehicles Stability analysis

来源：评论

学校读者我要写书评

暂无评论

Multifaceted User Modeling in Recommendation: A Federated Foundation Models Approach

arXiv

引用

arXiv 2024年

作者： Zhang, Chunxu Long, Guodong Guo, Hongkuan Liu, Zhaojie Zhou, Guorui Zhang, Zijian Liu, Yang Yang, Bo College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Australia Kuaishou Technology China Institute for AI Industry Research Tsinghua University China

Multifaceted user modeling aims to uncover fine-grained patterns and learn representations from user data, revealing their diverse interests and characteristics, such as profile, preference, and personality. Recent studies on foundation model-based recommendation have emphasized the Transformer architecture's remarkable ability to capture complex, non-linear user-item interaction relationships. This paper aims to advance foundation model-based recommendersystems by introducing enhancements to multifaceted user modeling capabilities. We propose a novel Transformer layer designed specifically for recommendation, using the self-attention mechanism to capture sequential user-item interaction patterns. Specifically, we design a group gating network to identify user groups, enabling hierarchical discovery across different layers, thereby capturing the multifaceted nature of user interests through multiple Transformer layers. Furthermore, to broaden the data scope and further enhance multifaceted user modeling, we extend the framework to a federated setting, enabling the use of private datasets while ensuring privacy. Experimental validations on benchmark datasets demonstrate the superior performance of our proposed method. Code is available. Copyright © 2024, The Authors. All rights reserved.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

TC-GAT: Graph Attention Network for Temporal Causality Discovery

TC-GAT: Graph Attention Network for Temporal Causality Disco...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaosong Yuan Ke Chen Wanli Zuo Yijia Zhang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering MOE Changchun China *** Inc Beijing China College of Electronic Countermeasures National University of Defense Technology Hefei China

The present study explores the intricacies of causal relationship extraction, a vital component in the pursuit of causality knowledge. Causality is frequently intertwined with temporal elements, as the progression from cause to effect is not instantaneous but rather ensconced in a temporal dimension. Thus, the extraction of temporal causality holds paramount significance in the field. In light of this, we propose a method for extracting causality from the text that integrates both temporal and causal relations, with a particular focus on the time aspect. To this end, we first compile a dataset that encompasses temporal relationships. Subsequently, we present a novel model, TC-GAT, which employs a graph attention mechanism to assign weights to the temporal relationships and leverages a causal knowledge graph to determine the adjacency matrix. Additionally, we implement an equilibrium mechanism to regulate the interplay between temporal and causal relations. Our experiments demonstrate that our proposed method significantly surpasses baseline models in the task of causality extraction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

UAV Swarm-enabled Collaborative Post-disaster Communications in Low Altitude Economy via a Two-stage Optimization Approach

arXiv

引用

arXiv 2025年

作者： Zheng, Xiaoya Sun, Geng Li, Jiahui Wang, Jiacheng Wu, Qingqing Niyato, Dusit Jamalipour, Abbas College of Computer Science d 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 ta Science Nanyang Technological University 639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China School of Electrical and Computer Engiering The University of Sydney SydneyNSW2006 Australia

The low-altitude economy (LAE), as a new economic paradigm, plays an indispensable role in cargo transportation, healthcare, infrastructure inspection, and especially post-disaster communication. Specifically, unmanned aerial vehicles (UAVs), as one of the core technologies of the LAE, can be deployed to provide communication coverage, facilitate data collection, and relay data for trapped users, thereby significantly enhancing the efficiency of post-disaster response efforts. However, conventional UAV self-organizing networks exhibit low reliability in long-range cases due to their limited onboard energy and transmit ability. Therefore, in this paper, we design an efficient and robust UAV-swarm enabled collaborative self-organizing network to facilitate post-disaster communications. Specifically, a ground device transmits data to UAV swarms, which then use collaborative beamforming (CB) technique to form virtual antenna arrays and relay the data to a remote access point (AP) efficiently. Then, we formulate a rescue-oriented post-disaster transmission rate maximization optimization problem (RPTRMOP), aimed at maximizing the transmission rate of the whole network. Given the challenges of solving the formulated RPTRMOP by using traditional algorithms, we propose a two-stage optimization approach to address it. In the first stage, the optimal traffic routing and the theoretical upper bound on the transmission rate of the network are derived. In the second stage, we transform the formulated RPTRMOP into a variant named V-RPTRMOP based on the obtained optimal traffic routing, aimed at rendering the actual transmission rate closely approaches its theoretical upper bound by optimizing the excitation current weight and the placement of each participating UAV via a diffusion model-enabled particle swarm optimization (DM-PSO) algorithm. Simulation results show the effectiveness of the proposed two-stage optimization approach in improving the transmission rate of the construct

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Local anatomy for personalised privacy protection

引用

International Journal of Information and Computer Security 2021年第2-3期15卷 254-271页

作者： Li, Boyu Liu, Yanheng Wang, Minghai Sun, Geng Li, Bin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China Big Data and Network Management Center Jilin University Changchun China College of Mathematics Jilin University Changchun China

Anonymisation technique has been extensively studied and widely applied for privacy-preserving data publishing. However, most existing methods ignore personal anonymity requirements. In these approaches, the microdata consist of three categories of attribute: explicit-identifier, quasi-identifier and sensitive attribute. In fact, the data sensitivity should be determined by individuals. An attribute is semi-sensitive if it contains both QI and sensitive values. In this paper, we propose a novel anonymisation approach, called local anatomy, to address personalised privacy protection. Local anatomy partitions the tuples who consider the value as sensitive into buckets inside each attribute. We conduct some experiments to illustrate that local anatomy can protect all the sensitive values and preserve great information utility. Additionally, we also present the concept of intelligent anonymisation system as our direction of future work. © 2021 Inderscience Enterprises Ltd.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs 39

CLDG: Contrastive Learning on Dynamic Graphs

引用

39th IEEE International Conference on Data engineering, ICDE 2023

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Xi'an Jiaotong University Department of Computer Science and Technology China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Xi'an Jiaotong University Department of Distance Education China Beihang University School of Software China Beihang University Advanced Innovation Center for Big Data and Brain Computing China

ISBN: (纸本)9798350322279

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph's augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：