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

DQPS: An Intelligent Multi-Hop Computation Offloading Scheme for Workflow Applications in Vehicular Edge computing Networks

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Lin, Bing Chen, Qiaoxin Chen, Xing Jia, Wen-Kang Lu, Yu Xiong, Neal N. Fujian Normal University College of Physics and Energy Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China Peking University School of Computer Science 100871 China Xiamen University Department of Informatics and Communication Engineering Xiamen361005 China Fuzhou University College of Computer and Data Science Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China Fujian Normal University College of Photonic and Electronic Engineering Fuzhou350117 China Fujian Normal University Concord University College Fuzhou350117 China Sul Ross State University Department of Computer Mathematical and Physical Sciences AlpineTX79830 United States

Vehicular Edge computing (VEC) is a feasible solution for autonomous driving as it can offload latency-sensitive and computation-intensive tasks from vehicle terminals to roadside units (RSUs) for real-time processing. Due to the high computational resource the workflow applications (i.e., autonomous driving) required, the small vehicle-to-RSUs communication range, and the scarce available resources for each vehicle, it might be difficult to accomplish complex workflow applications through the single-hop offloading paradigm in the Internet of Vehicles (IoV). In this paper, we propose a reinforcement learning (RL) based multi-hop computation offloading scheme for workflow applications to reduce their execution latency in the VEC networks, which considers the data dependency in workflow applications as well as the trust relationship and communication interference among RSUs. Firstly, a preprocessing method is employed to merge the cut-edges in a workflow to reduce the offloading scale of tasks and compress the encoding dimension of offloading solutions. Then, a Deep Q-network algorithm using Phase-optimal State update (DQPS) is proposed to update the offloading policy distribution, in which the deviation of the phase-optimal state from the current state is estimated as the reward of RL to promote the algorithm's convergence to adapt the dynamic VEC networks. Simulation results show that DQPS has the best performance compared to other benchmark schemes. Moreover, the latency of the identical applications can be reduced by 2.5%-25.3% through our offloading scheme with a multi-hop model compared to that with the single-hop paradigm in IoV. © 1975-2011 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Counting Mobile Devices With Physical Layer Measurements in the 2.4GHz ISM Band

Counting Mobile Devices With Physical Layer Measurements in ...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted computing, UIC-ATC

作者： Zhaoyan Zhang Baoqi Huang Chaowei Zhang Bing Jia Wuyungerile Li Gang Xu Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Key Laboratory of Wireless Networking and Mobile Computing Hohhot China College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Power Marketing Service and Operation Management Center

In general, the more mobile devices are operating in space, the more wireless communications are produced, leading to significant changes in the wireless spectrum, which can be utilized to infer the number of mobile devices conversely. Inspired by this idea, we pioneered present a novel mobile device counting method of measuring the wireless signals of the 2. 4GHz ISM band in which most WiFi-and Bluetooth-enabled mobile devices operate. Precisely, the in-phase (I) and quadrature (Q) components from the wireless signals are measured through a software-defined radio (SDR) platform and are then converted into spectrograms. On this ground, we propose a dual attention network based on EfficientNet-B4 (EANet) to estimate the number of mobile devices with the aforementioned spectrograms as inputs. In addition, a cross-domain estimation method is proposed to enhance the generalizability of our model. Experiments are conducted in real environments to validate our method. It is shown that the proposed regression model EANet outperforms the models based on popular convolutional neural networks (CNNs), and the proposed cross-domain method can effectively reduce the training time without sacrificing the estimation accuracy. This study preliminarily verifies the idea’s feasibility and the validity of the proposed methods, paving the way for future research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A residual attention-based privacy-preserving biometrics model of transcriptome prediction from genome

