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

SatCooper: Enhancing Cooperative Inference Analytics for Satellite Service via Multi-exit DNNs

IEEE Transactions on Mobile Computing 2025年

作者： Zhang, Qiyang Wang, Shangguang Guan, Jinglong Donta, Praveen Kumar Ma, Xiao Prasad, RangaRao Venkatesha Dustdar, Schahram Liu, Xuanzhe Peking University School of Computer Science Beijing100871 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing China Stockholm University Department of Computer and Systems Sciences Kista16455 Sweden Beiyou Shenzhen Institute Shenzhen China Netherlands TU Wien Distributed System Group Wien1040 Austria UPF Barcelona Spain

As a key technology of intelligent satellite-enabled services in B5G or 6G networks, deploying Deep Neural Networks (DNN) models on satellites has been a notable trend, catering to the daily demand for extensive computing-intensive and latency-sensitive tasks. The computing resources are strategically deployed on satellites where sensor data is generated or collected, facilitating the fine-grained computational inference of DNN-based tasks. However, no prior study has comprehensively explored the crucial inference challenges-e.g., the trade-off between the number of tasks completed and accuracy and partitioning models in multi-exit models-in the resource-constrained space environment. Effective scheduling frameworks cater to various streams of inference tasks are scarce because inference performance may deviate from the ideal situation due to changes in task system status, such as task profiles and network state. To this end, we first formulate a gain-aware in-orbit computing inference problem to strike a proper trade-off between inference latency and the number of tasks completed by dynamically selecting optimal early exit points and model partitioning points. We propose an offline dynamic programming-based algorithm that provides an effective solution when comprehensive system details are to be predicted. We have developed an online learning-based method to schedule inference tasks with uncertain and dynamic system statuses in real-world situations. Our evaluation shows that, compared to baseline methods, the online learning-based algorithm can improve task gain by an average of 87.3% across various tasks. © 2002-2012 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Towards Intelligent Transportation with Pedestrians and Vehicles In-the-Loop: A Surveillance Video-Assisted Federated Digital Twin Framework

arXiv

引用

arXiv 2025年

作者： Li, Xiaolong Wei, Jianhao Wang, Haidong Dong, Li Chen, Ruoyang Yi, Changyan Cai, Jun Niyato, Dusit Shen, Xuemin The Xiangjiang Laboratory Hunan Provincial General University Key Laboratory of IoT Intelligent Sensing and Distributed Collaborative Optimization Hunan University of Technology and Business Changsha410205 China The College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics China The Department of Electrical and Computer Engineering University of Concordia Montreal Canada The College of Computing and Data Science Nanyang Technological University Singapore The Department of Electrical and Computer Engineering University of Waterloo Canada

In intelligent transportation systems (ITSs), incorporating pedestrians and vehicles in-the-loop is crucial for developing realistic and safe traffic management solutions. However, there is falls short of simulating complex real-world ITS scenarios, primarily due to the lack of a digital twin implementation framework for characterizing interactions between pedestrians and vehicles at different locations in different traffic environments. In this article, we propose a surveillance video assisted federated digital twin (SV-FDT) framework to empower ITSs with pedestrians and vehicles in-the-loop. Specifically, SVFDT builds comprehensive pedestrian-vehicle interaction models by leveraging multi-source traffic surveillance videos. Its architecture consists of three layers: (i) the end layer, which collects traffic surveillance videos from multiple sources;(ii) the edge layer, responsible for semantic segmentation-based visual understanding, twin agent-based interaction modeling, and local digital twin system (LDTS) creation in local regions;and (iii) the cloud layer, which integrates LDTSs across different regions to construct a global DT model in realtime. We analyze key design requirements and challenges and present core guidelines for SVFDT’s system implementation. A testbed evaluation demonstrates its effectiveness in optimizing traffic management. Comparisons with traditional terminal-server frameworks highlight SV-FDT’s advantages in mirroring delays, recognition accuracy, and subjective evaluation. Finally, we identify some open challenges and discuss future research directions. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

