Modelling and Simulation of Perturb and Observe MPPT Algorithm Based on The PI Controller for Photovoltaic System by Ahlam Mohamad Shakoor, Hersh Hasan Taha

“…The proposed PV system is composed of a Photovoltaic array, DC to DC boost type converter and an MPPT algorithm using perturb and observe method. 1Soltech 1STH-220-P module type was chosen in this study for the simulation and proposed PV The array consists of 40 rows of PV modules connected in parallel, while each row consists of 10 modules connected in a series. …”
Get full text

Improving kinetic model fitting for total titratable acidity in bananas using genetic algorithms by Alejandro Kevin Méndez Castillo, Elizabeth Contreras López, Jesús Guadalupe Pérez Flores, Laura García Curiel, Emmanuel Pérez Escalante, Karla Soto Vega, Carlos Ángel-Jijón, Alicia Cervantes Elizarrarás

“… This research aimed to automate the fitting of kinetic models using genetic algorithms (GAs) to optimize the estimation of kinetic parameters—the reaction rate constant (k) and the initial value of total titratable acidity (TTA, C₀)—and enhance predictive accuracy. …”
Get full text

Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search by Amr Elshahed, Majid Khan Bin Majahar Ali, Ahmad Sufril Azlan Mohamed, Farah Aini Binti Abdullah, Ts. Lee Jian Aun

“…Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions, while others like Depth-First Search (DFS) and Greedy Best-First Search prioritize speed over optimality. …”
Get full text

Cellular-free RAN slicing resource allocation algorithm based on multi-timescale collaboration by XIA Weiwei, WANG Boye, XIA Yaxing, MIAO Weiwei, WANG Dayang, JING Dongsheng, YAN Feng, SHEN Lianfeng

“…To address the issue of ensuring user quality of service in resource allocation for 6G cell-free radio access network slicing under dynamic service variations, a resource allocation algorithm based on multi-timescale collaborative optimization was proposed. …”
Get full text

A dereverberation beamforming algorithm for noise source localization in anechoic and semi-reverberant environments by R. Singh, A. Mimani, R. Kumar

“…Additionally, the CLEAN-SC deconvolution applied to the DBF maps of the mixer-grinder significantly improved the source resolution. • DBF algorithm is presented based on CCM filtering using an optimized Hanning window to significantly improve the localization accuracy of noise sources within λ/20 uncertainty. • Trial-and-error method is used to determine the optimal Hanning window width, which depends on frequency, noise source and surroundings. • It was necessary to implement DBF even in an anechoic chamber to accurately localize noise sources generated by engineering applications.…”
Get full text

Hybrid Estimation of Distribution Algorithm for Solving Three-Stage Multiobjective Integrated Scheduling Problem by Chao Deng, Rong Hu, Bin Qian, Huai P. Jin

“…A variable neighborhood hybrid operation based on the speed scheduling set is designed in Local Search II to further improve the quality of the solution while balancing the optimization goals. Finally, simulations and comparisons show the efficiency of the proposed HEDA_VNS.…”
Get full text

Comparative Study of Algorithms for the Conversion From Surface Mesh Models to Volume Mesh Models by Youxi Wang, Qi Pang, Meng Li, Yang Liu

“…The results showed that the Frontal algorithm performed the best in the conversion of simple models with a CPU runtime of 0.001 s, while the Delaunay algorithm took relatively longer. …”
Get full text

A clustering algorithm based on grids for core data and adjacency relationships for edge data by Honglei He

“…To address these issues, existing research primarily focuses on three directions: (1) optimizing the adaptive selection of grid parameters, which struggles to handle variations in cluster density; (2) improving grid division methods (e.g., multi-granularity or dynamic grids), which have limited effectiveness on complex-shaped data; and (3) integrating other clustering techniques, which enhances accuracy but increases algorithmic complexity. …”
Get full text

Barcode-free multiplex plasmid sequencing using Bayesian analysis and nanopore sequencing by Masaaki Uematsu, Jeremy M Baskin

“…Long-read sequencing has emerged as a competitor to Sanger sequencing, with the principal benefit that whole plasmids can be sequenced in a single run. …”
Get full text

