Search NASA⌕ Search

SEARCH · Search NASA

Results for “VISUALIZATION LIBRARY”

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.

339 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Math Description Engine Software Development Kit

The Math Description Engine Software Development Kit (MDE SDK) can be used by software developers to make computer-rendered graphs more accessible to blind and visually-impaired users. The MDE SDK generates alternative graph descriptions in two forms: textual descriptions and non-verbal sound renderings, or sonification. It also enables display of an animated trace of a graph sonification on a visual graph component, with color and line-thickness options for users having low vision or color-related impairments. A set of accessible graphical user interface widgets is provided for operation by end users and for control of accessible graph displays. Version 1.0 of the MDE SDK generates text descriptions for 2D graphs commonly seen in math and science curriculum (and practice). The mathematically rich text descriptions can also serve as a virtual math and science assistant for blind and sighted users, making graphs more accessible for everyone. The MDE SDK has a simple application programming interface (API) that makes it easy for programmers and Web-site developers to make graphs accessible with just a few lines of code. The source code is written in Java for cross-platform compatibility and to take advantage of Java s built-in support for building accessible software application interfaces. Compiled-library and NASA Open Source versions are available with API documentation and Programmer s Guide at http:/ / prim e.jsc.n asa. gov.

Shelton, Robert O.↗
NASA NTRS1995

Supporting Research and Technology Activities for a Microwave Observing Program to Search for Extraterrestrial Intelligence

Curriculum materials based on the search for extraterrestrial intelligence (SETI) were developed for grades 3 through 9 science classes. The project was supported in part by NASA. Six teacher's guides, plus ancillary visuals, addressing topics in astronomy, biology, chemistry, geosciences, and physics as well as mathematics, social sciences, and language arts, were designed by a team of teachers, scientists. curriculum developers, and artists. First drafts were piloted by 10 design team teachers; revised drafts were field tested by 109 teachers in 30 states. Extensive feedback from these teachers and their students and reviews by scientists were used to revise materials prior to submission to the publisher. The field test teachers overall ranking of all guides (data from individual lesson feedback forms) was 431 on a one low to five high scale; 85% found the content appropriate to course and grade level and 75% indicated they had no reservations about using the materials again or recommending them to colleagues. The ratio of liked to disliked student responses (from 1305 student letters) was 70:30. Most recommendations from the teachers, students, and science reviewers were incorporated in the final versions for the guides, published by Libraries Unlimited/Teacher Ideas Press, 1995.

Tarter, Jill↗
DOE OSTI2017

Hybrid Parallel Contour Trees, Version 1.0

A common operation in scientific visualization is to compute and render a contour of a data set. Given a function of the form f : R^d -> R, a level set is defined as an inverse image f^-1(h) for an isovalue h, and a contour is a single connected component of a level set. The Reeb graph can then be defined to be the result of contracting each contour to a single point, and is well defined for Euclidean spaces or for general manifolds. For simple domains, the graph is guaranteed to be a tree, and is called the contour tree. Analysis can then be performed on the contour tree in order to identify isovalues of particular interest, based on various metrics, and render the corresponding contours, without having to know such isovalues a priori. This code is intended to be the first data-parallel algorithm for computing contour trees. Our implementation will use the portable data-parallel primitives provided by Nvidia’s Thrust library, allowing us to compile our same code for both GPUs and multi-core CPUs. Native OpenMP and purely serial versions of the code will likely also be included. It will also be extended to provide a hybrid data-parallel / distributed algorithm, allowing scaling beyond a single GPU or CPU.

Sewell, Christopher↗
DOE OSTI2021

DETECTING FIRE WITH MACHINE LEARNING-ENABLED VISUAL MONITORING FOR NUCLEAR POWER PLANT ENVIRONMENTS

