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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Speed Harmonic based Saturation Free Inductance Modeling and Estimation of Interior PMSM Using Measurements Under One Load Condition

引用

CES Transactions on Electrical Machines and systems 2025年第1期9卷 91-99页

作者： Guodong Feng Yuting Lu Zhe Tong Beichen Ding Guishan Yan Chunyan Lai the School of Intelligent Systems Engineering Sun Yat-sen UniversityShenzhenChina the School of Advanced Manufacturing Sun Yat-sen University the Southern Marine Science and Engineering Guangdong Laboratory(Zhuhai) China the Department of Electrical and Computer Engineering Concordia UniversityQCCanada

For permanent magnet synchronous machines(PMSMs),accurate inductance is critical for control design and condition *** to magnetic saturation,existing methods require nonlinear saturation model and measurements from multiple load/current conditions,and the estimation is relying on the accuracy of saturation model and other machine parameters in the *** harmonic produced by harmonic currents is inductance-dependent,and thus this paper explores the use of magnitude and phase angle of the speed harmonic for accurate inductance *** estimation models are built based on either the magnitude or phase angle,and the inductances can be from d-axis voltage and the magnitude or phase angle,in which the filter influence in harmonic extraction is considered to ensure the estimation *** inductances can be estimated from the measurements under one load condition,which is free of saturation ***,the inductance estimation is robust to the change of other machine *** proposed approach can effectively improve estimation accuracy especially under the condition with low current *** and comparisons are conducted on a test PMSM to validate the proposed approach.

关键词： PMSM Inductance estimation Speed harmonic High frequency signal injection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of text mining and clustering techniques for assessing functional dependency between manual test cases

引用

Software Quality Journal 2025年第2期33卷 1-36页

作者： Tahvili, Sahar Hatvani, Leo Felderer, Michael de Oliveira Neto, Francisco Gomes Afzal, Wasif Feldt, Robert Compute Platforms Engineering Unit Ericsson AB Stockholm Sweden Department of Industrial AI Systems Mälardalen University Västerås Sweden Institute of Software Technology German Aerospace Center Cologne Germany Department of Mathematics and Computer Science University of Cologne Cologne Germany Department of Computer Science and Engineering Chalmers University of Technology Gothenburg Sweden Department of Computer Science and Engineering Blekinge Institute of Technology Karlskrona Sweden Department of Computer Science and Engineering University of Gothenburg Gothenburg Sweden

Text mining techniques, particularly those leveraging machine learning for natural language processing, have gained significant attention for qualitative data analysis in software testing. However, their complexity and lack of transparency can pose challenges, especially in safety-critical domains where simpler, interpretable solutions are often preferred unless accuracy is heavily compromised. This study investigates the trade-offs between complexity, effort, accuracy, and utility in text mining and clustering techniques, focusing on their application for detecting functional dependencies among manual integration test cases in safety-critical systems. Using empirical data from an industrial testing project at ALSTOM Sweden, we evaluate various string distance methods, NCD compressors, and machine learning approaches. The results highlight the impact of preprocessing techniques, such as tokenization, and intrinsic factors, such as text length, on algorithm performance. Findings demonstrate how text mining and clustering can be optimized for safety-critical contexts, offering actionable insights for researchers and practitioners aiming to balance simplicity and effectiveness in their testing workflows. © The Author(s) 2025.

关键词： Artificial intelligence Clustering Natural language processing Software testing Text mining

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Interpretable Arabic Hate Speech Detection using Large Language Model 2

Interpretable Arabic Hate Speech Detection using Large Langu...

引用

2nd International Conference on Advanced Innovations in Smart Cities, ICAISC 2025

作者： Alwateer, Majed Gad, Ibrahim Elmarhomy, Mahmoud Elmarhomy, Ghada Hashim, Hasan Almaliki, Malik Atlam, El-Sayed College of Computer Science and Engineering Taibah University Department of Computer Science Saudi Arabia Tanta University Faculty of Science Computer Science Department Tanta31527 Egypt College of Applied Taibah University Computer Science and Information Saudi Arabia College of Computer Science and Engineering Taibah University Department of Information Systems Saudi Arabia

ISBN: (纸本)9798331506995

Social media platforms serve as significant spaces for users to have conversations, discussions and express their opinions. However, anonymity provided to users on these platforms allows the spread of hate speech and other offensive material. Due to the wide-ranging nature of these platforms, there is a critical need to automatically detect and report occurrences of hate speech. There are various detection methods, but many of them operate as black boxes, lacking interpretability and explainability by design. To address the lack of interpretability, this study explores the development of an interpretable framework to detect hate speech in Arabic using large language models (LLMs). The proposed approach combines advanced natural language processing techniques with interpretable machine learning methods to enhance understanding of model decisions. The experimental results demonstrate that the model achieves high accuracy while maintaining interpretability, enabling users to understand the reasoning behind the detections. The proposed method achieves an accuracy of 0.846%, with a precision of 0.843% and a recall of 0.846%, outperforming existing Arabic hate speech detection models. These results show the effectiveness of combining LLM with interpretability for this critical task, providing a reliable and transparent solution for automated moderation of harmful content. © 2025 IEEE.

关键词： Arabic Hate Speech Detection Large Language Mode XAI

来源：评论

学校读者我要写书评

暂无评论

A New Cybersecurity Approach Enhanced by xAI-Derived Rules to Improve Network Intrusion Detection and SIEM

引用

computers, Materials & Continua 2025年第5期83卷 1607-1621页

