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

A robust multi-objective optimization algorithm for accurate parameter estimation for solar cell models

Soft Computing 2024年第19期28卷 11265-11277页

作者： Singla, Manish Kumar Gupta, Jyoti Alsharif, Mohammed H. Kim, Mun-Kyeom Aljaidi, Mohammad Safaraliev, Murodbek Department of Interdisciplinary Courses in Engineering Chitkara University Institute of Engineering & ampTechnology Chitkara University Punjab India Applied Science Research Center Applied Science Private University Amman11931 Jordan School of Engineering and Technology K. R. Mangalam University Gurgaon Haryana122003 India Department of Electrical Engineering College of Electronics and Information Engineering Sejong University 209 Neungdong-Ro Gwangjin-Gu Seoul05006 Korea Republic of School of Energy System Engineering Chung-Ang University 84 Heukseok-Ro Dongjak-Gu Seoul06974 Korea Republic of Department of Computer Science Zarqa University Zarqa13110 Jordan Department of Automated Electrical Systems Ural Federal University Yekaterinburg620002 Russia

The accuracy of solar cell models is crucial for enhancing the performance of solar photovoltaic (PV) systems. However, existing solar cell models lack precise parameters, and the manufacturer's datasheet does not provide the required information for reliable modeling. Consequently, accurate parameter estimation becomes necessary. This paper presents a simple multi-objective optimization algorithm (Hybrid Particle Swarm Optimization and Rat Search Algorithm (PSORSA)) designed to estimate cell parameters based on this observation. Unlike other optimization algorithms addressing this issue, the proposed algorithm aims to overcome challenges related to local minima and premature convergence, which often lead to suboptimal results. The paper focuses on assessing the reliability of the proposed algorithm by comparing its performance with other well-known optimization algorithms. The proposed optimizing algorithm is tested on the CEC 2019 benchmark function. Experimental results (RMSE), including statistical analysis, validate the algorithm's effectiveness by comparing them with other algorithms. At the end, non-parametric test is performed to justify the outcomes, vouching for the better performance of the proposed algorithm. The findings demonstrate that the proposed algorithms are particularly well-suited for estimating solar PV models. With its simple structure and high accuracy, the proposed algorithm exhibits great potential for various applications in the field of solar energy. Moreover, its computational efficiency and ease of implementation further contribute to its practicality. © The Author(s) 2024.

关键词： Solar cells

来源：评论

学校读者我要写书评

暂无评论

Generalized Continuous-Time Models for Nesterov’s Accelerated Gradient Methods

arXiv

引用

arXiv 2024年

作者： Park, Chanwoong Cho, Youngchae Yang, Insoon Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Automation and Systems Research Institute Seoul National University Seoul08826 Korea Republic of Department of Electrical and Computer Engineering Automation and Systems Research Institute Seoul National University Seoul08826 Korea Republic of

Recent research has indicated a substantial rise in interest in understanding Nesterov’s accelerated gradient methods via their continuous-time models. However, most existing studies focus on specific classes of Nesterov’s methods, which hinders the attainment of an in-depth understanding and a unified perspective. To address this deficit, we present generalized continuous-time models that cover a broad range of Nesterov’s methods, including those previously studied under existing continuous-time frameworks. Our key contributions are as follows. First, we identify the convergence rates of the generalized models, eliminating the need to determine the convergence rate for any specific continuous-time model derived from them. Second, we show that six existing continuous-time models are special cases of our generalized models, thereby positioning our framework as a unifying tool for analyzing and understanding these models. Third, we design a restart scheme for Nesterov’s methods based on our generalized models and show that it ensures a monotonic decrease in objective function values. Owing to the broad applicability of our models, this scheme can be used to a broader class of Nesterov’s methods compared to the original restart scheme. Fourth, we uncover a connection between our generalized models and gradient flow in continuous time, showing that the accelerated convergence rates of our generalized models can be attributed to a time reparametrization in gradient flow. Numerical experiment results are provided to support our theoretical analyses and results. © 2024, CC BY-NC-ND.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Binary Bleed: Fast Distributed and Parallel Method for Automatic Model Selection

Binary Bleed: Fast Distributed and Parallel Method for Autom...

引用

2024 IEEE High Performance Extreme Computing Conference, HPEC 2024

作者： Barron, Ryan Eren, Maksim E. Bhattarai, Manish Boureima, Ismael Matuszek, Cynthia Alexandrov, Boian S. Theoretical Division Los Alamos National Laboratory Los Alamos United States University of Maryland Baltimore County Department of Computer Science and Electrical Engineering MD United States Advanced Research in Cyber Systems Los Alamos National Laboratory Los Alamos United States

ISBN: (纸本)9798350387131

