AI Article Synopsis
Article Abstract
Alignment of each optical element at a synchrotron beamline takes days, even weeks, for each experiment costing valuable beam time. Evolutionary algorithms (EAs), efficient heuristic search methods based on Darwinian evolution, can be utilized for multi-objective optimization problems in different application areas. In this study, the flux and spot size of a synchrotron beam are optimized for two different experimental setups including optical elements such as lenses and mirrors. Calculations were carried out with the X-ray Tracer beamline simulator using swarm intelligence (SI) algorithms and for comparison the same setups were optimized with EAs. The EAs and SI algorithms used in this study for two different experimental setups are the Genetic Algorithm (GA), Non-dominated Sorting Genetic Algorithm II (NSGA-II), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC). While one of the algorithms optimizes the lens position, the other focuses on optimizing the focal distances of Kirkpatrick-Baez mirrors. First, mono-objective evolutionary algorithms were used and the spot size or flux values checked separately. After comparison of mono-objective algorithms, the multi-objective evolutionary algorithm NSGA-II was run for both objectives - minimum spot size and maximum flux. Every algorithm configuration was run several times for Monte Carlo simulations since these processes generate random solutions and the simulator also produces solutions that are stochastic. The results show that the PSO algorithm gives the best values over all setups.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10914178 | PMC |
| http://dx.doi.org/10.1107/S1600577524000717 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
PairK: Pairwise k-mer alignment for quantifying protein motif conservation in disordered regions.
Protein Sci
January 2025
Department of Biology, MIT, Cambridge, Massachusetts, USA.
Protein-protein interactions are often mediated by a modular peptide recognition domain binding to a short linear motif (SLiM) in the disordered region of another protein. To understand the features of SLiMs that are important for binding and to identify motif instances that are important for biological function, it is useful to examine the evolutionary conservation of motifs across homologous proteins. However, the intrinsically disordered regions (IDRs) in which SLiMs reside evolve rapidly.
View Article and Find Full Text PDFNew search strategy for multi-objective evolutionary algorithm.
Heliyon
December 2024
Software School of Anyang Normal University, Anyang, 455002, Henan, China.
To address the problem of low search efficiency of multi-objective evolutionary algorithm during iterations, we proposed a new idea which considering a single individual to generate better solutions in a single iteration as a starting point to improve the search performance of multi-objective evolutionary algorithm and designedthe neighbor strategy and guidance strategy based on this improved approach in this paper. We used our proposed new search strategy to improve NSGA-III algorithm(named as NSGA-III/NG) and MOEA/D algorithm(named as MOEA/D-NG). On ZDT, DTLZ and WFG public test sets, the NSGA-III/NG algorithm using the new search strategy was compared with NSGA-II algorithm, NSGA-III algorithm, ANSGA-III algorithm and NSGA-II/ARSBX algorithm.
View Article and Find Full Text PDFOn the parameterized complexity of the median and closest problems under some permutation metrics.
Algorithms Mol Biol
December 2024
Instituto de Computação, Universidade Federal Fluminense, Niterói, Brazil.
Genome rearrangements are events where large blocks of DNA exchange places during evolution. The analysis of these events is a promising tool for understanding evolutionary genomics, providing data for phylogenetic reconstruction based on genome rearrangement measures. Many pairwise rearrangement distances have been proposed, based on finding the minimum number of rearrangement events to transform one genome into the other, using some predefined operation.
View Article and Find Full Text PDFAccurate predictions of SARS-CoV-2 infectivity from comprehensive analysis.
Elife
December 2024
Department of Medical Informatics, College of Medicine, The Catholic University of Korea, Seoul, Republic of Korea.
An unprecedented amount of SARS-CoV-2 data has been accumulated compared with previous infectious diseases, enabling insights into its evolutionary process and more thorough analyses. This study investigates SARS-CoV-2 features as it evolved to evaluate its infectivity. We examined viral sequences and identified the polarity of amino acids in the receptor binding motif (RBM) region.
View Article and Find Full Text PDFEpidemiological, molecular, and evolutionary characteristics of G1P[8] rotavirus in China on the eve of RotaTeq application.
Front Cell Infect Microbiol
December 2024
National Key Laboratory of Intelligent Tracking and Forecasting for Infectious Diseases (NITFID), National Health Commission Key Laboratory for Medical Virology and Viral Diseases, National Institute for Viral Disease Control and Prevention, Chinese Center for Disease Control and Prevention, Beijing, China.
Introduction: This study, conducted in China prior to RotaTeq's launch, examined the epidemiological, molecular, and evolutionary features of the G1P[8] genotype RVA in children admitted with diarrhea, to aid in evaluating its efficacy and impact on G1P[8] RVA in China.
Methods: Data from the Chinese viral diarrhea surveillance network were collected from January 2016 to December 2018. RVA strains identified as the G1P[8] genotype were subjected to whole-genome sequencing.
Want 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!