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

Auction Theory and Game Theory Based Pricing of Edge computing Resources: A Survey

IEEE Internet of Things Journal 2025年

作者： Yu, Jiguo Liu, Shun Zou, Yifei Wang, Guijuan Hu, Chunqiang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Qufu Normal University School of Computer Science Shandong Rizhao China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250353 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

The proliferation of Internet of Things (IoT) devices and edge computing applications has heightened the demand for efficient resource allocation and pricing mechanisms. Effective pricing strategies play a crucial role in optimizing resource utilization, reducing latency, and ensuring fair resource distribution among users. Both auction theory and game theory have emerged as fundamental economic frameworks for designing pricing mechanisms in edge computing. This paper presents a comprehensive survey of pricing strategies that leverage both auction and game theory, systematically categorizing existing research based on auction mechanisms and game-theoretic models. Unlike previous surveys that focus solely on auction-based pricing, this work integrates game-theoretic perspectives, providing a holistic analysis of strategic interactions in edge computing resource allocation. Furthermore, we discuss key challenges, emerging trends, and future research directions aimed at enhancing efficiency, fairness, and privacy protection in cloud-edge collaborative computing environments. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Flow-Level Bandwidth Allocation on P4 Tofino Switch with In-Network DRL Inference

Flow-Level Bandwidth Allocation on P4 Tofino Switch with In-...

引用

International Conference on Artificial Intelligence in Information and Communication (ICAIIC)

作者： Muhammad Irfan Hang Hu Myung J. Lee Arslan Qadeer Yang G. Kim Kazi Ahmed Daiki Nobayashi Department of Electrical Engineering City College of New York New York NY USA School of Computing & Data Science Wentworth Institute of Technology Boston MA USA Department of Computer Engineering Technology NYCCT Brooklyn NY USA Department of Electrical & Computer Engineering Technology NYIT New York NY USA Department of Electrical and Electronic Engineering Kyushu Institute of Technology Fukuoka Japan

ISBN: (数字)9798331507022

ISBN: (纸本)9798331507039

The Software-Defined Networking (SDN) paradigm has significantly improved network efficiency by integrating machine learning (ML) capabilities into the control plane (CP). This integration allows adaptive management of network resources in response to dynamic traffic conditions. However, the significant geographical distance between the CP and data plane (DP) causes considerable round-trip latency, measured in milliseconds, which poses a major challenge to time-sensitive traffic. To address this challenge, our research proposes a novel in-network Reinforcement Learning (RL) inference framework. This framework extends programmability from the CP to the DP, enabling timely and precise control of network resources to meet the stringent Quality of Service (QoS) requirements of mission-critical applications. The in-network RL inference is implemented using match-action tables within the Protocol Independent Switch Architecture (PISA) framework in the DP and validated through hardware deployment of protocol-independent packet processors (P4). To allocate bandwidth precisely based on QoS requirements, a P4 meter extern is used to differentiate the unique demands of individual traffic flows. Our enhanced deep-deterministic policy gradient (eDDPG)-based RL inference achieves superior performance with minimal processing overhead, reducing latency by 88.7% and jitter by 89.1 % compared to systems without RL inference.

关键词： Protocols Program processors Process control Switches Quality of service Reinforcement learning Channel allocation Jitter Network resource management Software defined networking

来源：评论

学校读者我要写书评

暂无评论

From Missing Pieces to Masterpieces: Image Completion with Context-Adaptive Diffusion

arXiv

引用

arXiv 2025年

作者： Shamsolmoali, Pourya Zareapoor, Masoumeh Zhou, Huiyu Felsberg, Michael Tao, Dacheng Li, Xuelong Department of Computer Science University of York University of UK SCEE East China Normal University China Department of Electrical Engineering Shanghai Jiao Tong University China School of Computing and Mathematical Sciences University of Leicester United Kingdom Computer Vision Laboratory Linkoping University Sweden College of Computing and Data Science Nanyang Technological University Singapore of China Telecom China

