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

Air-Ground Collaborative Mobile Edge Computing:Architecture,Challenges,and Opportunities

China Communications 2024年第5期21卷 1-16页

作者： Qin Zhen He Shoushuai Wang Hai Qu Yuben Dai Haipeng Xiong Fei Wei Zhenhua Li Hailong College of Communications Engineering Army Engineering University of PLANanjing 210000China Department of Information and Communication Noncommissioned Officer Academy of PAPHangzhou 310000China Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information TechnologyNanjing 211106China College of Electronic and Information Engineering Nanjing University of Aeronautics and AstronauticsNanjing 211106China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China CMC Political and Law Commission Beijing100120China Xi’an Research Institute of High Technology Xi’an 710025China

By pushing computation,cache,and network control to the edge,mobile edge computing(MEC)is expected to play a leading role in fifth generation(5G)and future sixth generation(6G).Nevertheless,facing ubiquitous fast-growing computational demands,it is impossible for a single MEC paradigm to effectively support high-quality intelligent services at end user equipments(UEs).To address this issue,we propose an air-ground collaborative MEC(AGCMEC)architecture in this *** proposed AGCMEC integrates all potentially available MEC servers within air and ground in the envisioned 6G,by a variety of collaborative ways to provide computation services at their best for ***,we introduce the AGC-MEC architecture and elaborate three typical use ***,we discuss four main challenges in the AGC-MEC as well as their potential ***,we conduct a case study of collaborative service placement for AGC-MEC to validate the effectiveness of the proposed collaborative service placement ***,we highlight several potential research directions of the AGC-MEC.

关键词： air-ground architecture collaborative mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

PERIODICITY DECOUPLING FRAMEWORK FOR LONG-TERM SERIES FORECASTING 12

PERIODICITY DECOUPLING FRAMEWORK FOR LONG-TERM SERIES FORECA...

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Dai, Tao Wu, Beiliang Liu, Peiyuan Li, Naiqi Bao, Jigang Jiang, Yong Xia, Shu-Tao College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen China WeBank Institute of Financial Technology Shenzhen University China

Convolutional neural network (CNN)-based and Transformer-based methods have recently made significant strides in time series forecasting, which excel at modeling local temporal variations or capturing long-term dependencies. However, real-world time series usually contain intricate temporal patterns, thus making it challenging for existing methods that mainly focus on temporal variations modeling from the 1D time series directly. Based on the intrinsic periodicity of time series, we propose a novel Periodicity Decoupling Framework (PDF) to capture 2D temporal variations of decoupled series for long-term series forecasting. Our PDF mainly consists of three components: multi-periodic decoupling block (MDB), dual variations modeling block (DVMB), and variations aggregation block (VAB). Unlike the previous methods that model 1D temporal variations, our PDF mainly models 2D temporal variations, decoupled from 1D time series by MDB. After that, DVMB attempts to further capture short-term and long-term variations, followed by VAB to make final predictions. Extensive experimental results across seven real-world long-term time series datasets demonstrate the superiority of our method over other state-of-the-art methods, in terms of both forecasting performance and computational efficiency. Code is available at https://***/Hank0626/PDF. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Ant: An Efficient Lossless Compression Algorithm for IoT Time Series Data 21

Ant: An Efficient Lossless Compression Algorithm for IoT Tim...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Li, Junhui Xu, Guangping Yang, Hongzhang Wu, Yulei Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China University of Bristol Faculty of Science and Engineering Bristol United Kingdom

ISBN: (纸本)9798350329223

In various applications in Internet of Things like industrial monitoring, large amounts of floating-point time series data are generated at an unprecedented rate. Efficient compression algorithms can effectively reduce the size of data, enhance transmission performance and storage efficiency, and simultaneously lower storage costs. Therefore, there is a need for lightweight and efficient stream compression algorithms. In this paper, we propose a novel lossless floating-point data compression algorithm called Ant. The main idea is to encode double-precision floating-point numbers into integer form, calculate the delta between adjacent values, and then convert the delta into unsigned integers. This encoding method effectively reduces storage costs and improves data compression efficiency. Extensive experiments on real-world datasets demonstrate that our algorithm achieves compression speeds at least as fast as state-of-the-art streaming methods, and a 63% relative improvement in average compression rate. © 2023 IEEE.

关键词： Storage efficiency

来源：评论

学校读者我要写书评

暂无评论

M-DFCPP: A runtime library for multi-machine dataflow computing

M-DFCPP: A runtime library for multi-machine dataflow comput...

引用

作者： Luo, Qiuming Liu, Senhong Huang, Jinke Li, Jinrong College of Computer Science and Software Engineering Shenzhen University Shenzhen China SKT Group Guangdong Province Key Laboratory of Popular High-Performance Computers Shenzhen China SKT Group Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen China

