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

Multi-user reinforcement learning based task migration in mobile edge computing

Frontiers of Computer Science 2024年第4期18卷 161-173页

作者： Yuya CUI Degan ZHANG Jie ZHANG Ting ZHANG Lixiang CAO Lu CHEN Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of TechnologyTianjin 300384China School of Internet of Things Engineering Jiangsu Vocational College of Information TechnologyWuxi 214153China School of Electronic and Information Engineering Beijing Jiaotong UniversityBeijing 100044China School of Sports Economics and Management Tianjin University of SportTianjin 301617China

Mobile Edge computing(MEC)is a promising *** service migration is a key technology in *** order to maintain the continuity of services in a dynamic environment,mobile users need to migrate tasks between multiple servers in real *** to the uncertainty of movement,frequent migration will increase delays and costs and non-migration will lead to service ***,it is very challenging to design an optimal migration *** this paper,we investigate the multi-user task migration problem in a dynamic environment and minimizes the average service delay while meeting the migration *** order to optimize the service delay and migration cost,we propose an adaptive weight deep deterministic policy gradient(AWDDPG)*** distributed execution and centralized training are adopted to solve the high-dimensional *** show that the proposed algorithm can greatly reduce the migration cost and service delay compared with the other related algorithms.

关键词： mobile edge computing mobility service migration deep reinforcement learning deep deterministic policy gradient

来源：评论

学校读者我要写书评

暂无评论

Offloading approach for mobile edge computing based on chaotic quantum particle swarm optimization strategy

引用

Journal of Ambient Intelligence and Humanized computing 2023年第10期14卷 14333-14347页

作者： Zhang, DeGan Sun, GuiXiang Zhang, Jie Zhang, Ting Yang, Peng Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin300384 China School of Sports Economics and Management Tianjin University of Sport Tianjin301617 China School of Electronics and Information Engineering Beijing Jiaotong University Beijing100093 China

With the development of 5 g, computing-intensive and complex applications in smart-city is growing rapidly. Due to the limited resources of mobile terminal devices in smart-city, new applications have higher requirements for delay, bandwidth, security, and energy consumption. Computation offloading in mobile edge computing (MEC) is effective to reduce delay and energy consumption of Real-time video analysis. An improved chaos quantum-behaved particle swarm optimization (ICQPSO) algorithm is proposed for multi-user and multi-MEC edge Computation offloading scenarios. Compared with other heuristic algorithms, the improved chaos quantum-behaved particle swarm optimization algorithm can effectively reduce the delay and energy consumption of edge computing offloading. Experimental results show that the improved chaotic quantum-behaved particle swarm optimization (ICQPSO) can effectively avoid premature convergence, has stronger global searchability, and can solve multi-dimensional complex NP-hard problems more efficiently. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parallel Inference for Large Model on Heterogeneous Clusters for High Throughput 29

Hybrid Parallel Inference for Large Model on Heterogeneous C...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Xu, Chaonong Kong, Weiming Liu, Min Zhang, Mingming Li, Chao Gong, Luqi Beijing Key Lab of Petroleum Data Mining Beijing China Institute of Intelligent Computing Zhejiang Lab Hangzhou China Bupt School of Computer Science National Pilot Software Engineering School Beijing China

ISBN: (纸本)9798350330717

In high-throughput intelligent computing scenarios, multi-device parallelism strategies based on data parallelism or pipeline parallelism have been extensively utilized to accelerate large deep neural network model inference. Data parallelism offers nearly linear improvement in inference speed, but it is limited by the memory capacity of a single device which constrains the model size. On the other hand, pipeline parallelism can support larger models, but the total communication of the activations among devices is high, which limits the improvement of the inference speed. To address the demand for efficient model inference in high-throughput heterogeneous scenarios, we proposes a hybrid parallelism strategy that combines data parallelism and pipeline parallelism. The strategy involves grouping heterogeneous device clusters and then employing inter-group data parallelism along with intra-group pipeline parallelism. Moreover, we propose an algorithm to find an optimal hybrid parallel inference strategy with maximum throughput. The control variables of the strategy includes the number of groups, group-device assignments and model partition ratios. Our experimental evaluation demonstrates that compared to PipeEdge, a pipeline parallel inference framework for heterogeneous cluster, our strategy can achieve 1.7× -3.4× acceleration in an 8-device heterogeneous cluster without loss of accuracy. © 2023 IEEE.

