SEARCH · Engineering Papers

Results for “Level set method”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2023

High-Order Mesh Morphing for Boundary and Interface Fitting to Implicit Geometries

Here, we propose a method that morphs high-order meshes such that their boundaries and interfaces coincide/align with implicitly defined geometries. Our focus is particularly on the case when the target surface is prescribed as the zero isocontour of a smooth discrete function. Common examples of this scenario include using level set functions to represent material interfaces in multimaterial configurations, and evolving geometries in shape and topology optimization. The proposed method formulates the mesh optimization problem as a variational minimization of the sum of a chosen mesh-quality metric using the Target-Matrix Optimization Paradigm (TMOP) and a penalty term that weakly forces the selected faces of the mesh to align with the target surface. The distinct features of the method are use of a source mesh to represent the level set function with sufficient accuracy, and adaptive strategies for setting the penalization weight and selecting the faces of the mesh to be fit to the target isocontour of the level set field. We demonstrate that the proposed method is robust for generating boundary- and interface-fitted meshes for curvilinear domains using different element types in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Distributed renewable energy resource trust metrics and secure routing

To ensure reliable and predictable service in the electrical grid between distributed renewable distributed energy resources (DERs) it is important to gauge the level of trust present within critical components and DER aggregators (DERAs). Although trust throughout a smart grid is temporal and dynamically varies according to measured states, it is possible to accurately formulate communications and service level strategies based on such trust measurements. Utilizing an effective set of machine learning and statistical methods, it is shown that establishment of trust levels between DERAs using behavioral pattern analysis is possible. Further, it is also shown that the establishment of such trust can facilitate simple secure communications routing between DERAs. Providing secure routing between DERAs enables a grid operator to maintain service level agreements to its customers, reduce the attack surface and increase operational resiliency.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A simple and highly efficient protocol for 13 C-labeling of plant cell wall for structural and quantitative analyses via solid-state nuclear magnetic resonance

Plant cell walls are made of a complex network of interacting polymers that play a critical role in plant development and responses to environmental changes. Thus, improving plant biomass and fitness requires the elucidation of the structural organization of plant cell walls in their native environment. The 13 C-based multi-dimensional solid-state nuclear magnetic resonance (ssNMR) has been instrumental in revealing the structural information of plant cell walls through 2D and 3D correlation spectral analyses. However, the requirement of enriching plants with 13 C limits the applicability of this method. To our knowledge, there is only a very limited set of methods currently available that achieve high levels of 13 C-labeling of plant materials using 13 CO 2 , and most of them require large amounts of 13 CO 2 in larger growth chambers. In this study, a simplified protocol for 13C-labeling of plant materials is introduced that allows ca 60% labeling of the cell walls, as quantified by comparison with commercially labeled samples. This level of 13 C-enrichment is sufficient for all conventional 2D and 3D correlation ssNMR experiments for detailed analysis of plant cell wall structure. The protocol is based on a convenient and easy setup to supply both 13 C-labeled glucose and 13 CO 2 using a vacuum-desiccator. The protocol does not require large amounts of 13 CO 2 . This study shows that our 13 C-labeling of plant materials can make the accessibility to ssNMR technique easy and affordable. The derived high-resolution 2D and 3D correlation spectra are used to extract structural information of plant cell walls. This helps to better understand the influence of polysaccharide-polysaccharide interaction on plant performance and allows for a more precise parametrization of plant cell wall models.

09 BIOMASS FUELS↗

DOE OSTI2018

Bayesian Static Parameter Estimation for Partially Observed Diffusions via Multilevel Monte Carlo

