Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 973 records · Page 54

Fault-tolerant dynamic task graph scheduling

In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.

fault tolerance↗

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗

Lattice QCD Calculation of Nucleon Structure

It is emphasized in the 2015 NSAC Long Range Plan that "understanding the structure of hadrons in terms of QCD's quarks and gluons is one of the central goals of modern nuclear physics." Over the last three decades, lattice QCD has developed into a powerful tool for ab initio calculations of strong-interaction physics. Up until now, it is the only theoretical approach to solving QCD with controlled statistical and systematic errors. Since 1985, we have proposed and carried out first-principles calculations of nucleon structure and hadron spectroscopy using lattice QCD which entails both algorithmic development and large-scale computer simulation. We started out by calculating the nucleon form factors -- electromagnetic, axial-vector, πNN, and scalar form factors, the quark spin contribution to the proton spin, the strangeness magnetic moment, the quark orbital angular momentum, the quark momentum fraction, and the quark and glue decomposition of the proton momentum and angular momentum. The first round of calculations were done with Wilson fermions in the `quenched' approximation where the dynamical effects of the quarks in the sea are not taken into account in the Monte Carlo simulation to generate the background gauge configurations. Beginning in 2000, we have started implementing the overlap fermion formulation into the spectroscopy and structure calculations. This is mainly because the overlap fermion honors chiral symmetry as in the continuum. It is going to be more and more important to take the symmetry into account as the simulations move closer to the physical point where the u and d quark masses are as light as a few MeV only. We began with lattices which have quark masses in the sea corresponding to a pion mass at ~ 300 MeV and obtained the strange form factors, charm and strange quark masses, the charmonium spectrum and the D s meson decay constant f D s , the strangeness and charmness, the meson mass decomposition and the strange quark spin from the anomalous Ward identity. Recently, we have started to include multiple lattices with different lattice spacings and different volumes including large lattices at the physical pion mass point. We are getting quite close to being able to calculate the hadron structure at the physical point and to do the continuum and large volume extrapolations, which is our ultimate aim. We have now finished several projects which have included these systematic corrections. They include the leptonic decay width of the ρ, the πN sigma and strange sigma terms, and the strange quark magnetic moment. Over the years, we have also studied hadron spectroscopy with lattice calculations and in phenomenology. These include Roper resonance, pentaquark state, charmonium spectrum, glueballs, scalar mesons a 0 (1450) and σ(600) and other scalar mesons, and the 1 -+ meson. In addition, we have employed the canonical approach to explore the first-order phase transition and the critical point at finite density and finite temperature. We have also discovered a new parton degree of freedom -- the connected sea partons, from the path-integral formulation of the hadronic tensor, which explains the experimentally observed Gottfried sum rule violation. Combining experimental result on the strange parton distribution, the CT10 global fitting results of the total u and d anti-partons and the lattice result of the ratio of the momentum fraction of the strange vs that of u or d in the disconnected insertion, we have shown that the connected sea partons can be isolated. In this final technical report, we shall present a few representative highlights that have been achieved in the project.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Chameleon sequences in neurodegenerative diseases

Chameleon sequences can adopt either alpha helix sheet or a coil conformation. Defining chameleon sequences in PDB (Protein Data Bank) may yield to an insight on defining peptides and proteins responsible in neurodegeneration. In this research, we benefitted from the large PDB and performed a sequence analysis on Chameleons, where we developed an algorithm to extract peptide segments with identical sequences, but different structures. In order to find new chameleon sequences, we extracted a set of 8315 non-redundant protein sequences from the PDB with an identity less than 25%. Our data was classified to “helix to strand (HE)”, “helix to coil (HC)” and “strand to coil (CE)” alterations. We also analyzed the occurrence of singlet and doublet amino acids and the solvent accessibility in the chameleon sequences; we then sorted out the proteins with the most number of chameleon sequences and named them Chameleon Flexible Proteins (CFPs) in our dataset. Our data revealed that Gly, Val, Ile, Tyr and Phe, are the major amino acids in Chameleons. We also found that there are proteins such as Insulin Degrading Enzyme IDE and GTP-binding nuclear protein Ran (RAN) with the most number of chameleons (640 and 405 respectively). These proteins have known roles in neurodegenerative diseases. Therefore it can be inferred that other CFP's can serve as key proteins in neurodegeneration, and a study on them can shed light on curing and preventing neurodegenerative diseases.

60 APPLIED LIFE SCIENCES↗

DNS and LES of turbulent flow in a closed channel featuring a pattern of hemispherical roughness elements

Three mesh adaptivity algorithms were developed to facilitate and expedite the use of the CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques in accurate full-scale neutronics simulations of fusion energy systems with immense sizes and complicated geometries. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility and resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation. Additionally, because of the significant increase in the efficiency of FW-CADIS simulations, the three algorithms enabled this difficult calculation to be accurately solved on a regular computer cluster, eliminating the need for a world-class super computer.

Nuclear Science & Technology↗

Robust reconstruction of single-cell RNA-seq data with iterative gene weight updates

Single-cell RNA-sequencing technologies have greatly enhanced our understanding of heterogeneous cell populations and underlying regulatory processes. However, structural (spatial or temporal) relations between cells are lost during cell dissociation. These relations are crucial for identifying associated biological processes. Many existing tissue-reconstruction algorithms use prior information about subsets of genes that are informative with respect to the structure or process to be reconstructed. When such information is not available, and in the general case when the input genes code for multiple processes, including being susceptible to noise, biological reconstruction is often computationally challenging. We propose an algorithm that iteratively identifies manifold-informative genes using existing reconstruction algorithms for single-cell RNA-seq data as subroutine. We show that our algorithm improves the quality of tissue reconstruction for diverse synthetic and real scRNA-seq data, including data from the mammalian intestinal epithelium and liver lobules.

59 BASIC BIOLOGICAL SCIENCES↗

Model-Based Iterative Reconstruction for One-Sided Ultrasonic Nondestructive Evaluation

One-sided ultrasonic nondestructive evaluation (UNDE) is extensively used to characterize structures that need to be inspected and maintained from defects and flaws that could affect the performance of power plants, such as nuclear power plants. Most UNDE systems send acoustic pulses into the structure of interest, measure the received waveform, and use an algorithm to reconstruct the quantity of interest. The most widely used algorithm in UNDE systems is the synthetic aperture focusing technique (SAFT) because it produces acceptable results in real time. Thus, a few regularized inversion techniques with linear models have been proposed which can improve on SAFT, but they tend to make simplifying assumptions that do not address how to obtain reconstructions from large real datasets. In this paper, we propose a model-based iterative reconstruction (MBIR) algorithm designed for scanning UNDE systems. To further reduce some of the artifacts in the results, we enhance the forward model to account for the transmitted beam profile, the occurrence of direct arrival signals, and the correlation between scans from adjacent regions. Next, we combine the forward model with a spatially variant prior model to account for the attenuation of deeper regions. Moreover, we also present an algorithm to jointly reconstruct measurements from large datasets. Finally, using simulated and extensive experimental data, we show MBIR results and demonstrate how we can improve over SAFT as well as existing regularized inversion techniques.

47 OTHER INSTRUMENTATION↗

Classical eikonal from Magnus expansion

In a classical scattering problem, the classical eikonal is defined as the generator of the canonical transformation that maps in-states to out-states. It can be regarded as the classical limit of the log of the quantum S-matrix. In a classical analog of the Born approximation in quantum mechanics, the classical eikonal admits an expansion in oriented tree graphs, where oriented edges denote retarded/advanced worldline propagators. The Magnus expansion, which takes the log of a time-ordered exponential integral, offers an efficient method to compute the coefficients of the tree graphs to all orders. We exploit a Hopf algebra structure behind the Magnus expansion to develop a fast algorithm which can compute the tree coefficients up to the 12th order (over half a million trees) in less than an hour. In a relativistic setting, our methods can be applied to the post-Minkowskian (PM) expansion for gravitational binaries in the worldline formalism. We demonstrate the methods by computing the 3PM eikonal and find agreement with previous results based on amplitude methods. Importantly, the Magnus expansion yields a finite eikonal, while the naïve eikonal based on the time-symmetric propagator is infrared-divergent from 3PM on.

Black Holes↗

Special Issue: Geostatistics and Machine Learning

Abstract Recent years have seen a steady growth in the number of papers that apply machine learning methods to problems in the earth sciences. Although they have different origins, machine learning and geostatistics share concepts and methods. For example, the kriging formalism can be cast in the machine learning framework of Gaussian process regression. Machine learning, with its focus on algorithms and ability to seek, identify, and exploit hidden structures in big data sets, is providing new tools for exploration and prediction in the earth sciences. Geostatistics, on the other hand, offers interpretable models of spatial (and spatiotemporal) dependence. This special issue on Geostatistics and Machine Learning aims to investigate applications of machine learning methods as well as hybrid approaches combining machine learning and geostatistics which advance our understanding and predictive ability of spatial processes.

58 GEOSCIENCES↗

Interval-Valued Rank in Finite Ordered Sets

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data objects like the semantic hierarchies of ontolog- ical databases. These rarely satisfy the strong property of gradedness, which is required for traditional rank functions to exist. Representing such semantic hierarchies as finite, bounded posets, we recognize the duality of ordered structures to motivate rank functions which respect verticality both from the bottom and from the top. Our rank functions are thus interval-valued, and always exist, even for non-graded posets, providing order homomorphisms to an interval order on the interval-valued ranks. The concept of rank width arises naturally, allowing us to identify the poset region with point-valued width as its longest graded portion (which we call the “spindle”). A standard interval rank function is naturally motivated both in terms of its extremality and on pragmatic grounds. Its properties are examined, including the relation- ship to traditional grading and rank functions, and methods to assess comparisons of standard interval-valued ranks.

Joslyn, Cliff↗

New metastable phases in an oxyborate compound obtained by an evolutionary algorithm and Density Functional Theory

New metastable phases in the Fe homometallic ludwigite compound are obtained and studied using anevolutionary algorithm and Density Functional Theory. Our lowest energy monoclinic structure is identified as P21/m with space group number of 11. This structure evolves towards the monoclinic structureas the result of the spin orbit coupling and a particular zigzag magnetic structure. A zigzag distortion in aclass of three-leg ladders follows similar to the experimental one observed below the transition temper-ature of Tc= 283 K. In this distortion long and short bonds inside rungs alternating in a zigzag way alongthe ladder legs. Furthermore, a new type of zigzag structural ordering is observed in other two low-energy phases analyzed. In this case, the magnetic ordering behaves qualitatively similar to the experimental structure at 82 K, with antiferromagnetically coupled ferromagnetic rungs. Our calculations showthat magnetic symmetry is not favorable for zigzag structural ordering. Finally, structural and magneticproperties will be discussed in comparison with the experimentally known phases.

Vallejo, E.↗

Scalable self attraction and loading calculations for unstructured ocean tide models

Self attraction and earth-loading effects are important for accurately modeling global tides. A common approach of handling this forcing is to expand mass anomalies into spherical harmonics, which are scaled by load Love numbers to account for elastic earth deformation. We investigate two different approaches to perform these calculations for ocean models that employ unstructured meshes and distributed memory parallelization. The first approach leverages a highly efficient spherical harmonics library, but requires all-to-one and one-to-all communications and interpolation operations between the unstructured and a structured mesh. This approach is compared to a parallel algorithm that computes the spherical harmonic transformations directly on the unstructured mesh with an all-reduce communication. Here, our results show that although the unstructured mesh calculations are more expensive, the scalability of the unstructured mesh approach allows for more efficient spherical harmonics transforms for high-resolution meshes and large processor counts. This methodology enables the efficient inclusion of tidal dynamics large-scale Earth system model simulations.

54 ENVIRONMENTAL SCIENCES↗

Comparison of Machine Learning Approaches for Prediction of the Equivalent Alkane Carbon Number for Microemulsions Based on Molecular Properties

The chemical properties of oils are vital in the design of microemulsion systems. The hydrophilic–lipophilic difference equation used to predict microemulsions’ phase behavior expresses the oils’ physiochemical properties as the equivalent alkane carbon number (EACN). The experimental determination of EACN requires knowledge of the temperature dependence of the microemulsion system and the effects of different surfactant concentrations. Thus, the experimental determination is time-intensive and tedious, requiring days to months for proper separations. Furthermore, the experiments require high purity of chemicals because microemulsions are sensitive to impurities. Our work focuses on the quick and reliable predictions of the EACN with machine learning (ML) models. Due to the immaturity of ML chemical predictions, we compare three graph neural networks (GNNs) and a gradient-boosted tree algorithm, known as XGBoost. The GNNs use the molecular structures represented as simplified molecular-input line-entry system (SMILES) codes for the initial input, which allows us to assess whether geometry optimization is necessary for reliable results. The XGBoost model also begins with the SMILES representations of the molecules but uses molecular descriptors instead of geometry optimizations. As a result, the best model tested (crystal graph convolutional neural network with Merck molecular force field-94) has an error of 1.15 EACN units of the true EACN for unknown data with the errors skewed toward zero and an R² score of 0.9

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adsorption of CO on Low-Energy, Low-Symmetry Pt Nanoparticles: Energy Decomposition Analysis and Prediction via Machine-Learning Models

We present a systematic analysis of CO adsorption on Pt nanoclusters in the 0.2–1.5 nm size range with the aim of unraveling size-dependent trends and developing predictive models for site-specific adsorption behavior. Using an empirical-potential-based genetic algorithm and density functional theory (DFT) modeling, we show that there exists a size window (40–70 atoms) over which Pt nanoclusters bind CO weakly, the binding energies being comparable to those on (111) or (100) facets. The size-dependent adsorption energy trends are, however, distinctly nonmonotonic and are not readily captured using traditional descriptors such as d-band energies or (generalized) coordination numbers of the Pt binding sites. Instead, by applying machine-learning algorithms, we show that multiple descriptors, broadly categorized as structural and electronic descriptors, are essential for qualitatively capturing the CO adsorption trends. Nevertheless, attaining quantitative accuracy requires further refinement, and we propose the use of an additional descriptors—the fully frozen adsorption energy—that is a computationally inexpensive probe of CO–Pt bond formation. With these three categories of descriptors, we achieve an absolute mean error in CO adsorption energy prediction of 0.12 eV, which is similar to the underlying error of DFT adsorption calculations. Our approach allows for building quantitatively predictive models of site-specific adsorbate binding on realistic, low-symmetry nanostructures, which is an important step in modeling reaction networks as well as for rational catalyst design in general.

36 MATERIALS SCIENCE↗

An ammonia spectral map of the L1495-B218 filaments in the Taurus molecular cloud. I. Physical properties of filaments and dense cores

We present deep NH{sub 3} observations of the L1495-B218 filaments in the Taurus molecular cloud covering over a 3° angular range using the K-band focal plane array on the 100 m Green Bank Telescope. The L1495-B218 filaments form an interconnected, nearby, large complex extending over 8 pc. We observed NH{sub 3} (1, 1) and (2, 2) with a spectral resolution of 0.038 km s{sup −1} and a spatial resolution of 31″. Most of the ammonia peaks coincide with intensity peaks in dust continuum maps at 350 and 500 μm. We deduced physical properties by fitting a model to the observed spectra. We find gas kinetic temperatures of 8–15 K, velocity dispersions of 0.05–0.25 km s{sup −1}, and NH{sub 3} column densities of 5 × 10{sup 12} to 1 × 10{sup 14} cm{sup −2}. The CSAR algorithm, which is a hybrid of seeded-watershed and binary dendrogram algorithms, identifies a total of 55 NH{sub 3} structures, including 39 leaves and 16 branches. The masses of the NH{sub 3} sources range from 0.05 to 9.5 M{sub ⊙}. The masses of NH{sub 3} leaves are mostly smaller than their corresponding virial mass estimated from their internal and gravitational energies, which suggests that these leaves are gravitationally unbound structures. Nine out of 39 NH{sub 3} leaves are gravitationally bound, and seven out of nine gravitationally bound NH{sub 3} leaves are associated with star formation. We also found that 12 out of 30 gravitationally unbound leaves are pressure confined. Our data suggest that a dense core may form as a pressure-confined structure, evolve to a gravitationally bound core, and undergo collapse to form a protostar.

79 ASTRONOMY AND ASTROPHYSICS↗

Exploring stellar evolution models of sdB stars using MESA

Stellar evolution calculations have had great success reproducing the observed atmospheric properties of different classes of stars. Recent detections of g-mode pulsations in evolved He burning stars allow a rare comparison of their internal structure with stellar models. Asteroseismology of subdwarf B (sdB) stars suggests convective cores of 0.22–0.28 M{sub ⊙}, ≳45% of the total stellar mass. Previous studies found significantly smaller convective core masses (≲0.19 M{sub ⊙}) at a comparable evolutionary stage. We evolved stellar models with Modules for Experiments in Stellar Astrophysics (MESA) to explore how well the interior structures inferred from asteroseismology can be reproduced by standard algorithms. Our qualitative evolutionary paths, position in the logg−T{sub eff} diagram, and model timescales are consistent with previous results. The sdB masses from our full evolutionary sequences fall within the range of the empirical sdB mass distribution, but are nearly always lower than the median. Using standard MLT with atomic diffusion we find convective core masses of ∼0.17–0.18 M{sub ⊙}, averaged over the entire sdB lifetime. We can increase the convective core sizes to be as large as those inferred from asteroseismology, but only for extreme values of the overshoot parameter (overshoot gives numerically unstable and physically unrealistic behavior at the boundary). High resolution three-dimensional simulations of turbulent convection in stars suggest that the Schwarzschild criterion for convective mixing systematically underestimates the actual extent of mixing because a boundary layer forms. Accounting for this would decrease the errors in both sdB total and convective core masses.

79 ASTRONOMY AND ASTROPHYSICS↗

Toward ab-initio nuclear theory calculations of 𝛿 𝐶

We propose a theory framework to study the isospin-symmetry breaking correction 𝛿 C in superallowed nuclear 𝛽 decays, crucial for the precise determination of |𝑉 𝑢⁢𝑑 |. Based on a general assumptions of the isovector dominance in isospin-symmetry breaking interactions, we construct a set of functions 𝐹 𝑇 𝑧 which involve nuclear matrix elements of isovector monopole operators and the nuclear Green's function. Via the functions 𝐹 𝑇 𝑧 , a connection of 𝛿 C to measurable electroweak nuclear radii is established, providing an experimental gauge of the theory accuracy of 𝛿 C . Here, we outline a strategy to perform ab initio calculations of 𝐹 𝑇 𝑧 based on the Lanczos algorithm, and discuss its similarity with other nuclear-structure-dependent inputs in nuclear 𝛽 decays.

Ab initio calculations↗