A residual attention-based privacy-preserving biometrics mod...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Cheng Tian Song Liu Jinbao Li Guangchen Wang Luyue Kong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Department of Medicine Shandong Medical College Jinan China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Transcriptome prediction from genetic variation data is an important task in the privacy-preserving and biometrics field, which can better protect genomic data and achieve biometric recognition through transcriptome. Many transcriptome prediction methods have achieved good accuracy from genetic variation data. However, these traditional transcriptome prediction methods have the problems of linear assumption, overfitting, expose personal privacy, and extensive manual optimization. To solve these shortcomings, we propose an attention-based transcriptome prediction model from genetic variation named RATPM that improves the accuracy of transcriptome prediction and protects participant genomic data. In RATPM, we introduce and improve the deep learning model with multi-head self-attention into the transcriptome prediction stage of Predixcan, which uncovers the non-linear relationship between genetic variation and transcriptome. Moreover, we introduce a residual attention module to generate attention-aware features and extract more accurate features at different levels from genetic variation. Furthermore, we introduce the BERT pre-training module to encode genetic variation fully utilizing their contextual information. Our research enables scientific institutions to publish only predicted transcriptomic data for biometric purposes, thus protecting the genomic information of the subjects. Finally, we evaluated our model on the 1000 Genomes and Geuvadis projects datasets to compare with other baseline models.

关键词： Privacy Biometrics (access control) Biological system modeling Genomics Predictive models Feature extraction Gene expression

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yan Zeng ChengChuang Huang YiJie Ni ChunBao Zhou JiLin Zhang Jue Wang MingYao Zhou MeiTing Xue YunQuan Zhang School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory for Modeling and Simulation of Complex Systems Ministry of Education Hangzhou China Data Security Governance Zhejiang Engineering Research Center Hangzhou China School of ITMO Joint Institute Hangzhou Dianzi University Hangzhou China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing China HuaWei State Key Laboratory of Computer Architecture Institute of Computing Technology of the Chinese Academy of Sciences Beijing China

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network’s dataflow graph and device cluster’s topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

UAV-enabled Collaborative Beamforming via Multi-Agent Deep Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Liu, Saichao Sun, Geng Li, Jiahui Liang, Shuang Wu, Qingqing Wang, Pengfei Niyato, Dusit The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Information Science and Technology Northeast Normal University Changchun130117 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Technology Dalian University of Technology Dalian116024 China

In this paper, we investigate an unmanned aerial vehicle (UAV)-assistant air-to-ground communication system, where multiple UAVs form a UAV-enabled virtual antenna array (UVAA) to communicate with remote base stations by utilizing collaborative beamforming. To improve the work efficiency of the UVAA, we formulate a UAV-enabled collaborative beamforming multi-objective optimization problem (UCBMOP) to simultaneously maximize the transmission rate of the UVAA and minimize the energy consumption of all UAVs by optimizing the positions and excitation current weights of all UAVs. This problem is challenging because these two optimization objectives conflict with each other, and they are non-concave to the optimization variables. Moreover, the system is dynamic, and the cooperation among UAVs is complex, making traditional methods take much time to compute the optimization solution for a single task. In addition, as the task changes, the previously obtained solution will become obsolete and invalid. To handle these issues, we leverage the multi-agent deep reinforcement learning (MADRL) to address the UCBMOP. Specifically, we use the heterogeneous-agent trust region policy optimization (HATRPO) as the basic framework, and then propose an improved HATRPO algorithm, namely HATRPO-UCB, where three techniques are introduced to enhance the performance. Simulation results demonstrate that the proposed algorithm can learn a better strategy compared with other methods. Moreover, extensive experiments also demonstrate the effectiveness of the proposed techniques. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

CPSketch: A ‘Couple’ Sketch-based Heavy Flow Detection Method

引用

Journal of Network and Computer Applications 2025年

作者： Renpin Yao Yang Cao Yunhe Cui Yi Chen Chun Guo Guowei Shen Engineering Research Center of Text Computing & Cognitive Intelligence Guizhou University College of Computer Science and Technology Guizhou University State Key Laboratory of Public Big Data Guizhou University

One of the core challenges in network measurement for large-scale networks is the accurate and efficient identification of heavy flows. This task has grown increasingly complex due to limited memory resources and the dynamic nature of network traffic patterns. Most current heavy flow detection methods fail to fully consider the mutual collisions between large flows and their sparse distribution, which are caused by the combined effects of hash collisions and the heavy-tailed distribution of network traffic, resulting in an inefficient use of limited memory resources. Additionally, existing approaches uniformly treat all flows. As a result, when the network contains many small flows, heavy flows are frequently and erroneously replaced. To address these issues, we propose CPSketch, a novel method that combines sketch with ‘couple’ buckets to enhance heavy flows detection accuracy. CPSketch optimizes memory utilization by leveraging cold buckets to store more heavy flows. Specifically, it accurately estimates flow sizes by monitoring the number of matched packets for candidate flows in real-time. For small flows, CPSketch rapidly identifies and evicts them based on flow ratios. For other flows, CPSketch calculates replacement probabilities using multidimensional statistical information. To protect heavy flows that have been incorrectly evicted, CPSketch employs a global hash function to provide additional storage opportunities and dynamically constructs couple buckets for these heavy flows. Moreover, CPSketch extends the selection range for minimum flows by leveraging couple buckets in the flow replacement policy, effectively mitigating the impact of hash limitations and improving memory efficiency. Experimental results from trace-driven simulations and Open vSwitch (OVS) tests demonstrate that CPSketch outperforms existing methods in accuracy, even under constrained memory and high traffic loads. It achieves improvements of up to 14.74% in F1-score while reducing the

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous influence of individuals’ behavior on mask efficacy in gathering environments