This article designs and implements a runtime library for general dataflow programming, DFCPP (Luo Q, Huang J, Li J, Du Z. Proceedings of the 52nd International Conference on Parallel Processing Workshops. ACM;2023:145-152.), and builds upon it to design and implement a multi-machine C++ dataflow library, M-DFCPP. In comparison to existing dataflow programming environments, DFCPP features a user-friendly interface and richer expressive capabilities (Luo Q, Huang J, Li J, Du Z. Proceedings of the 52nd International Conference on Parallel Processing Workshops. ACM;2023:145-152.), enabling the representation of various types of dataflow actor tasks (static, dynamic and conditional task). Besides that, DFCPP addresses the memory management and task scheduling for non-uniform memory access architectures, while other dataflow libraries lack attention to these issues. M-DFCPP extends the capability of current dataflow runtime libraries (DFCPP, taskflow, openstream, etc.) and capable of multi-machine computing, while maintains the API compatible with DFCPP. M-DFCPP adopts the concepts of master and follower (Dean J, Ghemawat S. Commun ACM. 2008;51(1):107-113;Ghemawat S, Gobioff H, Leung ST. ACM SIGOPS Operating systems Review. ACM;2003:29-43.), which form a worksharing framework as many multi-machine system. To shift to the M-DFCPP framework, a filtering layer is inserted to the original DFCPP, transforming it into followers that can cooperate with each other. The master is made of modules for scheduling, data processing, graph partition, state management and so forth. In benchmark tests with workload with directed acyclic graph topology of binary trees and random graphs, DFCPP demonstrated performance improvements of 20% and 8%, respectively, compared to the second fastest library. M-DFCPP consistently exhibits outstanding performance across varying levels of concurrency and task workloads, achieving a maximum speedup of more than 20 over DFCPP, when the task parallelism e

关键词： Libraries

来源：评论

学校读者我要写书评

暂无评论

A Study of Data Augmentation for Imbalance Problem in Network Traffic 3

A Study of Data Augmentation for Imbalance Problem in Networ...

引用

3rd International Conference on Blockchain Technology and Information Security, ICBCTIS 2023

作者： Wang, Xu Sun, Shimin Han, Li School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Software Tiangong University Tianjin China School of Computer Science and Engineering Tianjin University of Technology National Engineering Laboratory for Computer Virus Prevention and Control Technology Tianjin China

ISBN: (纸本)9798350340402

The complexity and diversity of smart grid systems increase the likelihood of anomalies in communications between devices in the system, and how these anomalies are detected is critical to the security of the grid system. However, the distribution of traffic types in the grid is often highly unbalanced, with the total amount of normal traffic data often far outweighing the anomalous data. This imbalance compromises the effectiveness of the detection model and poses a significant threat to the overall security of the grid This paper improves on traditional conditional generation adversarial neural networks and designs a new approach to overcome this obstacle and enhance the security of smart grid systems. In the generator part, the spatial features of the data are captured by convolutional neural networks, and the temporal features of the data are captured by gated recurrent units. By integrating these two components into the generative network we can generate synthetic data with both temporal and spatial features, thus enhancing the minority class samples. By incorporating the augmented minority data into the training process, the proposed approach enables the detection model to understand the distribution of features of the minority anomaly samples more accurately. This improved learning accuracy translates into improved model performance, resulting in higher detection rates for Previously under-represented anomalies. In addition, our approach effectively addresses the inherent bias towards traffic types with higher flows typically observed in asymmetric datasets, thus providing a more equitable and comprehensive security solution for smart grid systems. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Graph-Based AU Relationship Learning for Facial Action Unit Detection

Spatial-Temporal Graph-Based AU Relationship Learning for Fa...

引用

2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Wang, Zihan Song, Siyang Luo, Cheng Zhou, Yuzhi Wu, Shiling Xie, Weicheng Shen, Linlin Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology China University of Leicester School of Computing and Mathematical Sciences United Kingdom

ISBN: (纸本)9798350302493

This paper presents our Facial Action Units (AUs) detection submission to the fifth Affective Behavior Analysis in-the-wild Competition (ABAW). Our approach consists of three main modules: (i) a pre-trained facial representation encoder which produce a strong facial representation from each input face image in the input sequence;(ii) an AU-specific feature generator that specifically learns a set of AU features from each facial representation;and (iii) a spatio-temporal graph learning module that constructs a spatio-temporal graph representation. This graph representation describes AUs contained in all frames and predicts the occurrence of each AU based on both the modeled spatial information within the corresponding face and the learned temporal dynamics among frames. The experimental results show that our approach outperformed the baseline and the spatio-temporal graph representation learning allows our model to generate the best results among all ablated systems. Our model ranks at the 4th place in the AU recognition track at the 5th ABAW Competition. Our code is publicly available at https://***/wzh125/ABAW-5. © 2023 IEEE.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Pose-guided feature region-based fusion network for occluded person re-identification

Pose-guided feature region-based fusion network for occluded...

引用

作者： 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)

来源：评论

学校读者我要写书评

