Search NASA⌕ Search

SEARCH · Search NASA

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.

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

At least 505 records · Page 28

Initial Considerations for Large-Scale Carbon Removal in the United States

The Biden Administration has established a goal of removing 1 Gt carbon dioxide equivalents per year (CO 2e /yr) from the atmosphere and of achieving net zero greenhouse gas emissions (GHG) by 2050. Our team of leading academic and DOE national laboratory experts is conducting the first economy-wide technical evaluation of the options for achieving this carbon dioxide removal (CDR) goal. The net zero goal includes targets of 100% clean electricity by 2035 with 40% GHG emissions reductions by 2030, which helps set primary scenario boundaries for our analysis of the CDR supply curve. Our analysis will evaluate feasibility, performance, and costs on a county level for the entire USA (including AK and HI where possible), considering all removal methods that are currently well-enough developed for us to estimate the likely costs in 2050. We anticipate that more than 1 Gt CO 2e of removal will be available to the Nation. We will identify how much of each CO 2 removal approach is available in specific regions of the Nation and provide cumulative costs and volumes (a supply curve) by region for 2050. We expect to complete this detailed analysis by late 2023.

42 ENGINEERING↗

Python and HPC for High Energy Physics Data Analyses

High level abstractions in Python that can utilize computing hardware well seem to be an attractive option for writing data reduction and analysis tasks. In this paper, we explore the features available in Python which are useful and efficient for end user analysis in High Energy Physics (HEP). A typical vertical slice of an HEP data analysis is somewhat fragmented: the state of the reduction/analysis process must be saved at certain stages to allow for selective reprocessing of only parts of a generally time-consuming workflow. Also, algorithms tend to to be modular because of the heterogeneous nature of most detectors and the need to analyze different parts of the detector separately before combining the information. This fragmentation causes difficulties for interactive data analysis, and as data sets increase in size and complexity (O10 TiB for a “small” neutrino experiment to the O10 PiB currently held by the CMS experiment at the LHC), data analysis methods traditional to the field must evolve to make optimum use of emerging HPC technologies and platforms. Mainstream big data tools, while suggesting a direction in terms of what can be done if an entire data set can be available across a system and analysed with high-level programming abstractions, are not designed with either scientific computing generally, or modern HPC platform features in particular, such as data caching levels, in mind. Our example HPC use case is a search for a new elementary particle which might explain the phenomenon known as “Dark Matter”. Here, using data from the CMS detector, we will use HDF5 as our input data format, and MPI with Python to implement our use case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast Evaluation of Aircraft Icing Severity Using Machine Learning Based on XGBoost

Aircraft icing represents a serious hazard in aviation which has caused a number of fatal accidents over the years. In addition, it can lead to substantial increase in drag and weight, thus reducing the aerodynamics performance of the airplane. The process of ice accretion on a solid surface is a complex interaction of aerodynamic and environmental variables. The complex relationship makes machine learning-based methods an attractive alternative to traditional numerical simulation-based approaches. In this study, we introduce a purely data-driven approach to find the complex pattern between different flight conditions and aircraft icing severity prediction. The supervised learning algorithm Extreme Gradient Boosting (XGBoost) is applied to establish the prediction framework which makes prediction based on any set of observations. The input flight conditions for the proposed prediction framework are liquid water content, droplet diameter and exposure time. The proposed approach is demonstrated in three cases: maximum ice thickness prediction, icing area prediction and icing severity level evaluation. Performance comparison studies and error analysis are also conducted to verify the effectiveness and performance of the proposed method. Results show that the proposed method has reasonable capability in evaluating aircraft icing severity.

Li, Sibo (ORCID:000000021705844X)↗

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

In this paper, we present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.

97 MATHEMATICS AND COMPUTING↗

A robust real-time surface reconstruction method on point clouds captured from a 3D surface photogrammetry system