关键词： data parallelism heterogeneous cluster hybrid parallelism model inference pipeline parallelism

来源：评论

学校读者我要写书评

暂无评论

A Sentiment Classification Model Based on Syntactic Graph Attention Networks 24

A Sentiment Classification Model Based on Syntactic Graph At...

引用

2024 International Conference on intelligent Education and Computer Technology, IECT 2024

作者： Cheng, Yan Zhou, Ziwei School of Computer Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Prov. Key Lab. of Intelligent Information Processing and Affective Computing of Jiangxi Province 330022 China School of Software Jiangxi Normal University 330022 China

ISBN: (纸本)9798400709920

Text Sentiment Classification, a significant task in Natural Language Processing, aims to comprehend user needs and expectations by categorizing the sentiments of texts posted on platforms. Despite their utility, existing models for this task do not fully account for the influence of contextual and syntactic text features on sentiment classification. To address these issues, a text sentiment classification model based on syntactic graph attention network is proposed in this study. The model begins by extracting the contextual features of a sentence using BiGRU. It then generates a syntactic graph through a syntactic analyzer, using the contextual features as the node features of the syntactic graph. A syntactic graph attention network is constructed to extract the syntactic features of the syntactic graph. These feature vectors are then input into a softmax function to achieve text sentiment classification. Experimental results indicate that the proposed model outperforms similar models on two public datasets in terms of classification accuracy, thus demonstrating its effectiveness. © 2024 ACM.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Time Series Fusion Model for Predicting Electric power tools and equipment 6

Time Series Fusion Model for Predicting Electric power tools...

引用

6th International Conference on Robotics, intelligent Control and Artificial Intelligence, RICAI 2024

作者： Xue, Liang Ling, Xinghong Yang, Lei Yang, Yang Computing Science and Artificial Intelligence College Suzhou City University Suzhou China College of Computer Science and Software Engineering Hohai University Nanjing China Suzhou Key Lab of Multi-modal Data Fusion and Intelligent Healthcare Suzhou City University Suzhou China

ISBN: (纸本)9798331541699

To effectively address the issue of inadequate accuracy and timeliness in industrial data classification, this paper proposes a fusion classification model based on time series (DT-RF-MLP) for loss prediction of electrical work equipment. Firstly, data information is extracted from the dataset and features are constructed based on the data information to enhance the diversity of data features. Secondly, redundant and highly correlated features are removed by quantifying the correlation degree between the features to simplify the model inputs. On this basis, a fusion classification model is constructed and comparative experiments are conducted with a single model to validate the advantages of the fusion model in terms of prediction performance. The experimental results demonstrate that the model markedly enhances prediction accuracy while concurrently reducing the duration of the model run. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

VisioSLR: A Vision Data-Driven Framework for Sign Language Video Recognition and Performance Evaluation on Fine-Tuned YOLO Models

引用

Procedia Computer Science 2025年 257卷 85-92页

作者： Leila Ismail Nada Shahin Henok Tesfaye Alain Hennebelle Intelligent Distributed Computing and Systems (INDUCE) Lab Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University United Arab Emirates Independent Researcher

