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

arXiv 2024年

作者： Li, Hongjuan Kang, Hui Sun, Geng Li, Jiahui Wang, Jiacheng Wang, Xue 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 Computing and Data Science Nanyang Technological University Singapore639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore Department of Communication Engineering Jilin University Changchun130012 China 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

Unmanned aerial vehicles (UAVs) have gained considerable attention as a platform for establishing aerial wireless networks and communications. However, the line-of-sight dominance in air-to-ground communications often leads to significant interference with terrestrial networks, reducing communication efficiency among terrestrial terminals. This paper explores a novel uplink interference mitigation approach based on the collaborative beamforming (CB) method in multi-UAV network systems. Specifically, the UAV swarm forms a UAV-enabled virtual antenna array (VAA) to achieve the transmissions of gathered data to multiple base stations (BSs) for data backup and distributed processing. However, there is a trade-off between the effectiveness of CB-based interference mitigation and the energy conservation of UAVs. Thus, by jointly optimizing the excitation current weights and hover position of UAVs as well as the sequence of data transmission to various BSs, we formulate an uplink interference mitigation multi-objective optimization problem (MOOP) to decrease interference affection, enhance transmission efficiency, and improve energy efficiency, simultaneously. In response to the computational demands of the formulated problem, we introduce an evolutionary computation method, namely chaotic non-dominated sorting genetic algorithm II (CNSGA-II) with multiple improved operators. The proposed CNSGA-II efficiently addresses the formulated MOOP, outperforming several other comparative algorithms, as evidenced by the outcomes of the simulations. Moreover, the proposed CB-based uplink interference mitigation approach can significantly reduce the interference caused by UAVs to non-receiving BSs. Copyright © 2024, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Attribute-Guided Pedestrian Retrieval: Bridging Person Re-ID with Internal Attribute Variability

Attribute-Guided Pedestrian Retrieval: Bridging Person Re-ID...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yan Huang Zhang Zhang Qiang Wu Yi Zhong Liang Wang Center for Research on Intelligent Perception and Computing (CRIPAC) State Key Laboratory of Multimodal Artificial Intelligence Systems (MAIS) Chinese Academy of Sciences Institute of Automation Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences (UCAS). School of Electrical and Data Engineering University of Technology Sydney Australia School of Information and Electronics Beijing Institute of Technology China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

In various domains such as surveillance and smart retail, pedestrian retrieval, centering on person re-identification (Re-ID), plays a pivotal role. Existing Re-ID methodologies often overlook subtle internal attribute variations, which are crucial for accurately identifying individuals with changing appearances. In response, our paper introduces the Attribute-Guided Pedestrian Retrieval (AGPR) task, focusing on integrating specified attributes with query images to refine retrieval results. Although there has been progress in attribute-driven image retrieval, there remains a notable gap in effectively blending robust Re-ID models with intra-class attribute variations. To bridge this gap, we present the Attribute-Guided Transformer-based Pedestrian Retrieval (ATPR) framework. ATPR adeptly merges global ID recognition with local attribute learning, ensuring a co-hesive linkage between the two. Furthermore, to effectively handle the complexity of attribute interconnectivity, ATPR organizes attributes into distinct groups and applies both inter-group correlation and intra-group decorrelation regularizations. Our extensive experiments on a newly estab-lished benchmark using the RAP dataset [32] demonstrate the effectiveness of ATPR within the AGPR paradigm.

关键词： Couplings Pedestrians Correlation Surveillance Image retrieval Focusing Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Downstream-agnostic Adversarial Examples

arXiv

引用

arXiv 2023年

