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

DE-RALBA: dynamic enhanced resource aware load balancing algorithm for cloud computing

PeerJ Computer science 2025年 11卷 e2739-e2739页

作者： Hussain, Altaf Aleem, Muhammad Rehman, Atiq Ur Arshad, Umer Department of Computer Science KICSIT Campus Institute of Space Technology Islamabad Pakistan School of Computing Mathematics and Data Science Coventry University London United Kingdom Faculty of Information Technology Department of Computer Science University of Central Punjab UCP Lahore Pakistan

Cloud computing provides an opportunity to gain access to the large-scale and high-speed resources without establishing your own computing infrastructure for executing the high-performance computing (HPC) applications. Cloud has the computing resources (i.e., computation power, storage, operating system, network, and database etc.) as a public utility and provides services to the end users on a pay-as-you-go model. From past several years, the efficient utilization of resources on a compute cloud has become a prime interest for the scientific community. One of the key reasons behind inefficient resource utilization is the imbalance distribution of workload while executing the HPC applications in a heterogenous computing environment. The static scheduling technique usually produces lower resource utilization and higher makespan, while the dynamic scheduling achieves better resource utilization and load-balancing by incorporating a dynamic resource pool. The dynamic techniques lead to increased overhead by requiring a continuous system monitoring, job requirement assessments and real-time allocation decisions. This additional load has the potential to impact the performance and responsiveness on computing system. In this article, a dynamic enhanced resource-aware load balancing algorithm (DE-RALBA) is proposed to mitigate the load-imbalance in job scheduling by considering the computing capabilities of all VMs in cloud computing. The empirical assessments are performed on CloudSim simulator using instances of two scientific benchmark datasets (i.e., heterogeneous computing scheduling problems (HCSP) instances and Google Cloud Jobs (GoCJ) dataset). The obtained results revealed that the DE-RALBA mitigates the load imbalance and provides a significant improvement in terms of makespan and resource utilization against existing algorithms, namely PSSLB, PSSELB, Dynamic MaxMin, and DRALBA. Using HCSP instances, the DE-RALBA algorithm achieves up to 52.35% improved resources

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Cost Sensitive Ensemble Learning Framework for EEG- Based Emotion Recognition 2nd

Cost Sensitive Ensemble Learning Framework for EEG- Based Em...

引用

2nd International Conference on data science and Artificial Intelligence, DSAI 2024

作者： Ganepola, Dasuni Maduranga, M.W.P. Wanniarachchi, W.A.A.M. Wijayaratne, W.M.S.R.B. Faculty of Computing General Sir John Kotelawala Defence University Rathmalana Sri Lanka Department of Data Science Sri Lanka Technology Campus Padukka Sri Lanka

ISBN: (纸本)9789819797929

Cost-sensitive learning (CSL) emerges as a promising approach for machine learning (ML) model performance evaluation. CSL weighs the severity of the prediction errors/ misclassifications made in the form of costs. Varying consequences of misclassification costs are often overlooked in existing research that uses standard metrics such as prediction accuracy leading to suboptimal performances in real-world settings. This paper emphasizes the need of CSL for emotion recognition models that use Electroencephalography (EEG) data. It proposes a novel cost sensitive framework that addresses the challenge of reducing the overall misclassification cost of existing EEG based emotion recognition models and thereby, creating a tradeoff with prediction accuracy. This proposed cost-sensitive framework is based on ensemble ML. Random Forest, Support Vector Machine, and k-Nearest Neighbor algorithms were heterogeneously ensembled to create this framework. It was compared with individual ML models built from same algorithms, which are considered cost insensitive as they neglect the varying misclassification costs. EEG data that classifies students as confused and non-confused during learning were used as the dataset. Results indicated that the designed ensemble model achieved a misclassification cost of 1811.5, which is a reduction of 38.20% compared to the highest misclassification cost incurred by a cost-insensitive individual model. Moreover, the ensemble model reached a prediction accuracy of 70.01%, whereas the individual models did not exceed 70% accuracy. This demonstrates the effectiveness of the proposed cost-sensitive model, as the cost-insensitive models could not achieve this level of tradeoff between misclassification cost and prediction accuracy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

SUDCOPA: WSN-based IoT Energy Optimization and Load Balancing through a Context-Sensitive Minimum Clustering Radius 24

SUDCOPA: WSN-based IoT Energy Optimization and Load Balancin...

