A study of eight independent instances of evolution of a distinct mode of swimming by animals such as rays and cuttlefish shows repeated arrival at a single optimal solution.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4412493 | PMC |
| http://dx.doi.org/10.1371/journal.pbio.1002124 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Balanced dung beetle optimization algorithm based on parameter substitution and escape strategy.
Sci Rep
January 2025
School of Statistics and Applied Mathematics, Anhui University of Finance and Economics, Anhui, 10378, China.
Dung Beetle algorithm is an intelligent optimization algorithm with advantages in exploitation ability. However, due to the high randomness of parameters, premature convergence and other reasons, there is an imbalance between exploration and exploitation ability, and it is easy to fall into the problem of local optimal solution. The purpose of this study is to improve the optimization performance of dung beetle algorithm and explore its engineering application value.
View Article and Find Full Text PDFAdvanced microgrid optimization using price-elastic demand response and greedy rat swarm optimization for economic and environmental efficiency.
Sci Rep
January 2025
Department of Theoretical Electrical Engineering and Diagnostics of Electrical Equipment, Institute of Electrodynamics, National Academy of Sciences of Ukraine, Beresteyskiy, 56, Kyiv-57, Kyiv, 03680, Ukraine.
In this paper, a comprehensive energy management framework for microgrids that incorporates price-based demand response programs (DRPs) and leverages an advanced optimization method-Greedy Rat Swarm Optimizer (GRSO) is proposed. The primary objective is to minimize the generation cost and environmental impact of microgrid systems by effectively scheduling distributed energy resources (DERs), including renewable energy sources (RES) such as solar and wind, alongside fossil-fuel-based generators. Four distinct demand response models-exponential, hyperbolic, logarithmic, and critical peak pricing (CPP)-are developed, each reflecting a different price elasticity of demand.
View Article and Find Full Text PDFt2 Occupancy as an Effective and Predictive Descriptor for the Design of High-Performance Spinel Oxide Peroxidase-like Nanozymes.
Angew Chem Int Ed Engl
January 2025
Nanjing University, Biomedical Engineering, 22 Hankou Rd, 210093, Nanjing, CHINA.
Nanozymes are next generation of enzyme mimics. Due to the lack of activity descriptors, most nanozymes were discovered through trial-and-error strategies or by accident. While eg occupancy in an octahedral crystal field was proven as an effective descriptor, the t2 in a tetrahedral crystal field has rarely been explored.
View Article and Find Full Text PDFDeep Equilibrium Unfolding Learning for Noise Estimation and Removal in Optical Molecular Imaging.
Comput Med Imaging Graph
January 2025
CAS Key Laboratory of Molecular Imaging, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China; School of Artificial Intelligence, University of Chinese Academy of Sciences, Beijing 100049, China; National Key Laboratory of Kidney Diseases, Beijing 100853, China. Electronic address:
In clinical optical molecular imaging, the need for real-time high frame rates and low excitation doses to ensure patient safety inherently increases susceptibility to detection noise. Faced with the challenge of image degradation caused by severe noise, image denoising is essential for mitigating the trade-off between acquisition cost and image quality. However, prevailing deep learning methods exhibit uncontrollable and suboptimal performance with limited interpretability, primarily due to neglecting underlying physical model and frequency information.
View Article and Find Full Text PDFRuntime Analysis of Typical Decomposition Approaches in MOEA/D for Many-Objective Optimization Problems.
Evol Comput
January 2025
College of Science, Northwest A&F University, Yangling 712100, China
Decomposition-based multi-objective evolutionary algorithms (MOEAs) are popular methods utilized to address many-objective optimization problems (MaOPs). These algorithms decompose the original MaOP into several scalar optimization subproblems, and solve them to obtain a set of solutions to approximate the Pareto front (PF). The decomposition approach is an important component in them.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!