作者： Zhou, Ziqi Hu, Shengshan Zhao, Ruizhi Wang, Qian Zhang, Leo Yu Hou, Junhui Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Wuhan University China School of Information and Communication Technology Griffith University Australia Department of Computer Science City University of Hong Kong Hong Kong National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Self-supervised learning usually uses a large amount of unlabeled data to pre-train an encoder which can be used as a general-purpose feature extractor, such that downstream users only need to perform fine-tuning operations to enjoy the benefit of "large model". Despite this promising prospect, the security of pre-trained encoder has not been thoroughly investigated yet, especially when the pre-trained encoder is publicly available for commercial use. In this paper, we propose AdvEncoder, the first framework for generating downstream-agnostic universal adversarial examples based on the pre-trained encoder. AdvEncoder aims to construct a universal adversarial perturbation or patch for a set of natural images that can fool all the downstream tasks inheriting the victim pre-trained encoder. Unlike traditional adversarial example works, the pre-trained encoder only outputs feature vectors rather than classification labels. Therefore, we first exploit the high frequency component information of the image to guide the generation of adversarial examples. Then we design a generative attack framework to construct adversarial perturbations/patches by learning the distribution of the attack surrogate dataset to improve their attack success rates and transferability. Our results show that an attacker can successfully attack downstream tasks without knowing either the pre-training dataset or the downstream dataset. We also tailor four defenses for pre-trained encoders, the results of which further prove the attack ability of AdvEncoder. Our codes are available at: https://github. com/CGCL-codes/AdvEncoder. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Large Language Models as Evolutionary Optimizers

Large Language Models as Evolutionary Optimizers

引用

Congress on Evolutionary Computation

作者： Shengcai Liu Caishun Chen Xinghua Qu Ke Tang Yew-Soon Ong A*STAR Department of Computer Science and Engineering Centre for Frontier AI Research Southern University of Science and Technology Centre for Frontier AI Research A*STAR Tianqiao & Chrissy Chen Institute Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Centre for Frontier AI Research A*STAR College of Computing and Data Science Nanyang Technological University

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Evolutionary algorithms (EAs) have achieved remarkable success in tackling complex combinatorial optimization problems. However, EAs often demand carefully-designed operators with the aid of domain expertise to achieve satisfactory performance. In this work, we present the first study on large language models (LLMs) as evolutionary combinatorial optimizers. The main advantage is that it requires minimal domain knowledge and human efforts, as well as no additional training of the model. This approach is referred to as LLM-driven EA (LMEA). Specifically, in each generation of the evolutionary search, LMEA instructs the LLM to select parent solutions from current population, and perform crossover and mutation to generate offspring solutions. Then, LMEA evaluates these new solutions and include them into the population for the next generation. LMEA is equipped with a self-adaptation mechanism that controls the temperature of the LLM. This enables it to balance between exploration and exploitation and prevents the search from getting stuck in local optima. We investigate the power of LMEA on the classical traveling salesman problems (TSPs) widely used in combinatorial optimization research. Notably, the results show that LMEA performs competitively to traditional heuristics in finding high-quality solutions on TSP instances with up to 20 nodes. Additionally, we also study the effectiveness of LLM-driven crossover/mutation and the self- adaptation mechanism in evolutionary search. In summary, our results reveal the great potentials of LLMs as evolutionary optimizers for solving combinatorial problems. We hope our research shall inspire future explorations on LLM-driven EAs for complex optimization challenges.

关键词： Training Large language models Computational modeling Sociology Evolutionary computation Traveling salesman problems Temperature control

来源：评论

学校读者我要写书评

暂无评论

Optimizing Generative AI Networking: A Dual Perspective with Multi-Agent Systems and Mixture of Experts

arXiv

引用

arXiv 2024年

作者： Zhang, Ruichen Du, Hongyang Niyato, Dusit Kang, Jiawen Xiong, Zehui Zhang, Ping Kim, Dong In The College of Computing and Data Science Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

In the continued development of next-generation networking and artificial intelligence content generation (AIGC) services, the integration of multi-agent systems (MAS) and the mixture of experts (MoE) frameworks is becoming increasingly important. Motivated by this, this article studies the contrasting and converging of MAS and MoE in AIGC-enabled networking. First, we discuss the architectural designs, operational procedures, and inherent advantages of using MAS and MoE in generative AI to explore its functionality and applications fully. Next, we review the applications of MAS and MoE frameworks in content generation and resource allocation, emphasizing their impact on networking operations. Subsequently, we propose a novel multi-agent-enabled MoE-proximal policy optimization (MoE-PPO) framework for 3D object generation and data transfer scenarios. The framework uses MAS for dynamic task coordination of each network service provider agent and MoE for expert-driven execution of respective tasks, thereby improving overall system efficiency and adaptability. The simulation results demonstrate the effectiveness of our proposed framework and significantly improve the performance indicators under different network conditions. Finally, we outline potential future research directions. © 2024, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Hi-SAM: Marrying Segment Anything Model for Hierarchical Text Segmentation

