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

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

来源：评论

学校读者我要写书评

暂无评论

An Optimization Method for Weight Computation in Hypergraph Transductive Learning Model 9

An Optimization Method for Weight Computation in Hypergraph ...

引用

9th International Conference on Advanced Cloud and Big Data, CBD 2021

作者： Yang, Zhe Xu, Liangkui Bu, Ziyu Chen, Yipeng Information Processing Technology Provincial Key Laboratory for Computer Soochow University School of Computer Science and Technology Suzhou China

ISBN: (纸本)9781665407458

Compared with the graph structure, the hyper-graph structure can convey more complex and multivariate relationships. In addition, hypergraphs are more capable of portraying and mining higher-order nonlinear correlations among objects. Therefore, it has been widely used in feature selection, clustering classification, and addressing other issues, and hypergraph learning has also become an important branch in the field of machine learning. Hypergraph learning, however, is a relatively high time consuming learning algorithm, because in its iterative solving process, there are lots of high-dimension matrix computations with large-scale parameters. This paper proposes an optimization of the weights, which is constructed by Gaussian kernel, in hyper-graph transductive learning model the weight matrix is replaced by fixed parameters when constructing the hypergraph laplacian matrix, which reduces the time consuming of weights computation in iterative process. Extensive experimental with semi-supervised node classification experiment results on the UCI and Kaggle datasets show that the optimized model reduces the time consuming of the hypergraph model, while ensuring classification accuracy. After model optimization, the four accuracy indicators fluctuate on average 3.03%, the time consuming is reduced by 28.99% on average, and the maximum saving is 42.84%. © 2022 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Attention information Fusion Emotion Analysis Model Based on BiLSTM-BERT 4

Attention Information Fusion Emotion Analysis Model Based on...

引用

4th International Conference on Consumer Electronics and computer Engineering, ICCECE 2024

作者： Cheng, Zhi-Wei Li, Shun-Xin Wuhan University of Science and Technology Department of Computer Science and Technology Wuhan China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial Wuhan China

ISBN: (纸本)9798350384062

Aiming at the problem that most sentiment analysis methods do not focus on the weight fusion of local context and global context information and the important information in fusion features is not prominent, AIFM-BB (Attention information fusion emotion analysis model based on BiLSTM-BERT) is proposed. The model uses a pre-trained BERT model to process text vectors and a collaborative speech analysis algorithm to process audio vectors, and introduces BiLSTM and Attention mechanisms. The weight of the feature vector is dynamically adjusted by combining the global information and local information of text and audio and the attention information of text and audio modes. The emotion analysis results are obtained through the Softmax layer after the fusion features are self-focused. The experimental results show that the accuracy of the proposed AIFM-BB model on the CMU-MOSI dataset is 85.3%, which is 2.8 percentage points higher than the baseline. In the multi-category emotion classification task, the accuracy of the model is 44.7%, an improvement of 1.1 percentage points compared with baseline. The accuracy is 83.6% on the CMU-MOSEI dataset, an improvement of 1.4 percentage points compared to baseline. © 2024 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Multi-granularity time domain single-channel music source separation 6

Multi-granularity time domain single-channel music source se...

引用

6th International Conference on Advanced Electronic Materials, computers, and Software Engineering, AEMCSE 2023

作者： Liu, Zhiying Guo, Yan Zhang, Hui Inner Mongolia Key Laboratory of Mongolian Information Processing Technology College of Computer Science-College of Software Inner Mongolia University China

ISBN: (纸本)9781510668249

Music source separation isolates or separates the desired accompaniment or singing voice from the song recording. This study solves this problem in the time domain using only one channel. Music contains rich information over multiple temporal scales, such as rhythm, tonality, melody, harmony, chord, etc. These different temporal scales information should be represented by features in different granularity. Inspired by this underlying nature of music, a multi-granularity solution is adopted. Furthermore, music is usually self-similar and can be treated as a fractal structure, meaning multiscale pattern repetition exists in music. We have captured these patterns in a batch of different granularity features using the multi-granularity solution. A self-Attention mechanism is adopted to link these regular, predictable, and repeated features. Finally, we combine the multi-granularity and self-Attention and adopt the Sandglasset model, which can utilize the information in different temporal scales and the relationship of the repeated pattern among different temporal scales. Experimental results on public datasets show that the proposed method outperforms existing systems in the single-channel music source separation task. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

