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

Machine Learning and Autonomous Systems (ICMLAS), International Conference on

作者： Tiruveedula Gopi Krishna Nune Sreenivas M. Ajay Kumar Chandra Sekhar Reddy Davinder Sing Rathee Teklu Urgessa Department of Computer Science and Engineering College of Electrical Engineering and Computing Adama Science and Technology University Adama Ethiopia Department of Electrical and Electronics Engineering Andhra Loyala institute of Engineering and Technology Vijayawada India Department of Electrical Power and Control Engineering College of Electrical Engineering and Computing Adama Science and Technology University Adama Ethiopia Department of ECE College of Electrical Engineering and Computing Adama Science and Technology University Adama Ethiopia

ISBN: (数字)9798331505745

ISBN: (纸本)9798331505752

The research presents a new efficient machine learning method to classify brain tumors because this task remains vital in fighting the high incidence of brain cancers. The proposed approach unites all its operations including image segmentation with feature extraction and classification into a single processing system. This study uses Particle Swarm Optimization (PSO) and Adaptive PSO (APSO) methodologies to optimize Locally Linear Radial Basis Function Neural Network (LLRBFNN) resulting in PSO-LLRBFNN and APSO-LLRBFNN model implementations. The research examined the optimized APSO-LLRBFNN models against Support Vector Machines (SVM) and Least Mean Squares (LMS) based LLRBFNN classifier methods. Results from experiments show that APSO-LLRBFNN gives superior outcomes with 98.93% accuracy and takes 12.23 seconds for execution, which surpasses currently available methods.

关键词： Support vector machines Image segmentation Adaptation models Accuracy Magnetic resonance imaging Machine learning Feature extraction Brain modeling Data models Numerical models

来源：评论

学校读者我要写书评

暂无评论

Risk-Averse Learning with Delayed feedback

arXiv

引用

arXiv 2024年

作者： Wang, Siyi Wang, Zifan Johansson, Karl H. Hirche, Sandra Department of Electrical and Computer Engineering Technical University of Munich Munich80333 Germany Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden

In real-world scenarios, the impacts of decisions may not manifest immediately. Taking these delays into account facilitates accurate assessment and management of risk in real-world environments, thereby ensuring the efficacy of strategies. In this paper, we investigate risk-averse learning using Conditional Value at Risk (CVaR) as risk measure, while incorporating delayed feedback with unknown but bounded delays. We develop two risk-averse learning algorithms that rely on one-point and two-point zeroth-order optimization approaches, respectively. The regret achieved by the algorithms is analyzed in terms of the cumulative delay and the number of total samplings. The results suggest that the two-point risk-averse learning achieves a smaller regret bound than the one-point algorithm. Furthermore, the one-point risk-averse learning algorithm attains sublinear regret under certain delay conditions, and the two-point risk-averse learning algorithm achieves sublinear regret with minimal restrictions on the delay. We provide numerical experiments on a dynamic pricing problem to demonstrate the performance of the proposed algorithms. © 2024, CC0.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Optimization of Electric Vehicle Charging for Sustainable Power Grids using Sine Hunter-Prey Optimization with GRUs

Dynamic Optimization of Electric Vehicle Charging for Sustai...

引用

International Conference on Electrical Power and Energy Systems (ICEPES)

作者： Mohd Khizar Syed Prakash Chandra Behera P Joel Josephson Shamim Ahmad Khan Timur Kholmukhamedov Ponni Valavan M Department of Physics Kohinoor college Maharashtra India Department of Science St. Claret College Bangalore India Department of ECE Malla Reddy Engineering College Medchal Malkajgiri Telangana India Glocal School of Science & Technology Glocal University Uttar Pradesh India Automatic Control and Computer Engineering Department Turin Polytechnic University Tashkent Uzbekistan Department of AI & DS K.Ramakrishnan College of Engineering Trichy Tamil Nadu India

ISBN: (数字)9798350390728

ISBN: (纸本)9798350390735

