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

Fairness-Aware Budgeted Edge Server Placement for Connected Autonomous Vehicles

IEEE Transactions on Mobile Computing 2025年第6期24卷 4762-4776页

作者： Wu, Jintao Xu, Xiaolong Cui, Guangming Zhang, Yiwen Qi, Lianyong Dou, Wanchun Cai, Zhipeng Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software Nanjing210044 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software China Nanjing University State Key Laboratory for Novel Software Technology China Anhui University School of Computer Science and Technology Anhui230031 China College of Computer Science and Technology Qingdao266580 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China Georgia State University Department of Computer Science United States

Mobile edge computing (MEC) considerably enhances the capabilities and performance of connected autonomous vehicles (CAVs) by deploying edge servers (ESs) on roadside units (RSUs) near CAVs, thereby ensuring low-latency services. Given the constrained and costly nature of ES resources (computing, storage, and bandwidth), equitable ES utilization is critical for CAV operations. However, fairness considerations are often overlooked in current budgeted edge server placement (ESP) strategies, potentially worsening resource imbalances and compromising user experience. This paper investigates the fairness-aware budgeted edge server placement (FESP) problem within RSUs, proving its NP-hardness. To address FESP, we first propose FESP-O, an integer programming-based optimal approach for small-scale problems, followed by FESP-APX, an approximation approach for large-scale scenarios that provides near-optimal solutions. We analyze the time complexity and approximation ratio of our proposed algorithms and validate their efficacy through experiments on real-world datasets. Extensive experimental results demonstrate significant performance improvements over baseline and state-of-the-art methods, indicating practical suitability and efficiency. © 2002-2012 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University 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

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

TraSculptor: Visual Analytics for Enhanced Decision-Making in Road Traffic Planning

引用

IEEE Transactions on Visualization and Computer Graphics 2025年 PP卷 PP页

作者： Deng, Zikun Liu, Yuanbang Zhu, Mingrui Xiang, Da Yu, Haiyue Su, Zicheng Lu, Qinglong Schreck, Tobias Cai, Yi South China University of Technology School of Software Engineering China South China University of Technology Ministry of Education Key Laboratory of Big Data and Intelligent Robot China Tongji University Key Laboratory of Road and Traffic Engineering of the Ministry of Education China National University of Singapore Department of Civil and Environmental Engineering Singapore Graz University of Technology Austria

The design of urban road networks significantly influences traffic conditions, underscoring the importance of informed traffic planning. Traffic planning experts rely on specialized platforms to simulate traffic systems, assessing the efficacy of the road network across various states of modifications. Nevertheless, a prevailing issue persists: many existing traffic planning platforms exhibit inefficiencies in flexibly interacting with the road network's structure and attributes and intuitively comparing multiple states during the iterative planning process. This paper introduces TraSculptor, an interactive planning decision-making system. To develop TraSculptor, we identify and address two challenges: interactive modification of road networks and intuitive comparison of multiple network states. For the first challenge, we establish flexible interactions to enable experts to easily and directly modify the road network on the map. For the second challenge, we design a comparison view with a history tree of multiple states and a road-state matrix to facilitate intuitive comparison of road network states. To evaluate TraSculptor, we provided a usage scenario where the Braess's paradox was showcased, invited experts to perform a case study on the Sioux Falls network, and collected expert feedback through interviews. © 1995-2012 IEEE.

关键词： Visual analytics

来源：评论

学校读者我要写书评

暂无评论

Multi-Hop Attention Diffusion Graph Neural Networks For Multimodal Fake News Detection

Multi-Hop Attention Diffusion Graph Neural Networks For Mult...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Huang, Zhongqiang Lu, Dongli Sha, Ying Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China College of Informatics Huazhong Agricultural University Wuhan China

ISBN: (纸本)9798350368741

Fake news often spreads rapidly on social media in various forms, exposing users to a large amount of misinformation and disinformation. Recently, promising results have been achieved in fake news detection. However, most of the approaches only consider one-hop neighborhood information in cross-modal mapping relationships or focus mainly on pairwise interactions of multimodal fake news. However, the fine-grained feature mapping of multimodal fake news may go beyond binary relations. To address these issues, we propose a Multi-Hop Attention Diffusion Graph Neural Networks in this work to capture and complement the multivariate mapping relationships between fine-grained features, while extracting cross-modal higher-order alignment representations for multimodal fake news detection via cross-modal contrastive learning and modal matching. Extensive experiments on three public datasets demonstrate the effectiveness of the proposed approach in the multimodal fake news detection task. © 2025 IEEE.