引用

Frontiers of engineering Management 2022年第4期9卷 550-562页

作者： Haochen SUN Xiaofan LIU Zhanwei DU Ye WU Haifeng ZHANG Xiaoke XU College of Information and Communication Engineering Dalian Minzu UniversityDalian 116600China Web Mining Laboratory Department of Media and CommunicationCity University of Hong KongHong KongChina WHO Collaborating Centre for Infectious Disease Epidemiology and Control School of Public HealthLi Ka Shing Faculty of MedicineThe University of Hong KongHong KongChina Laboratory of Data Discovery for Health Hong Kong Science and Technology ParkHong KongChina Computational Communication Research Center Beijing Normal University(Zhuhai)Zhuhai 519087China School of Journalism and Communication Beijing Normal UniversityBeijing 100875China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical ScienceAnhui UniversityHefei 230601China

Wearing masks is an easy way to operate and popular measure for preventing *** masks can slow down the spread of viruses,their efficacy in gathering environments involving heterogeneous person-to-person contacts remains ***,we aim to investigate the epidemic prevention effect of masks in different real-life gathering *** study uses four real interpersonal contact datasets to construct four empirical networks to represent four gathering *** transmission of COVID-19 is simulated using the Monte Carlo simulation *** heterogeneity of individuals can cause mask efficacy in a specific gathering environment to be different from the baseline efficacy in general ***,the heterogeneity of gathering environments causes the epidemic prevention effect of masks to *** masks can greatly reduce the probability of clustered epidemics and the infection scale in primary schools,high schools,and ***,the use of masks alone in primary schools and hospitals cannot control *** high schools with social distancing between classes and in workplaces where the interpersonal contact is relatively sparse,masks can meet the need for *** the heterogeneity of individual behavior,if individuals who are more active in terms of interpersonal contact are prioritized for mask-wearing,the epidemic prevention effect of masks can be ***,asymptomatic infection has varying effects on the prevention effect of masks in different *** effect can be weakened or eliminated by increasing the usage rate of masks in high schools and ***,the effect on primary schools and hospitals cannot be *** study contributes to the accurate evaluation of mask efficacy in various gathering environments to provide scientific guidance for epidemic prevention.

关键词： COVID-19 masks behavioral heterogeneity asymptomatic infection

来源：评论

学校读者我要写书评

暂无评论

Federated Digital Twin Construction via Distributed Sensing: A Game-Theoretic Online Optimization with Overlapping Coalitions

arXiv

引用

arXiv 2025年

作者： Chen, Ruoyang Yi, Changyan Zhou, Fuhui Kang, Jiawen Wu, Yuan Niyato, Dusit College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China College of Electronic and Information Engineering Nanjing University of Astronautics and Aeronautics Nanjing210016 China School of Automation Guangdong University of Technology Guangzhou510006 China State Key Laboratory of Internet of Things for Smart City University of Macau China Department of Computer and Information Science University of Macau China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

