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

Cost-Optimized Task Offloading for Dependent Applications in Collaborative Edge and Cloud Computing

IEEE Internet of Things Journal 2025年第9期12卷 12975-12988页

作者： Yuan, Haitao Hu, Qinglong Wang, Shen Bi, Jing Buyya, Rajkumar Lu, Jinhu Yang, Jinhong Zhang, Jia Zhou, MengChu Beihang University School of Automation Science and Electrical Engineering Beijing100191 China City University of Hong Kong Department of Computer Science Kowloon Tong Hong Kong Beijing University of Technology School of Software Engineering Faculty of Information Technology Beijing100124 China Laboratory School of Computing and Information Systems MelbourneVIC3010 Australia CSSC Systems Engineering Research Institute Beijing100036 China Southern Methodist University Lyle School of Engineering Department of Computer Science DallasTX75205 United States New Jersey Institute of Technology Department of Electrical and Computer Engineering NewarkNJ07102 United States

A collaborative system that includes mobile devices (MDs), edge nodes (ENs), and the cloud is needed where ENs at the network edge can run offloaded tasks of MDs with limited resources and energy for timely processing for latency-sensitive applications. Unlike existing studies, we formulate a total cost minimization problem for the system for applications, which can be divided into several interdependent subtasks. Each subtask can be executed in MDs, ENs, and the cloud. This work formulates a mixed-integer nonlinear program to minimize the total system cost. To address it, a novel meta-heuristic optimization algorithm called Genetic Simulated-annealing-based Particle swarm optimization with Auto-Encoder (GSPAE) is proposed, which innovatively combines feature extraction of deep learning and global search of meta-heuristic optimization. Genetic operations provide diverse solutions, the Metropolis acceptance of annealing offers a robust global search, and autoencoders (AEs) extract distribution characteristics of particles toward high-quality regions for fast convergence. Thus, GSPAE optimizes the associations between ENs and MDs and the scheduling of subtasks among MDs, ENs, and the cloud. Experiments with large-scale Google cluster datasets show that compared to state-of-the-art benchmark methods, GSPAE reduces the total cost by at least 17% while strictly meeting limits of application latency, available energy, computing, and communication resources of ENs and MDs. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

An interaction-fair semi-decentralized trajectory planner for connected and autonomous vehicles

引用

Autonomous Intelligent systems 2025年第1期5卷 1-20页

作者： Liu, Zhengqin Lei, Jinlong Yi, Peng Hong, Yiguang Department of Control Science and Engineering Tongji University Shanghai201804 China The Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201804 China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai201804 China

Lately, there has been a lot of interest in game-theoretic approaches to the trajectory planning of autonomous vehicles (AVs). But most methods solve the game independently for each AV while lacking coordination mechanisms, and hence result in redundant computation and fail to converge to the same equilibrium, which presents challenges in computational efficiency and safety. Moreover, most studies rely on the strong assumption of knowing the intentions of all other AVs. This paper designs a novel autonomous vehicle trajectory planning approach to resolve the computational efficiency and safety problems in uncoordinated trajectory planning by exploiting vehicle-to-everything (V2X) technology. Firstly, the trajectory planning for connected and autonomous vehicles (CAVs) is formulated as a game with coupled safety constraints. We then define the interaction fairness of the planned trajectories and prove that interaction-fair trajectories correspond to the variational equilibrium (VE) of this game. Subsequently, we propose a semi-decentralized planner for the vehicles to seek VE-based fair trajectories, in which each CAV optimizes its individual trajectory based on neighboring CAVs’ information shared through V2X, and the roadside unit takes the role of updating multipliers for collision avoidance constraints. The approach can significantly improve computational efficiency through parallel computing among CAVs, and enhance the safety of planned trajectories by ensuring equilibrium concordance among CAVs. Finally, we conduct Monte Carlo experiments in multiple situations at an intersection, where the empirical results show the advantages of SVEP, including the fast computation speed, a small communication payload, high scalability, equilibrium concordance, and safety, making it a promising solution for trajectory planning in connected traffic scenarios. To the best of our knowledge, this is the first study to achieve semi-distributed solving of a game with coupled constr

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Optimizing task scheduling in cloud environments: a hybrid golden search whale optimization algorithm approach