Nuclear power plants are experiencing significant cost challenges to remain competitive with other energy-generation utilities. Unlike other industries, the cost of operation and maintenance activities is mostly attributed to workforce costs. To mitigate this, nuclear power plant stakeholders are increasingly interested in the development and deployment of machine learning methods to potentially automate or augment manually intensive tasks to reduce costs, especially for monitoring activities. One monitoring function that is visually demanding and that can occur frequently to meet the requirements of a fire protection program is visually monitoring an area for fire occurrence. Currently, fire watch activities consist of a worker physically stationed at a given location with the sole responsibility of observing a given area to ensure a fire is detected and mitigated promptly. This effort focused on the development and evaluation of a suitable deep convolutional neural network to classify individual video frames at a sub-second frequency for the occurrence of “fire” and “no fire” in varying industrial environments similar to nuclear power plants. It is believed that a trained neural network model could be integrated with existing facility video surveillance camera feeds to generate alerts when fire inferences occur in individual frames captured at sub-second temporal resolutions. Extensive effort was dedicated to identifying and curating suitable imagery training data representing varying environments and scene settings with and without flame features to maximize generalization in nuclear power plant environments. The data collection effort resulted in the aggregation of a large, labeled image library exceeding 12,000 images to support model training for diverse industrial environments. A deep neural network model incorporating parallel multi-scale capabilities was developed and trained to support accurate image-based detection of flame incidents of varying sizes and spectral feature properties within heterogeneous scenes. Analysis results show that the trained model can achieve high inference accuracy despite heterogeneous scene environments and components. Testing accuracy exceeded 95.0 percent with very low false positive and false negative inferences.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2017

Hybrid Parallel Contour Trees, Version 1.0

A common operation in scientific visualization is to compute and render a contour of a data set. Given a function of the form f : R^d -> R, a level set is defined as an inverse image f^-1(h) for an isovalue h, and a contour is a single connected component of a level set. The Reeb graph can then be defined to be the result of contracting each contour to a single point, and is well defined for Euclidean spaces or for general manifolds. For simple domains, the graph is guaranteed to be a tree, and is called the contour tree. Analysis can then be performed on the contour tree in order to identify isovalues of particular interest, based on various metrics, and render the corresponding contours, without having to know such isovalues a priori. This code is intended to be the first data-parallel algorithm for computing contour trees. Our implementation will use the portable data-parallel primitives provided by Nvidia’s Thrust library, allowing us to compile our same code for both GPUs and multi-core CPUs. Native OpenMP and purely serial versions of the code will likely also be included. It will also be extended to provide a hybrid data-parallel / distributed algorithm, allowing scaling beyond a single GPU or CPU.

Sewell, Christopher↗
DOE OSTI2023

Discovery of multi-functional polyimides through high-throughput screening using explainable machine learning

Polyimides have been widely used in modern industries because of their excellent mechanical and thermal properties, e.g., high-temperature fuel cells, displays, and aerospace composites. However, it usually takes decades of experimental efforts to develop a successful product. Aiming to expedite the discovery of high-performance polyimides, we utilize computational methods of machine learning (ML) and molecular dynamics (MD) simulations. Our study provides compelling evidence for the effectiveness of a data-driven approach in discovering novel polyimides. We first build a comprehensive library of more than 8 million hypothetical polyimides based on the polycondensation of existing dianhydride and diamine/diisocyanate molecules. Then we establish multiple ML models for the thermal and mechanical properties of polyimides based on their experimentally reported values, including glass transition temperature, Young’s modulus, and tensile yield strength. The obtained ML models demonstrate excellent predictive performance in identifying the key chemical substructures influencing the thermal and mechanical properties of polyimides. The use of explainable machine learning describes the effect of chemical substructures on individual properties, from which human experts can understand the cause of the ML model decision. Applying the well-trained ML models, we obtain property predictions of the 8 million hypothetical polyimides. Then, we screen the whole hypothetical dataset and identify three (3) best-performing novel polyimides that have better-combined properties than existing ones through Pareto frontier analysis. For an easy query of the discovered high-performing polyimides, we also create an online platform https://polyimide-explorer.herokuapp.com/ that embeds the developed ML model with interactive visualization. Furthermore, we validate the ML predictions through all-atom MD simulations and examine their synthesizability. The MD simulations are in good agreement with the ML predictions and the three novel polyimides are predicted to be easy to synthesize via Schuffenhauer’s synthetic accessibility score. Following the proposed ML guidance, we successfully synthesized a novel polyimide and the experimentally obtained high glass transition/thermal decomposition temperature demonstrated its excellent thermal stability. Here our study demonstrates an efficient way to expedite the discovery of novel polymers using ML prediction and MD validation. The high-throughput screening of a large computational dataset can serve as a general approach for new material discovery in other polymeric material exploration problems, such as organic photovoltaics, polymer membranes, and dielectrics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