引用

Proceedings of the 2024 13th International Conference on Software and Information Engineering

作者： Foudil Mir Ahcene Bounceur Farid Meziane Medical Computing Laboratory (LIMED) Faculty of Exact Sciences University of Bejaia Bejaia Algeria College of Computing and Informatics University of Sharjah Sharjah United Arab Emirates College of Science and Engineering Data Science Research Centre University of Derby Derby United Kingdom

来源：评论

学校读者我要写书评

暂无评论

An Inconsistency-Based Hybrid Feature Selection Approach for Enhancing Medical Classification Modeling 2nd

An Inconsistency-Based Hybrid Feature Selection Approach for...

引用

2nd International Conference on Intelligent Manufacturing and Robotics, ICIMR 2024

作者： Zhao, Rong ALDharhani, Ghassan Saleh Ratnavelu, Kuru Thambiayya, Sathiyaraj Jasser, Muhammed Basheer Majeed, Anwar P. P. Abdul Luo, Yang Institute of Computer Science and Digital Innovation UCSI University Kuala Lumpur56000 Malaysia Institute of Information Science and Technology Dalian University of Science and Technology Dalian China Faculty of Information Science and Technology UKM University Selangor Bangi43000 Malaysia Institute of Mathematical Sciences University of Malaya Kuala Lumpur56000 Malaysia Institute of Actuarial Science and Data Analytics UCSI University Kuala Lumpur56000 Malaysia Department of Data Science and Artificial Intelligence School of Computing and Artificial Intelligence Faculty of Engineering and Technology Sunway University No. 5 Jalan Universiti Bandar Sunway Selangor Petaling Jaya47500 Malaysia Faculty of Engineering and Technology Sunway University No. 5 Jalan Universiti Bandar Sunway Selangor Petaling Jaya47500 Malaysia School of Intelligent Manufacturing Ecosystem Xi’an Jiaotong-Liverpool University Suzhou Taicang215400 China

ISBN: (纸本)9789819639489

Artificial Intelligence is an essential tool for early disease recognition and supporting patient condition monitoring in the future. Timely and exact conclusions about the type of disease are significant for treatment and life extension. A combination of classification and feature selection algorithms can effectively handle complex datasets in the medical field and improve the accuracy of disease diagnosis and treatment. In this paper, we propose a new hybrid feature selection algorithm that uses inconsistency metrics as a filter method for the first step, and then feeds the resulting dataset into a wrapper method, which ultimately results in a reduced dataset. The proposed HFSIM algorithm is tested on five datasets in the medical domain from Kaggle. The obtained feature subsets are verified on three classification algorithms, KNN, LR and RF of machine learning to validate the effectiveness of the proposed algorithm. The experimental results show that the proposed algorithm obtains feature subsets with low dimensionality on most of the datasets and also has high classification accuracy after testing on the classifiers. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Detecting Glioma, Meningioma, and Pituitary Tumors, and Normal Brain Tissues based on Yolov11 and Yolov8 Deep Learning Models

arXiv

引用

arXiv 2025年

作者： Taha, Ahmed M. Aly, Salah A. Darwish, Mohamed F. Dept. of CE Faculty of Engineering Egypt University of Informatics Cairo Egypt Faculty of Computing and Data Science Badya University Giza Egypt Faculty of Science Fayoum University CS&Math Branch Fayoum Egypt Dept. of Pathology Faculty of Medicine Badya University Giza Egypt

Accurate and quick diagnosis of normal brain tissue Glioma, Meningioma, and Pituitary Tumors is crucial for optimal treatment planning and improved medical results. Magnetic Resonance Imaging (MRI) is widely used as a non-invasive diagnostic tool for detecting brain abnormalities, including tumors. However, manual interpretation of MRI scans is often time-consuming, prone to human error, and dependent on highly specialized expertise. This paper proposes an advanced AI-driven technique to detecting glioma, meningioma, and pituitary brain tumors using YoloV11 and YoloV8 deep learning models. Methods: Using a transfer learning-based fine-tuning approach, we integrate cutting-edge deep learning techniques with medical imaging to classify brain tumors into four categories: No-Tumor, Glioma, Meningioma, and Pituitary Tumors. Results: The study utilizes the publicly accessible CE-MRI Figshare dataset and involves fine-tuning pre-trained models YoloV8 and YoloV11 of 99.49% and 99.56% accuraies;and customized CNN accuracy of 96.98%. The results validate the potential of CNNs in achieving high precision in brain tumor detection and classification, highlighting their transformative role in medical imaging and diagnostics. © 2025, CC0.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Avoiding exp(Rmax) scaling in RLHF through Preference-based Exploration