引用

Neural Computing and Applications 2025年 1-23页

作者： Acharya, Biswaranjan Panda, Sucheta Das, Satyabrata Majhi, Santosh Kumar Gerogiannis, Vassilis C. Kanavos, Andreas Department of Computer Science and Engineering Veer Surendra Sai University of Technology Odisha Burla India Bilaspur India Department of Digital Systems University of Thessaly Larissa Greece Department of Informatics Ionian University Corfu Greece

Managing fluctuating workloads and optimizing resource utilization in cloud environments pose significant challenges, particularly in fields requiring real-time data processing, such as healthcare. This paper introduces a novel hybrid metaheuristic technique, the Golden Search Whale Optimization Algorithm (GSWOA), specifically designed for scheduling independent dynamic biomedical data. GSWOA merges the strengths of Golden Search Optimization (GSO) and Whale Optimization Algorithm (WOA), optimizing numerical function optimization and achieving a balance between exploration and exploitation. The algorithm’s effectiveness was assessed using MATLAB by applying standard benchmark functions and further evaluated on a real-world biomedical dataset within the CloudSim environment. The performance evaluations demonstrate that GSWOA significantly outperforms existing metaheuristic and traditional scheduling techniques, achieving a 42.71% increase in resource utilization and a 14.17% reduction in makespan compared to conventional methods. These results highlight GSWOA’s potential to enhance scheduling efficiency substantially in cloud computing infrastructures, suggesting it is a powerful tool for complex task allocations. Future research will explore the scalability of GSWOA and its applicability across other data-intensive sectors. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Clustering and Distribution Matching with Bandit Feedback

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2116-2139页

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y. F. Scarlett, Jonathan CNRS@CREATE DesCartes Program CREATE Tower 138602 Singapore National University of Singapore Department of Computer Science Queenstown119077 Singapore National University of Singapore School of Computing Department of Information Systems and Analytics Queenstown119077 Singapore National University of Singapore Department of Mathematics Department of Electrical and Computer Engineering Queenstown119077 Singapore Institute of Data Science National University of Singapore Department of Computer Science The Department of Mathematics Queenstown119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank-Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ vanishes. © 1963-2012 IEEE.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Abnormal event detection in surveillance videos through LSTM auto-encoding and local minima assistance

引用

Discover Internet of Things 2025年第1期5卷 1-25页

作者： Sengonul, Erkan Samet, Refik Abu Al-Haija, Qasem Alqahtani, Ali Alsemmeari, Rayan A. Alghamdi, Bandar Alturki, Badraddin Alsulami, Abdulaziz A. Department of Computer Engineering Ankara University Ankara06100 Turkey Department of Cybersecurity Faculty of Computer & Information Technology Jordan University of Science and Technology PO Box 3030 Irbid22110 Jordan Department of Networks & Communications Engineering College of Computer Science & Information Systems Najran University Najran61441 Saudi Arabia Department of Information Technology Faculty of Computing and Information Technology King Abdulaziz University Jeddah21589 Saudi Arabia Department of Information Systems Faculty of Computing and Information Technology King Abdulaziz University Jeddah21589 Saudi Arabia

