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

QSimPy: A Learning-centric Simulation Framework for Quantum cloud Resource Management

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Nguyen, Hoa T. Usman, Muhammad Buyya, Rajkumar Laboratory School of Computing and Information Systems The University of Melbourne ParkvilleVIC3052 Australia School of Physics The University of Melbourne ParkvilleVIC3052 Australia Data61 CSIRO ClaytonVIC3168 Australia

Quantum cloud computing is an emerging computing paradigm that allows seamless access to quantum hardware as cloud-based services. However, effective use of quantum resources is challenging and necessitates robust simulation frameworks for effective resource management design and evaluation. To address this need, we proposed QSimPy, a novel discrete-event simulation framework designed with the main focus to facilitate learning-centric approaches for quantum resource management problems in cloud environments. Underpinned by extensibility, compatibility, and reusability principles, QSimPy provides a lightweight simulation environment based on SimPy, a well-known Python-based simulation engine for modeling dynamics of quantum cloud resources and task operations. We integrate the Gymnasium environment into our framework to support the creation of simulated environments for developing and evaluating reinforcement learning-based techniques for optimizing quantum cloud resource management. The QSimPy framework encapsulates the operational intricacies of quantum cloud environments, supporting research in dynamic task allocation and optimization through DRL approaches. We also demonstrate the use of QSimPy in developing reinforcement learning policies for quantum task placement problems, demonstrating its potential as a useful framework for future quantum cloud research. © 2024, CC BY.

关键词： Reinforcement learning

DRLQ: A Deep Reinforcement Learning-based Task Placement for Quantum cloud computing

学校读者我要写书评

暂无评论

arXiv 2024年

The quantum cloud computing paradigm presents unique challenges in task placement due to the dynamic and heterogeneous nature of quantum computation resources. Traditional heuristic approaches fall short in adapting to the rapidly evolving landscape of quantum computing. This paper proposes DRLQ, a novel Deep Reinforcement Learning (DRL)based technique for task placement in quantum cloud computing environments, addressing the optimization of task completion time and quantum task scheduling efficiency. It leverages the Deep Q Network (DQN) architecture, enhanced with the Rainbow DQN approach, to create a dynamic task placement strategy. This approach is one of the first in the field of quantum cloud resource management, enabling adaptive learning and decision-making for quantum cloud environments and effectively optimizing task placement based on changing conditions and resource availability. We conduct extensive experiments using the QSimPy simulation toolkit to evaluate the performance of our method, demonstrating substantial improvements in task execution efficiency and a reduction in the need to reschedule quantum tasks. Our results show that utilizing the DRLQ approach for task placement can significantly reduce total quantum task completion time by 37.81% to 72.93% and prevent task rescheduling attempts compared to other heuristic approaches. © 2024, CC BY.

关键词： Reinforcement learning

Quantum Serverless Paradigm and Application Development using the QFaaS Framework

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Nguyen, Hoa T. Pham, Bui Binh An Usman, Muhammad Buyya, Rajkumar Laboratory School of Computing and Information Systems The University of Melbourne ParkvilleVIC3052 Australia School of Physics The University of Melbourne ParkvilleVIC3052 Australia Data61 CSIRO ClaytonVIC3168 Australia

Quantum computing has the potential to solve complex problems beyond thecapabilities of classical computers. However, its practical use is currentlylimited due to early-stage quantum software engineering and the constraints ofNoisy Intermediate-Scale Quantum (NISQ) devices. To address this issue, thischapter introduces the concept of serverless quantum computing with examplesusing QFaaS, a practical Quantum Function-as-a-Service framework. Thisframework utilizes the serverless computing model to simplify quantumapplication development and deployment by abstracting the complexities ofquantum hardware and enhancing application portability across different quantumsoftware development kits and quantum backends. The chapter providescomprehensive documentation and guidelines for deploying and using QFaaS,detailing the setup, component deployment, and examples of service-orientedquantum applications. This framework offers a promising approach to overcomingcurrent limitations and advancing the practical software engineering of quantumcomputing. © 2024, CC BY.

关键词： Computer software portability

High-performance mining of COVID-19 open research datasets for text classification and insights in cloud computing environments

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhao, Jie Rodriguez, Maria A. Buyya, Rajkumar Cloud Computing and Distributed Systems Laboratory School of Computing and Information Systems University of Melbourne Australia

