Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured”

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 1,441 records · Page 80

ON THE ISOTHERMALITY OF SOLAR PLASMAS

Recent measurements have shown that the quiet unstructured solar corona observed at the solar limb is close to isothermal, at a temperature that does not appear to change over wide areas or with time. Some individual active region loop structures have also been found to be nearly isothermal both along their axis and across their cross section. Even a complex active region observed at the solar limb has been found to be composed of three distinct isothermal plasmas. If confirmed, these results would pose formidable challenges to the current theoretical understanding of the thermal structure and heating of the solar corona. For example, no current theoretical model can explain the excess densities and lifetimes of many observed loops if the loops are in fact isothermal. All of these measurements are based on the so-called emission measure (EM) diagnostic technique that is applied to a set of optically thin lines under the assumption of isothermal plasma. It provides simultaneous measurement of both the temperature and EM. In this work, we develop a new method to quantify the uncertainties in the technique and to rigorously assess its ability to discriminate between isothermal and multithermal plasmas. We define a formal measure of the uncertainty in the EM diagnostic technique that can easily be applied to real data. We here apply it to synthetic data based on a variety of assumed plasma thermal distributions and develop a method to quantitatively assess the degree of multithermality of a plasma.

79 ASTRONOMY AND ASTROPHYSICS↗

PHURBAS: AN ADAPTIVE, LAGRANGIAN, MESHLESS, MAGNETOHYDRODYNAMICS CODE. I. ALGORITHM

We present an algorithm for simulating the equations of ideal magnetohydrodynamics and other systems of differential equations on an unstructured set of points represented by sample particles. Local, third-order, least-squares, polynomial interpolations (Moving Least Squares interpolations) are calculated from the field values of neighboring particles to obtain field values and spatial derivatives at the particle position. Field values and particle positions are advanced in time with a second-order predictor-corrector scheme. The particles move with the fluid, so the time step is not limited by the Eulerian Courant-Friedrichs-Lewy condition. Full spatial adaptivity is implemented to ensure the particles fill the computational volume, which gives the algorithm substantial flexibility and power. A target resolution is specified for each point in space, with particles being added and deleted as needed to meet this target. Particle addition and deletion is based on a local void and clump detection algorithm. Dynamic artificial viscosity fields provide stability to the integration. The resulting algorithm provides a robust solution for modeling flows that require Lagrangian or adaptive discretizations to resolve. This paper derives and documents the Phurbas algorithm as implemented in Phurbas version 1.1. A following paper presents the implementation and test problem results.

79 ASTRONOMY AND ASTROPHYSICS↗

PHURBAS: AN ADAPTIVE, LAGRANGIAN, MESHLESS, MAGNETOHYDRODYNAMICS CODE. II. IMPLEMENTATION AND TESTS

We present an algorithm for simulating the equations of ideal magnetohydrodynamics and other systems of differential equations on an unstructured set of points represented by sample particles. The particles move with the fluid, so the time step is not limited by the Eulerian Courant-Friedrichs-Lewy condition. Full spatial adaptivity is required to ensure the particles fill the computational volume and gives the algorithm substantial flexibility and power. A target resolution is specified for each point in space, with particles being added and deleted as needed to meet this target. We have parallelized the code by adapting the framework provided by GADGET-2. A set of standard test problems, including 10{sup -6} amplitude linear magnetohydrodynamics waves, magnetized shock tubes, and Kelvin-Helmholtz instabilities is presented. Finally, we demonstrate good agreement with analytic predictions of linear growth rates for magnetorotational instability in a cylindrical geometry. This paper documents the Phurbas algorithm as implemented in Phurbas version 1.1.

79 ASTRONOMY AND ASTROPHYSICS↗

A CENSUS OF ROTATION AND VARIABILITY IN L1495: A UNIFORM ANALYSIS OF TRANS-ATLANTIC EXOPLANET SURVEY LIGHT CURVES FOR PRE-MAIN-SEQUENCE STARS IN TAURUS