arXiv

引用

arXiv 2024年

作者： Ye, Maoyuan Zhang, Jing Liu, Juhua Liu, Chenyu Yin, Baocai Liu, Cong Du, Bo Tao, Dacheng School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China IFLYTEK Research IFLYTEK CO. LTD. China College of Computing & Data Science Nanyang Technological University #32 Block N4 #02a-014 50 Nanyang Avenue 639798 Singapore

The Segment Anything Model (SAM), a profound vision foundation model pretrained on a large-scale dataset, breaks the boundaries of general segmentation and sparks various downstream applications. This paper introduces Hi-SAM, a unified model leveraging SAM for hierarchical text segmentation. Hi-SAM excels in segmentation across four hierarchies, including pixel-level text, word, text-line, and paragraph, while realizing layout analysis as well. Specifically, we first turn SAM into a high-quality pixel-level text segmentation (TS) model through a parameter-efficient fine-tuning approach. We use this TS model to iteratively generate the pixel-level text labels in a semi-automatical manner, unifying labels across the four text hierarchies in the HierText dataset. Subsequently, with these complete labels, we launch the end-to-end trainable Hi-SAM based on the TS architecture with a customized hierarchical mask decoder. During inference, Hi-SAM offers both automatic mask generation (AMG) mode and promptable segmentation (PS) mode. In the AMG mode, Hi-SAM segments pixel-level text foreground masks initially, then samples foreground points for hierarchical text mask generation and achieves layout analysis in passing. As for the PS mode, Hi-SAM provides word, text-line, and paragraph masks with a single point click. Experimental results show the state-of-the-art performance of our TS model: 84.86% fgIOU on Total-Text and 88.96% fgIOU on TextSeg for pixel-level text segmentation. Moreover, compared to the previous specialist for joint hierarchical detection and layout analysis on HierText, Hi-SAM achieves significant improvements: 4.73% PQ and 5.39% F1 on the text-line level, 5.49% PQ and 7.39% F1 on the paragraph level layout analysis, requiring 20× fewer training epochs. The code is available at Hi-SAM. Copyright © 2024, The Authors. All rights reserved.

关键词： Masks

来源：评论

学校读者我要写书评

暂无评论

Curb Parking Occupancy Prediction Based on Real-Time Fusion of Multi-View Spatial-Temporal Information Using Graph Attention Gated Networks

SSRN

引用

SSRN 2024年

作者： Qian, Chonghui Yang, Kexu He, Jiangping Peng, Xiaojing Huang, Hengjun School of Statistics and Data Science Lanzhou University of Finance and Economics Lanzhou730020 China Key Laboratory of Digital Economy and Social Computing Science of Gansu Lanzhou730020 China School of Information Engineering and Artificial Intelligence Lanzhou University of Finance and Economics Lanzhou730020 China School of Business Administration Lanzhou University of Finance and Economics Lanzhou730020 China

Securing available curb parking space is crucial for reducing traffic congestion, cutting cruising time, and lessening pollution in smart cities. Accurate and timely parking occupancy predictions are essential for intelligent parking systems. However, most existing methods sequentially fuse spatial-temporal information using tandem concatenation, facing challenges such as spatial information lag and insufficient feature fusion. These methods fail to concurrently process spatial-temporal information, hindering real-time fusion capabilities. Furthermore, current research has limitations in utilizing spatial data, primarily focusing on geographic distance and points of interest (POI) information, while overlooking spatial features related to curb parking utilization, such as accessibility (i.e., the time to reach adjacent parking lots). Therefore, this study proposes the multi-view graph attention gated recurrent unit network (MGA-GRU) model for predicting curb parking occupancy. The model uses graph attention gated units to simultaneously fuse spatial-temporal data while constructing an integrated graph to aggregate multi-view spatial information. The proposed model undergoes validation tests using curb parking data from July 2019 to December 2020 in Lanzhou, China. The findings indicate that the MGA-GRU model outperforms the baseline for both short-term and long-term periods, underscoring its effectiveness in predicting curb parking space availability and providing valuable insights for improving parking system functionality. © 2024, The Authors. All rights reserved.

关键词： data fusion

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

