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

作者： Xie, Gengsheng Wen, Xianbin Yuan, Liming Wang, Jianchen Guo, Changlun Jia, Yansong Li, Minghao School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin300384 China

Learning distinguishing features from training datasets while filtering features of occlusions is critical to person retrieval scenarios. Most of the current person re-identification (Re-ID) methods based on classification or deep metric representation learning tend to overlook occlusion issues on the training set. Such representations from obstacles are easily over-fitted and misleading due to being considered as a part of the human body. To alleviate the occlusion problem, we propose a pose-guided feature region-based fusion network (PFRFN), to utilize pose landmarks as guidance to guide local learning for a good property of local feature, and the representation learning risk is evaluated on each part loss separately. Compared with only using global classification loss, concurrently considering local loss and the results of robust pose estimation enable the deep network to learn the representations of the body parts that prominently displayed in the image and gain the discriminative faculties on occluded scenes. Experimental results on multiple datasets, i.e., Market-1501, DukeMTMC, CUHK03, demonstrate the effectiveness of our method in a variety of scenarios. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

On Privacy-Preserving Task Assignment for Heterogeneous Users in Mobile Crowdsensing 26

On Privacy-Preserving Task Assignment for Heterogeneous User...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Ji Li, Peng Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Task assignment is a key challenge in mobile crowd-sensing because of the varying capabilities of crowd users. Location-based task assignment schemes require users to upload their location to an untrusted platform, which raises many privacy concerns. However, stronger privacy preservation may lead to lower system utility. It is challenging to maximize system utility under privacy preservation for users. In this paper, we propose a privacy-preserving task assignment for heterogeneous users (PTAH) problem in mobile crowdsensing. Specifically, we divide users into two groups: private users with location privacy requirements and public users without location privacy requirements. We first design a privacy-preserving mechanism to obfuscate the actual location of private users. Then we construct a relationship graph based on the locations between users and tasks. We prove that the PTAH problem is an NP-hard problem, so to maximize the system utility, we propose an approximation algorithm based on the greedy algorithm. Then we propose a multi-thread cooperative simulated annealing algorithm to search for a better approximate solution. Finally, we conducted simulations based on the widely-used real-world Roma dataset. The results show that our proposed algorithm consistently outperforms other baseline algorithms. © 2023 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Advswap: Covert Adversarial Perturbation with High Frequency Info-Swapping for Autonomous Driving Perception 27

Advswap: Covert Adversarial Perturbation with High Frequency...

引用

27th IEEE International Conference on Intelligent Transportation systems, ITSC 2024

作者： Huang, Yuanhao Zhang, Qinfan Xing, Jiandong Cheng, Mengyue Yu, Haiyang Ren, Yilong Xiong, Xiao School of Transportation Science and Engineering Beihang University Beijing100191 China State Key Lab of Intelligent Transportation System Beijing100191 China Zhongguancun Laboratory Beijing100094 China University of Alberta Department of Electrical and Computer Engineering Edmonton Canada

ISBN: (纸本)9798331505929

Perception module of Autonomous vehicles (AVs) are increasingly susceptible to be attacked, which exploit vulnerabilities in neural networks through adversarial inputs, thereby compromising the AI safety. Some researches focus on creating covert adversarial samples, but existing global noise techniques are detectable and difficult to deceive the human visual system. This paper introduces a novel adversarial attack method, AdvSwap, which creatively utilizes wavelet-based highfrequency information swapping to generate covert adversarial samples and fool the camera. AdvSwap employs invertible neural network for selective high-frequency information swapping, preserving both forward propagation and data integrity. The scheme effectively removes the original label data and incorporates the guidance image data, producing concealed and robust adversarial samples. Experimental evaluations and comparisons on the GTSRB and nuScenes datasets demonstrate that AdvSwap can make concealed attacks on common traffic targets. The generates adversarial samples are also difficult to perceive by humans and algorithms. Meanwhile, the method has strong attacking robustness and attacking transferability. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two-stage Vehicle Pair Dispatch in Multi-hop Ridesharing 26

