ANS is committed to advancing, fostering, and promoting the development and application of nuclear sciences and technologies to benefit society.
Explore the many uses for nuclear science and its impact on energy, the environment, healthcare, food, and more.
Explore membership for yourself or for your organization.
Conference Spotlight
2026 ANS Annual Conference
May 31–June 3, 2026
Denver, CO|Sheraton Denver
Latest Magazine Issues
Mar 2026
Jan 2026
Latest Journal Issues
Nuclear Science and Engineering
March 2026
Nuclear Technology
February 2026
Fusion Science and Technology
April 2026
Latest News
Kentucky disburses $10M in nuclear grants
The Kentucky Nuclear Energy Development Authority (KNEDA) recently distributed its first awards through the new Nuclear Energy Development Grant Program, which was established last year. In total, KNEDA disbursed $10 million to a variety of companies that will use the funding to support siting studies, enrichment supply-chain planning, workforce training, and curriculum development.
Haining Zhou, Volkan Seker, Thomas Downar
Nuclear Technology | Volume 206 | Number 6 | June 2020 | Pages 839-861
Technical Paper | doi.org/10.1080/00295450.2020.1746620
Articles are hosted by Taylor and Francis Online.
The paper presents a self-adaptive feature selection algorithm we developed for solving high-dimensional uncertainty quantification problems. The development of the algorithm was motivated and supported by the benchmarking of the Transient Reactor Test (TREAT) transient test 2857. The generalized polynomial chaos expansion scheme was adopted to decompose the response functions. Our algorithm was applied to select the dominant basis from the candidate polynomial basis in a self-adaptive manner by assigning weights to the polynomial basis and adjusting the weights using the least absolute shrinkage and selection operator regularization–estimated coefficients through iterations. The developed algorithm can recognize the significant basis terms in the polynomial expansion of the response functions and therefore build a sparse polynomial expansion using a limited number of samples. The algorithm was implemented and verified through three different TREAT modeling cases. The testing results demonstrated the general stability and prediction performance of our algorithm and provided useful information about the uncertainty mechanism of the TREAT transient test 2857.