HarDWR - Raw Water Rights Records

For a detailed description of the database of which this record is only one part, please see the HarDWR meta-record. In order to hold a water right in the western United States, an entity, (e.g., an individual, corporation, municipality, sovereign government, or non-profit) must register a physical document with the state's water regulatory agency. State water agencies each maintain their own database containing all registered water right documents within the state, along with relevant metadata such as the point of diversion and place of use of the water. All western U.S. states have digitized their individual water rights databases, along with the geospatial data describing the spatial units where water rights are managed. Each state maintains and provides their own water rights data in accordance with individual state regulations and standards. We collected water rights databases from 11 western United States states either by downloading them from publicly accessible web portals, or by contacting state water management representatives; detailed descriptions of where and when the data was collected is provided in the README.txt, as well as Lisk et al.(in review). This collection of data are those raw water rights. Each state formats their data differently, meaning that file types, field availability, and names vary from state to state. Note, the data provided here reflects the state of the water rights databases at the time we collected the data; updates have likely occurred in many states. Some pieces of information are common among all states. These are: priority date, volume or flow of water allowed by the right, stated water use of the right, and some means of identifying the geography and source of the water pertaining to the right - typically the coordinates of the Point of Diversion (PoD) of a waterbody or well. Arizona regulates water in a different way than the other 10 states. Outside of some relatively small critical agricultural areas called Active Management Areas (AMAs), Arizona does not maintain any water rights. However, the state does require registration of surface and groundwater pumping devices, which includes disclosing the mechanical specifics of the devices. We used these records as a proxy for water rights. Each state, and their respective water right authorities, have made their water right records available for non-commercial reference uses. In addition, the states make no guarantees as to the completeness, accuracy, or timeliness of their respective databases, let alone the modifications which we, the authors of this paper, have made to the collected records. None of the states should be held liable for using this data outside of its intended use. In addition, the following states have requested specifically worded disclaimers to be included with their data. Colorado: "The data made available here has been modified for use from its original source, which is the State of Colorado. THE STATE OF COLORADO MAKES NO REPRESENTATIONS OR WARRANTY AS TO THE COMPLETENESS, ACCURACY, TIMELINESS, OR CONTENT OF ANY DATA MADE AVAILABLE THROUGH THIS SITE. THE STATE OF COLORADO EXPRESSLY DISCLAIMS ALL WARRANTIES, WHETHER EXPRESS OR IMPLIED, INCLUDING ANY IMPLIED WARRANTIES OF MERCHANTABILITY, OR FITNESS FOR A PARTICULAR PURPOSE. The data is subject to change as modifications and updates are complete. It is understood that the information contained in the Web feed is being used at one's own risk." Montana: "The Montana State Library provides this product/service for informational purposes only. The Library did not produce it for, nor is it suitable for legal, engineering, or surveying purposes. Consumers of this information should review or consult the primary data and information sources to ascertain the viability of the information for their purposes. The Library provides these data in good faith but does not represent or warrant its accuracy, adequacy, or completeness. In no event shall the Library be liable for any incorrect results or analysis; any direct, indirect, special, or consequential damages to any party; or any lost profits arising out of or in connection with the use or the inability to use the data or the services provided. The Library makes these data and services available as a convenience to the public, and for no other purpose. The Library reserves the right to change or revise published data and/or services at any time." Oregon: "This product is for informational purposes and may not have been prepared for, or be suitable for legal, engineering, or surveying purposes. Users of this information should review or consult the primary data and information sources to ascertain the usability of the information." The available data is provided as a series of compressed files, which each containing the full data collected from each state. Some of the files have been renamed, to more easily know which state the data belongs to. The file renaming was also required as some files from different states had the same name. In other cases, the data for a state has been placed in a folder indicating which state it belongs to - as the state organized its data by selected subregions. Below is a brief description of the format of the collected data from each state. ArizonaRights_StatementOfClaimants: A folder containing a database of interconnected CSV files. The soc_erd.pdf file contains a visual flowchart of how the various files are connected, beginning with SOC_MAIN.csv in the center of the page. ArizonaRights_SurfaceWaterRightsData: A folder containing a database of a single Shapefile and 10 associated CSVs. SurfaceWater.pdf contains a visual flowchart of how the various files are connected, beginning with ADWR_SW_APPL_REGRY.csv. ArizonaRights_Well55Registry: A folder containing a database of a single Shapefile and 59 associated CSVs. Wells55.pdf contains a visual flowchart of how the various files are connected, beginning with WellRegistry.shp. CaliforniaRights_eWRIMS_directDatabase: A folder containing a collection of four "series" Microsoft Excel files, as either XLS or XLSX. The four "series": byCounty, byEntity (what type of legal entity holds the right), byUse (stated water use), and byWatershed, are various methods by which the California water rights are organized within the state's database. However, it was observed that by only collecting a single series, not all water rights were being provided. So, essentially, the majority of records within each "series" are copies of each other, with each "series" containing some unique records. ColoradoRights_NetAmounts: A folder containing 78 CSV files, with one file per Colorado Water District. IdahoRights_PointOfDiversion: A Shapefile containing the Points of Diversion for the entire state of Idaho. IdahoRights_PlaceOfUse: A Shapefile containing the Place of Use polygons for the entire state of Idaho. MontanaRights_WaterRights: A Geodatabase file containing the Points of Diversion and Places of Use for the entire state of Montana. The name of the Points of Diversion Feature Layer within the Geodatabase is "WRDIV", and the name of the Places of Use Feature Layer is "WRPOU". NevadaRights_POD_Sites: A Shapefile containing the Points of Diversion for the entire state of Nevada. NewMexicoRights_Points_of_Diversion: A Shapefile containing the Points of Diversion for the entire state of New Mexico. OregonRights_state_shp: A folder containing 36 Shapefiles and are split between "pod" (Point of Diversion) and "pou" (Place of Use) for each water management basin within Oregon. In other words, each basin has one "pod" file and one "pou" file. The "pod" files are point shapes, and the "pou" files are polygons. UtahRights_Points_of_Diversion: A Shapefile containing the Points of Diversion for the entire state of Utah. WashingtonRights_WaterDiversions_ECY_NHD: A Geodatabase file containing both the Points of Diversion for the entire state of Washington. The name of the Feature Layer within the Geodatabase is "WaterDiversions_ECY_NHD". WyomingRights: A folder containing four subdirectories, one for each Wyoming Water Division. Each Division directory includes a varying number of subdirectories for each Wyoming Water District. Each District folder contains two copies of the Point of Diversion records for that area, with one copying being in CSV and one copy in Microsoft Excel XLS format.