arXiv

引用

arXiv 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan The Beijing Key Laboratory of Network System Architecture and Convergence The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing China Singapore The Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States The College of Information Science and Electronic Engineering Zhejiang University Zhejiang Hangzhou310027 China The Department of Computer Science North Carolina State University RaleighNC27695 United States The Beijing Key Laboratory of Network System Architecture and Convergence China The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025, CC BY-NC-SA.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Dual-Scale Enhanced and Cross-Generative Consistency Learning for Semi-Supervised Medical Image Segmentation

SSRN

引用

SSRN 2024年

作者： Gu, Yunqi Zhou, Tao Zhang, Yizhe Zhou, Yi He, Kelei Gong, Chen Zhu, Huafu PCA Lab The Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Information Science and Technology Nanjing210094 China School of Computer Science and Engineering Southeast University Nanjing211189 China Medical School Nanjing University National Institute of Healthcare Data Science Nanjing210023 China Institute of High Performance Computing A*STAR Singapore

Medical image segmentation plays a crucial role in computer-aided diagnosis. However, existing methods heavily rely on fully supervised training, which requires a large amount of labeled data with time-consuming pixel-wise annotations. Moreover, accurately segmenting lesions poses challenges due to variations in shape, size, and location. To address these issues, we propose a novel Dual-scale Enhanced and Cross-generative consistency learning framework for semi-supervised medical image Segmentation (DEC-Seg). First, we propose a Cross-level Feature Aggregation (CFA) module that integrates cross-level adjacent layers to enhance the feature representation ability across different resolutions. To address scale variation, we present a scale-enhanced consistency constraint, which ensures consistency in the segmentation maps generated from the same input image at different scales. This constraint helps handle variations in lesion sizes and improves the robustness of the model. Furthermore, we propose a cross-generative consistency scheme, in which the original and perturbed images can be reconstructed using cross-segmentation maps. This consistency constraint allows us to mine effective feature representations and boost the segmentation performance. To produce more accurate segmentation maps, we propose a Dual-scale Complementary Fusion (DCF) module that integrates features from two scale-specific decoders operating at different scales. Extensive experimental results on polyp segmentation from colonoscopy images, skin lesion segmentation from dermoscopic images, and Brain glioma segmentation from MRI images demonstrate the effectiveness of our DEC-Seg against other state-of-the-art semi-supervised segmentation approaches. © 2024, The Authors. All rights reserved.

关键词： Computer aided diagnosis

来源：评论

学校读者我要写书评

暂无评论

TEVA: Training-Efficient and Verifiable Aggregation for Federated Learning for Consumer Electronics in Industry 5.0

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xia, Yuanjun Liu, Yining Chen, Jingxue Liang, Yangfan Khan, Fazlullah Alturki, Ryan Wang, Xiaopei Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software School of Computer and Information Security Guilin541004 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325027 China University of Technology School of Mathematical and Physical Sciences SydneyNSW2007 Australia Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China Umm AI-Qura University Makkah Department of Software Engineering College of Computing Saudi Arabia Riverside Department of Computer Science and Engineering University of California CA92521 United States

Federated learning (FL) has been widely used for privacy-preserving model updates in Industry 5.0, facilitated by 6G networks. Despite FL's privacy-preserving advantages, it remains vulnerable to attacks where adversaries can infer private data from local models or manipulate the central server (CS) to deliver falsified global models. Current privacy-preserving approaches, primarily based on the FedAvg algorithm, fail to optimize training efficiency for non-independent and identically distributed (non-IID) data. This article proposes training-efficient and verifiable aggregation (TEVA) for FL to resolve these issues. This scheme combines threshold Paillier homomorphic encryption (TPHE), verifiable aggregation, and an optimized double momentum update mechanism (OdMum). TEVA not only leverages TPHE to protect the privacy of local models but also ensures the integrity of the global model through a verifiable aggregation mechanism. Additionally, TEVA integrates the OdMum algorithm to effectively address the challenges posed by non-IID data, promoting rapid model convergence and significantly enhancing overall training efficiency. Security analysis indicates that TEVA meets the requirements for privacy protection. Extensive experimental results demonstrate that TEVA can accelerate model convergence while incurring lower computational and communication overheads. © 1975-2011 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：