The Security and Privacy of Mobile Edge Computing: An Artificial Intelligence Perspective

arXiv

引用

arXiv 2024年

作者： Wang, Cheng Yuan, Zenghui Zhou, Pan Xu, Zichuan Li, Ruixuan Wu, Dapeng Oliver Hubei Engineering Research Center on Big Data Security Key Laboratory of Distributed System Security of Hubei Province School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Software The Key Laboratory for Ubiquitous Network Service Software of Liaoning Province Dalian University of Technology Dalian116024 China Intelligent and Distributed Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science City University of Hong Kong Kowloon999077 Hong Kong

Mobile Edge Computing (MEC) is a new computing paradigm that enables cloud computing and information technology (IT) services to be delivered at the network’s edge. By shifting the load of cloud computing to individual local servers, MEC helps meet the requirements of ultralow latency, localized data processing, and extends the potential of Internet of Things (IoT) for end-users. However, the crosscutting nature of MEC and the multidisciplinary components necessary for its deployment have presented additional security and privacy concerns. Fortunately, Artificial Intelligence (AI) algorithms can cope with excessively unpredictable and complex data, which offers a distinct advantage in dealing with sophisticated and developing adversaries in the security industry. Hence, in this paper we comprehensively provide a survey of security and privacy in MEC from the perspective of AI. On the one hand, we use European Telecommunications Standards Institute (ETSI) MEC reference architecture as our based framework while merging the Software Defined Network (SDN) and Network Function Virtualization (NFV) to better illustrate a serviceable platform of MEC. On the other hand, we focus on new security and privacy issues, as well as potential solutions from the viewpoints of AI. Finally, we comprehensively discuss the opportunities and challenges associated with applying AI to MEC security and privacy as possible future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Consensus Control of Leader-Following Multi-Agent systems in Directed Topology With Heterogeneous Disturbances

引用

IEEE/CAA Journal of Automatica Sinica 2021年第2期8卷 423-431页

作者： Qinglai Wei Xin Wang Xiangnan Zhong Naiqi Wu the State Key Laboratory for Management and Control of Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190 the School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100049and also with Qingdao Academy of Intelligent IndustriesQingdao 266109China the Department of Computer and Electrical Engineering and Computer Science Florida Atlantic UniversityBoca Raton FL33431 USA the Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and SystemsMacao University of Science and TechnologyMacao 999078China

This paper investigates the consensus problem for linear multi-agent systems with the heterogeneous disturbances generated by the Brown *** main contribution is that a control scheme is designed to achieve the dynamic consensus for the multi-agent systems in directed topology interfered by stochastic *** traditional ways,the coupling weights depending on the communication structure are static.A new distributed controller is designed based on Riccati inequalities,while updating the coupling weights associated with the gain matrix by state errors between adjacent *** introducing time-varying coupling weights into this novel control law,the state errors between leader and followers asymptotically converge to the minimum value utilizing the local *** the Lyapunov directed method and It?formula,the stability of the closed-loop system with the proposed control law is *** simulation results conducted by the new and traditional schemes are presented to demonstrate the effectiveness and advantage of the developed control method.

关键词： Consensus control directed topology external disturbance multi-agent(MA)systems

来源：评论

学校读者我要写书评

暂无评论

A Primal-Dual SGD Algorithm for distributed Nonconvex Optimization

引用

IEEE/CAA Journal of Automatica Sinica 2022年第5期9卷 812-833页

作者： Xinlei Yi Shengjun Zhang Tao Yang Tianyou Chai Karl Henrik Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer ScienceKTH Royal Institute of Technologyand also affiliated with the Digital FuturesStockholm 10044Sweden Department of Electrical Engineering University of North TexasDentonTX 76203 USA IEEE State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819China