Lisk, Matthew↗
DOE OSTI2022

Development of high-affinity nanobodies specific for Na V 1.4 and Na V 1.5 voltage-gated sodium channel isoforms

Voltage-gated sodium channels, Na V s, are responsible for the rapid rise of action potentials in excitable tissues. Na V channel mutations have been implicated in several human genetic diseases, such as hypokalemic periodic paralysis, myotonia, and long-QT and Brugada syndromes. Here, we generated high-affinity anti-NaV nanobodies (Nbs), Nb17 and Nb82, that recognize the Na V 1.4 (skeletal muscle) and Na V 1.5 (cardiac muscle) channel isoforms. These Nbs were raised in llama (Lama glama) and selected from a phage display library for high affinity to the C-terminal (CT) region of Na V 1.4. The Nbs were expressed in Escherichia coli, purified, and biophysically characterized. Development of high-affinity Nbs specifically targeting a given human Na V isoform has been challenging because they usually show undesired crossreactivity for different Na V isoforms. Our results show, however, that Nb17 and Nb82 recognize the CTNa V 1.4 or CTNa V 1.5 over other CTNav isoforms. Kinetic experiments by biolayer interferometry determined that Nb17 and Nb82 bind to the CTNa V 1.4 and CTNa V 1.5 with high affinity (K D ~ 40–60 nM). In addition, as proof of concept, we show that Nb82 could detect Na V 1.4 and Na V 1.5 channels in mammalian cells and tissues by Western blot. Furthermore, human embryonic kidney cells expressing holo Na V 1.5 channels demonstrated a robust FRET-binding efficiency for Nb17 and Nb82. Our work lays the foundation for developing Nbs as anti-Na V reagents to capture Na V s from cell lysates and as molecular visualization agents for Na V s.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Hindsight logging for model training