Image completion is a challenging task, particularly when ensuring that generated content seamlessly integrates with existing parts of an image. While recent diffusion models have shown promise, they often struggle with maintaining coherence between known and unknown (missing) regions. This issue arises from the lack of explicit spatial and semantic alignment during the diffusion process, resulting in content that does not smoothly integrate with the original image. Additionally, diffusion models typically rely on global learned distributions rather than localized features, leading to inconsistencies between the generated and existing image parts. In this work, we propose ConFill, a novel framework that introduces a Context-Adaptive Discrepancy (CAD) model to ensure that intermediate distributions of known and unknown regions are closely aligned throughout the diffusion process. By incorporating CAD, our model progressively reduces discrepancies between generated and original images at each diffusion step, leading to contextually aligned completion. Moreover, ConFill uses a new Dynamic Sampling mechanism that adaptively increases the sampling rate in regions with high reconstruction complexity. This approach enables precise adjustments, enhancing detail and integration in restored areas. Extensive experiments demonstrate that ConFill outperforms current methods, setting a new benchmark in image completion. © 2025, CC BY-SA.

关键词： Photointerpretation

来源：评论

学校读者我要写书评

暂无评论

UniTSFace: unified threshold integrated sample-to-sample loss for face recognition 23

UniTSFace: unified threshold integrated sample-to-sample los...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Qiufu Li Xi Jia Jiancan Zhou Linlin Shen Jinming Duan National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and School of Computer Science University of Birmingham UK National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and Aqara Lumi United Technology Co. Ltd China School of Computer Science University of Birmingham UK and Alan Turing Institute UK

Sample-to-class-based face recognition models can not fully explore the cross-sample relationship among large amounts of facial images, while sample-to-sample-based models require sophisticated pairing processes for training. Furthermore, neither method satisfies the requirements of real-world face verification applications, which expect a unified threshold separating positive from negative facial pairs. In this paper, we propose a unified threshold integrated sample-to-sample based loss (USS loss), which features an explicit unified threshold for distinguishing positive from negative pairs. Inspired by our USS loss, we also derive the sample-to-sample based softmax and BCE losses, and discuss their relationship. Extensive evaluation on multiple benchmark datasets, including MFR, IJB-C, LFW, CFP-FP, AgeDB, and MegaFace, demonstrates that the proposed USS loss is highly efficient and can work seamlessly with sample-to-class-based losses. The embedded loss (USS and sample-to-class Softmax loss) overcomes the pitfalls of previous approaches and the trained facial model UniTSFace exhibits exceptional performance, outperforming state-of-the-art methods, such as CosFace, ArcFace, VPL, AnchorFace, and UNPG. Our code is available at https://***/CVI-SZU/UniTSFace.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Countering Eavesdroppers with Meta-learning-based Cooperative Ambient Backscatter Communications

arXiv

引用

arXiv 2023年

作者： Chu, Nam H. Van Huynh, Nguyen Nguyen, Diep N. Hoang, Dinh Thai Gong, Shimin Shu, Tao Dutkiewicz, Eryk Phan, Khoa T. School of Electrical and Data Engineering University of Technology Sydney Australia School of Computing Engineering and the Built Environment Edinburgh Napier University Edinburgh United Kingdom School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou China Department of Computer Science and Software Engineering Auburn University AuburnAL36849 United States School of Engineering and Mathematical Sciences Department of Computer Science and Information Technology La Trobe University Melbourne Australia

This article introduces a novel lightweight framework using ambient backscattering communications to counter eavesdroppers. In particular, our framework divides an original message into two parts. The first part, i.e., the active-transmit message, is transmitted by the transmitter using conventional RF signals. Simultaneously, the second part, i.e., the backscatter message, is transmitted by an ambient backscatter tag that backscatters upon the active signals emitted by the transmitter. Notably, the backscatter tag does not generate its own signal, making it difficult for an eavesdropper to detect the backscattered signals unless they have prior knowledge of the system. Here, we assume that without decoding/knowing the backscatter message, the eavesdropper is unable to decode the original message. Even in scenarios where the eavesdropper can capture both messages, reconstructing the original message is a complex task without understanding the intricacies of the message-splitting mechanism. A challenge in our proposed framework is to effectively decode the backscattered signals at the receiver, often accomplished using the maximum likelihood (MLK) approach. However, such a method may require a complex mathematical model together with perfect channel state information (CSI). To address this issue, we develop a novel deep meta-learning-based signal detector that can not only effectively decode the weak backscattered signals without requiring perfect CSI but also quickly adapt to a new wireless environment with very little knowledge. Simulation results show that our proposed learning approach, without requiring perfect CSI and complex mathematical model, can achieve a bit error ratio close to that of the MLK-based approach. They also clearly show the efficiency of the proposed approach in dealing with eavesdropping attacks and the lack of training data for deep learning models in practical scenarios. Copyright © 2023, The Authors. All rights reserved.

关键词： Backscattering

来源：评论

学校读者我要写书评