关键词： attention diffusion fake news graph neural networks multivariate mapping relationships

来源：评论

学校读者我要写书评

暂无评论

Dual-Aspect Noise-Based Regularization for Multi-Modal Relation Extraction in Media Posts

IEEE Transactions on Audio, Speech and Language Processing

引用

IEEE Transactions on Audio, Speech and Language Processing 2025年 33卷 1324-1336页

作者： Kai Sun Bin Shi Samuel Mensah Wenjian Liu Bo Dong School of Computer Science and Technology and Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China School of Computer Science and Technology The University of Sheffield Sheffield U.K. Faculty of Data Science City University of Macau Macau China School of Continuing Education and Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China

Multi-Modal Relation Extraction (MMRE) plays a key role in various multimedia applications including, recommendation and information retrieval systems. MMRE aims to extract the semantic relation between entities by leveraging context from a text-image pair. By utilizing context from images, the challenge of learning from noisy images in MMRE emerges as a research problem by itself. For instance, subtle variations in similar images can act as noise and potentially impact the predictions made by MMRE models. To tackle this problem, current work utilizes attention mechanisms to fuse relevant text and image features or devise data augmentation techniques (e.g., via generative models) to improve generalization. However, the current performance still remains unsatisfactory. In an effort to improve upon the performance, we propose a Dual-Aspect Noise-based Regularization framework that encompasses two techniques: 1) noise removal through an adaptive gating mechanism, 2) fighting noise with noise to improve feature stability in the learning process. We find that combining these techniques encourages the model to focus on more relevant image features for MMRE. We carry out extensive experiments and demonstrate that our proposed model is further enhanced by exploring data augmentation techniques. This additional improvement leads the model to achieve state-of-the-art performance on the widely-used Multi-modal Neural Relation Extraction (MNRE) dataset, and show its effectiveness and generalizability on the Multi-Modal Named Entity Recognition task.

关键词： Feature extraction Noise data mining Noise measurement Social networking (online) Adaptation models Transformers Training Predictive models data models

来源：评论

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

Using Depth-Enhanced Spatial Transformation for Student Gaze...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Miao, Haonan Zhao, Peizheng Sun, Yuqi Nan, Fang Zhang, Xiaolong Wu, Yaqiang Tian, Feng School of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China School of Advanced Technology Xi'an Jiaotong-Liverpool University Suzhou215123 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798350368741

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students' gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods. © 2025 IEEE.

关键词： classroom depth-enhanced 2D space dual-view gaze target estimation spatial transformation

来源：评论

学校读者我要写书评

暂无评论

MSMAE-Net: multi-semantic and multi-attention enhanced network for image forgery localization

引用

Signal, Image and Video Processing 2025年第7期19卷 1-11页

作者： Liao, Jianjun Su, Lichao Lu, Menghan Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

The popularization of modern digital image technology has brought convenience to us, but it also poses many risks. The advancement of image editing software allows anyone to modify image content effortlessly. If these modified images are abused, they can severely impact societal safety and stability. To address these risks, we propose an end-to-end multi-scale collaborative enhancement image forgery localization network, termed MSMAE-Net. The method first employs a multi-branch feature extractor to initially capture both global and local information, with each branch optimized for different contextual information and features of the image. Next, to enhance the model’s ability to capture forged traces at various levels while maintaining the correlation between different spatial hierarchies, a boundary information aggregation module is designed. By constructing multiple branches with different receptive fields and collaborative learning with each other, a nested collaborative enhancement branch is designed to make the backbone network pay more attention to key features, so as to obtain better feature representation capability. Furthermore, to further fuse different semantic information, a novel strongly compatible semantic attention fusion module is proposed in this paper. Finally, an attention enhancement module is introduced in the localization of forgery regions to adaptively concentrate on key forged areas in the image and effectively capture the relationships between different pixels. In the experiments, we demonstrate that MSMAE-Net exhibits significant advantages in both localization accuracy and robustness in complex forgery scenarios when compared to other SOTA image forgery detection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Simple Graph Contrastive Learning Framework for Short Text Classification

arXiv

引用

arXiv 2025年

作者： Liu, Yonghao Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University China University of Trento Italy