We analyze light curves obtained by the Trans-atlantic Exoplanet Survey (TrES) for a field centered on the L1495 dark cloud in Taurus. The Spitzer Taurus Legacy Survey catalog identifies 179 bona fide Taurus members within the TrES field; 48 of the known Taurus members are detected by TrES, as well as 26 candidate members identified by the Spitzer Legacy team. We quantify the variability of each star in our sample using the ratio of the standard deviation of the original light curve ({sigma}{sub orig.}) to the standard deviation of a light curve that has been smoothed by 9 or 1001 epochs ({sigma}{sub 9} and {sigma}{sub 1001}, respectively). Known Taurus members typically demonstrate ({sigma}{sub orig.}/{sigma}{sub 9}) < 2.0, and ({sigma}{sub orig.}/{sigma}{sub 1001}) < 5, while field stars reveal ({sigma}{sub orig.}/{sigma}{sub 9}) {approx} 3.0 and ({sigma}{sub orig.}/{sigma}{sub 1001}) {approx} 10, as expected for light curves dominated by unstructured white noise. Of the 74 Taurus members/candidates with TrES light curves, we detect significant variability in 49 sources. Adapting a quantitative metric originally developed to assess the reliability of transit detections, we measure the amount of red and white noise in each light curve and identify 18 known or candidate Taurus members with highly significant period measurements. These appear to be the first periods measured for four of these sources (HD 282276, CX Tau, FP Tau, TrES J042423+265008), and in two other cases, the first non-aliased periods (LkCa 21 and DK Tau AB). For the remainder, the TrES measurements typically agree very well ({delta}P < 1%) with previously reported values. Including periods measured at lower confidence for 15 additional sources, we report periods for 11 objects where no previous periods were found, including 8 confirmed Taurus members. We also identify 10 of the 26 candidate Taurus members that demonstrate variability levels consistent with being bona fide T Tauri stars. A Kolomgorov-Smirnov (K-S) test confirms that these new periods confirm the distinction between the rotation period distributions of stars with and without circumstellar disks, with only a 10% probability of the two populations sharing the same parent period distribution. K-S tests do suggest, however, that the updated Taurus period distribution now more closely resembles those measured in other young star-forming clusters (i.e., NGC 2264, NGC 6530, and the ONC). This improved agreement may reflect the exclusion of long rotation periods which are detected in Taurus at lower significance, and which may be beyond the limits of detectability in more distant star-forming regions.

79 ASTRONOMY AND ASTROPHYSICS↗

RICH: OPEN-SOURCE HYDRODYNAMIC SIMULATION ON A MOVING VORONOI MESH

We present here RICH, a state-of-the-art two-dimensional hydrodynamic code based on Godunov’s method, on an unstructured moving mesh (the acronym stands for Racah Institute Computational Hydrodynamics). This code is largely based on the code AREPO. It differs from AREPO in the interpolation and time-advancement schemeS as well as a novel parallelization scheme based on Voronoi tessellation. Using our code, we study the pros and cons of a moving mesh (in comparison to a static mesh). We also compare its accuracy to other codes. Specifically, we show that our implementation of external sources and time-advancement scheme is more accurate and robust than is AREPO when the mesh is allowed to move. We performed a parameter study of the cell rounding mechanism (Lloyd iterations) and its effects. We find that in most cases a moving mesh gives better results than a static mesh, but it is not universally true. In the case where matter moves in one way and a sound wave is traveling in the other way (such that relative to the grid the wave is not moving) a static mesh gives better results than a moving mesh. We perform an analytic analysis for finite difference schemes that reveals that a Lagrangian simulation is better than a Eulerian simulation in the case of a highly supersonic flow. Moreover, we show that Voronoi-based moving mesh schemes suffer from an error, which is resolution independent, due to inconsistencies between the flux calculation and the change in the area of a cell. Our code is publicly available as open source and designed in an object-oriented, user-friendly way that facilitates incorporation of new algorithms and physical processes.

79 ASTRONOMY AND ASTROPHYSICS↗

One-shot omnidirectional pressure integration through matrix inversion

In this work, we present a method to perform 2D and 3D omnidirectional pressure integration from velocity measurements with a single-iteration matrix inversion approach. This work builds upon our previous work, where the rotating parallel ray approach was extended to the limit of infinite rays by taking continuous projection integrals of the ray paths and recasting the problem as an iterative matrix inversion problem. This iterative matrix equation is now 'fast-forwarded' to the 'infinity' iteration, leading to a different matrix equation that can be solved in a single step, thereby presenting the same computational complexity as the Poisson equation. We observe computational speedups of ~10 6 when compared to brute-force omnidirectional integration methods, enabling the treatment of grids of ~10 9 points and potentially even larger in a desktop setup at the time of publication. Further examination of the boundary conditions of our one-shot method shows that omnidirectional pressure integration implements a boundary condition where the boundary points are treated as interior points to the extent that information is available. Finally, we show how the method can be extended from the regular grids typical of particle image velocimetry to the unstructured meshes characteristic of particle tracking velocimetry data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Including parameter dependence in the data and covariance for cosmological inference