arXiv

引用

arXiv 2025年

作者： Chen, Mingyu Chen, Yiding Sun, Wen Zhang, Xuezhou Department of Electrical & Computer Engineering Boston University United States Department of Computer Science Cornell University United States Faculty of Computing & Data Sciences Boston University United States

Reinforcement Learning from Human Feedback (RLHF) has emerged as a pivotal technique for large language model (LLM) alignment. This paper studies the setting of online RLHF and focus on improving sample efficiency. All existing algorithms in online RLHF, whether doing passive exploration or active exploration, suffer from a sample complexity that scales exponentially with the scale of the reward function. This fundamental limitation hinders their effectiveness in scenarios with heavily skewed preferences, e.g. questions with a unique correct solution. To address this, we introduce Self-Exploring Preference-Incentive Online Preference Optimization (SE-POPO), an online RLHF algorithm that for the first time achieves a sample complexity that scales polynomially with the reward scale, answering an open problem raised by Xie et al. (2024). Theoretically, we demonstrate that the sample complexity of SE-POPO dominates that of existing exploration algorithms. Empirically, our systematic evaluation confirms that SE-POPO is more sample-efficient than both exploratory and non-exploratory baselines, in two primary application scenarios of RLHF as well as on public benchmarks, marking a significant step forward in RLHF algorithm design. The code is available at https://***/MYC000801/SE-POPO. © 2025, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Predictive Modelling of Protest Event Signatures: Analyzing Temporal Dynamics and Digital Activism Discourse Across Global Movements

引用

Journal of Social computing 2025年第1期6卷 43-50页

作者： Amila Chethana Nanayakkara B. T. G. Samantha Kumara R. M. Kapila Tharanga Rathnayaka Center for Computer Studies Sabaragamuwa University of Sri Lanka Belihuloya Sri Lanka Department of Data Science Faculty of Computing Sabaragamuwa University of Sri Lanka Belihuloya Sri Lanka Department of Physical Sciences and Technology Faculty of Applied Sciences Sabaragamuwa University of Sri Lanka Belihuloya Sri Lanka

This research introduced a predictive modeling framework to analyze the temporal dynamics of social media discourse during three global movements: the Mahsa Amini Protests (2022), South African Unrest (2021), and the Black Lives Matter Movement (2020). By utilizing Twitter data, the study developed a Protest Social Media Archetype to capture the evolution of tweet activity during key protest periods, identifying common patterns and notable variations in public engagement. Techniques such as LOESS regression and correlation analysis were used to model fluctuations in online activity and assess the impact of social media on public mobilization during socio-political unrest. The findings revealed distinct temporal signatures for each movement, showing similarities in initial engagement and differences in sustained activity across various contexts. These insights underscore the role of digital platforms in protest organization and global solidarity, offering a framework for future studies on digital activism and protest dynamics.

关键词： Analytical models Social computing Fluctuations Social networking (online) Blogs Refining Organizations Predictive models Real-time systems Mathematics

来源：评论

学校读者我要写书评

暂无评论

Digital Sovereignty through Africa-Centric Emotional Intelligence: A Proof of Concept for AI-Enhanced Mental Health Support

引用

Procedia Computer science 2025年 254卷 269-278页

作者： Sontaga G. Forane Absalom E. Ezugwu Kevin Igwe Unit for Data Science and Computing North-West University 11 Hoffman Street Potchefstroom 2520 North-West South Africa Department of Psychology Faculty of Humanities University of Johannesburg Bunting Road Auckland Park Johannesburg 2092 South Africa