Two-stage Vehicle Pair Dispatch in Multi-hop Ridesharing

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wei, Xiaobo Li, Peng Huang, Weiyi Liu, Zhiyuan Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Ridesharing benefits the economy and the environment. In multi-hop ridesharing, passengers are permitted to switch vehicles within a single trip, extending the flexibility of conventional ridesharing. Nonetheless, vehicle dispatch is a difficult issue in multi-hop ridesharing. We subdivide the vehicle dispatching problem into the vehicle pairing problem and the request selection problem within a vehicle pair. To address these subproblems, we propose a two-stage framework for vehicle pair dispatching. In the initial stage, we model the vehicle pairing problem as a maximum vehicle-vehicle matching problem in a general graph, which differs from the conventional vehicle-request matching problem in a bipartite graph. The vehicle pairing algorithm is proposed to efficiently solve the vehicle pairing problem. In the second stage, we model the request selection problem as a multidimensional knapsack problem (d-KP) and propose an LP-relaxation request selection algorithm with an approximation ratio 1/5. Experiments conducted on a real-world dataset demonstrate the economic benefit of our proposed two-stage framework. © 2023 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Quality-Oriented Task Assignment for Heterogeneous Users in Mobile Crowdsensing 26

Quality-Oriented Task Assignment for Heterogeneous Users in ...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Chen, Kang Li, Peng Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Mobile crowdsensing (MCS) is a potential technology for large-scale data collection. This technology requires the platform to recruit users to complete tasks in specific areas. A vital issue in MCS is task assignment, and most existing task assignment efforts consider only a single user type, which is not reasonable in real scenarios. Task assignment becomes more complicated when the platform tries to assign tasks to heterogeneous users with a limited budget in the platform. In this paper, we consider a quality-oriented task assignment for heterogeneous users problem. Professional users have a high sensing quality with a high cost, and normal users have a low sensing quality with a low cost First, we model the sensing capabilities and the costs of different users and formulate the quality-oriented task assignment for heterogeneous users problem. Then, we design the integer linear programming form and prove that the problem is NP-hard. By verifying the submodularity of the objective function, we present a greedy algorithm. Considering the inefficiency of the algorithm, we design two genetic algorithms to improve the total sensing quality. Finally, we evaluate the proposed algorithms under different cost cases based on a real dataset The results show that our proposed algorithm performs well under different cost distribution scenarios. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An end-to-end instance segmentation method based on improved ConvNeXt V2

引用

International Journal of Wireless and Mobile Computing 2024年第4期26卷 384-392页

作者： Wang, Wenlu Sun, Ying Xu, Manman Bai, Dongxu Huang, Li Zou, Chunlong Chen, Baojia Tang, Dalai Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education Wuhan University of Science and Technology Hubei Wuhan China Research Centre for Biomimetic Robot and Intelligent Measurement and Control Wuhan University of Science and Technology Hubei Wuhan China Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering Wuhan University of Science and Technology Hubei Wuhan China College of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Hubei Wuhan China College of Mechanical Engineering Hubei University of Automotive Technology Hubei Shiyan China Hubei Key Laboratory of Hydroelectric Machinery Design and Maintenance China Three Gorges University Hubei Yichang China School of Computer Information Management Inner Mongolia University of Finance and Economics Hohhot China

In order to improve the efficiency of indoor mobile robots in locating and segmenting environmental instances, an instance segmentation method based on RTMDet is proposed. Firstly, the more powerful ConvNeXt V2 is used as the backbone network of the model, which improves the performance of the existing RTMDet model. Subsequently, NAS-FPN is used as a converged network to detect the network at any given time. Finally, AdamW is used as the model optimiser, which effectively solves the problem of excessive memory occupation when updating parameters and improves the performance of the model. The proposed method obtains the highest evaluation index in all cases. After training and testing on the Cityscapes data set, the recognition accuracy reaches 65.0%. © 2024 Inderscience Enterprises Ltd.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

