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.
We present an extensive study of the MSSM parameter space allowing for general generation mixing in the squark sector. Employing an MCMC algorithm, we establish the parameter ranges which are allowed with respect to various experimental and theoretical constraints. Based on this analysis, we propose benchmark scenarios for future studies. Moreover, we discuss aspects of signatures at the LHC.
The sharp increase of pressure at the edge of a high confinement mode (H-mode) plasma, the pedestal, strongly impacts overall plasma performance. Predicting the pedestal is a necessity to control and optimize tokamak operations. An experimental data-driven machine learning (ML) approach is presented that predicts the pedestal heights and widths of electron density (ne) and electron temperature (Te) profiles as well as the separatrix ne from externally controllable parameters such as the plasma shape, heating method and power, and gas puff rate and integrated gas puff. The OMFIT framework was used with DIII-D data to efficiently, robustly, and automatically build a database of pedestal parameters to train machine learning models. Database creation was enabled by the search engine tool for DIII-D data, TokSearch, which parallelizes data fetching, enabling fast searches through basic signals of thousands of DIII-D shots and selection of relevant time intervals. Principal Component Analysis (PCA) separated the database into three clusters that represent classes of plasma shapes that are regularly used in DIII-D. The most important parameters for setting the pedestal structure were plasma current (Ip), toroidal magnetic field (Bφ), neutral beam heating power (PNBI) and shaping quantities. The Deep Jointly Informed Neural Networks (DJINN) algorithm was applied to identify suitable neural network (NN) architectures that appropriately capture the features of the pedestal database. Separate NNs were implemented for each pedestal parameter, and ensembling methods were used to improve the prediction accuracy and allowed estimation of the prediction uncertainty. The pedestal predictions of the test dataset lie within the measurement uncertainties of the pedestal parameters. The NN outperformed simple Linear Regression (LR) analysis, indicating non-linear dependencies in the pedestal structure. The presented achievements illustrate a promising path for future research, using feature extraction to infer experimental trends and thereby improve pedestal models as well as deploying NN for a fast pedestal prediction in DIII-D scenario development.
The purpose of this paper is to construct new types of wavelets for minimal splines on an irregular grid. The approach applied to construct spline-wavelet decompositions uses approximation relations as an initial structure for constructing the spaces of minimal splines. The advantages of this approach are the possibilities of using irregular grids and sufficiently arbitrary nonpolynomial spline-wavelets.
Purpose: Pulmonary magnetic-resonance-imaging (MRI) and x-ray computed-tomography have provided strong evidence of spatially and temporally persistent lung structure-function abnormalities in asthmatics. This has generated a shift in their understanding of lung disease and supports the use of imaging biomarkers as intermediate endpoints of asthma severity and control. In particular, pulmonary {sup 1}H MRI can be used to provide quantitative lung structure-function measurements longitudinally and in response to treatment. However, to translate such biomarkers of asthma, robust methods are required to segment the lung from pulmonary {sup 1}H MRI. Therefore, their objective was to develop a pulmonary {sup 1}H MRI segmentation algorithm to provide regional measurements with the precision and speed required to support clinical studies. Methods: The authors developed a method to segment the left and right lung from {sup 1}H MRI acquired in 20 asthmatics including five well-controlled and 15 severe poorly controlled participants who provided written informed consent to a study protocol approved by Health Canada. Same-day spirometry and plethysmography measurements of lung function and volume were acquired as well as {sup 1}H MRI using a whole-body radiofrequency coil and fast spoiled gradient-recalled echo sequence at a fixed lung volume (functional residual capacity + 1 l). We incorporated the left-to-right lung volume proportion prior based on the Potts model and derived a volume-proportion preserved Potts model, which was approximated through convex relaxation and further represented by a dual volume-proportion preserved max-flow model. The max-flow model led to a linear problem with convex and linear equality constraints that implicitly encoded the proportion prior. To implement the algorithm, {sup 1}H MRI was resampled into ∼3 × 3 × 3 mm{sup 3} isotropic voxel space. Two observers placed seeds on each lung and on the background of 20 pulmonary {sup 1}H MR images in a randomized dataset, on five occasions, five consecutive days in a row. Segmentation accuracy was evaluated using the Dice-similarity-coefficient (DSC) of the segmented thoracic cavity with comparison to five-rounds of manual segmentation by an expert observer. The authors also evaluated the root-mean-squared-error (RMSE) of the Euclidean distance between lung surfaces, the absolute, and percent volume error. Reproducibility was measured using the coefficient of variation (CoV) and intraclass correlation coefficient (ICC) for two observers who repeated segmentation measurements five-times. Results: For five well-controlled asthmatics, forced expiratory volume in 1 s (FEV{sub 1})/forced vital capacity (FVC) was 83% ± 7% and FEV{sub 1} was 86 ± 9%{sub pred}. For 15 severe, poorly controlled asthmatics, FEV{sub 1}/FV C = 66% ± 17% and FEV{sub 1} = 72 ± 27%{sub pred}. The DSC for algorithm and manual segmentation was 91% ± 3%, 92% ± 2% and 91% ± 2% for the left, right, and whole lung, respectively. RMSE was 4.0 ± 1.0 mm for each of the left, right, and whole lung. The absolute (percent) volume errors were 0.1 l (∼6%) for each of right and left lung and ∼0.2 l (∼6%) for whole lung. Intra- and inter-CoV (ICC) were <0.5% (>0.91%) for DSC and <4.5% (>0.93%) for RMSE. While segmentation required 10 s including ∼6 s for user interaction, the smallest detectable difference was 0.24 l for algorithm measurements which was similar to manual measurements. Conclusions: This lung segmentation approach provided the necessary and sufficient precision and accuracy required for research and clinical studies.
Accuracy, variationality, and convergence underpin the reliability of modern electronic structure methods, yet definitive benchmarks in the relativistic regime remain elusive due to the absence of numerically exact full configuration interaction (CI) references. Recent algorithmic advances in the CI framework, enabled by the small-tensor-product (STP) decomposition approach, have dramatically extended the tractable size of the configuration space, making numerically exact CI calculations feasible in large active spaces previously beyond reach. In this paper, we employ the recently developed STP-CI framework to perform large-scale numerically exact CI calculations and directly benchmark relativistic coupled cluster and density matrix renormalization group methods. Definitive benchmarking of approximate relativistic electronic structure methods is ensured through the application of the gap theorem, which provides rigorous error bounds on the CI reference and establishes a controlled standard for assessing accuracy, variationality, and convergence.
Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.
Three-dimensional (3D) micro-tomography (µ-CT) has proven to be an important imaging modality in industry and scientific domains. Understanding the properties of material structure and behavior has produced many scientific advances. An important component of the 3D µ-CT pipeline is image partitioning (or image segmentation), a step that is used to separate various phases or components in an image. Image partitioning schemes require specific rules for different scientific fields, but a common strategy consists of devising metrics to quantify performance and accuracy. The present article proposes a set of protocols to systematically analyze and compare the results of unsupervised classification methods used for segmentation of synchrotron-based data. Additionally, the proposed dataflow for Materials Segmentation and Metrics (MSM) provides 3D micro-tomography image segmentation algorithms, such as statistical region merging (SRM), k-means algorithm and parallel Markov random field (PMRF), while offering different metrics to evaluate segmentation quality, confidence and conformity with standards. Both experimental and synthetic data are assessed, illustrating quantitative results through the MSM dashboard, which can return sample information such as media porosity and permeability. The main contributions of this work are: (i) to deliver tools to improve material design and quality control; (ii) to provide datasets for benchmarking and reproducibility; (iii) to yield good practices in the absence of standards or ground-truth for ceramic composite analysis.
Helium is generally understood to be chemically inert and this is due to its extremely stable closed-shell electronic configuration, zero electron affinity and an unsurpassed ionization potential. It is not known to form thermodynamically stable compounds, except a few inclusion compounds. Here, using the ab initio evolutionary algorithm USPEX and subsequent high-pressure synthesis in a diamond anvil cell, we report the discovery of a thermodynamically stable compound of helium and sodium, Na 2 He, which has a fluorite-type structure and is stable at pressures >113 GPa. We show that the presence of He atoms causes strong electron localization and makes this material insulating. This phase is an electride, with electron pairs localized in interstices, forming eight-centre two-electron bonds within empty Na 8 cubes. As a result, we also predict the existence of Na 2 HeO with a similar structure at pressures above 15 GPa.
Abstract Machine learning has been increasingly used for protein engineering. However, because the general sequence contexts they capture are not specific to the protein being engineered, the accuracy of existing machine learning algorithms is rather limited. Here, we report ECNet (evolutionary context-integrated neural network), a deep-learning algorithm that exploits evolutionary contexts to predict functional fitness for protein engineering. This algorithm integrates local evolutionary context from homologous sequences that explicitly model residue-residue epistasis for the protein of interest with the global evolutionary context that encodes rich semantic and structural features from the enormous protein sequence universe. As such, it enables accurate mapping from sequence to function and provides generalization from low-order mutants to higher-order mutants. We show that ECNet predicts the sequence-function relationship more accurately as compared to existing machine learning algorithms by using ~50 deep mutational scanning and random mutagenesis datasets. Moreover, we used ECNet to guide the engineering of TEM-1 β-lactamase and identified variants with improved ampicillin resistance with high success rates.
X-ray free-electron lasers (XFELs) have inspired the development of serial femtosecond crystallography (SFX) as a method to solve the structure of proteins. SFX datasets are collected from a sequence of protein microcrystals injected across ultrashort X-ray pulses. The idea behind SFX is that diffraction from the intense, ultrashort X-ray pulses leaves the crystal before the crystal is obliterated by the effects of the X-ray pulse. The success of SFX at XFELs has catalyzed interest in analogous experiments at synchrotron-radiation (SR) sources, where data are collected from many small crystals and the ultrashort pulses are replaced by exposure times that are kept short enough to avoid significant crystal damage. The diffraction signal from each short exposure is so `sparse' in recorded photons that the process of recording the crystal intensity is itself a reconstruction problem. Using the EMC algorithm, a successful reconstruction is demonstrated here in a sparsity regime where there are no Bragg peaks that conventionally would serve to determine the orientation of the crystal in each exposure. In this proof-of-principle experiment, a hen egg-white lysozyme (HEWL) crystal rotating about a single axis was illuminated by an X-ray beam from an X-ray generator to simulate the diffraction patterns of microcrystals from synchrotron radiation. Millions of these sparse frames, typically containing only ~200 photons per frame, were recorded using a fast-framing detector. It is shown that reconstruction of three-dimensional diffraction intensity is possible using the EMC algorithm, even with these extremely sparse frames and without knowledge of the rotation angle. Further, the reconstructed intensity can be phased and refined to solve the protein structure using traditional crystallographic software. In conclusion, this suggests that synchrotron-based serial crystallography of micrometre-sized crystals can be practical with the aid of the EMC algorithm even in cases where the data are sparse.
Scientific workflows provide an opportunity for declarative computational experiment design in an intuitive and efficient way. A distributed workflow is typically executed on a variety of resources, and it uses a variety of computational algorithms or tools to achieve the desired outcomes. Such a variety imposes additional complexity in scheduling these workflows on large scale computers. As computation becomes more distributed, insights into expected workload that a workflow presents become critical for effective resource allocation. In this paper, we present a modular framework that leverages Machine Learning for creating precise performance predictions of a workflow. The central idea is to partition a workflow in such a way that makes the task of forecasting each atomic unit manageable and gives us a way to combine the individual predictions efficiently. We recognize a combination of an executable and a specific physical resource as a single module. This gives us a handle to characterize workload and machine power as a single unit of prediction. Overall, our modular technique of creating atomic modules and deployment of longest-path approach to estimate workflow performance, allows the framework to adapt to highly complex nested directed acyclic workflows and scale to new scenarios, since it does not make assumptions of underlying workflow structure. We present performance estimation results of independent workflow modules executed on the XSEDE SDSC Comet cluster using various Machine Learning algorithms. The results provide insights into the behavior and effectiveness of different algorithms in the context of scientific workflow performance prediction.
We present the Point cLoud Algorithm for NEtwork Extraction of Discrete Fracture Networks (PLANE-DFN), a point cloud–based algorithm for automatic fracture network extraction designed to support discrete fracture network (DFN) modeling workflows. PLANE-DFN segments three-dimensional fracture planes from raw point cloud data using RANdom SAmple Consensus coupled with statistical outlier removal and density-based clustering to isolate individual fracture features. Each candidate plane is constrained against site-specific structural constraints based on strike and dip. After segmentation, each fracture is converted into a 2-D convex polygon suitable for meshing and simulation. The PLANE-DFN algorithm is validated by comparing geometric and flow and transport data against data from dfnWorks simulations with ensembles of plane-fit networks. We find that the flow and transport in plane-fit networks are comparable to dfnWorks-generated networks when realistic network geometry is maintained. The PLANE-DFN algorithm provides an automated and streamlined workflow to transform point clouds of data into DFN network geometry.
Constrained multiagent reinforcement learning (C-MARL) is gaining importance as MARL algorithms find new applications in real-world systems ranging from energy systems to drone swarms. Most C-MARL algorithms use a primal-dual approach to enforce constraints through a penalty function added to the reward. In this paper, we study the structural effects of this penalty term on the MARL problem. First, we show that the standard practice of using the constraint function as the penalty leads to a weak notion of safety. However, by making simple modifications to the penalty term, we can enforce meaningful probabilistic (chance and conditional value at risk) constraints. Second, we quantify the effect of the penalty term on the value function, uncovering an improved value estimation procedure. We use these insights to propose a constrained multiagent advantage actor critic (C-MAA2C) algorithm. Simulations in a simple constrained multiagent environment affirm that our reinterpretation of the primal-dual method in terms of probabilistic constraints is effective, and that our proposed value estimate accelerates convergence to a safe joint policy.
This report describes the University of Iowa portion of a project that is now continuing at Michigan State University. We are developing novel methods, algorithms, and software to enable simulations of molecules and materials at high temperature. This is a key challenge in chemistry and materials science. By refining an approach called Density Matrix Quantum Monte Carlo (DMQMC), we developed faster and more accurate ways to conduct these simulations. These advances will help us understand how temperature affects the behavior of electrons, chemical bonds, and phase transitions in solids and molecules. These breakthroughs are especially important for applications where light and heat drive chemical reactions, superconductivity, and materials used in energy and sensing. In addition, this project involved the development of the open-source HANDE-QMC software package, supporting the broader community in benchmarking and developing finite-temperature electronic structure methods.
Systems and methods for generating graded lattice structures that can be used as infill for additively manufactured articles. Tailored sectioning and field-based smoothing are modified polygon, e.g., circle, packing algorithms that adjust the size of the circles based on physical field data to adapt the infill generation process to a field expected to be experienced by the article. Molecular dynamically generated lattice infill is based on force balancing a node distribution instead of a circle packing. Field data can be utilized to adjust the spacing of the node distribution according to a force balance equilibrium model that accounts for the field expected to be experienced by the article being additively manufactured. The resultant non-uniform honeycomb structures from tailored sectioning, field-based smoothing, and force-balancing robustly and efficiently address the connection issues with traditional non-uniform lattice structures.
Many popular vetting tools for Android applications use static code analysis techniques. In particular, Interprocedural Data-Flow Graph (IDFG) construction is the computation at the core of Android static data-flow analysis and consumes most of the analysis time. Many analysis tools use a worklist algorithm, an iterative fixed-point approach, to construct the IDFG. In this paper, we observe that a straightforward GPU parallelization of the worklist algorithm leads to significant underutilization of the GPU resources. We identify four performance bottlenecks, namely, frequent dynamic memory allocations, high branch divergence, workload imbalance, and irregular memory access patterns. Accordingly, we propose GDroid, a GPU-based worklist algorithm implementation with multiple fine-grained optimizations tailored to common characteristics of Android applications. The optimizations considered are: matrix-based data structure, memory access-based node grouping, and worklist merging. Our experimental evaluation, performed on 1000 Android applications, shows that the proposed optimizations are beneficial to performance, and GDroid can achieve up to 128X speedups against a plain GPU implementation.
Optical microscopy, owing to its noninvasiveness and subcellular resolution, enables in vivo visualization of neuronal structure and function in the physiological context. Optical-sectioning structured illumination microscopy (OS-SIM) is a widefield fluorescence imaging technique that uses structured illumination patterns to encode in-focus structures and optically sections 3D samples. However, its application to in vivo imaging has been limited. In this study, we optimized OS-SIM for in vivo neural imaging. We modified OS-SIM reconstruction algorithms to improve signal-to-noise ratio and correct motion-induced artifacts in live samples. Incorporating an adaptive optics (AO) module to OS-SIM, we found that correcting sample-induced optical aberrations was essential for achieving accurate structural and functional characterizations in vivo. With AO OS-SIM, we demonstrated fast, high-resolution in vivo imaging with optical sectioning for structural imaging of mouse cortical neurons and zebrafish larval motor neurons, and functional imaging of quantal synaptic transmission at Drosophila larval neuromuscular junctions.
Cellular lattice structures possess high strength-to-weight ratios suitable for advanced lightweight engineering applications. However, their quality and mechanical performance can degrade because of defects introduced during manufacturing or in-service. Their complexity and small length scale features make defects difficult to detect using conventional nondestructive evaluation methods. Here we propose a current injection-based method, electrical resistance tomography (ERT), that can be used to detect damaged struts in conductive cellular lattice structures with their intrinsic electromechanical properties. The reconstructed conductivity distributions from ERT can reveal the severity and location of damaged struts without having to probe each strut. However, the low central sensitivity of ERT may result in image artifacts and inaccurate localization of damaged struts. To address this issue, this study introduces an absolute, high throughput, conductivity reconstruction algorithm for 3D ERT. The algorithm incorporates a strut-based normalized sensitivity map to compensate for lower interior sensitivity and suppresses reconstruction artifacts. Numerical simulations and experiments on fabricated representative cellular lattice structures were performed to verify the ability of ERT to quantitatively identify single and multiple damaged struts. The improved performance of this method compared with classical ERT was observed, based on greatly decreased imaging and reconstructed value errors.