IGED:Towards Intelligent DDoS Detection Model Using Improved Generalized Entropy and DNN

引用

computers, Materials & Continua 2024年第8期80卷 1851-1866页

作者： Yanhua Liu Yuting Han HuiChen Baokang Zhao XiaofengWang Ximeng Liu College of Computer and Data Science Fuzhou UniversityFuzhou350108China Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou350108China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350108China College of Computer National University of Defense TechnologyChangsha410073China

As the scale of the networks continually expands,the detection of distributed denial of service(DDoS)attacks has become increasingly *** propose an intelligent detection model named IGED by using improved generalized entropy and deep neural network(DNN).The initial detection is based on improved generalized entropy to filter out as much normal traffic as possible,thereby reducing data *** the fine detection is based on DNN to perform precise DDoS detection on the filtered suspicious traffic,enhancing the neural network’s generalization *** results show that the proposed method can efficiently distinguish normal traffic from DDoS *** with the benchmark methods,our method reaches 99.9%on low-rate DDoS(LDDoS),flooded DDoS and CICDDoS2019 datasets in terms of both accuracy and efficiency in identifying attack flows while reducing the time by 17%,31%and 8%.

关键词： DDoS real-time improved generalized entropy DNN

来源：评论

学校读者我要写书评

暂无评论

A Conflict-Priority-Based Variable Neighborhood Tabu Search Method for Multi-Satellite Scheduling

引用

Advances in Astronautics Science and technology 2024年第2期7卷 163-176页

作者： Chen, Xiaoyu Gao, Qi Peng, Shengren Song, Shihui Liu, Yufei Dai, Guangming Wang, Maocai Zhang, Changxing School of Computer China University of Geosciences Lumo Road Wuhan430074 China Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Lumo Road Wuhan430074 China Qian Xuesen Laboratory China Academy of Space Technology Youyi Road Beijing100094 China

With the increasing number and capabilities of orbital satellites and their onboard sensors, satellites scheduling plays an important role in growing demands for Earth observation tasks. A conflict-priority-based variable neighborhood tabu search method is proposed in this paper. By analyzing the flexibility of resources, the conflict-priority of tasks, and the visible time window features, the indicators of the impact, the conflict, the flexibility, and the bad impact are first established. On this basis, a first-come first-served greedy algorithm and a minimum bad impact greedy algorithm are designed for the generation of the initial solution. some rule-based heuristic strategies are also adopted for optimizing. Additionally, the algorithm incorporates three types of neighborhood structures including insertion, swapping and rearrangement, and deletion, using a tabu list to avoid local optima. Experimental results indicate the validity and efficiency of the proposed method. All solutions are within 10% of the optimal solution, with some even within 5%.The proposed method is effective for obtaining optimum solutions or solutions with a very good quality in various multi-satellite scheduling scenarios of realistic planning. © Chinese Society of Astronautics 2024.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-Updating Strategy Based Particle Swarm Optimization

引用

Intelligent Automation & Soft Computing 2023年第9期37卷 2783-2807页

作者： Dongping Tian Bingchun Li Jing Liu Chen Liu Ling Yuan Zhongzhi Shi School of Computer Science and Technology Kashi UniversityKashi844006China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing100190China

Particle swarm optimization(PSO)is a stochastic computation tech-nique that has become an increasingly important branch of swarm intelligence ***,like other evolutionary algorithms,PSO also suffers from premature convergence and entrapment into local optima in dealing with complex multimodal *** this paper puts forward an adaptive multi-updating strategy based particle swarm optimization(abbreviated as AMS-PSO).To start with,the chaotic sequence is employed to generate high-quality initial particles to accelerate the convergence rate of the ***,according to the current iteration,different update schemes are used to regulate the particle search process at different evolution *** be specific,two different sets of velocity update strategies are utilized to enhance the exploration ability in the early evolution stage while the other two sets of velocity update schemes are applied to improve the exploitation capability in the later evolution *** by the unequal weightage of acceleration coefficients is used to guide the search for the global worst particle to enhance the swarm *** addition,an auxiliary update strategy is exclusively leveraged to the global best particle for the purpose of ensuring the convergence of the PSO ***,extensive experiments on two sets of well-known benchmark functions bear out that AMS-PSO outperforms several state-of-the-art PSOs in terms of solution accuracy and convergence rate.

关键词： Particle swarm optimization local optima acceleration coefficients swarm diversity premature convergence