作者： Federica Uccello Marek Pawlicki Salvatore D'Antonio RafałKozik MichałChoras Centro Direzionale Department of EngineeringUniversity of Naples‘Parthenope’Isola C4Napoli80133Italy Department of Computer and Information Science Software and SystemsLinköping UniversityLinköping58183Sweden ITTI Sp.z o.o. Pozna´n61-612Poland Faculty of Telecommunications Computer Science and Electrical EngineeringBydgoszcz University of Science and TechnologyBydgoszcz85-796Poland

The growing sophistication of cyberthreats,among others the Distributed Denial of Service attacks,has exposed limitations in traditional rule-based Security Information and Event Management *** machine learning–based intrusion detection systems can capture complex network behaviours,their“black-box”nature often limits trust and actionable insight for security *** study introduces a novel approach that integrates Explainable Artificial Intelligence—xAI—with the Random Forest classifier to derive human-interpretable rules,thereby enhancing the detection of Distributed Denial of Service(DDoS)*** proposed framework combines traditional static rule formulation with advanced xAI techniques—SHapley Additive exPlanations and Scoped Rules-to extract decision criteria from a fully trained *** methodology was validated on two benchmark datasets,CICIDS2017 and *** rules were evaluated against conventional Security Information and Event Management systems rules with metrics such as precision,recall,accuracy,balanced accuracy,and Matthews Correlation *** results demonstrate that xAI-derived rules consistently outperform traditional static ***,the most refined xAI-generated rule achieved near-perfect performance with significantly improved detection of DDoS traffic while maintaining high accuracy in classifying benign traffic across both datasets.

关键词： Cybersecurity explainable artificial intelligence intrusion detection system rule-based SIEM distributed denial of service

来源：评论

学校读者我要写书评

暂无评论

Lightweight and Roubust Key Agreement for Securing IIoT-Driven Flexible Manufacturing systems

引用

IEEE Internet of Things Journal 2025年第11期12卷 17197-17209页

作者： Hammad, Muhammad Badshah, Akhtar Almeer, Mohammed A. Waqas, Muhammad Song, Houbing Chen, Sheng Han, Zhu GIK Institute of Engineering Sciences and Technology Faculty of Mechanical Engineering Topi23640 Pakistan University of Malakand Department of Software Engineering Dir Lower18800 Pakistan University of Bahrain Computer Engineering Department College of Information Technology 32038 Bahrain University of Greenwich Faculty of Engineering and Science Centre for Sustainable Cybersecurity United Kingdom Edith Cowan University School of Engineering PerthWA6027 Australia Department of Information Systems BaltimoreMD United States University of Southampton School of Electronics and Computer Science SouthamptonSO17 1BJ United Kingdom University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The ever-evolving Internet of Things (IoT) has ushered in a new era of intelligent manufacturing across multiple industries. However, the security and privacy of real-time data transmitted over the public channel of the industrial IoT (IIoT) remain formidable challenges. Existing lightweight protocols often omit one or more critical security features, such as anonymity and untraceability, and are susceptible to threats like desynchronization attacks. Additionally, they struggle to achieve an optimal balance between robust security and performance efficiency. To bridge these gaps, we introduce a new lightweight key agreement security scheme that guarantees secure access to the IIoT-enabled flexible manufacturing system (FMS). The strength of our scheme lies in its utilization of the authenticated encryption with associative data (AEAD) primitive, AEGIS, along with hash functions and physical unclonable functions, which secure the IIoT ecosystem. Additionally, our scheme offers flexibility in the form of the addition of new machines, password updates, and revocation in cases of theft or loss. A comprehensive security analysis demonstrates the efficacy of the proposed scheme in thwarting various attacks. The formal analysis, based on the Real-Or-Random (RoR) model, ensures session key indistinguishability, while the informal analysis highlights its resilience against known attacks. The comparative assessment demonstrate that the proposed scheme consistently outperforms the benchmark schemes across multiple dimensions, including security and functionality features, computational and communication overheads, and runtime efficiency. Specifically, the proposed scheme achieves peak performance enhancements of 77.55%, 44.73%, and 69.6% in computational overhead, runtime overhead, and communication overhead, respectively, underscoring its substantial performance advantages. © 2025 IEEE.

关键词： Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

Binary Stochastic Flip Optimization for Training Binary Neural Networks

Binary Stochastic Flip Optimization for Training Binary Neur...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Shibuya, Tatsukichi Inoue, Nakamasa Kawakami, Rei Sato, Ikuro Department of Computer Science Institute of Science Tokyo Tokyo Japan Department of Systems and Control Engineering Institute of Science Tokyo Tokyo Japan Denso IT Laboratory Tokyo Japan

ISBN: (纸本)9798350368741

For deploying deep neural networks on edge devices with limited resources, binary neural networks (BNNs) have attracted significant attention, due to their computational and memory efficiency. However, once a neural network is binarized, finetuning it on edge devices becomes challenging because most conventional training algorithms for BNNs are designed for use on centralized servers and require storing real-valued parameters during training. To address this limitation, this paper introduces binary stochastic flip optimization (BinSFO), a novel training algorithm for BNNs. BinSFO employs a parameter update rule based on Boolean operations, eliminating the need to store real-valued parameters and thereby reducing memory requirements and computational overhead. In experiments, we demonstrated the effectiveness and memory efficiency of BinSFO in finetuning scenarios on six image classification datasets. BinSFO performed comparably to conventional training algorithms with a 70.7% smaller memory requirement. Code is released at https://***/TatsukichiShibuya/ICASSP2025_BinSFO. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：