Search NASA⌕ Search

SEARCH · Search NASA

Results for “Intersection”

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 307 records · Page 17

An analysis of gamma-ray data collected at traffic intersections in Northern Virginia

Gamma-ray spectral data were collected from sensors mounted to traffic signals around Northern Virginia. The data were collected over a span of approximately fifteen months. A subset of the data were analyzed manually and subsequently used to train machine-learning models to facilitate the evaluation of the remaining 50k anomalous events identified in the dataset. We describe the analysis approach used here and discuss the results in terms of radioisotope classes and frequency patterns over day-of-week and time-of-day spans. Data from this work has been archived and is available for future and ongoing research applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Development of a Geothermal Module in reV: Quantifying the Geothermal Potential while Accounting for the Geospatial Intersection of the Grid Infrastructure and Land Use Characteristics

The Renewable Energy Potential (reV) model is a geospatial platform for estimating technical potential and developing renewable energy supply curves, initially developed for wind and solar technologies. The model evaluates deployment constraints, considering land use, environmental, and cultural factors, and estimates the distance to existing grid features to connect future plants (Maclaurin et al., 2021). A pressing deficiency in the reV model, however, is representation of geothermal electricity generation technologies. To address this gap, we developed a novel geothermal generation module for reV that allows for representation and analysis at the same level of detail as other renewable technologies. This paper describes our process for evaluating data sources for the modeling, and presents five preliminary reV geothermal results. More specifically, we present two sets of resource data that represent upper and lower bounds for geothermal potential. We then present several sensitivity runs using the upper bound resource data; the results are encouraging that levelized cost of electricity (LCOE) can be reduced by optimizing the location and estimated capacity of the spatially diverse geothermal resource while considering the distance to existing grid infrastructure. Our preliminary supply curves and levelized cost of electricity (LCOE) results should be considered with care due to the highly uncertainty in geothermal resource potential data. We present median LCOE values for the conterminous U.S. for five scenarios: four hydrothermal (3.5km depth) and one EGS (4.5km depth). The capital and operating costs for each respective technology are modeled. We also compare results using two different resource data sources.

exclusions↗

Simulating Bubble Deformations Using the Intersection Marker (ISM) Front-Tracking method

Surface and volume tracking methods have been under continuous development over the last 50+ years since the first MAC (Marker and Cell) and SLIC (Simple Line Interface Calculation) methods appeared in the 1960's. The sustained interest in simulating multiphase flow stem from their many practical applications in the physical world; from biological systems, to chemical systems, to boiling dynamics and atmospheric heat and mass transfer. The ability to capture the details of interface evolution as well as the physics of interfacial heat and mass transfer has thus been a tempting goal for many numerical researchers. Numerical analysts, apart from the well-established and popular VOF PLIC (Volume of Fluid, Piecewise Linear Interface Construction) method, can now call upon even more computationally intensive options such as the LS (Level Set) method, the FT (Front Tracking) method, the MoF (Moment of Fluid) method and hybrid methods.

42 ENGINEERING↗

Development of a Geothermal Module in reV: Quantifying the Geothermal Potential While Accounting for the Geospatial Intersection of the Grid Infrastructure and Land Use Characteristics: Preprint

The Renewable Energy Potential (reV) model is a geospatial platform for estimating technical potential and developing renewable energy supply curves, initially developed for wind and solar technologies. The model evaluates deployment constraints, considering land use, environmental, and cultural factors, and estimates the distance to existing grid features to connect future plants (Maclaurin et al., 2021). A pressing deficiency in the reV model, however, is representation of geothermal electricity generation technologies. To address this gap, we developed a novel geothermal generation module for reV that allows for representation and analysis at the same level of detail as other renewable technologies. This paper describes our process for evaluating data sources for the modeling, and presents five preliminary reV geothermal results. More specifically, we present two sets of resource data that represent upper and lower bounds for geothermal potential. We then present several sensitivity runs using the upper bound resource data; the results are encouraging that levelized cost of electricity (LCOE) can be reduced by optimizing the location and estimated capacity of the spatially diverse geothermal resource while considering the distance to existing grid infrastructure. Our preliminary supply curves and levelized cost of electricity (LCOE) results should be considered with care due to the highly uncertainty in geothermal resource potential data. We present median LCOE values for the conterminous U.S. for five scenarios: four hydrothermal (3.5km depth) and one EGS (4.5km depth). The capital and operating costs for each respective technology are modeled. We also compare results using two different resource data sources.