Short text classification has gained significant attention in the information age due to its prevalence and real-world applications. Recent advancements in graph learning combined with contrastive learning have shown promising results in addressing the challenges of semantic sparsity and limited labeled data in short text classification. However, existing models have certain limitations. They rely on explicit data augmentation techniques to generate contrastive views, resulting in semantic corruption and noise. Additionally, these models only focus on learning the intrinsic consistency between the generated views, neglecting valuable discriminative information from other potential views. To address these issues, we propose a Simple graph contrastive learning framework for Short Text Classification (SimSTC). Our approach involves performing graph learning on multiple text-related component graphs to obtain multi-view text embeddings. Subsequently, we directly apply contrastive learning on these embeddings. Notably, our method eliminates the need for data augmentation operations to generate contrastive views while still leveraging the benefits of multi-view contrastive learning. Despite its simplicity, our model achieves outstanding performance, surpassing large language models on various datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Improving Visual Reinforcement Learning via Spatial-Temporal data Augmentation

Improving Visual Reinforcement Learning via Spatial-Temporal...

引用

Consumer Electronics and Computer engineering (ICCECE), 2021 IEEE International Conference on

作者： Jiabao Li Qingwen Hou Jie Zhang Xianzhong Chen Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing China

ISBN: (数字)9798331533113

ISBN: (纸本)9798331533120

Sample efficiency has been a challenging problem in visual reinforcement learning, where agents not only learn polices but also extract meaningful state representations for decision making from images. Reinforcement Learning methods that adopt data augmentation have significantly improved sample efficiency. However, prior studies have primarily focused on spatial augmentation, which enhances data diversity but insufficiently exploits temporal information, such as historical states which is critical for time-series-dependent reinforcement learning tasks. To address this gap, we introduce a Spatial-Temporal data Augmentation (STDA) framework designed to enhance the agent's ability to learn task-relevant state representations by effectively leveraging historical state information. We evaluate our approach using the DeepMind Control Suite, and empirical results demonstrate that STDA significantly improves performance, surpassing state-of-the-art methods across a range of tasks.

关键词： Visualization Q-learning Law enforcement Decision making Training data Reinforcement learning Benchmark testing data augmentation Consumer electronics

来源：评论

学校读者我要写书评

暂无评论

LSDK-LegalSum: improving legal judgment summarization using logical structure and domain knowledge

引用

Journal of King Saud University - Computer and Information Sciences 2025年第1期37卷 1-15页

作者： Gao, Wei Yu, Shuai Qin, Yongbin Yang, Caiwei Huang, Ruizhang Chen, Yanping Lin, Chuan Engineering Research Center of Text Computing & CognitiveIntelligence Ministry of Education Guizhou University Guizhou Huaxi Guiyang 550025 China State Key Laboratory of Public Big Data Guizhou University Guizhou Huaxi Guiyang 550025 China College of Computer Science and Technology Guizhou University Guizhou Huaxi Guiyang 550025 China

Legal judgment summarization enhances the efficiency and accuracy of processing and retrieving similar cases by distilling key information from legal judgment documents. Legal judgments, which record the trial process and outcome, tend to have lengthy texts. However, most existing methods for legal judgment summarization struggle to effectively handle long texts and focus only on the serialized text information, neglecting the auxiliary role of the document’s logical structure in generating summaries. Additionally, legal judgment documents contain extensive domain knowledge formed by professional legal terminology, which is crucial for accurately understanding and analyzing the content of the documents. We propose a method to improve the quality of legal judgment summaries by utilizing logical structures and domain knowledge (LSDK-LegalSum). Specifically, we first use a multi-label document classification approach to divide the legal judgment into four parts: ‘Type’, ‘Claim’, ‘Fact’ and ‘Result’, then generate a summary of the ‘Type’ part, and combine it with the ‘Claim’ part to create a new summary, and so forth until the final summary is produced. Moreover, the case descriptions in legal judgments cause substantial textual noise;therefore, we employ a text-denoising method that integrates domain knowledge to further enhance the performance of the summaries. Extensive experiments on the CAIL2020 legal summarization dataset have shown that our method achieves improvements of 8.37, 16.64, and 13.07 percentage points in Rouge-1, Rouge-2, and Rouge-L scores respectively over the state-of-the-art models. This demonstrates that our method not only produces concise and semantically complete summaries but also ensures that the content is logically rigorous and well-organized, meeting practical needs more effectively. © The Author(s) 2025.

关键词： Abstractive summarization Domain knowledge Legal judgment summarization Logical structure Low-source summarization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：