In this article we consider static Bayesian parameter estimation for partially observed diffusions that are discretely observed. We work under the assumption that one must resort to discretizing the underlying diffusion process, for instance, using the Euler--Maruyama method. Given this assumption, we show how one can use Markov chain Monte Carlo (MCMC) and particularly particle MCMC [C. Andrieu, A. Doucet, and R. Holenstein, J. R. Stat. Soc. Ser. B Stat. Methodol., 72 (2010), 269--342] to implement a new approximation of the multilevel (ML) Monte Carlo (MC) collapsing sum identity. Our approach comprises constructing an approximate coupling of the posterior density of the joint distribution over parameter and hidden variables at two different discretization levels and then correcting by an importance sampling method. The variance of the weights are independent of the length of the observed data set. The utility of such a method is that, for a prescribed level of mean square error, the cost of this MLMC method is provably less than i.i.d. sampling from the posterior associated to the most precise discretization. However the method here comprises using only known and efficient simulation methodologies. Finally, the theoretical results are illustrated by inference of the parameters of two prototypical processes given noisy partial observations of the process: the first is an Ornstein--Uhlenbeck process and the second is a more general Langevin equation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Relativistic MR-MP Energy Levels for L-shell Ions of Sulfur and Argon

Calculated level energies for valence and K-vacancy states are given for the ion series S vii–S xiv and Ar ix–Ar xvi. The calculations were performed with the relativistic Multi-Reference Møller–Plesset Perturbation Theory method (MR-MP). The data set includes all the level energies with configurations $1{s}^{2}2{(s,p)}^{q}$, $1{s}^{2}2{(s,p)}^{q-1}{nl}$, $1{s}^{1}2{(s,p)}^{q+1}$, $1{s}^{1}2{(s,p)}^{q}{nl}$, $2{(s,p)}^{q+2}$, and $2{(s,p)}^{q+1}{nl}$, where 1 ≤ q ≤ 8, n ≤ 5, and l ≤ 3. We have compared our results with data from the National Institute of Standards and Technology (NIST) online database and with previous calculations. The average deviation of valence level energies ranges from 0.16 eV in Ne-like ions to 0.01 eV in Li-like ions, demonstrating that the present MR-MP valence level energies are highly accurate. In the case of K-vacancy states, the deviation is generally below 0.3 eV for Li-like S xiv and Ar xvi. The deviation for K-vacancy energies in other L-shell ions (Be-, B-, C-, N-, and O-like Ar ions) is higher but likely because the NIST-recommended values have a higher uncertainty. The data set includes many n = 4 and n = 5 valence and K-vacancy levels in L-shell ions of S and Ar that have not been previously reported. The data can be used for line identification and modeling of L-shell ions of S and Ar in astrophysical and laboratory-generated plasmas, and as energy references in the absence of more accurate laboratory calculations.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Multiclass Classification Using Bayesian Multivariate Adaptive Regression Splines

We present a new Bayesian model for the problem of multiclass classification. In this model, the probabilities of class membership of a given observation are determined by the mean of a latent Gaussian distribution. The mean functions of this latent distribution consist of combinations of highly flexible basis functions of the inputs: multivariate adaptive regression splines (MARS), first developed for multiple regression. We use reversible jump Markov chain Monte Carlo to make inference on the classification model, including the number of basis functions. We compare the probabilistic classification performance of our proposed approach to existing methods on simulated and benchmark data, and compare uncertainty estimates on simulated data. Our proposed method compares favorably with existing Bayesian and frequentist multiclass classification methods in out-of-sample probabilistic classification, and uncertainty estimation of these probabilistic classifications. We examine the fit of the proposed method to a data set of hurricane storm surge levels near Delaware Bay, US, and conclude that sea level rise is a key contributor to damage delivered by storm surge.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Digital zero noise extrapolation for quantum error mitigation

Zero-noise extrapolation (ZNE) is an increasingly popular technique for mitigating errors in noisy quantum computations without using additional quantum resources. We review the fundamentals of ZNE and propose several improvements to noise scaling and extrapolation, the two key components in the technique. We introduce unitary folding and parameterized noise scaling. Furthermore, these are digital noise scaling frameworks, i.e. one can apply them using only gate-level access common to most quantum instruction sets. We also study different extrapolation methods, including a new adaptive protocol that uses a statistical inference framework. Benchmarks of our techniques show error reductions of 18X to 24X over non-mitigated circuits and demonstrate ZNE effectiveness at larger qubit numbers than have been tested previously. In addition to presenting new results, this work is a self-contained introduction to the practical use of ZNE by quantum programmers.

quantum computing↗

DOE OSTI2024

Power Profile Monitoring and Tracking Evolution of System-Wide HPC Workloads