The integration of electric vehicles (EVs) into power grids presents a significant challenge for sustainability due to their dynamic charging demands and the need to accommodate renewable energy sources. Existing optimization methods often fail to adequately address the complexity of this problem. In this study, propose a novel approach that combines Sine Hunter-Prey Optimization (SHPO) with Gated Recurrent Units (GRUs) to dynamically optimize EV charging for sustainable power grid operation. Traditional optimization methods struggle to capture the nonlinear and time-varying nature of EV charging demands and renewable energy availability. To overcome this limitation, SHPO's ability to efficiently explore complex solution spaces and GRUs' capability to model temporal dependencies in sequential data. This proposed method optimizes EV charging schedules by considering grid stability, renewable energy utilization, and cost minimization. Validating the approach using historical data on EV charging patterns, renewable energy generation, and grid conditions. Performance metrics include grid stability indices, renewable energy integration rates, and cost savings compared to baseline strategies. Experimental results demonstrate that the method outperforms traditional optimization techniques, leading to more sustainable and resilient power grid operation with 92% stability. Overall, this study contributes to advancing the modern methods in dynamic optimization of EV charging, paving the way for more sustainable transportation and energy systems.

关键词： Renewable energy sources Costs Stability criteria Power system dynamics Optimization methods Power system stability Electric vehicle charging

来源：评论

学校读者我要写书评

暂无评论

Classification of the Heartbeats in Electrocardiograms with K-Nearest Neighbors Algorithm, Random Forests, and Support Vector Machines - A Pilot Study 21st

Classification of the Heartbeats in Electrocardiograms with ...

引用

21st Scientific Conference on Medical and Sport Technologies, 2024

作者： Vural, Muzaffer Samed Heryan, Katarzyna Sieciński, Szymon Bilko, Pawel Grzegorzek, Marcin Faculty of Automatic Control Electrical Engineering and Biomedical Engineering Department of Measurement and Electronics AGH University of Science and Technology Aleja Adama Mickiewicza 30 Kraków30-059 Poland Institute of Medical Informatics University of Lübeck Ratzeburger Allee 160 Lübeck23562 Germany Faculty of Biomedical Engineering Department of Medical Informatics and Artificial Intelligence Silesian University of Technology Franklina Delano Roosevelta 40 Zabrze41-800 Poland Department of Clinical Engineering Academy of Silesia Rolna 43 Katowice40-555 Poland German Research Center for Artificial Intelligence Ratzeburger Allee 160 Lübeck23562 Germany

ISBN: (纸本)9783031821424

Electrocardiography (ECG) is vital for diagnosing and monitoring cardiovascular diseases. automatic interpretation of ECG signals, particularly classifying heartbeats, is essential in diagnosing these conditions. We compared the performance of three classifiers (K-Nearest Neighbors (KNN), Random Forests (RF), and Support Vector Machine (SVM)) using heartbeat and ECG signal features. We trained the classifiers on 173 heartbeats from 11 recordings in the MIT-BIH Arrhythmia (MITDB) Database. To address imbalance, we used SMOTE (Synthetic Minority Over-sampling Technique) to increase the number of abnormal heartbeats. We divided the data into 70% for training set and 30% for testing set, evaluating performance through 10-fold cross-validation. Results demonstrated state-of-the-art performance for KNN, RF, and SVM. KNN achieved an overall accuracy, positive predictive value, and sensitivity of 0.977, 0.978, and 0.978, respectively. RF achieved an overall accuracy, precision, and sensitivity of 0.971, 0.972, and 0.971, respectively. SVM achieved a recall of 0.988, 0.989, and 0.988. SVM exhibited the highest overall performance in heartbeat classification (0.99), followed by KNN (0.98) and RF (0.97). © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Rough inference system for automated failure prediction in cooling devices

Rough inference system for automated failure prediction in c...

引用

Optimization Techniques for Learning (ICOTL), International Conference on

作者： Zbigniew Kokosiński Piotr Szydłowski Department of Automatic Control and Computer Engineering Cracow University of Technology Kraków Poland Efento Sp. z o.o. Kraków Poland