In several Machine Learning (ML) clustering and dimensionality reduction approaches, such as nonnegative matrix factorization (NMF), RESCAL, and K-Means clustering, users must select a hyper-parameter k to define the number of clusters or components that yield an ideal separation of samples or clean clusters. This selection, while difficult, is crucial to avoid overfitting or underfitting the data. Several ML applications use scoring methods (e.g., Silhouette and Davies Boulding scores) to evaluate the cluster pattern stability for a specific k. The score is calculated for different trials over a range of k, and the ideal k is heuristically selected as the value before the model starts overfitting, indicated by a drop or increase in the score resembling an elbow curve plot. While the grid-search method can be used to accurately find a good k value, visiting a range of k can become time-consuming and computationally resource-intensive. In this paper, we introduce the Binary Bleed method based on binary search, which significantly reduces the k search space for these grid-search ML algorithms by truncating the target k values from the search space using a heuristic with thresholding over the scores. Binary Bleed is designed to work with single-node serial, single-node multi-processing, and distributed computing resources. In our experiments, we demonstrate the reduced search space gain over a naive sequential search of the ideal k and the accuracy of the Binary Bleed in identifying the correct k for NMFk, K-Means pyDNMFk, and pyDRESCALk with Silhouette and Davies Boulding scores. We make our implementation of Binary Bleed for the NMF algorithm available on GitHub. © 2024 IEEE.

关键词： Dimensionality reduction

来源：评论

学校读者我要写书评

暂无评论

Optimum sensors allocation for drones multi-target tracking under complex environment using improved prairie dog optimization

引用

Neural Computing and Applications 2024年第18期36卷 10501-10525页

作者： Zitar, Raed Abu Alhadhrami, Esra Abualigah, Laith Barbaresco, Frederic Seghrouchni, Amal ElFallah Thales/SCAI Sorbonne University Abu Dhabi United Arab Emirates Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Computer Science Department Al al-Bayt University Mafraq25113 Jordan MEU Research Unit Middle East University Amman11831 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon Research Center University of Tabuk Tabuk71491 Saudi Arabia Thales Land and Air Systems Paris France Mohammed VI Polytechnic University-Ai movement Rabat Morocco Sorbonne University Paris France College of Engineering Yuan Ze University Taoyuan Taiwan School of Engineering and Technology Sunway University Malaysia Petaling Jaya Malaysia Applied science research center Applied science private university Amman Jordan

This paper presents a novel hybrid optimization method to solve the resource allocation problem for multi-target multi-sensor tracking of drones. This hybrid approach, the Improved Prairie Dog Optimization Algorithm (IPDOA) with the Genetic Algorithm (GA), utilizes the strengths of both algorithms to improve the overall optimization performance. The goal is to select a set of sensors based on norms of weighted distances cost function. The norms are the Euclidean distance and the Mahalanobis distance between the drone location and the sensors. The second one depends on the predicted covariance of the tracker. The Extended Kalman Filter (EKF) is used for state estimation with proper clutter and detection models. Since we use Multi-objects to track, the Joint Probability Distribution Function (JPDA) estimates the best measurement values with a preset gating threshold. The goal is to find a sensor or minimum set of sensors that would be enough to generate high-quality tracking based on optimum resource allocation. In the experimentation simulated with Stone Soup, one radar among five radars is selected at every time step of 50-time steps for 200 tracks distributed over 20 different ground truths. The proposed IPDOA provided optimum solutions for this complex problem. The obtained solution is an optimum offline solution that is used to select one or more sensors for any future flights within the vicinity of the 5 radars. Environment and conditions are assumed to be similar in future drone flights within the radars’ defined zone. The IPDOA performance was compared with the other 8 metaheuristic optimization algorithms and the testing showed its superiority over those techniques for solving this complex problem. The proposed simulated model can find the most relevant sensor(s) capable of generating the best quality tracks based on weighted distance criteria (Euclidean and Mahalanobis). That would cut down the cost of operating extra sensors and then it would be possible to

关键词： Clutter (information theory)

来源：评论

学校读者我要写书评

暂无评论

Tuning PID Controller Parameters of Automatic Voltage Regulator (AVR) Using Particle Swarm Optimization : A Comparative Study

Tuning PID Controller Parameters of Automatic Voltage Regula...

引用

IEEE PES Conference on Innovative Smart Grid Technologies - Middle East (ISGT Middle East)

作者： Sultan Alghamdi Awadh Ba Wazir Hassan Hadi H Awaji Abdullah Ali Alhussainy Hatem Faiz Sindi Muhyaddin Rawa Department of Electrical and Computer Engineering Smart Grids Research Group Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz University Jeddah Saudi Arabia Department of Electrical and Computer Engineering King Abdulaziz University1 Jeddah Saudi Arabia