Purpose: To develop a robust and real-time surface reconstruction method on point clouds captured from a 3D surface photogrammetry system. Methods: The authors have developed a robust and fast surface reconstruction method on point clouds acquired by the photogrammetry system, without explicitly solving the partial differential equation required by a typical variational approach. Taking advantage of the overcomplete nature of the acquired point clouds, their method solves and propagates a sparse linear relationship from the point cloud manifold to the surface manifold, assuming both manifolds share similar local geometry. With relatively consistent point cloud acquisitions, the authors propose a sparse regression (SR) model to directly approximate the target point cloud as a sparse linear combination from the training set, assuming that the point correspondences built by the iterative closest point (ICP) is reasonably accurate and have residual errors following a Gaussian distribution. To accommodate changing noise levels and/or presence of inconsistent occlusions during the acquisition, the authors further propose a modified sparse regression (MSR) model to model the potentially large and sparse error built by ICP with a Laplacian prior. The authors evaluated the proposed method on both clinical point clouds acquired under consistent acquisition conditions and on point clouds with inconsistent occlusions. The authors quantitatively evaluated the reconstruction performance with respect to root-mean-squared-error, by comparing its reconstruction results against that from the variational method. Results: On clinical point clouds, both the SR and MSR models have achieved sub-millimeter reconstruction accuracy and reduced the reconstruction time by two orders of magnitude to a subsecond reconstruction time. On point clouds with inconsistent occlusions, the MSR model has demonstrated its advantage in achieving consistent and robust performance despite the introduced occlusions. Conclusions: The authors have developed a fast and robust surface reconstruction method on point clouds captured from a 3D surface photogrammetry system, with demonstrated sub-millimeter reconstruction accuracy and subsecond reconstruction time. It is suitable for real-time motion tracking in radiotherapy, with clear surface structures for better quantifications.

60 APPLIED LIFE SCIENCES↗

Frisker Response to Soil Concentrations (Bq/g) Compared to NaI(Tl) - 19338

The Chalk River Laboratories (CRL) began nuclear operations in 1947. Portions of the site land areas have become radiologically contaminated through the 1952 National Reactor Experimental (NRX) accident and/or waste management activities over the past 70 years of site operations. The Environmental Remediation Projects Group (ERP) characterizes, and performs risk assessment, and remedial actions, as required over these contaminated land areas. ERP work activities are subject to controls established by CRL's Radiation Protection (RP) Group such that RP establishes the radiological controls and monitoring requirements for ERP field work activities. The different methods of monitoring soil contamination between ERP and the RP program present some challenges in the interpretation and comparison of the two sets of results and the soil disposition. ERP utilizes NaI(Tl) scintillation detectors and MARSSIM land scanning techniques to measure soil concentrations between sample locations and in excavated materials. Whereas, RP utilizes surface contamination monitoring equipment in the form of a 15.5 cm{sup 2} open area pancake Geiger-Mueller (GM) tube detector to measure soil contamination levels reported in counts per minute (cpm). This paper presents a method to evaluate the theoretical best responses that could be obtained from surface contamination monitoring instrumentation for a known concentration (1 Bq/g) of various radionuclides. A static efficiency of cpm/Bq{sup -1} g{sup -1} is obtained from these calculations. These contamination monitoring sensitivities are then used in a MARSSIM scanning sensitivity equation and compared to the scanning sensitivity of an NaI(Tl) scintillation detector. The results demonstrate that the sensitivity of the frisker probes to particle radiations (betas for pancake) tend to fall in a range of only a few cpm/Bq{sup -1} g{sup -1}. Rather, the primary static response of the pancake probe to soil contamination is from gamma radiation where a value of 36 cpm/Bq{sup -1} g{sup -1} for Cs-137 was obtained at 2.54 cm distance without the application of scanning statistics. In comparison, a 7.6 cm x 7.6 cm NaI(Tl) detector has a Cs-137 static response factor of 10,000 cpm/Bq{sup -1} g{sup -1} at 15 cm distance without applying scanning statistics. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Vectorization of CMSSW offline software

The CMS experiment has been utilizing vectorization, or SIMD, in parts of its data processing applications for over a decade. On x86 platforms the vectorization level is still SSE3. In the past attempts to use wider vector instruction sets such as AVX or AVX-512 have, in practice, not resulted in improvements in the overall event processing throughput, because the CPUs scale down their frequency when processing AVX instructions. In addition, a notable part of the global pool of CMS’ resources has been old systems either not supporting AVX, or where the CPU frequency downscaling impacts all cores of the CPU. CMS has nevertheless continued to vectorize more of its application code, and in this work we review profiling methods we have found effective to find out pieces of code that would benefit from vectorization, and techniques to transform those codes such that the GCC compiler is able to auto-vectorize those codes. The build system used for CMSSW, Scram, has also been enha nced to be able to build code for multiple CPU microarchitectures such that the shared libraries of desired microarchitecture level can be loaded based on the CPU of the system. This multi-microarchitecture setup is invisible to the workflow management system, which makes its deployment straightforward. We describe in detail how this multi-microarchitecture build is set up, and measure the impact of using wider vector units than SSE3 on the event processing throughput of CMS applications such as simulation and reconstruction on recent x86 CPUs.

Gartung, Patrick↗

Comparative Analysis of TCR and TCR-pMHC Complex Structure Prediction Tools