Digital sovereignty is vital for enabling communities to control their technological ecosystems, particularly in areas like mental health, where cultural relevance and data autonomy are paramount. This study examines the integration of Africa-centric emotional intelligence principles into AI-driven mental health support systems, while at the same time proposing a culturally adaptive framework with a proof of concept that emphasizes both technological autonomy and cultural authenticity. Grounded in values such as empathy, communal well-being, resilience, and Ubuntu, the conceptualized approach aligns mental health interventions with the lived experience of African communities. The framework incorporates conversational agents and personalized interventions, alongside a prototype system capable of detecting and classifying mental health conditions, such as depression, anxiety, and stress. The culturally aligned design enhances user trust, engagement, and perceived usefulness, By emphasizing local data control and leveraging Indigenous systems, this work promotes digital sovereignty and addresses privacy concerns. Preliminary testing of the prototype demonstrates the feasibility of culturally attuned AI solutions, showing improved user engagement and trust. This paper emphasizes the need for mental health interventions that respect cultural identity while promoting digital autonomy. More so, it advocates for AI systems personalized to regional contexts and calls for mental health solutions that uphold cultural identity while advancing digital self-governance.

关键词： data Sovereignty Digital Sovereignty Mental Health Emotional Intelligence Large Language Models Ubuntu Cognitive Behavioral Therapy Africa-Centric

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Feature Selection With Multi-Scale Fuzzy Information Fusion: From Both Global and Local Perspectives

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Zhou, Nan Liao, Shujiao Chen, Hongmei Ding, Weiping Lu, Yaqian Minnan Normal University School of Mathematics and Statistics Fujian Key Laboratory of Granular Computing and Applications Zhangzhou363000 China Southwest Jiaotong University School of Computing and Artificial Intelligence National Engineering Laboratory of Integrated Transportation Big Data Application Technology Chengdu611756 China Nantong University School of Artificial Intelligence and Computer Science Nantong226019 China City University of Macau Faculty of Data Science 999078 China

In reality, the laborious nature of label annotation leads to the widespread existence of limited labeled data. Moreover, multi-scale data have received widespread attention due to its rich knowledge representation. However, current research on multi-scale data primarily focuses on supervised learning environments, while semi-supervised feature selection for multi-scale data with limited labels remains inadequately explored. Meanwhile, existing studies on multi-scale data often emphasize selecting optimal scales and further conducting feature selection, but this strategy may result in losing potentially valuable information from other scales. To overcome these limitations, by adopting a multi-scale fuzzy information fusion mechanism, this article proposes two new semi-supervised feature selection approaches for multi-scale data with limited labels from both global and local perspectives. Initially, by fusing fuzzy information at various scales, a label learning method is proposed to convert the decision of missing labels into a fuzzy decision of label distribution. Subsequently, label-distributed multi-scale fuzzy global and local rough sets are constructed from global and local perspectives, respectively. Based on the two models, two semi-supervised feature selection algorithms are developed based on global and local multi-scale fuzzy information fusion. Experimental results demonstrate that, compared to other advanced feature selection algorithms, the two proposed algorithms can effectively handle multi-scale data with limited labels and exhibit superior classification performance, computational efficiency and robustness. © 1993-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Quantitative Error Bounds for Scaling Limits of Stochastic Iterative Algorithms

arXiv

引用

arXiv 2025年

作者： Wang, Xiaoyu Kasprzak, Mikolaj J. Negrea, Jeffrey Bourguin, Solesne Huggins, Jonathan H. Department of Mathematics & Statistics Boston University United States Department of Information Systems Data Analytics & Operations ESSEC Business School France Department of Statistics & Actuarial Science University of Waterloo Canada Faculty of Computing & Data Sciences Boston University United States

Stochastic iterative algorithms, including stochastic gradient descent (SGD) and stochastic gradient Langevin dynamics (SGLD), are widely utilized for optimization and sampling in large-scale and high-dimensional problems in machine learning, statistics, and engineering. Numerous works have bounded the parameter error in, and characterized the uncertainty of, these approximations. One common approach has been to use scaling limit analyses to relate the distribution of algorithm sample paths to a continuous-time stochastic process approximation, particularly in asymptotic setups. Focusing on the univariate setting, in this paper, we build on previous work to derive non-asymptotic functional approximation error bounds between the algorithm sample paths and the Ornstein-Uhlenbeck approximation using an infinite-dimensional version of Stein's method of exchangeable pairs. We show that this bound implies weak convergence under modest additional assumptions and leads to a bound on the error of the variance of the iterate averages of the algorithm. Furthermore, we use our main result to construct error bounds in terms of two common metrics: the Lévy-Prokhorov and bounded Wasserstein distances. Our results provide a foundation for developing similar error bounds for the multivariate setting and for more sophisticated stochastic approximation *** Codes 60F17 (Primary) 60J60, 62-08, 68T05, 62E17 (Secondary) Copyright © 2025, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：