With the emergence of AI for good, there has been an increasing interest in building computer vision data-driven deep learning inclusive AI solutions. Sign language Recognition (SLR) has gained attention recently. It is an essential component of a sign-to-text translation system to support the deaf and hard-of-hearing population. This paper presents a computer VISIOn data-driven deep learning framework for Sign Language video Recognition (VisoSLR). VisioSLR provides a precise measurement of translating signs for developing an end-to-end computational translation system. Considering the scarcity of sign language datasets, which hinders the development of an accurate recognition model, we evaluate the performance of our framework by fine-tuning the very well-known YOLO models, which are built from a signs-unrelated collection of images and videos, using a small-sized sign language dataset. Gathering a sign language dataset for signs training would involve an enormous amount of time to collect and annotate videos in different environmental setups and multiple signers, in addition to the training time of a model. Numerical evaluations of VisioSLR show that our framework recognizes signs with a mean average precision of 97.4%, 97.1%, and 95.5% and 11, 12, and 12 milliseconds of recognition time on YOLOv8m, YOLOv9m, and YOLOv11m, respectively.

关键词： Artificial intelligence Computer vision Deep learning Fine-tuning Machine translation Neural machine translation Sign language Sign language recognition Transfer learning YOLO

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1899-1912页

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points. Our code is available at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spatial clustering

Adaptively feature matching via joint transformational-spati...

引用

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

来源：评论

学校读者我要写书评

暂无评论

FLIP-80M: 80 Million Visual-Linguistic Pairs for Facial Language-Image Pre-Training 24

FLIP-80M: 80 Million Visual-Linguistic Pairs for Facial Lang...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Li, Yudong Hou, Xianxu Dezhi, Zheng Shen, Linlin Zhao, Zhe School of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of AI and Advanced Computing Xi'an Jiaotong-Liverpool University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Tencent AI Lab Beijing China

ISBN: (纸本)9798400706868

While significant progress has been made in multi-modal learning driven by large-scale image-text datasets, there is still a noticeable gap in the availability of such datasets within the facial domain. To facilitate and advance the field of facial representation learning, we present FLIP-80M, a large-scale visual-linguistic dataset comprising over 80 million face images paired with text descriptions. FLIP-80M is constructed by leveraging the large openly available image-text-pair dataset LAION-5B and a mixed-method approach to filter face-related pairs from both visual and linguistic perspectives. Our curation process involves face detection, face caption classification, text de-noising, and synthesis-based image augmentation. As a result, FLIP-80M stands as the largest face-text dataset to date. To evaluate the potential of our dataset, we fine-tune the CLIP model using the proposed FLIP-80M, to create FLIP (Facial Language-Image Pretraining) and assess its representation capabilities across various downstream tasks. Our experiments demonstrate that our FLIP model achieves state-of-the-art results in a range of face analysis tasks, including face parsing, face alignment, and face attribute classification. The dataset and models are available at https://***/ydli-ai/FLIP. © 2024 ACM.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Geometric Latent Diffusion Model for Graph Generation 41

Hyperbolic Geometric Latent Diffusion Model for Graph Genera...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Fu, Xingcheng Gao, Yisen Wei, Yuecen Sun, Qingyun Peng, Hao Li, Jianxin Li, Xianxian Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

Diffusion models have made significant contributions to computer vision, sparking a growing interest in the community recently regarding the application of them to graph generation. Existing discrete graph diffusion models exhibit heightened computational complexity and diminished training efficiency. A preferable and natural way is to directly diffuse the graph within the latent space. However, due to the non-Euclidean structure of graphs is not isotropic in the latent space, the existing latent diffusion models effectively make it difficult to capture and preserve the topological information of graphs. To address the above challenges, we propose a novel geometrically latent diffusion framework HypDiff. Specifically, we first establish a geometrically latent space with interpretability measures based on hyperbolic geometry, to define anisotropic latent diffusion processes for graphs. Then, we propose a geometrically latent diffusion process that is constrained by both radial and angular geometric properties, thereby ensuring the preservation of the original topological properties in the generative graphs. Extensive experimental results demonstrate the superior effectiveness of HypDiff for graph generation with various topologies. Copyright 2024 by the author(s)

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：