UAV-Assisted Dynamic Avatar Task Migration for Vehicular Metaverse Services: A Multi-Agent Deep Reinforcement Learning Approach

引用

IEEE/CAA Journal of Automatica Sinica 2024年第2期11卷 430-445页

作者： Jiawen Kang Junlong Chen Minrui Xu Zehui Xiong Yutao Jiao Luchao Han Dusit Niyato Yongju Tong Shengli Xie IEEE School of Automation Guangdong University of TechnologyGuangzhou 510006China 111 Center for Intelligent Batch Manufacturing based on IoT Technology Guangzhou 510006China Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of EducationGuangzhou 510006China School of Computer Science and Engineering Nanyang Technological UniversitySingaporeSingapore Pillar of Information Systems Technology and Design Singapore University of Technology and DesignSingaporeSingapore College of Communication Engineering Army Engineering University of PLANanjing 210007China National Natural Science Foundation of China Beijing 100085China Key Laboratory of Intelligent Detection and IoT in Manufacturing Ministry of EducationGuangzhou 510006China Guangdong Key Laboratory of IoT Information Technology Guangzhou 510006China

Avatars, as promising digital representations and service assistants of users in Metaverses, can enable drivers and passengers to immerse themselves in 3D virtual services and spaces of UAV-assisted vehicular Metaverses. However, avatar tasks include a multitude of human-to-avatar and avatar-to-avatar interactive applications, e.g., augmented reality navigation,which consumes intensive computing resources. It is inefficient and impractical for vehicles to process avatar tasks locally. Fortunately, migrating avatar tasks to the nearest roadside units(RSU)or unmanned aerial vehicles(UAV) for execution is a promising solution to decrease computation overhead and reduce task processing latency, while the high mobility of vehicles brings challenges for vehicles to independently perform avatar migration decisions depending on current and future vehicle status. To address these challenges, in this paper, we propose a novel avatar task migration system based on multi-agent deep reinforcement learning(MADRL) to execute immersive vehicular avatar tasks dynamically. Specifically, we first formulate the problem of avatar task migration from vehicles to RSUs/UAVs as a partially observable Markov decision process that can be solved by MADRL algorithms. We then design the multi-agent proximal policy optimization(MAPPO) approach as the MADRL algorithm for the avatar task migration problem. To overcome slow convergence resulting from the curse of dimensionality and non-stationary issues caused by shared parameters in MAPPO, we further propose a transformer-based MAPPO approach via sequential decision-making models for the efficient representation of relationships among agents. Finally, to motivate terrestrial or non-terrestrial edge servers(e.g., RSUs or UAVs) to share computation resources and ensure traceability of the sharing records, we apply smart contracts and blockchain technologies to achieve secure sharing management. Numerical results demonstrate that the proposed approach

关键词： Avatar blockchain metaverses multi-agent deep reinforcement learning transformer UAVs

来源：评论

学校读者我要写书评

暂无评论

On the Outage of Far-Reach Communications via RIS-Empowered Satellites

On the Outage of Far-Reach Communications via RIS-Empowered ...

引用

2024 IEEE Pacific Rim Conference on Communications, computers and Signal Processing, PACRIM 2024

作者： Wang, Fan Jiang, Ruihong Liu, Yuan Bao, Tingnan Peng, Mugen Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Research Center for Space Computing System Zhejiang Laboratory Hangzhou311100 China School of Electrical Engineering and Computer Science University of Ottawa OttawaON Canada

ISBN: (纸本)9798350362312