Abnormal event detection in video surveillance is critical for security, traffic management, and industrial monitoring applications. This paper introduces an innovative methodology for anomaly detection in video data, encompassing three primary stages: preprocessing, feature learning, and anomaly detection. We employ background subtraction and noise reduction during preprocessing to refine the data. The feature-learning stage involves training an LSTM autoencoder to capture the essential features of normal video sequences. For anomaly detection, we map video data to a lower-dimensional space (latent code) and compare it against the distribution of codes from normal sequences. We determine regularity scores and identify local minima points exceeding a specified threshold while scrutinizing shadows between adjacent maxima to confirm and pinpoint anomalies. When tested on the CUHK Avenue and UMN datasets, our methodology demonstrated performance with AUCs of 93.8% and 94.1%, respectively, outperforming several baseline models. Our results show the high precision of our method that can detect anomalies, highlighting its potential advantages that it can achieve for enhancing systems of surveillance. © The Author(s) 2025.

关键词： Noise abatement

来源：评论

学校读者我要写书评

暂无评论

Observer-based stabilization for discrete nonlinear semi-Markov jump singularly perturbed models with mode-switching delay

引用

science China(Information sciences) 2025年第4期68卷 389-390页

作者： Wenhai QI Runkun LI Ju H.PARK Zheng-Guang WU Huaicheng YAN School of Engineering Qufu Normal University Department of Electrical Engineering Yeungnam University Institute of Cyber-Systems and Control Zhejiang University Key Laboratory of Smart Manufacturing in Energy Chemical Process of Ministry of Education East China University of Science and Technology

Semi-Markov jump systems(S-MJMs) not only characterize hybrid systems but also address the limitations of Markov jump systems(MJMs) [1–3]. Due to their ability to exhibit multi-time-scale features, singularly perturbed models(SPMs) effectively model practical systems influenced by multiple time-scale phenomena [4]. In this study, the observer-based output feedback controller is asynchronous with the original system due to the time delay in the controller mode switching. A nonlinear plant with singularly perturbed parameters(SPPs) is represented using an interval type-2(IT2) fuzzy model [5].

关键词：

来源：评论

学校读者我要写书评

暂无评论

MIDDLE: A Mobility-Driven Device-Edge-Cloud Federated Learning Framework

引用

IEEE Transactions on Mobile Computing 2025年第06期24卷 4589-4606页

作者： Zhang, Songli Zheng, Zhenzhe Wu, Fan Li, Bingshuai Shao, Yunfeng Chen, Guihai Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems China Huawei Technologies Huawei Noah's Ark Lab China

Federated learning (FL) can be implemented in large-scale wireless networks in a hierarchical way, introducing edge servers as relays between the cloud server and devices. These devices are dispersed within multiple clusters coordinated by edges. However, the devices are typically mobile users with unpredictable trajectories, and the impact of their mobility on the model training process is not well-studied. In this work, we propose a new MobIlity-Driven feDerated LEarning framework, namely MIDDLE. MIDDLE addresses unbalanced model updates by capitalizing on model aggregation opportunities on mobile devices due to their mobility across edges. It consists of two components: on-device model aggregation, which aggregates models from different edges carried by mobile devices as they move across edges, and in-edge device selection, adjusting the current edge optimization direction through careful device selection. Theoretical analysis emphasizes that on-device model aggregation can reduce bias in model updating on edges and the cloud, thereby accelerating the FL model convergence. Building on this analysis, we introduce on-device global control averaging, modifying the training process on mobile devices and extending MIDDLE into MIDDLE+. Extensive experimental results validate that MIDDLE and MIDDLE+ can reduce the time steps to reach the target accuracy by 19.44% and 20.37% at least, respectively. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Stack-HAR: Complex Human Activity Recognition with Stacking-based Ensemble Learning Framework

引用

IEEE Sensors Journal 2025年第9期25卷 16373-16380页

作者： Dahal, Abisek Moulik, Soumen Mukherjee, Rohan National Institute of Technology Meghalaya Department of Computer Science & Engineering Saitsohpen Sohra East Khasi Hills Meghalaya 793108 India Imi Kolkata Department of Management Information Systems and Analytics Kolkata 700027 India