Proportional integral derivative controller is commonly used to control devices, which is a transfer function consisting of three parameters which are: Proportional Gain (kp), Integral Gain (ki) and Derivative Gain (kd). The problem of the PID controller is that the gains (kp, ki and kd) must be chosen carefully in order to get better performance. In this paper, Particle swarm optimization (PSO) applies to obtain these gains. PID controller applies to Automatic Voltage Regulator in this paper. Furthermore, this paper presents simulation results that are used for comparing the proposed gains of PID controller and base system gains based on performance criteria in the time domain (Transient Analysis), including the overshoot, rise time, settling time, and steadystate error. In addition, this paper presents a simulation for the terminal voltage response to show the efficiency of the PSO method compared with the Genetic Algorithm (GA) method and the simulated Annealing (SA) method.

关键词： Regulators Transfer functions Automatic voltage control Steady-state Smart grids Particle swarm optimization Transient analysis

来源：评论

学校读者我要写书评

暂无评论

Cyber-Security Knowledge Graph Generation by Hierarchical Nonnegative Matrix Factorization 12

Cyber-Security Knowledge Graph Generation by Hierarchical No...

引用

12th International Symposium on Digital Forensics and Security, ISDFS 2024

作者： Barron, Ryan Eren, Maksim E. Bhattarai, Manish Wanna, Selma Solovyev, Nicholas Rasmussen, Kim Alexandrov, Boian S. Nicholas, Charles Matuszek, Cynthia Los Alamos National Laboratory Theoretical Division Los Alamos United States Los Alamos National Laboratory Advanced Research in Cyber Systems Los Alamos United States University of Maryland Department of Computer Science and Electrical Engineering Baltimore CountyMD United States

ISBN: (纸本)9798350330366

Much of human knowledge in cybersecurity is encapsulated within the ever-growing volume of scientific papers. As this textual data continues to expand, the importance of document organization methods becomes increasingly crucial for extracting actionable insights hidden within large text datasets. Knowledge Graphs (KGs) serve as a means to store factual information in a structured manner, providing explicit, interpretable knowledge that includes domain-specific information from the cybersecurity scientific literature. One of the challenges in constructing a KG from scientific literature is the extraction of ontology from unstructured text. In this paper, we address this topic and introduce a method for building a multi-modal KG by extracting structured ontology from scientific papers. We demonstrate this concept in the cybersecurity domain. One modality of the KG represents observable information from the papers, such as the categories in which they were published or the authors. The second modality uncovers latent (hidden) patterns of text extracted through hierarchical and semantic non-negative matrix factorization (NMF), such as named entities, topics or clusters, and keywords. We illustrate this concept by consolidating more than two million scientific papers uploaded to arXiv into the cyber-domain, using hierarchical and semantic NMF, and by building a cyber-domain-specific KG. © 2024 IEEE.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Enhancing Mild Cognitive Impairment Detection through Efficient Magnetic Resonance Image Analysis

引用

computers, Materials & Continua 2024年第8期80卷 2081-2098页

作者： Atif Mehmood Zhonglong Zheng Rizwan Khan Ahmad Al Smadi Farah Shahid Shahid Iqbal Mutasem K.Alsmadi Yazeed Yasin Ghadi Syed Aziz Shah Mostafa M.Ibrahim Department of Computer Science and Technology Zhejiang Normal UniversityJinhua321002China Zhejiang Institute of Photoelectronics&Zhejiang Institute for Advanced Light Source Zhejiang Normal UniversityJinhua321004China Department of Data Science and Artificial Intelligence Zarqa UniversityZarqa13100Jordan School of Chemical and Environmental Engineering College of ChemistryChemical Engineering andMaterials ScienceSoochow UniversitySuzhou215123China Department of Management Information Systems College of Applied Studies and Community ServiceImam Abdulrahman Bin Faisal UniversityDammam32244Saudi Arabia Department of Computer Science Al Ain UniversityAbu Dhabi999041United Arab Emirates Department of Electrical Engineering Faculty of EngineeringMinia UniversityMinia61519Egypt Healthcare Technology and Innovation Theme Faculty Research Centre for Intelligent HealthcareCoventry UniversityCoventryCV48BWUK