The power & energy demands of HPC machines have grown significantly. Modern exascale HPC systems require tens of megawatts of combined power for computing resources and cooling facilities at full capacity. The current energy trend is not sustainable for future HPC systems, and there is a need to work toward the energy efficiency aspect of HPC performance. Energy awareness of the HPC applications at the job level is essential for running an efficient HPC system. This work aims to develop a pipeline to provide a production-level system-wide overview of the HPC workloads' power profile while handling evolving workloads exhibiting new power trends. We developed an open-set classification model for HPC jobs based on the properties of power profiles to continuously provide a system-wide holistic view of recently completed jobs. The pipeline helps continuously monitor the job-level power usage pattern of HPC and enables us to capture the new trends in applications' power behavior. We employed a comprehensive set of techniques to generate job-level data, custom-designed feature extraction methods to extract critical features from jobs' power profiles, clustering techniques powered by generative modeling, and open-set classification for identifying job profiles into known classes or an unknown set. With extensive evaluations, we demonstrate the effectiveness of each component in our pipeline. We provide an analysis of the resulting clusters that characterize the power profile landscape of the Summit supercomputer from more than 60K jobs executed in a year. The open-set classification classifies the known data sets into known classes with high accuracy and identifies unknown data noints with over 85% accuracy.

Karimi, Ahmad Maroof↗

DOE OSTI2021

Extending quantum probabilistic error cancellation by noise scaling

Here, we propose a general framework for quantum error mitigation that combines and generalizes two techniques: probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE). Similar to PEC, the proposed method represents ideal operations as linear combinations of noisy operations that are implementable on hardware. However, instead of assuming a fixed level of hardware noise, we extend the set of implementable operations by noise scaling. By construction, this method encompasses both PEC and ZNE as particular cases and allows us to investigate a larger set of hybrid techniques. For example, gate extrapolation can be used to implement PEC without requiring knowledge of the device’s noise model, e.g., avoiding gate-set tomography. Alternatively, probabilistic error reduction can be used to estimate expectation values at intermediate virtual noise strengths (below the hardware level), leading to partially mitigated results at a lower sampling cost. Moreover, multiple results obtained with different noise-reduction factors can be further postprocessed with ZNE to better approximate the zero-noise limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Automatic microseismic event picking via unsupervised machine learning

SUMMARY Effective and efficient arrival picking plays an important role in microseismic and earthquake data processing and imaging. Widely used short-term-average long-term-average ratio (STA/LTA) based arrival picking algorithms suffer from the sensitivity to moderate-to-strong random ambient noise. To make the state-of-the-art arrival picking approaches effective, microseismic data need to be first pre-processed, for example, removing sufficient amount of noise, and second analysed by arrival pickers. To conquer the noise issue in arrival picking for weak microseismic or earthquake event, I leverage the machine learning techniques to help recognizing seismic waveforms in microseismic or earthquake data. Because of the dependency of supervised machine learning algorithm on large volume of well-designed training data, I utilize an unsupervised machine learning algorithm to help cluster the time samples into two groups, that is, waveform points and non-waveform points. The fuzzy clustering algorithm has been demonstrated to be effective for such purpose. A group of synthetic, real microseismic and earthquake data sets with different levels of complexity show that the proposed method is much more robust than the state-of-the-art STA/LTA method in picking microseismic events, even in the case of moderately strong background noise.

Chen, Yangkang↗

DOE OSTI2018

The clustering of theSDSS-IV extended Baryon Oscillation Spectroscopic Survey DR14 quasar sample: measuring the anisotropic baryon acoustic oscillations with redshift weights