COVID-19 global pandemic is an unprecedented health crisis. Since the outbreak, many researchers around the world have produced an extensive collection of literatures. For the research community and the general public to digest, it is crucial to analyse the text and provide insights in a timely manner, which requires a considerable amount of computational power. clouding computing has been widely adopted in academia and industry in recent years. In particular, hybrid cloud is gaining popularity since its two-fold benefits: utilising existing resource to save cost and using additional cloud service providers to gain assess to extra computing resources on demand. In this paper, we developed a system utilising the Aneka PaaS middleware with parallel processing and multi-cloud capability to accelerate the ETL and article categorising process using machine learning technology on a hybrid cloud. The result is then persisted for further referencing, searching and visualising. Our performance evaluation shows that the system can help with reducing processing time and achieving linear scalability. Beyond COVID-19, the application might be used directly in broader scholarly article indexing and analysing. Copyright © 2020, The Authors. All rights reserved.

关键词： Text processing

Bag2image: A Multi-Instance Network Traffic Representation for Network Security Event Prediction

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Zhang, Jiachen Han, Daoqi Lv, Zhaoxuan Liu, Yang Lu, Yueming Duan, Junke Zhang, Xinyu School of Cyberspace Security Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education China School of Automation Beijing Institute of Technology Beijing China Beijing Institute of Astronautical Systems Engineering Beijing China

In practical scenarios, security events triggered by abnormal network traffic often result from the collective behavior of multiple data streams, embodying group security events with collective characteristics. Existing research methods, focusing on individual data streams, lack a macroscopic analysis and struggle with challenges of analyzing massive, imbalanced data sets. To address these challenges, this paper adopts a multi-instance learning approach, mapping multiple data streams into a bag with a coarse-grained approach, where each bag corresponds to a security event label and each data stream represents an instance. We propose a multi-instance network traffic conversion method, Bag2Image, which transforms temporal multi-instance network traffic data into image representations, preserving the spatio-temporal characteristics of instances within the bag through image channels and pixels. This strategy allows the network security event prediction task to be approached as an image classification problem, leveraging advanced image classification techniques for prediction. Our cross-experiments with six advanced multi-instance learning (MIL) algorithms and six different classification models demonstrate the superior performance of our method on both the UNSW-NB15 dataset and a private dataset. Specifically, our method achieved the highest F1 scores of 77.9% and 74.4% on these datasets, respectively, representing improvements of 4.1% and 13.5% over the second-best MIL algorithm. The recall rates also saw increases of 4.1% and 13.2%, respectively. © 2024, The Authors. All rights reserved.

关键词： Network security

Enhancing Parkinson’s Disease Prediction Using Machine Learning and Feature Selection Methods

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第6期71卷 5639-5657页

作者： Faisal Saeed Mohammad Al-Sarem Muhannad Al-Mohaimeed Abdelhamid Emara Wadii Boulila Mohammed Alasli Fahad Ghabban College of Computer Science and Engineering Taibah UniversityMedina41477Saudi Arabia School of Computing and Digital Technology Birmingham City UniversityBirminghamB47XGUnited Kingdom Information System Department Saba’a Region UniversityMareebYemen Computers and Systems Engineering Department Al-Azhar UniversityCairo11884Egypt RIADI Laboratory National School of Computer SciencesUniversity of ManoubaManouba2010Tunisia

Several millions of people suffer from Parkinson’s disease ***’s affects about 1%of people over 60 and its symptoms increase with *** voice may be affected and patients experience abnormalities in speech that might not be noticed by listeners,but which could be analyzed using recorded speech *** the huge advancements of technology,the medical data has increased dramatically,and therefore,there is a need to apply data mining and machine learning methods to extract new knowledge from this *** classification methods were used to analyze medical data sets and diagnostic problems,such as Parkinson’s Disease(PD).In addition,to improve the performance of classification,feature selection methods have been extensively used in many *** paper aims to propose a comprehensive approach to enhance the prediction of PD using several machine learning methods with different feature selection methods such as filter-based and *** dataset includes 240 recodes with 46 acoustic features extracted from3 voice recording replications for 80 *** experimental results showed improvements when wrapper-based features selection method was used with K-NN classifier with accuracy of 88.33%.The best obtained results were compared with other studies and it was found that this study provides comparable and superior results.

关键词： Filter-based feature selection methods machine learning parkinson’s disease wrapper-based feature selection methods

Deep support vector machines for speech emotion recognition 19th

学校读者我要写书评

暂无评论

Deep support vector machines for speech emotion recognition