The final step of most large-scale structure analyses involves the comparison of power spectra or correlation functions to theoretical models. It is clear that the theoretical models have parameter dependence, but frequently the measurements and the covariance matrix depend upon some of the parameters as well. We show that a very simple interpolation scheme from an unstructured mesh allows for an efficient way to include this parameter dependence self-consistently in the analysis at modest computational expense. We describe two schemes for covariance matrices. The scheme which uses the geometric structure of such matrices performs roughly twice as well as the simplest scheme, though both perform very well.

79 ASTRONOMY AND ASTROPHYSICS↗

A Scalable Monitoring for the CMS Filter Farm Based on Elasticsearch

A flexible monitoring system has been designed for the CMS File-based Filter Farm making use of modern data mining and analytics components. All the metadata and monitoring information concerning data flow and execution of the HLT are generated locally in the form of small documents using the JSON encoding. These documents are indexed into a hierarchy of elasticsearch (es) clusters along with process and system log information. Elasticsearch is a search server based on Apache Lucene. It provides a distributed, multitenant-capable search and aggregation engine. Since es is schema-free, any new information can be added seamlessly and the unstructured information can be queried in non-predetermined ways. The leaf es clusters consist of the very same nodes that form the Filter Farm thus providing natural horizontal scaling. A separate central” es cluster is used to collect and index aggregated information. The fine-grained information, all the way to individual processes, remains available in the leaf clusters. The central es cluster provides quasi-real-time high-level monitoring information to any kind of client. Historical data can be retrieved to analyse past problems or correlate them with external information. We discuss the design and performance of this system in the context of the CMS DAQ commissioning for LHC Run 2.

Andre, J. M.↗

Response of salt intrusion in a tidal estuary to regional climatic forcing

Abstract Salinity distribution in a large tidal estuary is subject to estuarine adjustment under the influences of multiple physical drivers such as freshwater pulses and sea level rise, and is crucial to upstream water quality, aquaculture, and ecosystem functions of the estuary. To better understand the estuarine salinity response to climate change, the unstructured-grid Finite Volume Community Ocean Model was implemented to simulate the salt intrusion in the Delaware Bay Estuary. The model was first validated by multiple observational data sets and subsequently applied in an idealized setting to examine the response of salt front to freshwater pulses in high flow conditions, followed by a long-term drought condition supported by a multi-decadal streamflow drought analysis in the estuary. The model results showed that after the freshwater pulses the salt front location moved further upstream with sea level rise. Under the simulated long-term drought condition, the adjustment timescale of salt intrusion varies nonlinearly with sea level rise. With a significant increase in sea level rise, the adjustment timescale starts to decrease. This shift suggests a transition into a different regime where the estuary becomes more stratified, as indicated by an increasing bulk Simpson number with rising sea levels.

54 ENVIRONMENTAL SCIENCES↗

MULTI-SPACECRAFT OBSERVATIONS OF LINEAR MODES AND SIDEBAND WAVES IN ION-SCALE SOLAR WIND TURBULENCE

In the scenario of weak turbulence, energy is believed to be cascaded from smaller to larger wave numbers and frequencies due to weak wave-wave interactions. Based on its perturbative treatment one may regard plasma turbulence as a superposition of linear modes (or normal modes) and sideband waves (or nonlinear modes). In this study, we use magnetic field and plasma measurements of nine solar wind events obtained by the Cluster spacecraft and make extensive use of a high-resolution wave vector analysis method, the Multi-point Signal Resonator technique, to find frequencies and wave vectors of discrete modes on ion kinetic scales in the plasma rest frame. The primarily unstructured wave observations in the frequency-wave number diagram are classified into three distinct linear modes (proton Bernstein modes, helium-alpha Bernstein modes, and kinetic Alfvén waves) and the sideband waves by comparing with the dispersion relations derived theoretically from linear Vlasov theory using observational values of the plasma parameter beta and the propagation angle from the mean magnetic field. About 60% of the observed discrete modes can be explained by the linear modes, primarily as the proton Bernstein and the kinetic Alfvén waves, within the frequency uncertainties, while the rest of the population (about 40%) cannot be classified as linear modes due to the large deviation from dispersion relations. We conclude that both the linear modes and sideband wave components are needed to construct the wave picture of solar wind turbulence on ion-kinetic scales.