This article presents a versatile model of failure prediction in control systems of objects with large time constants. The basic model of a control unit consists of deterministic finite automaton (DFA) which states correspond to states of the system where system variables satisfy a given set of constraints. System failures can be predicted on the basis of time series of the selected signals. Further diagnosis is performed on the basis of rough set theory and original algorithms for attributes’ reduction and decision rule generation. A versatile failure prediction algorithm is constructed that integrates all involved techniques. Cooling systems are application examples of the proposed methodology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Low-Distortion Clustering with Ordinal and Limited Cardinal Information

arXiv

引用

arXiv 2024年

作者： Burkhardt, Jakob Caragiannis, Ioannis Fehrs, Karl Russo, Matteo Schwiegelshohn, Chris Shyam, Sudarshan Department of Computer Science Aarhus University Åbogade 34 Aarhus N8200 Denmark Department of Computer Control Management Engineering Sapienza University of Rome Via Ariosto 25 Rome00185 Italy

Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of n agents located in an underlying metric space, our goal is to partition them into k clusters, optimizing some social cost objective. The metric space is defined by a distance function d between the agent locations. Information about d is available only implicitly via n rankings, through which each agent ranks all other agents in terms of their distance from her. Still, even though no cardinal information (i.e., the exact distance values) is available, we would like to evaluate clustering algorithms in terms of social cost objectives that are defined using d. This is done using the notion of distortion, which measures how far from optimality a clustering can be, taking into account all underlying metrics that are consistent with the ordinal information available. Unfortunately, the most important clustering objectives (e.g., those used in the well-known k-median and k-center problems) do not admit algorithms with finite distortion. To sidestep this disappointing fact, we follow two alternative approaches: We first explore whether resource augmentation can be beneficial. We consider algorithms that use more than k clusters but compare their social cost to that of the optimal k-clusterings. We show that using exponentially (in terms of k) many clusters, we can get low (constant or logarithmic) distortion for the k-center and k-median objectives. Interestingly, such an exponential blowup is shown to be necessary. More importantly, we explore whether limited cardinal information can be used to obtain better results. Somewhat surprisingly, for k-median and k-center, we show that a number of queries that is polynomial in k and only logarithmic in n (i.e., only sublinear in the number of agents for the most relevant scenarios in practice) is enough to get constant distortion. © 2024, CC BY.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Average Communication Rate for Networked Event-Triggered Stochastic control Systems

引用

IEEE Transactions on control of Network Systems 2025年

作者： Zhang, Zengjie Liu, Qingchen Mamduhi, Mohammad H. Hirche, Sandra Eindhoven University of Technology Department of Electrical Engineering Netherlands University of Science and Technology of China Department of Automation Hefei China University of Birmingham School of Computer Science United Kingdom Technical University of Munich Chair of Information-Oriented Control Munich Germany

Quantifying the average communication rate (ACR) of a networked event-triggered stochastic control system (NET-SCS) with deterministic thresholds is challenging due to the non-stationary nature of the system's stochastic processes. For a NET-SCS, the propagation of nonlinear statistics of the network communication status brought up by deterministic thresholds makes the precise computation of ACR difficult. Previous work used to over-simplify the computation using a Gaussian distribution without incorporating this nonlinearity, leading to sacrificed precision. This paper proposes a novel approach to calculate the exact ACR for a NET-SCS using a recursive model. We use theoretical analysis and a numerical study to qualitatively evaluate the deviation gap of the conventional approach that ignores the side information. The accuracy of our proposed method, alongside its comparison with the simplified results of the conventional approach, is validated by experimental studies. Our work is promising to benefit the efficient resource planning of networked control systems with limited communication resources by providing accurate ACR computation. © 2025 IEEE.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

ACIGS: An automated large-scale crops image generation system based on large visual language multi-modal models

ACIGS: An automated large-scale crops image generation syste...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON)