Risk of AI Algorithmic Discrimination Embedded in Government Data Governance and Its Prevention and Control by PENG Lihui, ZHANG Qiong, LI Tianyi

“…To address this issue, this study proposed a series of targeted prevention and control measures, including clarifying the principle of algorithmic fairness, formulating industry norms and standards, improving the accountability mechanism and regulatory system, and optimizing the data collection and processing environment, so as to effectively curb the phenomenon of algorithmic discrimination while making full use of the advantages of AI technology, so that AI technology in government data governance can truly benefit the people, and promote social fairness and justice.…”
Get full text

Stress management with HRV following AI, semantic ontology, genetic algorithm and tree explainer by Ayan Chatterjee, Michael A. Riegler, K. Ganesh, Pål Halvorsen

“…Various techniques like feature selection and dimensionality reduction are explored to improve classification accuracy while minimizing bias. Different machine learning (ML) algorithms, including traditional and ensemble methods, are employed for analyzing both imbalanced and balanced HRV datasets. …”
Get full text

Construction and Application of Carbon Emissions Estimation Model for China Based on Gradient Boosting Algorithm by Dongjie Guan, Yitong Shi, Lilei Zhou, Xusen Zhu, Demei Zhao, Guochuan Peng, Xiujuan He

“…Key variables were selected through correlation analysis, missing values were interpolated using K-means clustering, and model parameters were systematically optimized via grid search and cross-validation. Among the algorithms tested, LightGBM achieved the best performance (R² = 0.992, RMSE = 0.297), demonstrating both robustness and efficiency. …”
Get full text

Chinese National Condition Based Power Dispatching Optimization in Microgrids by Gang Chen, Jian-Ming Wang, Xiao-Dong Yuan, Liang Chen, Lu-Jia Zhao, Yu-Ling He

“…This paper proposed a study on the power dispatching optimization in the microgrid aiming at Chinese national condition based on PSO algorithm. …”
Get full text

AVS3 intra frame prediction parallel algorithm based on minimum CU cost by ZHANG Quan, WANG Shun, LIU Yangyi, DUAN Chang, PENG Bo

“…To address the time-consuming issue of audio video coding standard 3(AVS3) intra frame prediction, an intra frame prediction parallel algorithm based on the cost of the minimum coding unit (CU) was proposed. …”
Get full text

Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios by Geng CHEN, Zhiwei XING, Fei SHEN, Qingtian ZENG

“…A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.…”
Get full text

Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios by Geng CHEN, Zhiwei XING, Fei SHEN, Qingtian ZENG

“…A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.…”
Get full text

Comparing Geodesic Filtering to State-of-the-Art Algorithms: A Comprehensive Study and CUDA Implementation by Pierre Boulanger, Sadid Bin Hasan

“…Additionally, we present a highly optimized GPU implementation featuring innovative wave-propagation algorithms and memory access optimization techniques that achieve a 200× speedup, making geodesic filtering practical for real-time applications. …”
Get full text

Combining 3-Opt and Improved Discrete Cuckoo Search Algorithm for the Traveling Salesman Problem by A. Sarucan, M. F. Berkaya

“…In terms of processing time, the average time of the proposed algorithm was 11.46 seconds, while the average time of the improved discrete CSA was 92.86 seconds. …”
Get full text

An Improved KF-RBF Based Estimation Algorithm for Coverage Control with Unknown Density Function by Lei Zuo, Maode Yan, Yaoren Guo, Wenrui Ma

“…A cost function, depending on the density function and a certain metric, is provided to evaluate the performance of coverage network. Then, while considering the sampling noise, a novel estimation algorithm is developed to approximate the density function based on the Kalman filter (KF) and the Radial Basis Function (RBF) neural network. …”
Get full text

Dual FOPID-neural network controller based on fast grey wolf optimizer: application to two-inputs two-outputs helicopter by Amar Rezoug, Jamshed Iqbal, Abdelkrim Nemra

“…The DRF-FG showed robustness in trajectory tracking compared to the controllers based on the Ant Lion Optimizer (DRF-A) and the Whale Optimization Algorithm (DRF-W). …”
Get full text