In modern Machine Learning, model training is an iterative, experimental process that can consume enormous computation resources and developer time. To aid in that process, experienced model developers log and visualize program variables during training runs. Exhaustive logging of all variables is infeasible, so developers are left to choose between slowing down training via extensive conservative logging, or letting training run fast via minimalist optimistic logging that may omit key information. As a compromise, optimistic logging can be accompanied by program checkpoints; this allows developers to add log statements post-hoc, and "replay" desired log statements from checkpoint---a process we refer to as hindsight logging. Unfortunately, hindsight logging raises tricky problems in data management and software engineering. Done poorly, hindsight logging can waste resources and generate technical debt embodied in multiple variants of training code. In this paper, we present methodologies for efficient and effective logging practices for model training, with a focus on techniques for hindsight logging. Our goal is for experienced model developers to learn and adopt these practices. To make this easier, we provide an open-source suite of tools for Fast Low-Overhead Recovery (flor) that embodies our design across three tasks: (i) efficient background logging in Python, (ii) adaptive periodic checkpointing, and (iii) an instrumentation library that codifies hindsight logging for efficient and automatic record-replay of model-training. Model developers can use each flor tool separately as they see fit, or they can use flor in hands-free mode, entrusting it to instrument their code end-to-end for efficient record-replay. Our solutions leverage techniques from physiological transaction logs and recovery in database systems. Evaluations on modern ML benchmarks demonstrate that flor can produce fast checkpointing with small user-specifiable overheads (e.g. 7%), and still provide hindsight log replay times orders of magnitude faster than restarting training from scratch.

Computer Science↗
DOE OSTI2023

ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2000

Global Interoperability of High Definition Video Streams Via ACTS and Intelsat

In 1993, a proposal at the Japan.-U.S. Cooperation in Space Program Workshop lead to a subsequent series of satellite communications experiments and demonstrations, under the title of Trans-Pacific High Data Rate Satellite Communications Experiments. The first of which is a joint collaboration between government and industry teams in the United States and Japan that successfully demonstrated distributed high definition video (HDV) post-production on a global scale using a combination of high data rate satellites and terrestrial fiber optic asynchronous transfer mode (ATM) networks. The HDV experiment is the first GIBN experiment to establish a dual-hop broadband satellite link for the transmission of digital HDV over ATM. This paper describes the team's effort in using the NASA Advanced Communications Technology Satellite (ACTS) at rates up to OC-3 (155 Mbps) between Los Angeles and Honolulu, and using Intelsat at rates up to DS-3 (45 Mbps) between Kapolei and Tokyo, with which HDV source material was transmitted between Sony Pictures High Definition Center (SPHDC) in Los Angeles and Sony Visual Communication Center (VCC) in Shinagawa, Tokyo. The global-scale connection also used terrestrial networks in Japan, the States of Hawaii and California. The 1.2 Gbps digital HDV stream was compressed down to 22.5 Mbps using a proprietary Mitsubishi MPEG-2 codec that was ATM AAL-5 compatible. The codec: employed four-way parallel processing. Improved versions of the codec are now commercially available. The successful post-production activity performed in Tokyo with a HDV clip transmitted from Los Angeles was predicated on the seamless interoperation of all the equipment between the sites, and was an exciting example in deploying a global-scale information infrastructure involving a combination of broadband satellites and terrestrial fiber optic networks. Correlation of atmospheric effects with cell loss, codec drop-out, and picture quality were made. Current efforts in the Trans-Pacific series plan to examine the use of Internet Protocol (IP)-related technologies over such an infrastructure. The use of IP allows the general public to be an integral part of the exciting activities, helps to examine issues in constructing the solar-system internet, and affords an opportunity to tap the research results from the (reliable) multicast and distributed systems communities. The current Trans- Pacific projects, including remote astronomy and digital library (visible human) are briefly described.