来源：评论

学校读者我要写书评

暂无评论

Multiband Kick Drum Separation with Genre-Guided Optimization 10th

Multiband Kick Drum Separation with Genre-Guided Optimizati...

引用

10th Conference on Sound and Music technology, CSMT 2023

作者： Li, Si Jiang, Yuanfeng Wang, Zhaowen Qian, Jiale Li, Wei School of Computer Science and Technology Fudan University Shanghai200438 China Department of Music AI and Information Technology Central Conservatory of Music Beijing100091 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai200433 China

ISBN: (纸本)9789819779611

Kick drum plays an important role in electronic music. When hearing an excellent kick drum sound from a reference music track, music production beginners always feel confused about how it will sound if we solo the kick track and why it sounds perfect in a specific song. Reproducing the kick of a music track is not easy even for professional producers and arrangers. To investigate the ability of artificial intelligence in separating kick-drum sounds, in this paper we propose an end-to-end system which is capable of separating multi-genre high-quality electronic kick drum clips from mixed song tracks. Unlike most of the previous music source separation tasks, we only focus on the electronic kick drum rather than the whole percussion track. First, we design a multiband data representation approach for non-pitched percussions such as kick drums, then adopt a multi-discriminator module trained on a multi-genre kick drum corpus to further optimize the separated kick sound. To the authors’ knowledge, this study marks the first attempt at kick drum separation with stylistic optimization. Objective and subjective evaluations demonstrate that joint multiband representation and genre-guided optimisation can form a high-performance framework, showing a promising solution to the kick drum separation task. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

Linear Subspace Surrogate Modeling for Large-Scale Expensive Single/Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2023年第3期29卷 1-1页

作者： Si, Langchun Zhang, Xingyi Tian, Ye Yang, Shangshang Zhang, Limiao Jin, Yaochu School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China School of Artificial Intelligence Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei China Faculty of Technology Bielefeld University Bielefeld Germany

Despite that the surrogate-assisted evolutionary algorithms have achieved great success in addressing expensive optimization problems, they still suffer from stiff challenges when the number of dimensions of problems becomes large. The primary reason lies in that it is very hard to build an acceptable surrogate model in the high-dimensional search space with small amounts of evaluated historical data in evolution. To tackle this issue, we suggest an effective surrogate modeling method for large-scale expensive optimization in this paper, where the models are built on a number of linear subspaces instead of the original search space. Specifically, a linear subspace is constructed by a pair of points/solutions which are generated based on the set of elite solutions. For each linear subspace, several historical solutions are first associated according to their distance to the linear subspace, and then a surrogate model is trained by the associated solutions and used to evaluate the offspring. To ensure the exploration and exploitation capacity of the proposed method, these linear subspaces and the surrogate models are updated after a few iterations. Experimental results on CEC’2010 and CEC’2013 single-objective optimization problems with up to 1500 decision variables show that the proposed algorithm is superior over six comparison algorithms. Moreover, we also extend the proposed algorithm to multi-objective optimization problems and verified its competitiveness on problems with up to 1500 decision variables. IEEE

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving Speaker Verification Back-End with Graph Neural Networks

引用

Journal of Shanghai Jiaotong University (Science) 2025年 1-9页

作者： Chen, Jinfeng Fang, Zhihua He, Liang School of Computer Science and Technology Xinjiang University Urumqi830017 China Xinjiang Key Laboratory of Signal Detection and Processing Urumqi830017 China School of Intelligence Science and Technology Xinjiang University Urumqi830017 China Department of Electronic Engineering Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China

Currently, research on speaker verification tasks is primarily concentrated on enhancing deep speaker models to extract high-quality speaker embeddings. Nevertheless, this speaker embeddings can be regarded as potential graph structures. Therefore, this paper introduces a graph neural network-based speaker verification back-end approach, treating the speaker embeddings derived from the front-end as graph structures and leveraging graph neural networks to uncover the relationships among embeddings, thereby achieving superior-quality speaker embeddings. In addition, we propose a group updating method to solve the problem of memory overflow when the number of nodes is excessive. Extensive experiments and ablation studies were carried out on the VoxCeleb dataset, and the experimental outcomes validate the effectiveness of our proposed graph neural network speaker back-end in significantly boosting the performance of speaker verification systems. (Figure presented.) © Shanghai Jiao Tong University 2025.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：