暂无评论

A nearly optimal distributed algorithm for computing the weighted girth

引用

Science China(Information Sciences) 2021年第11期64卷 80-94页

作者： Qiang-Sheng HUA Lixiang QIAN Dongxiao YU Xuanhua SHI Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology School of Computer Science and Technology Shandong University

computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle,is an important problem in network analysis. The problem for distributively computing girth in unweighted graphs has garnered lots of attention, but there are few studies in weighted graphs. In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, nc], where n is the number of vertices and c is a constant. The algorithm is devised under the standard synchronous CON GE S T model, which limits each vertex can only transfer O（log n） bits information along each incident edge in a round. The upper bound of the algorithm is O（n log2n） rounds. We also prove the lower bound for computing the weighted girth is ?（D + n/log n） where D is the hop diameter of the weighted graph. This means our distributed algorithm is optimal within a factor of O（log3n）.

关键词： distributed algorithms weighted girth \({\cal C}{\cal O}{\cal N}{\cal G}{\cal E}{\cal S}{\cal T}\) model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

Automatic and Robust Segmentation of Multiple Sclerosis Lesions with Convolutional Neural Networks

引用

Computers, Materials & Continua 2021年第1期66卷 977-991页

作者： H.M.Rehan Afzal Suhuai Luo Saadallah Ramadan Jeannette Lechner-Scott Mohammad Ruhul Amin Jiaming Li M.Kamran Afzal M.Kamran Afzal School of Electrical Engineering and Computing University of NewcastleCallaghanNSW 2308Australia Hunter Medical Research Institute New Lambton HeightsNSW 2305Australia Department of Neurology John Hunter HospitalNew Lambton HeightsNSW 2305Australia CSIRO Data61 MarsfieldNSW 2122Australia School of Computer Science and Technology Xiamen UniversityXiamen361005China

The diagnosis of multiple sclerosis(MS)is based on accurate detection of lesions on magnetic resonance imaging(MRI)which also provides ongoing essential information about the progression and status of the *** detection of lesions is very time consuming and lacks *** of the lesions are difficult to detect manually,especially within the grey *** paper proposes a novel and fully automated convolution neural network(CNN)approach to segment *** proposed system consists of two 2D patchwise CNNs which can segment lesions more accurately and *** first CNN network is implemented to segment lesions accurately,and the second network aims to reduce the false positives to increase *** system consists of two parallel convolutional pathways,where one pathway is concatenated to the second and at the end,the fully connected layer is replaced with *** routine MRI sequences T1-w,T2-w and FLAIR are used as input to the CNN,where FLAIR is used for segmentation because most lesions on MRI appear as bright regions and T1-w&T2-w are used to reduce MRI *** evaluated the proposed system on two challenge datasets that are publicly available from MICCAI and *** and qualitative evaluation has been performed with various metrics like false positive rate(FPR),true positive rate(TPR)and dice similarities,and were compared to current state-of-the-art *** proposed method shows consistent higher precision and sensitivity than other *** proposed method can accurately and robustly segment MS lesions from images produced by different MRI scanners,with a precision up to 90%.

关键词： Multiple sclerosis lesion segmentation automatic segmentation CNN automated tool lesion detection

来源：评论

学校读者我要写书评

暂无评论

Diffusion-based Dynamic Contract for Federated AI Agent Construction in Mobile Metaverses

arXiv

引用

arXiv 2025年

作者： Wen, Jinbo Kang, Jiawen Zhang, Yang Zhong, Yue Niyato, Dusit Xu, Jie Tang, Jianhang Yuen, Chau College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics China School of Automation Guangdong University of Technology China College of Computing and Data Science Nanyang Technological University Singapore Guangdong Provincial Key Laboratory of Future Networks of Intelligence The Chinese University of Hong Kong Shenzhen China State Key Laboratory of Public Big Data Guizhou University China School of Electrical and Electronics Engineering Nanyang Technological University Singapore