Hsu, Eddie↗
NASA NTRS1996

Algal Accessory Pigment Detection Using AVIRIS Image-Derived Spectral Radiance Data

Visual and derivative analyses of AVIRIS spectral data can be used to detect algal accessory pigments in aquatic communities. This capability extends the use of remote sensing for the study of aquatic ecosystems by allowing detection of taxonomically significant pigment signatures which yield information about the type of algae present. Such information allows remote sensing-based assessment of aquatic ecosystem health, as in the detection of nuisance blooms of cyanobacteria or toxic blooms of dinoflagellates. Remote sensing of aquatic systems has traditionally focused on quantification of chlorophyll a, a photoreactive (and light-harvesting) pigment which is common to all algae as well as cyanobacteria (bluegreen algae). Due to the ubiquitousness of this pigment within algae, chl a is routinely measured to estimate algal biomass both during ground-truthing and using various airborne or satellite based sensors, including AVIRIS. Within the remote sensing and aquatic sciences communities, ongoing research has been performed to detect algal accessory pigments for assessment of algal population composition. This research is based on the fact that many algal accessory pigments are taxonomically significant, and all are spectrally unique. Aquatic scientists have been refining pigment analysis techniques, primarily high performance liquid chromatography, or HPLC, to detect specific pigments as a time-saving alternative to individual algal cell identifications and counts. Remote sensing scientists are investigating the use of pigment signatures to construct pigment libraries analogous to mineral spectral libraries used in geological remote sensing applications. The accessory pigment approach has been used successfully in remote sensing using data from the Thematic Mapper, low-altitude, multiple channel scanners, field spectroradiometers and the AVIRIS hyperspectral scanner. Due to spectral and spatial resolution capabilities, AVIRIS is the sensor of choice for such studies. We present here our results on detection of algal accessory pigments using AVIRIS data.

Richardson, Laurie L.↗
NASA NTRS1998

Low Speed Aerodynamics of the X-38 CRV

This project was performed in support of the engineering development of the NASA X-38 Crew Return Vehicle (CRV)system. Wind tunnel experiments were used to visualize various aerodynamic phenomena encountered by the CRV during the final stages of descent and landing. Scale models of the CRV were used to visualize vortex structures above and below the vehicle, and in its wake, and to quantify their trajectories. The effect of flaperon deflection on these structures was studied. The structure and dynamics of the CRV's wake during the drag parachute deployment stage were measured. Regions of high vorticity were identified using surveys conducted in several planes using a vortex meter. Periodic shedding of the vortex sheets from the sides of the CRV was observed using laser sheet videography as the CRV reached high angles of attack during the quasi-steady pitch-up prior to parafoil deployment. Using spectral analysis of hot-film anemometer data, the Strouhal number of these wake fluctuations was found to be 0.14 based on the model span. Phenomena encountered in flight test during parafoil operation were captured in scale-model tests, and a video photogrammetry technique was implemented to obtain parafoil surface shapes during flight in the tunnel. Forces on the parafoil were resolved using tension gages on individual lines. The temporal evolution of the phenomenon of leading edge collapse was captured. Laser velocimetry was used to demonstrate measurement of the porosity of the parafoil surface. From these measurements, several physical explanations have been developed for phenomena observed at various stages of the X-38 development program. Quantitative measurement capabilities have also been demonstrated for continued refinement of the aerodynamic technologies employed in the X-38 project. Detailed results from these studies are given in an AIAA Paper, two slide presentations, and other material which are given on a Web-based archival resource. This is the Digital Library of the Georgia Tech Experimental Aerodynamics Group.

Komerath, N. M.↗
NASA NTRS1998

LAPS Lidar Measurements at the ARM Alaska Northslope Site (Support to FIRE Project)