The rapid development of computational approaches for predicting the structures of T cell receptors (TCRs) and TCR-peptide-major histocompatibility (TCR-pMHC) complexes, accelerated by AI breakthroughs such as AlphaFold, has made it feasible to calculate these structures with increasing accuracy. Although these tools show great potential, their relative accuracy and limitations remain unclear due to the lack of standardized benchmarks. Here, we systematically evaluate seven tools for predicting isolated TCR structures together with six tools for predicting TCR-pMHC complex structures. The methods include homology-based approaches, general prediction tools using AlphaFold, TCR-specific tools derived from AlphaFold2, and the newly developed tFold-TCR model. The evaluation uses a post-training data set comprising 40 αβ TCRs and 27 TCR-pMHC complexes (21 Class I and 6 Class II). Model accuracy is assessed at global, local, and interface levels using a variety of metrics. We find that each tool offers distinct advantages in various aspects of its predictions. AlphaFold2, AlphaFold3, and tFold-TCR excel in overall accuracy of TCR structure prediction, and TCRmodel2 and AlphaFold2 perform well in overall accuracy of TCR-pMHC structure prediction. However, TCR-specific tools derived from AlphaFold2 show lower accuracy in the framework region than both homology-based methods and general-purpose tools such as AlphaFold, and challenges remain for all in modeling CDR3 loops, docking orientations, TCR-peptide interfaces, and Class II MHC-peptide interfaces. Furthermore, these findings will guide researchers in selecting appropriate tools, emphasize the importance of using multiple evaluation metrics to assess model performance, and offer suggestions for improving TCR and TCR-pMHC structure prediction tools.

Chemical structure↗

Optimal Voltage Reference for Droop-Based DERs in Distribution Systems

Due to the newly issued standards on distributed energy resources (DERs), the droop-based operation modes (Q-V and P-V droops) become a requirement for all the interconnected DER units at the distribution level. Voltage references of the DER units can be assigned to improve the operational behavior of the distribution system in the smart grid context. This paper presents a novel formulation for optimally setting voltage reference of the droop-based DER units in distribution systems with the objective of minimizing the system ohmic loss. This problem is formulated as a mixed-integer quadratic convex optimization problem in MATLAB and solved by the MATLAB and CPLEX solvers. The IEEE 123-bus system and the EPRI test system Ckt5 are used to validate the proposed formulation. The result obtained from the proposed formulation is compared with the result of the original problem solved by the heuristic method. Based on the numerical study results, system loss can be reduced after the proposed voltage reference assignment. The computational expense of the new formulation is also much lower than that of the heuristic approach.

distributed energy resource integration↗

Optimized Auxiliary Functions for Robust Mitigation of Finite-Size Errors in Periodic Hybrid Density Functional Theory

When calculating properties of periodic systems at the thermodynamic limit (TDL), the dominant source of finite size error (FSE) arises from the long-range Coulomb interaction, and can manifest as a slowly converging quadrature error when approximating an integral in the reciprocal space by a finite sum. The singularity subtraction (SS) method offers a systematic approach for reducing this quadrature error and thus the FSE. Here, in this work, we first investigate the performance of the SS method in the simplest setting, aiming at reducing the FSE in exact exchange calculations by subtracting the Coulomb contribution with a single, adjustable Gaussian auxiliary function. We demonstrate that a simple fitting method can robustly estimate the optimal Gaussian width and leads to rapid convergence toward the TDL. Furthermore, we suggest new forms of the auxiliary function, whose optimal parameters could also be determined through least-squares fitting. For a range of semiconductors and insulators, the proposed auxiliary functions achieve robust, millihartree-level accuracy in hybrid density functional theory calculations, including cases with sparse k-meshes and large basis sets.