作者： Bolong Liu Hao Zhang Jie Liu Qiang Wang Department of Control Science and Engineering Harbin Institute of Technology Harbin China Department of Computer Science and Technology Harbin Institute of Technology (ShenZhen) ShenZhen China

Smart agriculture requires an extensive convergence of information technology and agriculture. Attaining intelligence mandates an enormous amount of data to train models. However, it is challenging to acquire a large number of crop image data, limiting the application and growth of computer vision technology in agriculture. To address this problem, we designed a crop image generation system that combines a large language model with visual language multi-modal large models to augment the scale, variety, and resolution of crop image data. First, the system inputs existing real crop images into the visual language multimodal model to extract features and represent crop images in text form. Then, the system passes the crop text representation to the language model for cleaning and processing, which generates prompts to create crop images. The prompts are input into the visual language multi-modal model to generate crop images based on text representation of crops. The resulting crop images undergo image quality evaluation in the visual language multimodal model, and high-quality crop images are saved to the crop image dataset based on the quality evaluation. These steps lead to the formation of the final generated crop image dataset. The experimental results indicate that the crop images generated using the proposed system are similar to but different from the example images. This characteristic enables the expansion of crop data while circumventing redundancy and allowing for resolution control, which is crucial for dense segmentation tasks. Using this method, the existing data can be enlarged up to 7.5 times.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Decoding AI Judgment: How LLMs Assess News Credibility and Bias

arXiv

引用

arXiv 2025年

作者： Loru, Edoardo Nudo, Jacopo Marco, Niccolò Di Cinelli, Matteo Quattrociocchi, Walter Department of Computer Control and Management Engineering Sapienza University of Rome Viale Ariosto 25 Rome00185 Italy Department of Computer Science Sapienza University of Rome Viale Regina Elena 295 Rome00161 Italy

Large Language Models (LLMs) are increasingly used to assess news credibility, yet little is known about how they make these judgments. While prior research has examined political bias in LLM outputs or their potential for automated fact-checking, their internal evaluation processes remain largely unexamined. Understanding how LLMs assess credibility provides insights into AI behavior and how credibility is structured and applied in large-scale language models. This study benchmarks the reliability and political classifications of state-of-the-art LLMs—Gemini 1.5 Flash (Google), GPT-4o mini (OpenAI), and LLaMA 3.1 (Meta)—against structured, expert-driven rating systems such as NewsGuard and Media Bias Fact Check. Beyond assessing classification performance, we analyze the linguistic markers that shape LLM decisions, identifying which words and concepts drive their evaluations. We uncover patterns in how LLMs associate credibility with specific linguistic features by examining keyword frequency, contextual determinants, and rank distributions. Beyond static classification, we introduce a framework in which LLMs refine their credibility assessments by retrieving external information, querying other models, and adapting their responses. This allows us to investigate whether their assessments reflect structured reasoning or rely primarily on prior learned associations. © 2025, CC BY.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

A New Mutimodel approach for modelling of fractional order interval transfer functions 20

A New Mutimodel approach for modelling of fractional order i...

引用

20th International Multi-Conference on Systems, Signals and Devices, SSD 2023

作者： Talmoudi, Samia Ksouri, Moufida Lahmari Applied College Department of Computer Science University of Tabuk Tabuk Saudi Arabia University of Tunis El Manar National Engineering School of Tunis LR11ES20 Analysis Design and Control of Systems Laboratory Tunis1002 Tunisia

ISBN: (纸本)9798350332568

This paper is focused on uncertain fractional order systems. In this context, a new modelling approach of uncertain fractional order systems represented by an explicit fractional order interval transfer function is proposed. This approach is based, essentially, on multimodel approach. In fact, firstly, two new determination methods of models' library, inspired from the Kharitonov approach, are exposed. Then, we propose to compute the validity degree of each model of the obtained library, by optimizing a constrained least squares problem. The global model is, finally deduced by fusion of outputs of the different library' models. To prove its efficiency and its precision, the proposed approach is then compared to the approximation approach of Oustaloup through two simulation examples. © 2023 IEEE.

关键词： Transfer functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：