We present an anisotropic analysis of baryon acoustic oscillation (BAO) signal from the Sloan Digital Sky Survey IV extended Baryon Oscillation Spectroscopic Survey Data Release 14 quasar sample. The sample consists of 147 000 quasars distributed over a redshift range of 0.8 < z < 2.2. We apply the redshift weights technique to the clustering of quasars in this sample and achieve a 4.6 per cent measurement of the angular distance measurement DM at z = 2.2 and Hubble parameter H at z = 0.8. We parametrize the distance-redshift relation, relative to a fiducial model, as a Taylor series. The coefficients of this expansion are used to reconstruct the distance-redshift relation and obtain distance and Hubble parameter measurements at all redshifts within the redshift range of the sample. Reporting the result at two characteristic redshifts, we determine DM(z = 1) = 3405 ± 305 (rd/rd, fid) Mpc, H(z=1) = 120.7± 7.3 (r_d,fid / r_d) km s^{-1} Mpc^{-1} and DM(z = 2) = 5325 ± 249 (rd/rd, fid) Mpc, H(z=2) = 189.9± 32.9 (r_d,fid / r_d) km s^{-1} Mpc^{-1}. These measurements are highly correlated. We assess the outlook of BAO analysis from the final quasar sample by testing the method on a set of mocks that mimic the noise level in the final sample. We demonstrate on these mocks that redshift weighting shrinks the measurement error by over 25 per cent on average. We conclude redshift weighting can bring us closer to the cosmological goal of the final quasar sample.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Reconstructing magnetic deflections from sets of proton images using differential evolution

Proton imaging is a powerful technique for imaging electromagnetic fields within an experimental volume, in which spatial variations in proton fluence are a result of deflections to proton trajectories due to interaction with the fields. When deflections are large, proton trajectories can overlap, and this nonlinearity creates regions of greatly increased proton fluence on the image, known as caustics. The formation of caustics has been a persistent barrier to reconstructing the underlying fields from proton images. We have developed a new method for reconstructing the path-integrated magnetic fields, which begins to address the problem posed by caustics. Our method uses multiple proton images of the same object, each image at a different energy, to fill in the information gaps and provide some uniqueness when reconstructing caustic features. We use a differential evolution algorithm to iteratively estimate the underlying deflection function, which accurately reproduces the observed proton fluence at multiple proton energies simultaneously. We test this reconstruction method using synthetic proton images generated for three different, cylindrically symmetric field geometries at various field amplitudes and levels of proton statistics and present reconstruction results from a set of experimental images. Here, the method we propose requires no assumption of deflection linearity and can reliably solve for fields underlying linear, nonlinear, and caustic proton image features for the selected geometries and is shown to be fairly robust to noise in the input proton intensity.

47 OTHER INSTRUMENTATION↗

DOE OSTI2022

A critical comparison of CH∙∙∙π versus π∙∙∙π interactions in the benzene dimer: obtaining benchmarks at the CCSD(T) level and assessing the accuracy of lower scaling methods

In this study, we have established CCSD(T)/CBS (Complete Basis Set) limits for 3 stationary points on the benzene dimer potential energy surface, corresponding to the π∙∙∙π (parallel displaced or PD(C 2h ), minimum) and CH∙∙∙π (T-shaped or T(C 2v ), transition state) and tilted T-shaped (or TT(Cs), minimum) bonding scenarios considering both the structure and binding energy. The CCSD(T)/CBS binding energies are -2.65 ± 0.02 (PD), -2.74 ± 0.03 (T), and -2.83 ± 0.01 kcal mol -1 (TT). To this end, the CH∙∙∙π is ~0.2 kcal mol -1 stronger than the π∙∙∙π interaction, whereas the tilting of the CH donating benzene molecule with respect to the other benzene is worth 0.1 kcal mol -1 . As previously discussed in the literature, the MP2 level of theory does not provide a close match for either the energy or structure, yet the SCS-MP2 yields structures in excellent agreement with respect to the CCSD(T) result. It is found that the SCS-MI-MP2 also gives optimized structures very close to SCS-MP2 (within ~0.01 Å of the benchmark). Despite the closer match in structure, the spin-biased MP2 methods (SCS-, SCS-MI-, and SOS-MP2) incorrectly predict the relative stabilities of the isomers. That said, none of the spin biased MP2 methods offers a good compromise between energy and structure for the systems examined. Finally, the CCSD(T)/CBS benchmarks were used to assess the performance of 13 DFT functionals selected from different rungs of Jacob's ladder. Several functionals such as TPSS-D3, B3LYP-D3, B97-D, B97-D3, and B2PLYP-D3 provided a good description of the binding energies for both CH∙∙∙π and π∙∙∙π interactions, yielding values within 6% of the CCSD(T)/CBS benchmark values. Unlike the MP2 methods, these functionals correctly predict the relative stability of the PD(C 2h ) and T(C 2v ) dimers. Further, we find that there is no systematic improvement as Jacob's ladder is ascended (increased complexity of functional). The best functionals that result in a good compromise between structure and energy accuracy are B97-D3 and B2PLYP-D3 for both the CH∙∙∙π and π∙∙∙π interaction. Despite the impressive performance of these functionals, a challenge that remains is ensuring the transferability of these density functionals in accurately describing the interaction between dimers of larger aromatic molecules, the latter requiring high-level benchmarks for these systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2018