The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is *** problem is an important component of many machine learning techniques with data parallelism,such as deep learning and federated *** propose a distributed primal-dual stochastic gradient descent(SGD)algorithm,suitable for arbitrarily connected communication networks and any smooth(possibly nonconvex)cost *** show that the proposed algorithm achieves the linear speedup convergence rate O(1/(√nT))for general nonconvex cost functions and the linear speedup convergence rate O(1/(nT)) when the global cost function satisfies the Polyak-Lojasiewicz(P-L)condition,where T is the total number of *** also show that the output of the proposed algorithm with constant parameters linearly converges to a neighborhood of a global *** demonstrate through numerical experiments the efficiency of our algorithm in comparison with the baseline centralized SGD and recently proposed distributed SGD algorithms.

关键词： distributed nonconvex optimization linear speedup Polyak-Lojasiewicz(P-L)condition primal-dual algorithm stochastic gradient descent

来源：评论

学校读者我要写书评

暂无评论

Optimal Sensor Placement for Full-Set TDOA Localization Accounting for Sensor Location Errors

引用

IEEE Transactions on Aerospace and Electronic systems 2025年

作者： Zhang, Chengjie Han, Xinyang Kong, He Ho, K.C. Southern University of Science and Technology Shenzhen Key Laboratory of Control Theory and Intelligent Systems Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology Shenzhen518055 China University of Missouri Electrical Engineering and Computer Science Department ColumbiaMO65211 United States

The positioning accuracy of a signal source is influenced by where the sensors are deployed. Studies in the literature for the optimal sensor placement (OSP) of localization often ignore the presence of sensor position errors. In practice, however, it is impossible to place the sensors precisely at the desired locations. This work designs OSP by accounting for the presence of Gaussian sensor position errors that are independent and identically distributed (IID), with the full set of Time Difference of Arrival measurements corrupted by Gaussian IID noise. The criterion is the A-optimality equal to the trace of the source position Cramer-Rao Bound (CRB). We show that the presence of sensor position errors introduces a multiplication factor to the same criterion for the case without sensor position errors. The latter factor is dependent on the ratio of the sensor position error power to the range difference noise power but independent of the sensor positions, implying that the A-optimality OSP in the presence of sensor position errors is the same as in the absence. To our knowledge, this is the first time such results have been derived. Simulation studies validate the derived OSP, show the minimal OSP performance gap with sensor positioning error and without, and illustrate the better source localization accuracy by OSP. © 1965-2011 IEEE.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

Federated Online/Offline Remote Data Inspection for distributed Edge Computing

arXiv

引用

arXiv 2023年

作者： Ali, Mohammad Liu, Ximeng The Department of Mathematics and Computer Science Amirkabir University of Technology Tehran Iran The Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou350108 China

In edge computing environments, app vendors can cache their data to be shared with their users in many geographically distributed edge servers. However, the cached data is particularly vulnerable to several intentional attacks or unintentional events. Given the limited resources of edge servers and prohibitive storage costs incurred by app vendors, designing an efficient approach to inspect and maintain the data over tremendous edge servers is a critical issue. To tackle the problem, we design a novel data inspection approach, named O2DI, that provides the following services: i) using O2DI, app vendors can inspect the data cached in edge servers without having the original data, which reduces the incurred I/O and storage overhead significantly;ii) computational operations conducted by both edge servers and app vendors are highly efficient because of a novel online/offline technique;iii) many data files cached in different edge servers can be verified quickly and at once by using a novel batch verification method;iv) corrupted data in edge servers can be localized and repaired efficiently. We analyze the security and performance of O2DI. We see that it is secure in the random oracle model, much faster, and more cost-effective compared to state-of-the-art approaches. © 2023, CC BY.

关键词： Inspection

来源：评论

学校读者我要写书评

暂无评论

A fully decentralized auditing approach for edge computing: A Game-Theoretic Perspective

arXiv

引用

arXiv 2023年

作者： Seyedi, Zahra Rahmati, Farhad Ali, Mohammad Liu, Ximeng Department of Mathematics and Computer Science Amirkabir University of Technology Tehran Iran Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou350108 China