exclusions↗

Exploring the Intersection of AI and Visualization in the Nuclear Industry

This presentation explores the impact of AI and visualization in advancing the nuclear industry by improving safety, operational efficiency, and decision-making processes. It highlights key applications such as real-time monitoring, predictive maintenance, and immersive training, while addressing challenges like data quality, regulatory hurdles, and the need for explainable AI. Additionally, the presentation outlines future directions, emphasizing the potential of AI-driven reactor design, advanced simulation tools, and ethical considerations to drive innovation and sustainability in nuclear operations.

99 GENERAL AND MISCELLANEOUS↗

The Intersection of Physics and Biology

In April 1953, Watson and Crick largely defined the program of 20th century biology: obtaining the blueprint of life encoded in the DNA. Fifty years later, in 2003, the sequencing of the human genome was completed. Like any major scientific breakthrough, the sequencing of the human genome raised many more questions than it answered. I'll brief you on some of the big open problems in cell and developmental biology, and I'll explain why approaches, tools, and ideas from the physical sciences are currently reshaping biological research. Super-resolution light microscopies are revealing the intricate spatial organization of cells, single-molecule methods show how molecular machines function, and new probes are clarifying the role of mechanical forces in cell and tissue function. At the same time, Physics stands to gain beautiful new problems in soft condensed matter, quantum mechanics, and non-equilibrium thermodynamics.

59 BASIC BIOLOGICAL SCIENCES↗

Automated Manufacturing of Grid Stiffened Panels with Radically Reduced Tooling

Grid stiffened continuous fiber reinforced composite panels are an attractive option for creating lightweight structures due to the tailorability for various applications and the resulting high specific properties. However, the panel stiffeners and stiffener intersections result in high tooling complexity and correspondingly high cost of implementation. These factors have limited the impact of such structures in the composites industry. Previous research has demonstrated the ability to produce high quality, high aspect ratio beams, representative of individual grid stiffeners, using E-glass/PET comingled tow via direct digital manufacturing. Further, prior preliminary efforts have demonstrated the potential to use the same approach to manufacture grid intersections that have continuous fiber in both directions. To expand on the previous efforts in grid stiffeners produced by direct digital manufacture with radically reduced tooling requirements, this effort compares two methods of providing positioning and consolidation, nozzle vs. roller. Both processes are based on a commingled yarn feedstock. The extrusion through a nozzle has been shown to enable grid intersection control through local variations in applied consolidation and serves as the baseline process. However, this approach requires a continuous placement path to create the complete grid stiffened panel as no mechanism for cutting and restarting has been implemented. Alternatively, a newly developed placement head incorporating cut and refeed, mounted to a 6-axis robot, offers the potential of improved path placement efficiency. The two techniques are used to produce similar grid composite stiffeners to evaluate the effectiveness of producing the grid intersections. Rate of deposition of the two end effectors are compared and the quality of the associated grid stiffeners, and intersections, are determined through measurement of geometry, fiber volume fraction and void fraction.

Engineering↗

WHEN SHOCK WAVES COLLIDE

Supersonic outflows from objects as varied as stellar jets, massive stars, and novae often exhibit multiple shock waves that overlap one another. When the intersection angle between two shock waves exceeds a critical value, the system reconfigures its geometry to create a normal shock known as a Mach stem where the shocks meet. Mach stems are important for interpreting emission-line images of shocked gas because a normal shock produces higher postshock temperatures, and therefore a higher-excitation spectrum than does an oblique shock. In this paper, we summarize the results of a series of numerical simulations and laboratory experiments designed to quantify how Mach stems behave in supersonic plasmas that are the norm in astrophysical flows. The experiments test analytical predictions for critical angles where Mach stems should form, and quantify how Mach stems grow and decay as intersection angles between the incident shock and a surface change. While small Mach stems are destroyed by surface irregularities and subcritical angles, larger ones persist in these situations and can regrow if the intersection angle changes to become more favorable. The experimental and numerical results show that although Mach stems occur only over a limited range of intersection angles and size scales, within these ranges they are relatively robust, and hence are a viable explanation for variable bright knots observed in Hubble Space Telescope images at the intersections of some bow shocks in stellar jets.

79 ASTRONOMY AND ASTROPHYSICS↗

GOTTCHA, Version2

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗

GOTTCHA, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