Measuring the Error in Approximating the Sub-Level Set Topology of Sampled Scalar Data

This paper studies here the influence of the definition of neighborhoods and methods used for creating point connectivity on topological analysis of scalar functions. It is assumed that a scalar function is known only at a finite set of points with associated function values. In order to utilize topological approaches to analyze the scalar-valued point set, it is necessary to choose point neighborhoods and, usually, point connectivity to meaningfully determine critical-point behavior for the point set. Two distances are used to measure the difference in topology when different point neighborhoods and means to define connectivity are used: (i) the bottleneck distance for persistence diagrams and (ii) the distance between merge trees. Usually, these distances define how different scalar functions are with respect to their topology. These measures, when properly adapted to point sets coupled with a definition of neighborhood and connectivity, make it possible to understand how topological characteristics depend on connectivity. Noise is another aspect considered. Five types of neighborhoods and connectivity are discussed: (i) the Delaunay triangulation; (ii) the relative neighborhood graph; (iii) the Gabriel graph; (iv) the k-nearest-neighbor (KNN) neighborhood; and (v) the Vietoris–Rips complex. It is discussed in detail how topological characterizations depend on the chosen connectivity.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Delineating Facies Spatial Distribution by Integrating Ensemble Data Assimilation and Indicator Geostatistics with Level-Set Transformation

The facies-based approach has been widely adopted to delineate an aquifer into distinct geological units with unique distributions of hydraulic, physical, and/or chemical properties. The recent development in ensemble-based data assimilation methods allows both the direct and indirect data to be used to improve facies delineation. A major difficulty in those applications is to honor the spatial continuity and avoid overfitting after data assimilation. We introduce a new facies delineation framework to integrate ensemble data assimilation with traditional transition probability-based geostatistics. A level-set concept is used to parametrize discrete facies indicators and for updating facies shape. During the iterative data assimilation process, we impose spatial continuity by conditioning facies field generation on points selected adaptively based on their sensitivity to observation data. This reconditioning step is a key step to maintain spatial continuity and overcome over-fitting problems in inversion. We selected two examples to evaluate the performance of the new framework in estimating facies-based permeability field. The first example is a two-dimensional synthetic system with transient head data induced by pumping tests used for delineating two facies. The second example is a three-dimensional case with three facies, conceptualized from a field tracer experiment within the Columbia River corridor in Washington State, USA. Both examples demonstrate that the new method can adequately capture the spatial pattern of hydrofacies with reconditioning, which leads to the improved prediction of system behaviors.

Song, Xuehang↗

DOE OSTI2025

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

adaptation models↗

DOE OSTI2024

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation: Preprint

distribution system operator↗

DOE OSTI2020

A reduced-order shifted boundary method for parametrized incompressible Navier–Stokes equations

Here, we investigate a projection-based reduced order model of the steady incompressible Navier–Stokes equations for moderate Reynolds numbers. In particular, we construct an “embedded” reduced basis space, by applying proper orthogonal decomposition to the Shifted Boundary Method, a high-fidelity embedded method recently developed. We focus on the geometrical parametrization through level-set geometries, using a fixed Cartesian background geometry and the associated mesh. This approach avoids both remeshing and the development of a reference domain formulation, as typically done in fitted mesh finite element formulations. Two-dimensional computational examples for one and three parameter dimensions are presented to validate the convergence and the efficacy of the proposed approach.

"embedded" basis↗