Quiton, Stephen Jon [University of California, Ber↗

A Parameter-masked Mock Data Challenge for Beyond-two-point Galaxy Clustering Statistics

The past few years have seen the emergence of a wide array of novel techniques for analyzing high-precision data from upcoming galaxy surveys, which aim to extend the statistical analysis of galaxy clustering data beyond the linear regime and the canonical two-point (2pt) statistics. We test and benchmark some of these new techniques in a community data challenge named “Beyond-2pt,” initiated during the Aspen 2022 Summer Program “Large-Scale Structure Cosmology beyond 2-Point Statistics,” whose first round of results we present here. The challenge data set consists of high-precision mock galaxy catalogs for clustering in real space, in redshift space, and on a light cone. Participants in the challenge have developed end-to-end pipelines to analyze mock catalogs and extract unknown (“masked”) cosmological parameters of the underlying ΛCDM models with their methods. The methods represented are density-split clustering, nearest neighbor statistics, BACCO power spectrum emulator, void statistics, LEFTfield field-level inference using effective field theory (EFT), and joint power spectrum and bispectrum analyses using both EFT and simulation-based inference. In this work, we review the results of the challenge, focusing on problems solved, lessons learned, and future research needed to perfect the emerging beyond-2pt approaches. The unbiased parameter recovery demonstrated in this challenge by multiple statistics and the associated modeling and inference frameworks supports the credibility of cosmology constraints from these methods. The challenge data set is publicly available, and we welcome future submissions from methods that are not yet represented.

Krause, Elisabeth [Univ. of Arizona, Tucson, AZ (U↗

Microstrata

Abstract Microstrata are the non-extremal analogues of superstrata: they are smooth, non-extremal (non-BPS) solitonic solutions to IIB supergravity whose deep-throat limits approximate black holes. Using perturbation theory and numerical methods, we construct families of solutions using a consistent truncation to three-dimensional supergravity. The most general families presented here involve two continuous parameters, or amplitudes, and four quantized parameters that set the angular momenta and energy levels. Our solutions are asymptotic to the vacuum of the D1-D5 system: AdS 3 ×S 3 × 𝕋 4 . Using holography, we show that the they are dual to multi-particle states in the D1-D5 CFT involving a large number of mutually non-BPS supergravitons and we determine the anomalous dimensions of these states from the binding energies in supergravity. These binding energies are uniformly negative and depend non-linearly on the amplitudes of the states. In one family of solutions, smoothness restricts some of the fields to lie on a special locus of the parameter space. Using precision holography we show that this special locus can be identified with the multi-particle states constructed via the standard OPE of the single-particle constituents. Our numerical analysis shows that microstrata are robust at large amplitudes and the solutions can be obtained to very high precision.

Physics↗

Biosensor Guided Polyketide Synthases Engineering for Optimization of Domain Exchange Boundaries

Type I modular polyketide synthases (PKSs) are multi-domain enzymes functioning like assembly lines. Many engineering attempts have been made for the last three decades to replace, delete and insert new functional domains into PKSs to produce novel molecules. However, inserting heterologous domains often destabilize PKSs, causing loss of activity and protein misfolding. To address this challenge, here we develop a fluorescence-based solubility biosensor that can quickly identify engineered PKSs variants with minimal structural disruptions. Using this biosensor, we screen a library of acyltransferase (AT)-exchanged PKS hybrids with randomly assigned domain boundaries, and we identify variants that maintain wild type production levels. We then probe each position in the AT linker region to determine how domain boundaries influence structural integrity and identify a set of optimized domain boundaries. Overall, we have successfully developed an experimentally validated, high-throughput method for making hybrid PKSs that produce novel molecules.

59 BASIC BIOLOGICAL SCIENCES↗

SU-E-J-176: Characterization of Inter-Fraction Breast Variability and the Implications On Delivered Dose

Purpose: To systematically characterize inter-fraction breast variability and determine implications on delivered dose. Methods: Weekly port films were used to characterize breast setup variability. Five evenly spaced representative positions across the contour of each breast were chosen on the electronic port film in reference to graticule, and window and level was set such that the skin surface of the breast was visible. Measurements from the skin surface to treatment field edge were taken on each port film at each position and compared to the planning DRR, quantifying the variability. The systematic measurement technique was repeated for all port films for 20 recently treated breast cancer patients. Measured setup variability for each patient was modeled as a normal distribution. The distribution was randomly sampled from the model and applied as isocentric shifts in the treatment planning computer, representing setup variability for each fraction. Dose was calculated for each shifted fraction and summed to obtain DVHs and BEDs that modeled the dose with daily setup variability. Patients were categorized in to relevant groupings that were chosen to investigate the rigorousness of immobilization types, treatment techniques, and inherent anatomical difficulties. Mean position differences and dosimetric differences were evaluated between planned and delivered doses. Results: The setup variability was found to follow a normal distribution with mean position differences between the DRR and port film between − 8.6–3.5 mm with sigma range of 5.3–9.8 mm. Setup position was not found to be significantly different than zero. The mean seroma or whole breast PTV dosimetric difference, calculated as BED, ranged from a −0.23 to +1.13Gy. Conclusion: A systematic technique to quantify and model setup variability was used to calculate the dose in 20 breast cancer patients including variable setup. No statistically significant PTV or OAR BED differences were found between immobilization, treatment or anatomical differences investigated.

60 APPLIED LIFE SCIENCES↗

SU-E-T-14: A Comparative Study Between Forward and Inverse Planning in Gamma Knife Radiosurgery for Acoustic Neuroma Tumours

Purpose: To evaluate forward and inverse planning methods for acoustic neuroma cases treated in Gamma Knife Perfexion. Methods: Five patients with acoustic neuroma tumour abutting brainstem were planned twice in LGP TPS (Version 10.1) using TMR10 algorithm. First plan was entirely based on forward planning (FP) in which each shot was chosen manually. Second plan was generated using inverse planning (IP) for which planning parameters like coverage, selectivity, gradient index (GI) and beam-on time threshold were set. Number of shots in IP was automatically selected by objective function using iterative process. In both planning methods MRI MPRAGE sequence images were used for tumour localization and planning. A planning dose of 12Gy at 50% isodose level was chosen. Results and Discussion: Number of shots used in FP was greater than IP and beam-on time in FP was in average 1.4 times more than IP. One advantage of FP was that the brainstem volume subjected to 6Gy dose (25% isodose) was less in FP than IP. Our results showed use of more number of shots as in FP results in GI less than or equal to 2.55 which is close to its lower limit. Dose homogeneity index (DHI) analysis of FP and IP showed average values of 0.59 and 0.67 respectively. General trend in GK for planning in acoustic neuroma cases is to use small collimator shots to avoid dose to adjacent critical structures. More number of shots and prolonged treatment time causes inconvenience to the patients. Similarly overuse of automatic shot shaping as in IP results in increased scatter dose. A compromise is required in shot selection for these cases. Conclusion: IP method could be used in acoustic neuroma cases to decrease treatment time provided the source sector openings near brainstem are shielded or adjusted appropriately to reduce brainstem dose.

60 APPLIED LIFE SCIENCES↗

Impacts of Dual-Use Solar (Agrivoltaics) on Crop Productivity and the Agricultural Economy in Massachusetts and Beyond

This project contributes applied research to better understand the impacts of agrivoltaics on farm microclimates, crop productivity, and economics at the farm and sector level. The site trial research is divided into two sets of site trials integrated into commercial farm and agrivoltaic operations – one set on annual vegetable and hay crops and one on perennial cranberry bog operations. The economic research developed methods for recording and evaluating changes in farm operations and costs, and on the public perception of and willingness-to-accept agrivoltaics.

14 SOLAR ENERGY↗

A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization

This work presents a novel modeling and analysis framework for graph sequences which addresses the challenge of detecting and contextualizing anomalies in labelled, streaming graph data. We introduce a generalization of the BTER model of Seshadhri et al. by adding flexibility to community structure, and use this model to perform multi-scale graph anomaly detection. Specifically, probability models describing coarse subgraphs are built by aggregating node probabilities, and these related hierarchical models simultaneously detect deviations from expectation. This technique provides insight into a graph's structure and internal context that may shed light on a detected event. Additionally, this multi-scale analysis facilitates intuitive visualizations by allowing users to narrow focus from an anomalous graph to particular subgraphs or nodes causing the anomaly. For evaluation, two hierarchical anomaly detectors are tested against a baseline Gaussian method on a series of sampled graphs. We demonstrate that our graph statistics-based approach outperforms both a distribution-based detector and the baseline in a labeled setting with community structure, and it accurately detects anomalies in synthetic and real-world datasets at the node, subgraph, and graph levels. Furthermore, to illustrate the accessibility of information made possible via this technique, the anomaly detector and an associated interactive visualization tool are tested on NCAA football data, where teams and conferences that moved within the league are identified with perfect recall, and precision greater than 0.786.

97 MATHEMATICS AND COMPUTING↗

A general framework for substructuring-based domain decomposition methods for models having nonlocal interactions [including apppendix B]

A rigorous mathematical framework is provided for a substructuring-based domain-decomposition approach for nonlocal problems that feature interactions between points separated by a finite distance. Here, by substructuring it is meant that a traditional geometric configuration for local partial differential equation problems is used in which a computational domain is subdivided into non-overlapping subdomains. In the nonlocal setting, this approach is substructuring-based in the sense that those subdomains interact with neighboring domains over interface regions having finite volume, in contrast to the local PDE setting in which interfaces are lower dimensional manifolds separating abutting subdomains Key results include the equivalence between the global, single-domain nonlocal problem and its multi-domain reformulation, both at the continuous and discrete levels. These results provide the rigorous foundation necessary for the development of efficient solution strategies for nonlocal domain-decomposition methods.

97 MATHEMATICS AND COMPUTING↗