Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity
Not Available
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Not Available
Microplastic spectral analysis is one of the most time-consuming processes in studying microplastic pollution, often requiring days per sample. Researchers are transitioning to automated batch and hyperspectral image analysis techniques to enhance efficiency. Open Specy, initially aimed at manual single-spectrum analysis, has now integrated automated methods. This updated version, Open Specy 1.0, introduces several new features, including two algorithms for automated processing (smoothing and particle compression), an extensive library containing over 40,000 open-source Raman and FTIR spectra, and two machine learning classifiers (logistic regression and k medoids) developed from this library. Furthermore, it includes a revamped user interface, an R package, and a benchmark data set for testing future advancements in automated techniques. Researchers evaluated various configurations for hyperspectral smoothing, particle identification, compression, and splitting, to achieve combined recovery rates between 50 and 150% particle counts, identities, and sizes with a coefficient of variation (CV) of less than 40% (the accredited standard). Mean absorbance times the standard deviation provided a consistent particle identification. Hyperspectral smoothing led to a 96% combined recovery rate and reduced variability (CV = 38%) compared to the 86% recovery (CV = 83%) of nonsmoothed controls. Additionally, compressing spectra for particles was significantly faster (>3x) and showed similar accuracy but with reduced variability than processing each pixel individually. Key challenges persist in automating spectral analysis, particularly in refining particle splitting algorithms, and improving identification routines to minimize false positives and negatives. In conclusion, new methods in sample preparation for better stabilization and dispersion of particles could overcome some of these issues.
Here, we report a scalable delamination procedure for a SSZ-70-framework layered-zeolite precursor, which for the first time does not involve either sonication or long-chain surfactants. Our approach instead relies on the mild heating of layered zeolite precursor B-SSZ-70(P) in an aqueous solution containing Zn(NO 3 ) 2 and tetrabutylammonium fluoride. Powder X-ray diffraction data are consistent with a loss of long-range order along the z-direction, while 29 Si MAS NMR spectroscopy demonstrates preservation of the zeolite framework crystallinity during delamination. The resulting delaminated material, DZ-2, possesses 1.4-fold higher external surface area relative to the nondelaminated three-dimensional zeolite B-SSZ-70, based on N2 physisorption data at 77 K. DZ-2 was functionalized with cationic Ti heteroatoms to synthesize Ti-DZ-2 via exchange with framework B. Ti-DZ-2 contains isolated titanium centers in its crystalline framework, as shown by UV-Vis spectroscopy. The generality of the synthetic delamination approach and catalyst synthesis is demonstrated with the synthesis of delaminated material DZ-3, which is derived from layered zeolite precursor ERB-1(P) with MWW framework topology. Upon catalytic testing for the epoxidation of 1-octene with ethylbenzene hydroperoxide as oxidant, under harsh tail-end conditions that deactivate amorphous Ti-silica-based catalysts, Ti-DZ-2 exhibits the highest per-Ti-site activity, selectivity, and stability for 1-octene epoxidation of all catalysts investigated. This testing includes the prior benchmark delaminated zeolite catalyst in this area, Ti-UCB-4, which possesses similar external surface area to Ti-DZ-2 but requires sonication and long-chain surfactants for its synthesis. The synthesis of DZ-2 is the first example of an economical delamination of layered zeolite precursor SSZ-70(P) and opens up new doors to the development of delaminated zeolites as commercial catalysts.
Accelerating the discovery of new molecules with targeted properties is a central challenge in molecular design. In this contribution, we present an AI-driven molecular discovery framework that integrates Large Language Models (LLMs) for generative molecular design with Machine Learning (ML)-based screening to identify novel Liquid Organic Hydrogen Carrier (LOHC) candidates. Using the developed framework, LOHC molecules were systematically generated, evaluated, and refined iteratively, combining LLM-guided molecular generation and ML-predicted hydrogenation enthalpies (Δ H ), under physicochemical property constraints such as optimal melting points (MP), desired hydrogen storage capacity (wt% H 2 ), and synthetic accessibility (SA) scores. This approach enabled the discovery of 42 new LOHC candidates in two distinct campaigns, one seeded with experimentally known and another with previously computationally identified LOHCs, respectively. Although we began with different numbers of starting molecules (31 vs . 7 seed molecules), both runs yielded a comparable number of viable candidates, suggesting an influence of chemically intuitive seed molecule selection for success. Selected LOHC molecules, such as 3-methyl pyridine, 1-ethylnapthalene, 1,1-diphenylethane, and benzofuran, were experimentally tested and compared with benchmark LOHCs (toluene and 9-ethylcarbazole) for hydrogenation using a series of commercial supported metal catalysts. The order of conversion into fully hydrogenated products at 200 °C was 3-methyl pyridine (100%) > 9-ethyl carbazole (86.4%) > 2,3-benzofuran (74%) > 1,1-diphenylethane (66.9%) > 1-ethylnapthalene (66.7%) > toluene (57%), further validating the AI-guided molecular design. This study demonstrates promise of LLM-driven molecular design in conjunction with ML-based screening for accelerated discovery and design of molecules.
We present the photon-plasma code, a modern high order charge conserving particle-in-cell code for simulating relativistic plasmas. The code is using a high order implicit field solver and a novel high order charge conserving interpolation scheme for particle-to-cell interpolation and charge deposition. It includes powerful diagnostics tools with on-the-fly particle tracking, synthetic spectra integration, 2D volume slicing, and a new method to correctly account for radiative cooling in the simulations. A robust technique for imposing (time-dependent) particle and field fluxes on the boundaries is also presented. Using a hybrid OpenMP and MPI approach, the code scales efficiently from 8 to more than 250.000 cores with almost linear weak scaling on a range of architectures. The code is tested with the classical benchmarks particle heating, cold beam instability, and two-stream instability. We also present particle-in-cell simulations of the Kelvin-Helmholtz instability, and new results on radiative collisionless shocks.
We present quantum calculations of the relaxation matrix for the Q branch of N{sub 2} at room temperature using a recently proposed N{sub 2}-N{sub 2} rigid rotor potential. Close coupling calculations were complemented by coupled states studies at high energies and provide about 10 200 two-body state-to state cross sections from which the needed one-body cross-sections may be obtained. For such temperatures, convergence has to be thoroughly analyzed since such conditions are close to the limit of current computational feasibility. This has been done using complementary calculations based on the energy corrected sudden formalism. Agreement of these quantum predictions with experimental data is good, but the main goal of this work is to provide a benchmark relaxation matrix for testing more approximate methods which remain of a great utility for complex molecular systems at room (and higher) temperatures.
ITER will be equipped with three plasma heating systems: neutral beam (NB), electron cyclotron (EC), and ion cy-clotron resonance heating (ICRH). The latter consists of two identical ICRH antennas to deliver 20 MW to the plasma (baseline, upgradable to 40 MW). ICRH will play a crucial role in the ignition and sustainment of burning plasmas in ITER. A high fidelity and robust modeling effort to understand the interaction of the IC waves with the scrape-off-layer (SOL) plasma is a very important aspect. Among the main important research topics, we have the assessment of the antenna loading for different plasma scenarios, the role of the lower hybrid resonance in front of the antenna and how to include it in our models, and the RF sheath boundary conditions to evaluate the antenna impurity generation. In this work, we tackle the first of these by reporting on ICRF simulations employing the Petra-M code, which is an electromagnetic simulation tool for modeling RF wave propagation based on MFEM [http://mfem.org] for the ITER ICRH antenna. Moreover, a benchmark between the well tested antenna codes TOPICA, RAPLI-CASOL, which is based on COMSOL [www.comsol.com], and the Petra-M code is also presented. In conclusion, S- and Z-matrices and wave electric field are compared showing an excellent agreement among these codes.
Incremental full configuration interaction (iFCI) closely approximates the FCI limit with polynomial cost through a many-body expansion of the correlation energy, providing highly accurate total energies within a given basis set. To extend iFCI beyond previous basis set limitations, this work introduces a novel natural orbital (NO) screening approach, incremental NO full configuration interaction (iNO-FCI). By consideration of the importance of virtual orbital selection in the convergence of iFCI, iNO-FCI maximizes the consistency between orbitals selected for each correlated body. iNO-FCI employs a principle of cancellation of errors and ensures that the same set of virtual NOs is used for interdependent terms. Here, this strategy significantly reduces computational cost without compromising precision. Computational savings of up to 95% are demonstrated, allowing access to larger basis sets that were previously computationally prohibitive. iNO-FCI is herein introduced and benchmarked for several difficult test cases involving double-bond dissociation, biradical systems, conjugated π systems, and the spin gap of a Cu-based transition metal complex.
Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to have such a long CPU time. This paper proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation Markov chain Monte Carlo, it is shown that the new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, e.g., a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors.
Abstract Motivation Millions of protein sequences have been generated by numerous genome and transcriptome sequencing projects. However, experimentally determining the function of the proteins is still a time consuming, low-throughput, and expensive process, leading to a large protein sequence-function gap. Therefore, it is important to develop computational methods to accurately predict protein function to fill the gap. Even though many methods have been developed to use protein sequences as input to predict function, much fewer methods leverage protein structures in protein function prediction because there was lack of accurate protein structures for most proteins until recently. Results We developed TransFun—a method using a transformer-based protein language model and 3D-equivariant graph neural networks to distill information from both protein sequences and structures to predict protein function. It extracts feature embeddings from protein sequences using a pre-trained protein language model (ESM) via transfer learning and combines them with 3D structures of proteins predicted by AlphaFold2 through equivariant graph neural networks. Benchmarked on the CAFA3 test dataset and a new test dataset, TransFun outperforms several state-of-the-art methods, indicating that the language model and 3D-equivariant graph neural networks are effective methods to leverage protein sequences and structures to improve protein function prediction. Combining TransFun predictions and sequence similarity-based predictions can further increase prediction accuracy. Availability and implementation The source code of TransFun is available at https://github.com/jianlin-cheng/TransFun.
Autonomous methods to align beamlines can decrease the amount of time spent on diagnostics, and also uncover better global optima leading to better beam quality. The alignment of these beamlines is a high-dimensional expensive-to-sample optimization problem involving the simultaneous treatment of many optical elements with correlated and nonlinear dynamics. Bayesian optimization is a strategy of efficient global optimization that has proved successful in similar regimes in a wide variety of beamline alignment applications, though it has typically been implemented for particular beamlines and optimization tasks. In this paper, we present a basic formulation of Bayesian inference and Gaussian process models as they relate to multi-objective Bayesian optimization, as well as the practical challenges presented by beamline alignment. We show that the same general implementation of Bayesian optimization with special consideration for beamline alignment can quickly learn the dynamics of particular beamlines in an online fashion through hyperparameter fitting with no prior information. We present the implementation of a concise software framework for beamline alignment and test it on four different optimization problems for experiments on X-ray beamlines at the National Synchrotron Light Source II and the Advanced Light Source, and an electron beam at the Accelerator Test Facility, along with benchmarking on a simulated digital twin. We discuss new applications of the framework, and the potential for a unified approach to beamline alignment at synchrotron facilities.
Here, this letter investigates the importance of integrating the coherency knowledge for designing controllers to dampen sustained oscillations in wide-area power networks with significant penetration of inverter-interfaced resources. Coherency is a fundamental property of power systems, where time-scale separation in frequency dynamics leads to clustered behavior among generators of different groups. Large-scale penetration of inverter-driven low inertia resources replacing conventional synchronous generators (SGs) can lead to perturbation in the coherent partitioning; hence, integrating such information is of utmost importance for oscillation control designs. We present the coherency-aware design of a distributed output feedback-based reinforcement learning method that additionally incorporates risk constraints to capture the uncertainties related to net-load fluctuations. The use of domain-aware coherency information has produced improved training and oscillation performance than the coherency-agnostic control design, hence proving to be effective in controller design. Finally, we validated the proposed method with numerical experiments on the benchmark IEEE 68-bus test system.
This paper is an overview of Power System Simulation Toolbox (psst). psst is an open-source Python application for the simulation and analysis of power system models. psst simulates the wholesale market operation by solving a DC Optimal Power Flow (DCOPF), Security Constrained Unit Commitment (SCUC) and a Security Constrained Economic Dispatch (SCED). psst also includes models for the various entities in a power system such as Generator Companies (GenCos), Load Serving Entities (LSEs) and an Independent System Operator (ISO). psst features an open modular object oriented architecture that will make it useful for researchers to customize, expand, experiment beyond solving traditional problems. psst also includes a web based Graphical User Interface (GUI) that allows for user friendly interaction and for implementation on remote High Performance Computing (HPCs) clusters for parallelized operations. This paper also provides an illustrative application of psst and benchmarks with standard IEEE test cases to show the advanced features and the performance of toolbox.
This paper presents a new method for enhancing Alternating Current Power Flow (ACPF) analysis. The method integrates the Newton-Raphson (NR) method with Enhanced-Gradient Descent (GD) and computational graphs. The integration of renewable energy sources in power systems introduces variability and unpredictability, and this method addresses these challenges. It leverages the robustness of NR for accurate approximations and the flexibility of GD for handling variable conditions, all without requiring Jacobian matrix inversion. Furthermore, computational graphs provide a structured and visual framework that simplifies and systematizes the application of these methods. The goal of this fusion is to overcome the limitations of traditional ACPF methods and improve the resilience, adaptability, and efficiency of modern power grid analyses. We validate the effectiveness of our advanced algorithm through comprehensive testing on established IEEE benchmark systems. Furthermore, our findings demonstrate that our approach not only speeds up the convergence process but also ensures consistent performance across diverse system states, representing a significant advancement in power flow computation.
Purpose: The advent of magnetic resonance imaging (MRI) guided radiotherapy systems demands the incorporation of the magnetic field into dose calculation algorithms of treatment planning systems. This is due to the fact that the Lorentz force of the magnetic field perturbs the path of the relativistic electrons, hence altering the dose deposited by them. Building on the previous work, the authors have developed a discontinuous finite element space-angle treatment of the linear Boltzmann transport equation to accurately account for the effects of magnetic fields on radiotherapy doses. Methods: The authors present a detailed description of their new formalism and compare its accuracy to GEANT4 Monte Carlo calculations for magnetic fields parallel and perpendicular to the radiation beam at field strengths of 0.5 and 3 T for an inhomogeneous 3D slab geometry phantom comprising water, bone, and air or lung. The accuracy of the authors’ new formalism was determined using a gamma analysis with a 2%/2 mm criterion. Results: Greater than 98.9% of all points analyzed passed the 2%/2 mm gamma criterion for the field strengths and orientations tested. The authors have benchmarked their new formalism against Monte Carlo in a challenging radiation transport problem with a high density material (bone) directly adjacent to a very low density material (dry air at STP) where the effects of the magnetic field dominate collisions. Conclusions: A discontinuous finite element space-angle approach has been proven to be an accurate method for solving the linear Boltzmann transport equation with magnetic fields for cases relevant to MRI guided radiotherapy. The authors have validated the accuracy of this novel technique against GEANT4, even in cases of strong magnetic field strengths and low density air.
Recently exponential integrators have been receiving increased attention as a means of solving large stiff systems of ODEs. Preliminary performance analysis demonstrated that exponential integrators hold promise compared to state-of-the-art implicit methods. However, much work remains to be done to understand in detail possible computational advantages these methods may offer in practice. This is particularly true for supercomputer-scale problems as there has been very little work on parallelizing exponential methods. In this paper we describe an implementation of a suite of parallel exponential solvers. Additionally, we present some performance tests on four stiff benchmark problems of a particular adaptive-Krylov exponential propagation iterative Runge--Kutta (EPIRK) method from the suite, and compare efficiency with the Newton--Krylov implicit solver CVODE.
AMG is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the BoomerAMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL and is very similar to the AMG2013 benchmark with additional optimizations. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem with a 27-point stencil, which can be scaled up and is designed to solve a very large problem. A second problem simulates a time dependent problem, in which successively various smnllcr systems are solved.
Representation of cloud microphysics is a key aspect of simulating clouds. From the early days of cloud modeling, numerical models have relied on an Eulerian approach for all cloud and thermodynamic and microphysics variables. Over time the sophistication of microphysics schemes has steadily increased, from simple representations of bulk masses of cloud and rain in each grid cell, to including different ice particle types and bulk hydrometeor concentrations, to complex schemes referred to as bin or spectral schemes that explicitly evolve the hydrometeor size distributions within each model grid cell. As computational resources grow, there is a clear trend toward wider use of bin schemes, including their use as benchmarks to develop and test simplified bulk schemes. We argue that continuing on this path brings fundamental challenges difficult to overcome. The Lagrangian particle-based probabilistic approach is a practical alternative in which the myriad of cloud and precipitation particles present in a natural cloud is represented by a judiciously selected ensemble of point particles called superdroplets or superparticles. Here, the advantages of the Lagrangian particle-based approach when compared to the Eulerian bin methodology are explained, and the prospects of applying the method to more comprehensive cloud simulations—for instance, targeting deep convection or frontal cloud systems—are discussed.