Navy Condition-Based Monitoring Project Update: Distances Overview [Slides]
A project update is provided, and various spaces, metrics, and measures are discussed.
97 MATHEMATICS AND COMPUTING↗
SEARCH · Search NASA
Results for “Space Based”
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.
Accelerating particle-in-cell kinetic plasma simulations via reduced-order modeling of space-charge dynamics using dynamic mode decomposition
We present a data-driven reduced-order modeling of the space-charge dynamics for electromagnetic particle-in-cell (EMPIC) plasma simulations based on dynamic mode decomposition (DMD). The dynamics of the charged particles in kinetic plasma simulations such as EMPIC is manifested through the plasma current density defined along the edges of the spatial mesh. We showcase the efficacy of DMD in modeling the time evolution of current density through a low-dimensional feature space. Not only do such DMD based predictive reduced-order models help accelerate EMPIC simulations, they also have the potential to facilitate investigative analysis and control applications. Here, we demonstrate the proposed DMD-EMPIC scheme for reduced-order modeling of current density and speedup in EMPIC simulations involving electron beam under the influence of magnetic field, virtual cathode oscillations, and backward wave oscillator.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
SPACE: 3D parallel solvers for Vlasov-Maxwell and Vlasov-Poisson equations for relativistic plasmas with atomic transformations
A parallel, relativistic, three-dimensional particle-in-cell code SPACE has been developed for the simulation of electromagnetic fields, relativistic particle beams, and plasmas. In addition to the standard second-order Particle-in-Cell (PIC) algorithm, SPACE includes efficient novel algorithms to resolve atomic physics processes such as multi-level ionization of plasma atoms, recombination, and electron attachment to dopants in dense neutral gases. SPACE also contains a highly adaptive particle-based method, called Adaptive Particle-in-Cloud (AP-Cloud), for solving the Vlasov-Poisson problems. It eliminates the traditional Cartesian mesh of PIC and replaces it with an adaptive octree data structure. The code's algorithms, structure, capabilities, parallelization strategy, and performance have been discussed. Additionally, typical examples of SPACE applications to accelerator science and engineering problems are described.
43 PARTICLE ACCELERATORS↗
Accurate Prediction of Voltage of Battery Electrode Materials Using Attention-Based Graph Neural Networks
Performing first-principles calculations to discover electrodes’ properties in the large chemical space is a challenging task. While machine learning (ML) has been applied to effectively accelerate those discoveries, most of the applied methods ignore the materials’ spatial information and only use predefined features: based only on chemical compositions. Here, we propose two attention-based graph convolutional neural network techniques to learn the average voltage of electrodes. Our proposed methods, which combine both atomic composition and atomic coordinates in 3D-space, improve the accuracy in voltage prediction significantly when compared to composition-based ML models. The first model directly learns the chemical reaction of electrodes and metal ions to predict their average voltage, whereas the second model combines electrodes’ ML predicted formation energy (E form ) to compute their average voltage. Our E form -based model demonstrates improved accuracy in transferability from our subset of learned Li ions to Na ions. Moreover, we predicted the theoretical voltage of 10 Na x MPO 4 F (M = Ti, Cr, Fe, Cu, Mn, Co, and Ni) fluorophosphate battery frameworks, which are unavailable in the Material Project database. It could be shown that we can expect average voltages higher than 3.1 V from those Na battery frameworks except from the NaTiPO 4 F and TiPO 4 F pair of electrodes, which offer an average voltage of 1.32 V.
25 ENERGY STORAGE↗
Elsa: enhanced latent spaces for improved collider simulations
Abstract Simulations play a key role for inference in collider physics. We explore various approaches for enhancing the precision of simulations using machine learning, including interventions at the end of the simulation chain (reweighting), at the beginning of the simulation chain (pre-processing), and connections between the end and beginning (latent space refinement). To clearly illustrate our approaches, we use W + jets matrix element surrogate simulations based on normalizing flows as a prototypical example. First, weights in the data space are derived using machine learning classifiers. Then, we pull back the data-space weights to the latent space to produce unweighted examples and employ the Latent Space Refinement ( Laser ) protocol using Hamiltonian Monte Carlo. An alternative approach is an augmented normalizing flow, which allows for different dimensions in the latent and target spaces. These methods are studied for various pre-processing strategies, including a new and general method for massive particles at hadron colliders that is a tweak on the widely-used RamboOnDiet mapping. We find that modified simulations can achieve sub-percent precision across a wide range of phase space.
Nachman, Benjamin (ORCID:0000000310240932)↗
Multigrid Algorithms with Projection and Prolongation over Elements of the Phase Space for K-Eigenvalue Transport Problems
This paper describes new multilevel acceleration methods for solving the multigroup neu- tron transport eigenvalue problems. These multilevel algorithms use different projection and prolongation operators in the phase space. The Nonlinear Diffusion Acceleration (NDA) method with multiple grids in energy is formulated with the prolongation oper- ator based on multiplication iterative correction and linear-in-energy mapping. Another multilevel NDA method uses the projection operator with coarsening in energy between the high-order transport and low-order NDA equations. The third algorithm is formu- lated with the partial-current based CMFD low-order equations and applies projection operators in space and energy. The numerical results are presented.
Cornejo, Luke↗
Data-Driven Operator Theoretic Methods for Phase Space Learning and Analysis
This paper uses data-driven operator theoretic approaches to explore the global phase space of a dynamical system. In this work, we defined conditions for discovering new invariant subspaces in the state space of a dynamical system starting from an invariant subspace based on the spectral properties of the Koopman operator. When the system evolution is known locally in several invariant subspaces in the state space of a dynamical system, a phase space stitching result is derived that yields the global Koopman operator. Additionally, in the case of equivariant systems, a phase space stitching result is developed to identify the global Koopman operator using the symmetry properties between the invariant subspaces of the dynamical system and time-series data from any one of the invariant subspaces. Finally, these results are extended to topologically conjugate dynamical systems; in particular, the relation between the Koopman tuple of topologically conjugate systems is established. The proposed results are demonstrated on several second-order nonlinear dynamical systems including a bistable toggle switch. Our method elucidates a strategy for designing discovery experiments: experiment execution can be done in many steps, and models from different invariant subspaces can be combined to approximate the global Koopman operator.
42 ENGINEERING↗
FLAMES─Fast, Low-Storage, Accurate, and Memory-Efficient Adaptive Sampling─Approach to Resolve Spatially Dependent Dynamics of Molecular Liquids
Many critical phenomena in soft matter occur at large length scales, necessitating the resolution of their structure and dynamics at low wavenumbers. However, resolving wavenumber-dependent dynamics computationally via molecular dynamics simulations presents significant challenges, as these phenomena span several orders of magnitude in both time and length scales, resulting in high computational costs and memory demands. Here, this work highlights the computational and memory challenges associated with analyzing molecular trajectories in reciprocal space and demonstrates a method to address them. We introduce FLAMESFast, Low-storage, Accurate, and Memory-Efficient adaptive Sampling, which is a direct method for calculation of structure factors, allowing us to select only the required number of wavevectors for binning. We also use wavenumber-dependent time steps to extract dynamics. Our FLAMES approach effectively mitigates computational and memory/storage bottlenecks. We demonstrate the method using simulations of a model system, liquid octane, at various temperatures. Comparisons with experimental data and real space computation show that the FLAMES technique achieves high accuracy in resolving temperature- and spatially dependent dynamics while being significantly more computationally efficient and requiring less memory and storage than methods based on a uniform wavevector grid and fixed temporal spacing.
Chen, Guang [Argonne National Laboratory (ANL), Ar↗
Neural architecture search via similarity adaptive guidance
Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.
97 MATHEMATICS AND COMPUTING↗
Widely Tunable Berry Curvature in the Magnetic Semimetal Cr 1+ δ Te 2
Abstract Magnetic semimetals have increasingly emerged as lucrative platforms hosting spin‐based topological phenomena in real and momentum spaces. Cr 1+ δ Te 2 is a self‐intercalated magnetic transition metal dichalcogenide (TMD), which exhibits topological magnetism and tunable electron filling. While recent studies have explored real‐space Berry curvature effects, similar considerations of momentum‐space Berry curvature are lacking. Here, the electronic structure and transport properties of epitaxial Cr 1+ δ Te 2 thin films are systematically investigated over a range of doping, δ (0.33 – 0.71). Spectroscopic experiments reveal the presence of a characteristic semi‐metallic band region, which shows a rigid like energy shift with δ. Transport experiments show that the intrinsic component of the anomalous Hall effect (AHE) is sizable and undergoes a sign flip across δ. Finally, density functional theory calculations establish a link between the doping evolution of the band structure and AHE: the AHE sign flip is shown to emerge from the sign change of the Berry curvature, as the semi‐metallic band region crosses the Fermi energy. These findings underscore the increasing relevance of momentum‐space Berry curvature in magnetic TMDs and provide a unique platform for intertwining topological physics in real and momentum spaces.
36 MATERIALS SCIENCE↗
Sequence-defined Pareto frontier of a copolymer structure
The correlations between the sequence of monomers in a macromolecule and its three-dimensional (3D) structure is a grand challenge in polymer science. The properties and functions of macromolecules depend on their 3D shape that has appeared to be dictated by their monomer sequence. However, the progress towards understanding the sequence–structure-property correlations and their utilization in materials engineering are slow because it is almost impossible to characterize an astronomically large number of possible sequences of a copolymer using traditional experimental and simulation methods. To address this problem, here, we combine evolutionary computing and coarse-grained molecular dynamics (CGMD) simulation and study the sequence-structure correlations of a model AB-type copolymer in a solution and assess the impact of sequence on the packing density in its bulk phase. The CGMD-based evolutionary algorithm (EA) screens the sequence space of a single chain copolymer efficiently and identifies a wide range of single-molecule structures including extremal radii of gyration. The data are utilized to estimate the Pareto front of the structure-space of a binary copolymer as a function of its composition. The monomer packings in single-molecule solution phase and multimolecular bulk phase are found to be identical. Finally, this work highlights the opportunities of sequence-specific control of macromolecular structure for designing target materials.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Hierarchical Conditioning of Diffusion Models Using Tree-of-Life for Studying Species Evolution
A central problem in biology is to understand how organisms evolve and adapt to their environment by acquiring variations in the observable characteristics or traits of species across the tree of life. With the growing availability of large-scale image repositories in biology and recent advances in generative modeling, there is an opportunity to accelerate the discovery of evolutionary traits automatically from images. Toward this goal, we introduce Phylo-Diffusion, a novel framework for conditioning diffusion models with phylogenetic knowledge represented in the form of HIERarchical Embeddings (HIER-Embeds). We also propose two new experiments for perturbing the embedding space of Phylo-Diffusion: trait masking and trait swapping, inspired by counterpart experiments of gene knockout and gene editing/swapping. Our work represents a novel methodological advance in generative modeling to structure the embedding space of diffusion models using tree-based knowledge. Our work also opens a new chapter of research in evolutionary biology by using generative models to visualize evolutionary changes directly from images. We empirically demonstrate the usefulness of Phylo-Diffusion in capturing meaningful trait variations for fishes and birds, revealing novel insights about the biological mechanisms of their evolution. (Model and code can be found at imageomics.github.io/phylo-diffusion)
Khurana, Mridul↗
Tropical amplitudes for colored Lagrangians
Recently a new formulation for scattering amplitudes in Tr(Φ 3 ) theory has been given based on simple combinatorial ideas in the space of kinematic data. This allows all-loop integrated amplitudes to be expressed as “curve integrals” defined using tropical building blocks — the “headlight functions”. This paper shows how the formulation extends to the amplitudes of more general Lagrangians. We will present a number of different ways of introducing tropical “numerator functions” that allow us to describe general Lagrangian interactions. The simplest family of these “tropical numerators” computes the amplitudes of interesting Lagrangians with infinitely many interactions. We also describe methods for tropically formulating the amplitudes for general Lagrangians. One uses a variant of “Wick contraction” to glue together numerator factors for general interaction vertices. Another uses a natural characterization of polygons on surfaces to give a novel combinatorial description of all possible diagrams associated with arbitrary valence interactions.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
One-loop matrix elements of effective superstring interactions: α' -expanding loop integrands
In the low-energy effective action of string theories, non-abelian gauge interactions and supergravity are augmented by infinite towers of higher-mass-dimension operators. We propose a new method to construct one-loop matrix elements with insertions of operators D 2k F n and D 2k R n in the tree-level effective action of type-I and type-II superstrings. Inspired by ambitwistor string theories, our method is based on forward limits of moduli-space integrals using string tree-level amplitudes with two extra points, expanded in powers of the inverse string tension α'. Similar to one-loop ambitwistor computations, intermediate steps feature non-standard linearized Feynman propagators which eventually recombine to conventional quadratic propagators. With linearized propagators the loop integrand of the matrix elements obey one-loop versions of the monodromy and KLT relations. We express a variety of four- and five-point examples in terms of quadratic propagators and formulate a criterion on the underlying genus-one correlation functions that should make this recombination possible at all orders in α'. The ultraviolet divergences of the one-loop matrix elements are crosschecked against the non-separating degeneration of genus-one integrals in string amplitudes. Conversely, our results can be used as a constructive method to determine degenerations of elliptic multiple zeta values and modular graph forms at arbitrary weight.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Yet another parameter-free shape optimization method
The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.
42 ENGINEERING↗
Yesterday’s extremes, today’s new normal: flood risk in the Kathmandu Valley, Nepal
Unplanned urban growth has left many cities increasingly vulnerable to extreme rainfall events, particularly in regions with inadequate drainage infrastructures and development encroaching on natural floodplains. Here, in this perspective paper, we examine the September 2024 floods that struck Central Nepal, triggered by a persistent low-pressure system and enhanced by converging moisture flows from the Arabian Sea and the Bay of Bengal which led to widespread catastrophic damage. In the Kathmandu Valley, floodwaters expanded to more than 2.5 times the bankfull water extent, causing significant damage to housing, transportation network, and critical infrastructure, displacing thousands of residents, and severely disrupting urban services. This event highlights the urgent need for improved flood management strategies that integrate both structural and non-structural measures into the infrastructure development. While early warning systems provided critical lead time, challenges remain in reducing forecasting uncertainties and improving communication across government agencies and with local communities. A forward-looking approach is essential, including probabilistic flood forecasting systems, sustainable floodplain management, risk-sensitive land use planning, climate- and disaster- resilient infrastructure development, and the integration of nature-based solutions like urban green and blue spaces to mitigate flood impacts. By involving local communities in planning and preparedness efforts, particularly through citizen science initiatives, and engagement with underserved and disadvantaged communities, Nepal can better adapt to the growing risks posed by extreme rainfall and urban flooding and enhance long-term disaster resilience in rapidly urbanizing areas like Kathmandu Valley.
Kathmandu Valley↗
Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces
This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.
Data-driven model reduction↗
Comparison of multiobjective optimization methods for the $\mathrm{LCLS-II}$ photoinjector
Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.
43 PARTICLE ACCELERATORS↗