This report consists of data summaries of the results obtained during the May 1998 measurement period at Barrow Alaska. This report does not contain any data interpretation or analysis of the results which will follow this activity. This report is forwarded with a data set on magnetic media which contains the reduced data from the LAPS lidar in 15 minute intervals. The data was obtained during the period 15-30 May 1998. The measurement period overlapped with several aircraft flights conducted by NASA as part of the FIRE project. The report contains a summary list of the data obtained plus figures that have been prepared to help visualize the measurement periods. The order of the presentation is as follows: Section 1. A copy of the Statement of Work for the planned activity of the second measurement period at the ARM Northslope site is provided. Section 2. A list of the data collection periods shows the number of one minute data records stored during each hour of operation and the corresponding size (Mbytes) of the one hour data folders. The folder and file names are composed from the year, month, day, hour and minute. The date/time information is given in UTC for easier comparison with other data sets. Section 3. A set of 4 comparisons between the LAPS lidar results and the sondes released by the ARM scientists from a location nearby the lidar. The lidar results show the +/- 1 sigma statistical error on each of the independent 75 m altitude bins of the data. This set of 4 comparisons was used to set and validate the calibration value which was then used for the complete data set. Section 4. A set of false color figures with up to 10 hours of specific humidity measurements are shown in each graph. Two days of measurements are shown on each page. These plots are crude representations of the data and permit a survey which indicates when the clouds were very low or where interesting events may occur in the results. These plots are prepared using the real time sequence plot program which has no smoothing in either the altitude or time (except that you are allowed to pick the integration time and time step. All of these plots were prepared with 15 minute integration and 5 minute time step. Section 5. A set of time sequence data for all of the extended observation periods are shown with a smoothing algorithm from the Matlab plotting library. Most of these data are integrated for 5 minutes and stepped at I minute intervals but several plots are shown with both 15 minute integration and 5 minute steps. The upper level on these data was selected and converted to the white background where the error in the specific humidity reached 25%. Section 6. The set of one hour integrated plots shown with up to 4 hours per page are provided- from the real time analysis snapshot program. The only difference in these plots and the real time display is that the plots are stopped at an altitude where the error appears to be too large for the data to contain any meaningful information.

Philbrick, C. Russell↗
DOE OSTI2017

Metamesh, Version 1.0

Metamesh is a general-purpose C++ language library for creating data structures that represent meshes. An important difference between Metamesh and other "mesh" libraries is that Metamesh does not provide a specific mesh format, in the usual sense, or tools or a GUI by which users build specific meshes. Rather, it provides a mechanism by which mesh formats themselves can be built, based on their constituent parts and the relationships between them.Consider that a mesh in up to three space dimensions can, in principle, contain nodes (0d entities, or points), edges (1d entities), faces (2d entities), and cells (3d, or volumetric, entities). A node might be defined in terms of (x), (x,y), or (x,y,z) in Cartesian coordinates; or perhaps something else, in a different coordinate system. An edge is typically defined from two nodes; say, "edge E goes from node A=(ax,ay) to node B=(bx,by)." Faces can reasonably be defined in terms of nodes or edges, and cells in terms of nodes, edges, or faces. Note also that someone might wish to support general faces or cells, or only specific variants - say, triangular faces and tetrahedral cells, or quadrilateral faces and hexahedral cells. Or, perhaps, both triangular and quadrilateral faces (but no others), with prisms for each cell. Consider also that a mesh can have the same or a lesser dimension than that of its enclosing space. In 3d, for example, one could have a full 3d mesh, a 2d "sheet" mesh with no cells, a 1d "parametrized curve" with neither faces nor cells, or even a 1d "point cloud." And, in addition to defining a mesh scheme, a user might wish to place additional data onto one or more mesh entities. Imagine, for example, a velocity at each node, a flux across each edge or face, and a mass or average density per cell. Metamesh supports all of this, through the use of C++ class and function templates, and template metaprogramming techniques. Programmers begin with constructs that Metamesh provides (or, users can define their own), and assemble them in particular ways in order to create particular mesh formats. Metamesh then provides functionality automatically to meshes that are constructed in this manner. Finally, Metamesh provides very general functions for spinning, extruding, visualizing, and performing input/output of whatever meshes a user builds with it.

Staley, Martin↗