Mobile metaverses have attracted significant attention from both academia and industry, which are envisioned as the next-generation Internet, providing users with immersive and ubiquitous metaverse services through mobile devices. Driven by Large Language Models (LLMs) and Vision-Language Models (VLMs), Artificial Intelligence (AI) agents hold the potential to empower the creation, maintenance, and evolution of mobile metaverses. Currently, AI agents are primarily constructed using cloud-based LLMs and VLMs. However, several challenges hinder their effective implementation, including high service latency and potential sensitive data leakage during perception and processing. In this paper, we develop an edge-cloud collaboration-based federated AI agent construction framework in mobile metaverses. Specifically, Edge Servers (ESs), acting as agent infrastructures, collaboratively create agent modules in a distributed manner. The cloud server then integrates these modules into AI agents and deploys them at the edge, thereby enabling low-latency AI agent services for users. Considering that ESs may exhibit dynamic levels of willingness to participate in federated AI agent construction, we design a two-period dynamic contract model to continuously motivate ESs to participate in agent module creation, effectively addressing the dynamic information asymmetry between the cloud server and the ESs. Furthermore, we propose an Enhanced Diffusion Model-based Soft Actor-Critic (EDMSAC) algorithm to efficiently generate optimal dynamic contracts, in which dynamic structured pruning is applied to DM-based actor networks to enhance denoising efficiency and policy learning performance. Extensive simulations demonstrate the effectiveness and superiority of the EDMSAC algorithm and the proposed contract model. Copyright © 2025, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

QoS Optimization via Computation Offloading in Metaverse Environment

QoS Optimization via Computation Offloading in Metaverse Env...

引用

IEEE International Conference on Web Services (ICWS)

作者： Zhiyuan Ge Pengcheng Zhang Huiying Jin Hai Dong Shunhui Ji Jiajia Li Qi Wang Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China College of Computer Science and Software Engineering Hohai University Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computing Technologies RMIT University Melbourne Australia

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

The emergence of the metaverse signifies a paradigm shift in Internet technology, offering a comprehensive virtual social platform spanning various domains such as social interaction, gaming, healthcare, and tourism. This new era of the metaverse is facilitated by advancements in next-generation digital technologies including edge computing, artificial intelligence, virtual reality, augmented reality, and blockchain. In the metaverse, the quantity and variety of services requested by users may surpass those in other environments, and existing work cannot be applied to metaverse QoS (Quality of Service) optimization. To address this problem, this paper proposes Meta-PPO, an optimization method for enhancing the QoS of metaverse services using reinforcement learning. Firstly, metaverse services are categorized into virtual scene services and meta-services, providing a comprehensive framework for analysis. Secondly, Meta-PPO, based on the proximal policy optimization algorithm, is introduced to optimize the QoS of metaverse services. This method effectively balances the objectives of minimizing average delay and maximizing resource utilization of mobile devices by making informed offloading decisions for the identified service categories. Simulation results demonstrate the superiority of the proposed method over existing techniques, showcasing its suitability and effectiveness for enhancing the QoS of metaverse service.

关键词： Metaverse Web services Simulation Optimization methods Quality of service Reinforcement learning Mobile handsets Delays Resource management Object recognition

来源：评论

学校读者我要写书评

暂无评论

Prompting Large Language Models for Zero-Shot Clinical Prediction with Structured Longitudinal Electronic Health Record data

arXiv

引用

arXiv 2024年

作者： Zhu, Yinghao Wang, Zixiang Gao, Junyi Tong, Yuning An, Jingkun Liao, Weibin Harrison, Ewen M. Ma, Liantao Pan, Chengwei Institute of Artificial Intelligence Beihang University Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China Centre for Medical Informatics University of Edinburgh Edinburgh United Kingdom Health Data Research UK London United Kingdom School of Computing National University of Singapore Singapore

The inherent complexity of structured longitudinal Electronic Health Records (EHR) data poses a significant challenge when integrated with Large Language Models (LLMs), which are traditionally tailored for natural language processing. Motivated by the urgent need for swift decision-making during new disease outbreaks, where traditional predictive models often fail due to a lack of historical data, this research investigates the adaptability of LLMs, like GPT-4, to EHR data. We particularly focus on their zero-shot capabilities, which enable them to make predictions in scenarios in which they haven’t been explicitly trained. In response to the longitudinal, sparse, and knowledge-infused nature of EHR data, our prompting approach involves taking into account specific EHR characteristics such as units and reference ranges, and employing an in-context learning strategy that aligns with clinical contexts. Our comprehensive experiments on the MIMIC-IV and TJH datasets demonstrate that with our elaborately designed prompting framework, LLMs can improve prediction performance in key tasks such as mortality, length-of-stay, and 30-day readmission by about 35%, surpassing ML models in few-shot settings. Our research underscores the potential of LLMs in enhancing clinical decision-making, especially in urgent healthcare situations like the outbreak of emerging diseases with no labeled data. The code is publicly available at https://***/yhzhu99/llm4healthcare for reproducibility. Copyright © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：