Edge storage presents a viable data storage alternative for application vendors (AV), offering benefits such as reduced bandwidth overhead and latency compared to cloud storage. However, data cached in edge computing systems is susceptible to intentional or accidental disturbances. This paper proposes a decentralized integrity auditing scheme to safeguard data integrity and counter the traditional reliance on centralized third-party auditors (TPA), which are unfit for distributed systems. Our novel approach employs edge servers (ES) as mutual auditors, eliminating the need for a centralized entity. This decentralization minimizes potential collusion with malicious auditors and biases in audit outcomes. Using a strategic game model, we demonstrate that ESs are more motivated to audit each other than TPAs. The auditing process is addressed as a Nash Equilibrium problem, assuring accurate integrity proof through incentives for ESs. Our scheme’s security and performance are rigorously assessed, showing it is secure within the random oracle model, offers improved speed, and is cost-effective compared to existing methods. © 2023, CC0.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of distributed Filtering under Mismatched Noise Covariances

arXiv

引用

arXiv 2024年

作者： Lyu, Xiaoxu Wen, Guanghui Shi, Ling Duan, Peihu Duan, Zhisheng The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong The Laboratory of Security Operation and Control for Intelligent Autonomous Systems Department of Systems Science School of Mathematics Southeast University Nanjing211189 China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden State Key Laboratory for Turbulence and Complex Systems Department of Mechanics and Engineering Science College of Engineering Peking University Beijing100871 China

This paper systematically investigates the performance of consensus-based distributed filtering under mismatched noise covariances. First, we introduce three performance evaluation indices for such filtering problems, namely the standard performance evaluation index, the nominal performance evaluation index, and the estimation error covariance. We derive difference expressions among these indices and establish one-step relations among them under various mismatched noise covariance scenarios. We particularly reveal the effect of the consensus fusion on these relations. Furthermore, the recursive relations are introduced by extending the results of the one-step relations. Subsequently, we demonstrate the convergence of these indices under the collective observability condition, and show this convergence condition of the nominal performance evaluation index can guarantee the convergence of the estimation error covariance. Additionally, we prove that the estimation error covariance of the consensus-based distributed filter under mismatched noise covariances can be bounded by the Frobenius norms of the noise covariance deviations and the trace of the nominal performance evaluation index. Finally, the effectiveness of the theoretical results is verified by numerical simulations. Copyright © 2024, The Authors. All rights reserved.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

HealthEdge: A Machine Learning-Based Smart Healthcare Framework for Prediction of Type 2 Diabetes in an Integrated IoT, Edge, and Cloud Computing System

引用

Procedia computer science 2023年 220卷 331-338页

作者： Alain Hennebelle Huned Materwala Leila Ismail Independent Researcher Melbourne Australia Intelligent Distributed Computing and Systems (INDUCE) Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University United Arab Emirates National Water and Energy Center United Arab Emirates University United Arab Emirates Cloud Computing and Distributed Systems (CLOUDS) Lab School of Computing and Information Systems The University of Melbourne Australia

Diabetes Mellitus has no permanent cure to date and is one of the leading causes of death globally. The alarming increase in diabetes calls for the need to take precautionary measures to avoid/predict the occurrence of diabetes. This paper proposes HealthEdge, a machine learning-based smart healthcare framework for type 2 diabetes prediction in an integrated IoT-edge-cloud computing system. Numerical experiments and comparative analysis were carried out between the two most used machine learning algorithms in the literature, Random Forest (RF) and Logistic Regression (LR), using two real-life diabetes datasets. The results show that RF predicts diabetes with 6% more accuracy on average compared to LR.

关键词： Artificial Intelligence (AI) Cloud Computing Diagnosis Digital Health Edge Computing eHealth Internet of Things (IoT) Logisitic Regression Machine Learning Prognosis Random Forest Risk Factors Smart Connected Healthcare Type 2 Diabetes Mellitus

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：