19th International Conference on Intelligent systems Design and Applications, ISDA 2019

作者： Aouani, Hadhami Ben Ayed, Yassine National School of Engineers ENIS University of Sfax Sfax Tunisia Multimedia InfoRmation Systems and Advanced Computing Laboratory MIRACL University of Sfax Sfax Tunisia

ISBN: (纸本)9783030493417

Speech Emotions recognition has become the active research theme in speech processing and in applications based on human-machine interaction. In this work, our system is a two-stage approach, namely feature extraction and classification engine. Firstly, two sets of feature are investigated which are: the first one is extracting only 13 Mel-frequency Cepstral Coefficient (MFCC) from emotional speech samples and the second one is applying features fusions between the three features: zero crossing rate (ZCR), Teager Energy Operator (TEO), and Harmonic to Noise Rate (HNR) and MFCC features. Secondly, we use two types of classification techniques which are: the Support Vector Machines (SVM) and the k-Nearest Neighbor (k-NN) to show the performance between them. Besides that, we investigate the importance of the recent advances in machine learning including the deep kernel learning. A large set of experiments are conducted on Surrey Audio-Visual Expressed Emotion (SAVEE) dataset for seven emotions. The results of our experiments showed given good accuracy compared with the previous studies. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

关键词： Support vector machines

FEDGS: Federated Graph-based Sampling with Arbitrary Client Availability

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Zheng Fan, Xiaoliang Qi, Jianzhong Jin, Haibing Yang, Peizhen Shen, Siqi Wang, Cheng Fujian Key Laboratory of Sensing and Computing for Smart Cities School of Informatics Xiamen University Xiamen China School of Computing and Information Systems University of Melbourne Melbourne Australia

While federated learning has shown strong results in optimizing a machine learning model without direct access to the original data, its performance may be hindered by intermittent client availability which slows down the convergence and biases the final learned model. There are significant challenges to achieve both stable and bias-free training under arbitrary client availability. To address these challenges, we propose a framework named Federated Graph-based Sampling (FEDGS), to stabilize the global model update and mitigate the long-term bias given arbitrary client availability simultaneously. First, we model the data correlations of clients with a Data-Distribution-Dependency Graph (3DG) that helps keep the sampled clients data apart from each other, which is theoretically shown to improve the approximation to the optimal model update. Second, constrained by the far-distance in data distribution of the sampled clients, we further minimize the variance of the numbers of times that the clients are sampled, to mitigate long-term bias. To validate the effectiveness of FEDGS, we conduct experiments on three datasets under a comprehensive set of seven client availability modes. Our experimental results confirm FEDGS’s advantage in both enabling a fair client-sampling scheme and improving the model performance under arbitrary client availability. Our code is available at https://***/WwZzz/FedGS. © 2022, CC BY.

关键词： Learning systems

Federated Graph Learning for Cross-Domain Recommendation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Ziqi Peng, Zhaopeng Wang, Zihui Qi, Jianzhong Chen, Chaochao Pan, Weike Wen, Chenglu Wang, Cheng Fan, Xiaoliang Fujian Key Laboratory of Sensing and Computing for Smart Cities Xiamen University China Key Laboratory of Multimedia Trusted Perception and Efficient Computing Ministry of Education of China Xiamen University China School of Computing and Information Systems The University of Melbourne Australia College of Computer Science and Technology Zhejiang University Hangzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

Cross-domain recommendation (CDR) offers a promising solution to the data sparsity problem by enabling knowledge transfer across source and target domains. However, many recent CDR models overlook crucial issues such as privacy as well as the risk of negative transfer (which negatively impact model performance), especially in multi-domain settings. To address these challenges, we propose FedGCDR, a novel federated graph learning framework that securely and effectively leverages positive knowledge from multiple source domains. First, we design a positive knowledge transfer module that ensures privacy during inter-domain knowledge transmission. This module employs differential privacy-based knowledge extraction combined with a feature mapping mechanism, transforming source domain embeddings from federated graph attention networks into reliable domain knowledge. Second, we design a knowledge activation module to filter out potential harmful or conflicting knowledge from source domains, addressing the issues of negative transfer. This module enhances target domain training by expanding the graph of the target domain to generate reliable domain attentions and fine-tunes the target model for improved negative knowledge filtering and more accurate predictions. We conduct extensive experiments on 16 popular domains of the Amazon dataset, demonstrating that FedGCDR significantly outperforms state-of-the-art methods. © 2024, CC BY.

关键词： Federated learning