暂无评论

A Memetic Algorithm Based Feature Weighting for Metabolomics Data Classification

引用

Chinese Journal of Electronics 2025年第4期23卷 706-711页

作者： Jiarui Zhou Zexuan Zhu Zhen Ji College of Biomedical Engineering and Instrument Science Zhejiang University Hangzhou China Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen China

A metaheuristic chain based memetic algorithm namely MCMA is proposed for the classification of metabolomics data. MCMA regards both global evolution and local search as equivalent elemental metaheuristics, and searches with a chain of metaheuristics performed alternatively on the target problem. A hidden Markov model based scheduling mechanism is employed in MCMA for the selection of metaheuristics. By using MCMA for optimizing the linkage weight vector, a feature weighting algorithm for metabolomics data is formed to identify relevant metabolite features and reveal their exact relationships with the given physiological states. An extreme learning machine based classifier is utilized in predicting the physiological states according to the weighted metabolite features. Experimental results on real metabolomics data of clinical liver transplantation demonstrate that the proposed feature weighting and classification method obtains better performance than the other compared algorithms.

关键词： Memetics Metabolomics Metaheuristics Urban areas Liver Prediction algorithms Search problems Physiology Vectors Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Instruct or Interact? Exploring and Eliciting LLMs' Capability in Code Snippet Adaptation Through Prompt engineering

Instruct or Interact? Exploring and Eliciting LLMs' Capabili...

引用

International Conference on software engineering (ICSE)

作者： Tanghaoran Zhang Yue Yu Xinjun Mao Shangwen Wang Kang Yang Yao Lu Zhang Zhang Yuxin Zhao College of Computer Science and Technology National University of Defense and Technology Changsha China Key Laboratory of Software Engineering for Complex System

ISBN: (数字)9798331505691

ISBN: (纸本)9798331505707

Code snippet adaptation is a fundamental activity in the software development process. Unlike code generation, code snippet adaptation is not a “free creation”, which requires developers to tailor a given code snippet in order to fit specific requirements and the code context. Recently, large language models (LLMs) have confirmed their effectiveness in the code generation task with promising results. However, their performance on code snippet adaptation, a reuse-oriented and context-dependent code change prediction task, is still unclear. To bridge this gap, we conduct an empirical study to investigate the performance and issues of LLMs on the adaptation task. We first evaluate the adaptation performances of three popular LLMs and compare them to the code generation task. Our result indicates that their adaptation ability is weaker than generation, with a nearly 15% decrease on pass@1 and more context-related errors. By manually inspecting 200 cases, we further investigate the causes of LLMs' sub-optimal performance, which can be classified into three categories, i.e., Unclear Requirement, Requirement Misalignment and Context Misapplication. Based on the above empirical research, we propose an interactive prompting approach to eliciting LLMs' ability on the adaptation task. Specifically, we enhance the prompt by enriching the context and decomposing the task, which alleviates context misapplication and improves requirement understanding. Besides, we enable LLMs' reflection by requiring them to interact with a human or a LLM counselor, compensating for unclear requirement. Our experimental result reveals that our approach greatly improve LLMs' adaptation performance. The best-performing Human-LLM interaction successfully solves 159 out of the 202 identified defects and improves the pass@1 and pass@5 by over 40% compared to the initial instruction-based prompt. Considering human efforts, we suggest multi-agent interaction as a trade-off, which can achieve comparable p

关键词： Bridges Codes Large language models Context awareness Reflection Prompt engineering software engineering software development management

来源：评论

学校读者我要写书评

暂无评论

An unsupervised deep learning framework for gene regulatory network inference from single-cell expression data

An unsupervised deep learning framework for gene regulatory ...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Mao, Guo Liu, Jie National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha410073 China National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Laboratory of Software Engineering for Complex System Changsha410073 China

ISBN: (纸本)9798350337488

Recent advances in single-cell RNA sequencing (scRNA-seq) technology provides unprecedented opportunities for reconstruction gene regulation networks (GRNs). At present, many different models have been proposed to infer GRN from a large number of RNA-seq data, but most deep learning models use a priori gene regulatory network to infer potential GRNs. It is a challenge to reconstruct GRNs from scRNA-seq data due to the noise and sparsity introduced by the dropout effect. Here, we propose GAALink, a novel unsupervised deep learning method. It first constructs the gene similarity matrix and then refines it by threshold value. It then learns feature representations of genes through a graphical attention autoencoder that propagates information across genes with different weights. Finally, we use gene feature expression for matrix completion such that the GRNs are reconstructed. Compared with seven existing GRNs reconstruction methods, GAALink achieves more accurate performance on seven scRNA-seq dataset with four ground truth networks. GAALink can provide a useful tool for inferring GRNs for scRNA-seq expression data. © 2023 IEEE.

关键词： Feature representations Gene similarity matrix Graphical attention autoencoder Matrix completion Unsupervised deep learning method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：