Neuroimaging has emerged over the last few decades as a crucial tool in diagnosing Alzheimer’s disease(AD).Mild cognitive impairment(MCI)is a condition that falls between the spectrum of normal cognitive function and ***,previous studies have mainly used handcrafted features to classify MCI,AD,and normal control(NC)*** paper focuses on using gray matter(GM)scans obtained through magnetic resonance imaging(MRI)for the diagnosis of individuals with MCI,AD,and *** improve classification performance,we developed two transfer learning strategies with data augmentation(i.e.,shear range,rotation,zoom range,channel shift).The first approach is a deep Siamese network(DSN),and the second approach involves using a cross-domain strategy with customized *** performed experiments on the Alzheimer’s Disease Neuroimaging Initiative(ADNI)dataset to evaluate the performance of our proposed *** experimental results demonstrate superior performance in classifying the three binary classification tasks:NC ***,NC ***,and MCI ***,we achieved a classification accuracy of 97.68%,94.25%,and 92.18%for the three cases,*** study proposes two transfer learning strategies with data augmentation to accurately diagnose MCI,AD,and normal control individuals using GM *** findings provide promising results for future research and clinical applications in the early detection and diagnosis of AD.

关键词： Alzheimer’s disease mild cognitive impairment normal control transfer learning classification augmentation

来源：评论

学校读者我要写书评

暂无评论

Designing a Distributed Multi-agent System for Compiler Optimization

Designing a Distributed Multi-agent System for Compiler Opti...

引用

2021 Zooming Innovation in Consumer Technologies Conference, ZINC 2021

作者： Sari, Alparslan Sahin, Cagri Butun, Ismail University of Delaware Electrical and Computer Engineering Computer Systems and Networking NewarkDE United States Gazi University Computer Engineering Software Research Group Ankara Turkey Chalmers University of Technology Computer Science and Engineering Network and Systems Division Gothenburg Sweden

ISBN: (纸本)9781665404174

This paper explores the run time performance improvements using different GCC optimization flags in program compilation. As multi-core microprocessor systems replacing legacy single-core ones, tremendous effort is needed to address to optimize the associated compilers for newly designed architectures in order to suit them for running parallel programming on multiple cores. Therefore, the aim of this paper is to address this challenge by designing an optimum distributed multi-agent system to perform compiler optimization. A multi-agent framework is adopted to utilize random and genetic algorithm-based search algorithm to find the best GCC optimization flags for a given program. The framework is highly scalable and can be extended with distributed system concept to perform code compilation in parallel to find the best-optimized code sequence in a short amount of time. The initial performance results have promising indicators which clearly show that the performance improvement is achieved. © 2021 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Sensitivity of DC Network Representation for GIC Analysis

Sensitivity of DC Network Representation for GIC Analysis

引用

IEEE Texas Power and Energy Conference (TPEC)

作者： Aniruddh Mishra Arthur K. Barnes Jose E. Tabarez Adam Mate Department of Electrical and Computer Engineering University of Texas at Austin Austin TX Information Systems and Modeling Group Los Alamos National Laboratory Los Alamos NM

ISBN: (数字)9798331541125

ISBN: (纸本)9798331541132

Geomagnetic disturbances are a threat to the reliability and security of our national critical energy infrastructures. These events specifically result in geomagnetically induced currents, which can cause damage to transformers due to magnetic saturation. In order to mitigate these effects, blocker devices must be placed in optimal locations. Finding this placement requires a dc representation of the ac transmission lines, which this paper discusses. Different decisions in this process, including the method of representing the blocking devices, result in significant variations to the power loss calculations. To analyze these effects, we conclude the paper by comparing the losses on a sample network with different modeling implementations.

关键词： Analytical models Sensitivity Substations Power transmission lines Windings Circuit faults Security Reliability Electric fields Saturation magnetization

来源：评论

学校读者我要写书评

暂无评论

Delay Minimization of Task Offloading in O-RAN Architecture

Delay Minimization of Task Offloading in O-RAN Architecture

引用

IEEE Future Networks World Forum (FNWF)

作者： Nikos A. Mitsiou Sotiris A. Tegos Thomas Lagkas Panagiotis Sarigiannidis George K. Karagiannidis Department of Electrical and Computer Engineering Aristotle University of Thessaloniki Thessaloniki Greece Department of Computer Science Democritus University of Thrace Kavala Greece Department of Electrical and Computer Engineering University of Western Macedonia Kozani Greece Artificial Intelligence & Cyber Systems Research Center Lebanese American University (LAU) Lebanon

ISBN: (数字)9798350379495

ISBN: (纸本)9798350379501

In this paper, we propose a heuristic algorithm for minimizing the delay of task offloading within the open radio access network (O-RAN) architecture. We model the O-RAN architecture using a directed graph connecting its various components. Assuming that frequency-division multiplexing (FDM) is used between all users sharing the same communication link, and applying the M/M/1 queueing model at the O-RAN central units (O-CUs), we update the graph weights and design a heuristic algorithm to provide delay-efficient routing for all users. Numerical results demonstrate the performance of the algorithm and provide insights into the O-RAN architecture.

关键词： Heuristic algorithms Scalability Directed graphs Open RAN Routing Minimization Delays Numerical models Frequency division multiplexing Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：