In this paper, we propose a novel federated framework for constructing the digital twin (DT) model, referring to a living and self-evolving visualization model empowered by artificial intelligence, enabled by distributed sensing under edge-cloud collaboration. In this framework, the DT model to be built at the cloud is regarded as a global one being split into and integrating from multiple functional components, i.e., partial-DTs, created at various edge servers (ESs) using feature data collected by associated sensors. Considering time-varying DT evolutions and heterogeneities among partial-DTs, we formulate an online problem that jointly and dynamically optimizes partial-DT assignments from the cloud to ESs, ES-sensor associations for partial-DT creation, and as well as computation and communication resource allocations for global-DT integration. The problem aims to maximize the constructed DT’s model quality while minimizing all induced costs, including energy consumption and configuration costs, in long runs. To this end, we first transform the original problem into an equivalent hierarchical game with an upper-layer two-sided matching game and a lower-layer overlapping coalition formation game. After analyzing these games in detail, we apply the Gale-Shapley algorithm and particularly develop a switch rules-based overlapping coalition formation algorithm to obtain short-term equilibria of upper-layer and lower-layer subgames, respectively. Then, we design a deep reinforcement learning-based solution, called DMO, to extend the result into a long-term equilibrium of the hierarchical game, thereby producing the solution to the original problem. Simulations show the effectiveness of the introduced framework, and demonstrate the superiority of the proposed solution over counterparts. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

DRLO: Optimizing edge server placement in dynamic MEC scenarios using deep reinforcement learning

引用

Computer Networks 2025年 268卷

作者： Guo, Yingya Chen, Cen College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian China

As an emerging computing paradigm, Mobile Edge computing (MEC) significantly enhances user experience and alleviates network congestion by strategically deploying edge servers in close proximity to mobile users. However, the effectiveness of MEC hinges on the precise placement of these edge servers, a critical factor in determining the Quality of Experience (QoE) for mobile users. While existing studies predominantly focus on optimizing edge server placement in static scenarios, they often fall short when faced with user mobility, resulting in a degradation of QoE. To address this challenge, we propose an adaptive edge server placement approach that leverages Deep Reinforcement Learning (DRL) to select the base stations for placing edge servers in a dynamic MEC environment. Our objective is to minimize access delay by optimizing edge server placement for adapting to dynamic environment. To tackle the vast action space associated with edge server placement, we introduce a novel activation function in the actor neural network for efficient exploration. Furthermore, to enhance the adaptability of the derived edge server placement strategy, we meticulously design a new reward function, which takes into account the minimization of total access delay within dynamic MEC scenarios. Finally, to validate the effectiveness of our proposed method, extensive experiments were conducted using the Shanghai Telecom dataset. The results demonstrate that our approach outperforms baseline methods in minimizing access delay for users in dynamic MEC scenarios. © 2025 Elsevier B.V.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

SED-MVS: Segmentation-Driven and Edge-Aligned Deformation Multi-View Stereo with Depth Restoration and Occlusion Constraint

arXiv

引用

arXiv 2025年

作者： Yuan, Zhenlong Yang, Zhidong Cai, Yujun Wu, Kuangxin Liu, Mufan Zhang, Dapeng Jiang, Hao Li, Zhaoxin Wang, Zhaoqi The Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Australia The Information Technology Department Hunan Police Academy Changsha410100 China Cooperative MediaNet Innovation Center Shanghai Jiao Tong University Shanghai200240 China DSLAB School of Information Science & Engineering Lanzhou University 730000 China Agricultural Information Institute Chinese Academy of Agricultural Sciences Key Laboratory of Agricultural Big Data Ministry of Agriculture and Rural Affairs 100081 China

Recently, patch-deformation methods have exhibited significant effectiveness in multi-view stereo owing to the deformable and expandable patches in reconstructing textureless areas. However, such methods primarily emphasize broadening the receptive field in textureless areas, while neglecting deformation instability caused by easily overlooked edge-skipping, potentially leading to matching distortions. To address this, we propose SED-MVS, which adopts panoptic segmentation and multi-trajectory diffusion strategy for segmentation-driven and edge-aligned patch deformation. Specifically, to prevent unanticipated edge-skipping, we first employ SAM2 for panoptic segmentation as depth-edge guidance to guide patch deformation, followed by multi-trajectory diffusion strategy to ensure patches are comprehensively aligned with depth edges. Moreover, to avoid potential inaccuracy of random initialization, we combine both sparse points from LoFTR and monocular depth map from DepthAnything V2 to restore reliable and realistic depth map for initialization and supervised guidance. Finally, we integrate segmentation image with monocular depth map to exploit inter-instance occlusion relationship, then further regard them as occlusion map to implement two distinct edge constraint, thereby facilitating occlusion-aware patch deformation. Extensive results on ETH3D, Tanks & Temples, BlendedMVS and Strecha datasets validate the state-of-the-art performance and robust generalization capability of our proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：