Human Activity Recognition (HAR) is crucial in various domains like healthcare, elderly care, sports, gait analysis, and security surveillance. Despite its critical role in these fields, achieving high accuracy in HAR remains a challenging task. This article proposed a multi-model stacking-based ensemble learning framework for complex human activity recognition (Stack-HAR). The proposed framework demonstrates significant performance improvements across benchmark datasets such as mHealth, UCI HAR, and WISDM datasets. By leveraging stacking-based ensemble technique, the proposed Stack-HAR framework achieves exceptional accuracy's of 99.49%, 96%, and 90% on these datasets respectively. The meta-learner consistently outperforms individual classifiers, showcasing the effectiveness of ensemble learning. This framework offers a balanced solution for real-world HAR applications, optimizing both accuracy and computational efficiency. Recognizing activities of daily living using smartphone, given their widespread sensor availability, gets benefited greatly from this approach. © 2001-2012 IEEE.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

Prediction of Covid-19 Recovery Chances Using Supervised Machine Learning Classification 5th

Prediction of Covid-19 Recovery Chances Using Supervised Mac...

引用

5th International Conference on Innovative Product Design and Intelligent Manufacturing systems, ICIPDIMS 2023

作者： Dhanalakshmi, R. Nivashini, A. Vijayaraghavan, N. Centre for Cyber Physical Systems School of Computer Science and Engineering Vellore Institute of Technology Chennai India Department of Computer Science and Engineering MNM Jain Engineering College Chennai India Department of Mathematics KCG College of Technology Chennai India

ISBN: (纸本)9789819767311

Predictive analytics if combined with machine learning approaches have the potential to play a significant role in forecasting the spread of respiratory infections. Machine learning approaches aid in the mining of data to better assess and forecast the presence or absence of covid-19 infection. In this paper, XGBoost Ensemble Classification using a fine-tuned approach is being used. Various machine learning algorithms are being analyzed and XGBoost Ensemble Classification algorithm is used to forecast and predict the covid-19 infected patient recovery chances that is the possible outcome of a covid-19 infected patient along with the prediction probability of recovery. The suggested categorization model is applied to a variety of situations. When compared to other ensemble models like random forest, hybrid ensemble and other individual classifiers such as decision tree, logistic regression, K-nearest neighbor, support vector machine and Naive Bayes, the XGBoost Ensemble Classification model gave the highest accuracy. Predicting the correct class is important. Thus, the proposed system discusses the possibility of automated prediction for covid-19 infected patient recovery chances along with the probability of recovery and the effectiveness of such predictions. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

FunGrasp: Functional Grasping for Diverse Dexterous Hands

引用

IEEE Robotics and Automation Letters 2025年第6期10卷 6175-6182页

作者： Huang, Linyi Zhang, Hui Wu, Zijian Christen, Sammy Song, Jie Thrust of Robotics and Autonomous Systems Guangzhou China ETH Zürich Department of Computer Science Zürich Switzerland The Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong

Functional grasping is essential for humans to perform specific tasks, such as grasping scissors by the finger holes to cut materials or by the blade to safely hand them over. Enabling dexterous robot hands with functional grasping capabilities is crucial for their deployment to accomplish diverse real-world tasks. Recent research in dexterous grasping, however, often focuses on power grasps while overlooking task- and object-specific functional grasping poses. In this paper, we introduce FunGrasp, a system that enables functional dexterous grasping across various robot hands and performs one-shot transfer to unseen objects. Given a single RGBD image of functional human grasping, our system estimates the hand pose and transfers it to different robotic hands via a human-to-robot (H2R) grasp retargeting module. Guided by the retargeted grasping poses, a policy is trained through reinforcement learning in simulation for dynamic grasping control. To achieve robust sim-to-real transfer, we employ several techniques including privileged learning, system identification, domain randomization, and gravity compensation. In our experiments, we demonstrate that our system enables diverse functional grasping of unseen objects using single RGBD images, and can be successfully deployed across various dexterous robot hands. The significance of the components is validated through comprehensive ablation studies. © 2016 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：