79 ASTRONOMY AND ASTROPHYSICS↗

Large gradients via correlation in random parameterized quantum circuits

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Here, examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}\left({2}^{n/2}\right)$, the optimal oracle complexity of quantum unstructured search.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

32 examples of LLM applications in materials science and chemistry: towards automation, assistants, agents, and accelerated scientific discovery

Abstract Large language models (LLMs) are reshaping many aspects of materials science and chemistry research, enabling advances in molecular property prediction, materials design, scientific automation, knowledge extraction, and more. Recent developments demonstrate that the latest class of models are able to integrate structured and unstructured data, assist in hypothesis generation, and streamline research workflows. To explore the frontier of LLM capabilities across the research lifecycle, we review applications of LLMs through 32 total projects developed during the second annual LLM hackathon for applications in materials science and chemistry, a global hybrid event. These projects spanned seven key research areas: (1) molecular and material property prediction, (2) molecular and material design, (3) automation and novel interfaces, (4) scientific communication and education, (5) research data management and automation, (6) hypothesis generation and evaluation, and (7) knowledge extraction and reasoning from the scientific literature. Collectively, these applications illustrate how LLMs serve as versatile predictive models, platforms for rapid prototyping of domain-specific tools, and much more. In particular, improvements in both open source and proprietary LLM performance through the addition of reasoning, additional training data, and new techniques have expanded effectiveness, particularly in low-data environments and interdisciplinary research. As LLMs continue to improve, their integration into scientific workflows presents both new opportunities and new challenges, requiring ongoing exploration, continued refinement, and further research to address reliability, interpretability, and reproducibility.

Computer Science↗

SetBERT: the deep learning platform for contextualized embeddings and explainable predictions from high-throughput sequencing

MOTIVATION: High-throughput sequencing (HTS) is a modern sequencing technology used to profile microbiomes by sequencing thousands of short genomic fragments from the microorganisms within a given sample. This technology presents a unique opportunity for artificial intelligence to comprehend the underlying functional relationships of microbial communities. However, due to the unstructured nature of HTS data, nearly all computational models are limited to processing DNA sequences individually. This limitation causes them to miss out on key interactions between microorganisms, significantly hindering our understanding of how these interactions influence the microbial communities as a whole. Furthermore, most computational methods rely on post-processing of samples which could inadvertently introduce unintentional protocol-specific bias. RESULTS: Addressing these concerns, we present SetBERT, a robust pre-training methodology for creating generalized deep learning models for processing HTS data to produce contextualized embeddings and be fine-tuned for downstream tasks with explainable predictions. By leveraging sequence interactions, we show that SetBERT significantly outperforms other models in taxonomic classification with genus-level classification accuracy of 95%. Furthermore, we demonstrate that SetBERT is able to accurately explain its predictions autonomously by confirming the biological-relevance of taxa identified by the model. AVAILABILITY AND IMPLEMENTATION: All source code is available at https://github.com/DLii-Research/setbert. SetBERT may be used through the q2-deepdna QIIME 2 plugin whose source code is available at https://github.com/DLii-Research/q2-deepdna.

Ludwig, David W↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

Automatic extraction of cancer registry reportable information from free-text pathology reports using multitask convolutional neural networks