The rising demand for reliable, high-bandwidth satellite communications in far-reach areas drives the integration of low earth orbit (LEO) satellites into future 6G networks. In this paper, we investigate the deployment of reconfigurable intelligent surface (RIS) technology and rate splitting multiple access (RSMA) within LEO satellite systems to improve communication quality and system capacity. We derive closed-form expressions for outage probability (OP) and reliable throughput that validate the theoretical advantages of these technologies under various signal-to-noise ratio conditions. Numerical results demonstrate that, compared with traditional space division multiple access (SDMA) and non-orthogonal multiple access (NOMA) approaches, our RSMA and RIS-integrated framework significantly can reduce OP and enhance reliable throughput with an appropriate power-splitting factor, showcasing its superiority in RIS-enabled satellite communication scenarios. © 2024 IEEE.

关键词： Satellite communication systems

来源：评论

学校读者我要写书评

暂无评论

Transferable Features from 1D-Convolutional Network for Industrial Malware Classification

引用

computer Modeling in engineering & sciences 2022年第2期130卷 1003-1016页

作者： LiweiWang Jiankun Sun Xiong Luo Xi Yang School of Computer and Communication Engineering University of Science and Technology BeijingBeijing100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083China Shunde Graduate School University of Science and Technology BeijingFoshan528399China Beijing Intelligent Logistics System Collaborative Innovation Center Beijing101149China

With the development of information technology,malware threats to the industrial system have become an emergent issue,since various industrial infrastructures have been deeply integrated into our modern works and *** identify and classify new malware variants,different types of deep learning models have been widely explored ***,sufficient data is usually required to achieve a well-trained deep learning classifier with satisfactory generalization ***,in current practical applications,an ample supply of data is absent in most specific industrial malware detection *** learning as an effective approach can be used to alleviate the influence of the small sample size *** addition,it can also reuse the knowledge from pretrained models,which is beneficial to the real-time requirement in industrial malware *** this paper,we investigate the transferable features learned by a 1D-convolutional network and evaluate our proposed methods on 6 transfer learning *** experiment results show that 1D-convolutional architecture is effective to learn transferable features for malware classification,and indicate that transferring the first 2 layers of our proposed 1D-convolutional network is the most efficient way to reuse the learned features.

关键词： Transfer learning malware classification sequence data modeling convolutional network

来源：评论

学校读者我要写书评

暂无评论

RSP-gcForest: A Distributed Deep Forest via Random Sample Partition

RSP-gcForest: A Distributed Deep Forest via Random Sample Pa...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Li, Mark Junjie Cai, Wenzhu Lin, Yigang Huang, Sunjie Huang, Joshua Zhexue Peng, Patrick Xiaogang Shenzhen University College of Computer Science and Software Engineering Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen Academy of Inspection and Quarantine China

ISBN: (纸本)9798350324457

Deep Forest, a powerful alternative to deep neural networks, has gained much attention due to its advantages, such as low complexity, minimal hyperparameter requirements, and strong application performance. In the current big data environment, where data volumes and model complexities are growing rapidly, distributed computing is needed to increase computational efficiency. Recently, a distributed deep forest approach, called BLB-gcForest (Bag of Little Bootstraps-gcForest), has been successful in reducing training instances within cascade forests, combining BLB and granularity segmentation, thus improving the computational efficiency and scalability of distributed deep forests. However, it still transmits the entire data set between layers and requires double sampling with BLB, limiting the amount of data and the scalability of resource utilization. This paper introduces a novel algorithm, RSP-gcForest, based on Random Sample Partition (RSP) to improve distributed deep forests computational efficiency and scalability. RSP-gcForest uses block-level samples that replace the full dataset, significantly reducing interlayer instance transmission and prediction within cascade forests. Additionally, RSP blocks are integrated with the segmentation granularity of cascade forests for ensemble learning, effectively addressing computational efficiency and resource constraints. We conducted experiments on four extensive datasets using Spark and evaluated performance across five key metrics. The results clearly show that RSP-gcForest, while maintaining high classification quality, surpasses state-of-the-art methods in terms of computational efficiency and resource utilization. Furthermore, it achieves superior load balancing, demonstrating its potential as a powerful tool in big data and distributed computing. © 2023 IEEE.

关键词： Deep forest Distributed Computing Ensemble Learning Random Sample Partition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：