Objective: In this work we implement 2 different multitask learning (MTL) techniques, hard parameter sharing and cross-stitch, to train a word-level convolutional neural network (CNN) specifically designed for automatic extraction of cancer data from unstructured text in pathology reports. We show the importance of learning related information extraction (IE) tasks leveraging shared representations across the tasks to achieve state-of-the-art performance in classification accuracy and computational efficiency. Materials and Methods: Multitask CNN (MTCNN) attempts to tackle document information extraction by learning to extract multiple key cancer characteristics simultaneously. We trained our MTCNN to perform 5 information extraction tasks: (1) primary cancer site (65 classes), (2) laterality (4 classes), (3) behavior (3 classes), (4) histological type (63 classes), and (5) histological grade (5 classes). We evaluated the performance on a corpus of 95 231 pathology documents (71 223 unique tumors) obtained from the Louisiana Tumor Registry. We compared the performance of the MTCNN models against single-task CNN models and 2 traditional machine learning approaches, namely support vector machine (SVM) and random forest classifier (RFC). Results: MTCNNs offered superior performance across all 5 tasks in terms of classification accuracy as compared with the other machine learning models. Based on retrospective evaluation, the hard parameter sharing and cross-stitch MTCNN models correctly classified 59.04% and 57.93% of the pathology reports respectively across all 5 tasks. The baseline models achieved 53.68% (CNN), 46.37% (RFC), and 36.75% (SVM). Based on prospective evaluation, the percentages of correctly classified cases across the 5 tasks were 60.11% (hard parameter sharing), 58.13% (cross-stitch), 51.30% (single-task CNN), 42.07% (RFC), and 35.16% (SVM). Moreover, hard parameter sharing MTCNNs outperformed the other models in computational efficiency by using about the same number of trainable parameters as a single-task CNN. Conclusions: The hard parameter sharing MTCNN offers superior classification accuracy for automated coding support of pathology documents across a wide range of cancers and multiple information extraction tasks while maintaining similar training and inference time as those of a single task–specific model.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Using ensembles and distillation to optimize the deployment of deep learning models for the classification of electronic cancer pathology reports

One of the goals of the Surveillance, Epidemiology, and End Results (SEER) program is to estimate incidence, prevalence, and mortality of all cancers. To that end, cancer registries across the country maintain a massive database of cancer pathology reports which contain rich information to understand cancer trends. However, these reports are stored in the form of unstructured text, and human annotators are required to read and extract relevant information. In this article, we show that existing deep learning models for automating information extraction from cancer pathology reports can be significantly improved by using ensemble model distillation. We found that by training multiple predictive models and transferring their knowledge to a single, low-resource model, we can reduce the number of highly confident wrong predictions. Our results show that our implemented methods could save 1000s of manual annotation hours.

60 APPLIED LIFE SCIENCES↗

An finite element analysis surrogate model with boundary oriented graph embedding approach for rapid design

Abstract In this work, we present a boundary oriented graph embedding (BOGE) approach for the graph neural network to assist in rapid design and digital prototyping. The cantilever beam problem has been solved as an example to validate its potential of providing physical field results and optimized designs using only 10 ms. Providing shortcuts for both boundary elements and local neighbor elements, the BOGE approach can embed unstructured mesh elements into the graph and performs an efficient regression on large-scale triangular-mesh-based finite element analysis (FEA) results, which cannot be realized by other machine-learning-based surrogate methods. It has the potential to serve as a surrogate model for other boundary value problems. Focusing on the cantilever beam problem, the BOGE approach with 3-layer DeepGCN model achieves the regression with mean square error (MSE) of 0.011 706 (2.41% mean absolute percentage error) for stress field prediction and 0.002 735 MSE (with 1.58% elements having error larger than 0.01) for topological optimization. The overall concept of the BOGE approach paves the way for a general and efficient deep-learning-based FEA simulator that will benefit both industry and Computer Aided Design (CAD) design-related areas.

42 ENGINEERING↗

Machine learning and deep learning tools for the automated capture of cancer surveillance data

The National Cancer Institute and the Department of Energy strategic partnership applies advanced computing and predictive machine learning and deep learning models to automate the capture of information from unstructured clinical text for inclusion in cancer registries. Applications include extraction of key data elements from pathology reports, determination of whether a pathology or radiology report is related to cancer, extraction of relevant biomarker information, and identification of recurrence. With the growing complexity of cancer diagnosis and treatment, capturing essential information with purely manual methods is increasingly difficult. These new methods for applying advanced computational capabilities to automate data extraction represent an opportunity to close critical information gaps and create a nimble, flexible platform on which new information sources, such as genomics, can be added. This will ultimately provide a deeper understanding of the drivers of cancer and outcomes in the population and increase the timeliness of reporting. These advances will enable better understanding of how real-world patients are treated and the outcomes associated with those treatments in the context of our complex medical and social environment.

60 APPLIED LIFE SCIENCES↗