Search NASA⌕ Search

SEARCH · Search NASA

Results for “data pipelines”

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Transiting Planet Search in the Kepler Pipeline

The Kepler Mission simultaneously measures the brightness of more than 160,000 stars every 29.4 minutes over a 3.5-year mission to search for transiting planets. Detecting transits is a signal-detection problem where the signal of interest is a periodic pulse train and the predominant noise source is non-white, non-stationary (1/f) type process of stellar variability. Many stars also exhibit coherent or quasi-coherent oscillations. The detection algorithm first identifies and removes strong oscillations followed by an adaptive, wavelet-based matched filter. We discuss how we obtain super-resolution detection statistics and the effectiveness of the algorithm for Kepler flight data.

Jenkins, Jon M.↗
NASA NTRSDate not supplied

Optical Time Transfer for Bistatic SAR Spacecraft

A spacecraft-to-spacecraft optical time-transfer simulation has been developed as a tool for informing NASA’s Surface Deformation and Change (SDC) mission architecture. The SDC mission will combine radar images from multiple spacecraft to improve understanding of the Earth’s sea-level and landscape changes. Spacecraft must be precisely synchronized in order to create sharp radar images. Simulation of multiple spacecraft time-synchronizing via laser communication can inform technology choices of a mission by providing a picosecond-precision level estimate of clock error. This timing and ranging simulation has been combined with a radar system performance analysis pipeline. The simulated timing errors are used to predict performance of bistatic SAR systems in the presence of oscillator noise and time synchronization in accuracy. This analysis includes both analytic approximation equations from existing literature, and a numerical radar simulation to extract key system performance parameters like phase error and signal-to-noise ratio (SNR)degradation. Precision time-transfer techniques facilitate the accurate synchronization of clocks between any combination of terminals. Most time-transfer technology for comparing two clocks at different terminals use radio frequencies (RF) to measure the time delay between the sending and receiving of signals. Laser technology offers the capability to transmit high data rates with systems that are of smaller size and lower power than comparable RF systems. The clocks on independent spacecraft will have some phase and frequency errors between them that result in clock drift. The two clock models that are included in this bi-directional MATLAB simulation are a cesium-based Chip-Scale Atomic Clock (CSAC) and a rubidium-based Miniature Atomic Clock (MAC). The CSAC has flown as hardware for small satellite missions such as the University of Florida’s CHOMPTT mission. A study of example orbits, including that of NASA NASA-ISRO Synthetic Aperture Radar Mission (NISAR) mission, and lasing rates demonstrate the impact of flight configuration parameters on the synchronization error between two spacecraft. The MATLAB timing simulation uses a Runge-Kutta 4th-order method to propagate spacecraft orbits and computes the light-travel time estimate between them. The simulation outputs the estimated range and estimated clock error based on a user-defined spacecraft cluster configuration. The radar simulation and analytic approximations are applied to evaluate a potential future NASA bistatic SAR constellation architecture. In the proposed architecture, satellites follow each other in the same orbit at 800 km altitude, with a 210 km baseline. We also baseline the CSAC as an ultra stable oscillator, and use NASA’s NISAR for baseline radar system parameters to compute a clock-system introduced phase error of 5.6 degrees without synchronization by frequent time transfer. We build on this base case with a sensitivity analysis of radar performance over a proposed range of constellation and radar system parameters. With this analysis pipeline, we comment on which radar parameters should or should not be changed to minimize synchronization requirements. This analysis technique could be extended or modified to evaluate the timing requirements of other geometries for other future multistatic SAR missions, or other interferometric satellite missions.

Surface Deformation and Change↗
NASA NTRS2022

Simons Observatory: Constraining inflationary gravitational waves with multitracer B-mode delensing

We introduce and validate a delensing framework for the Simons Observatory (SO), which will be used to improve constraints on inflationary gravitational waves by reducing the lensing noise in measurements of the B modes in CMB polarization. SO will initially observe CMB by using three small aperture telescopes and one large-aperture telescope. While polarization maps from small-aperture telescopes will be used to constrain inflationary gravitational waves, the internal CMB lensing maps used to delens will be reconstructed from data from the large-aperture telescope. Since lensing maps obtained from the SO data will be noise dominated on subdegree scales, the SO lensing framework constructs a template for lensing-induced B modes by combining internal CMB lensing maps with maps of the cosmic infrared background from Planck as well as galaxy density maps from the LSST survey. We construct a likelihood for constraining the tensor-to-scalar ratio r that contains auto and cross spectra between observed B modes and the lensing B-mode template. We test our delensing analysis pipeline on map-based simulations containing survey nonidealities, but that, for this initial exploration, does not include contamination from Galactic and extragalactic foregrounds. We find that the SO survey masking and inhomogeneous and atmospheric noise have very little impact on the delensing performance, and the r constraint becomes σ(r)≈0.0015 which is close to that obtained from the idealized forecasts in the absence of the Galactic foreground and is nearly a factor of 2 tighter than without delensing. We also find that uncertainties in the external large-scale structure tracers used in our multitracer delensing pipeline lead to bias much smaller than the 1σ statistical uncertainties.

Toshiya Namikawa↗
NASA NTRS2004

Scalable Multiprocessor for High-Speed Computing in Space

A report discusses the continuing development of a scalable multiprocessor computing system for hard real-time applications aboard a spacecraft. "Hard realtime applications" signifies applications, like real-time radar signal processing, in which the data to be processed are generated at "hundreds" of pulses per second, each pulse "requiring" millions of arithmetic operations. In these applications, the digital processors must be tightly integrated with analog instrumentation (e.g., radar equipment), and data input/output must be synchronized with analog instrumentation, controlled to within fractions of a microsecond. The scalable multiprocessor is a cluster of identical commercial-off-the-shelf generic DSP (digital-signal-processing) computers plus generic interface circuits, including analog-to-digital converters, all controlled by software. The processors are computers interconnected by high-speed serial links. Performance can be increased by adding hardware modules and correspondingly modifying the software. Work is distributed among the processors in a parallel or pipeline fashion by means of a flexible master/slave control and timing scheme. Each processor operates under its own local clock; synchronization is achieved by broadcasting master time signals to all the processors, which compute offsets between the master clock and their local clocks.

Lux, James↗
NASA NTRS2016

The IPAC Image Subtraction and Discovery Pipeline for the Intermediate Palomar Transient Factory

We describe the near real-time transient-source discovery engine for the intermediate Palomar Transient Factory (iPTF), currently in operations at the Infrared Processing and Analysis Center (IPAC), Caltech. We coin this system the IPAC/iPTF Discovery Engine (or IDE). We review the algorithms used for PSF-matching, image subtraction, detection, photometry, and machine-learned (ML) vetting of extracted transient candidates. We also review the performance of our ML classifier. For a limiting signal-to-noise ratio of 4 in relatively unconfused regions, bogus candidates from processing artifacts and imperfect image subtractions outnumber real transients by approximately equal to 10:1. This can be considerably higher for image data with inaccurate astrometric and/or PSF-matching solutions. Despite this occasionally high contamination rate, the ML classifier is able to identify real transients with an efficiency (or completeness) of approximately equal to 97% for a maximum tolerable false-positive rate of 1% when classifying raw candidates. All subtraction-image metrics, source features, ML probability-based real-bogus scores, contextual metadata from other surveys, and possible associations with known Solar System objects are stored in a relational database for retrieval by the various science working groups. We review our efforts in mitigating false-positives and our experience in optimizing the overall system in response to the multitude of science projects underway with iPTF.

methods: analytical – methods: data analysis –↗
NASA NTRS1988

Presentation planning using an integrated knowledge base

A description is given of user interface research aimed at bringing together multiple input and output modes in a way that handles mixed mode input (commands, menus, forms, natural language), interacts with a diverse collection of underlying software utilities in a uniform way, and presents the results through a combination of output modes including natural language text, maps, charts and graphs. The system, Integrated Interfaces, derives much of its ability to interact uniformly with the user and the underlying services and to build its presentations, from the information present in a central knowledge base. This knowledge base integrates models of the application domain (Navy ships in the Pacific region, in the current demonstration version); the structure of visual displays and their graphical features; the underlying services (data bases and expert systems); and interface functions. The emphasis is on a presentation planner that uses the knowledge base to produce multi-modal output. There has been a flurry of recent work in user interface management systems. (Several recent examples are listed in the references). Existing work is characterized by an attempt to relieve the software designer of the burden of handcrafting an interface for each application. The work has generally focused on intelligently handling input. This paper deals with the other end of the pipeline - presentations.

Arens, Yigal↗
NASA NTRS2011

Correlations in the (Sub)Mil1imeter Background from ACT x BLAST

We present measurements of the auto- and cross-frequency correlation power spectra of the cosmic (sub)millimeter background at: 250, 350, and 500 microns (1200, 860, and 600 GHz) from observations made with the Balloon-borne Large Aperture Submillimeter Telescope, BLAST; and at 1380 and 2030 microns (218 and 148 GHz) from observations made with the Atacama Cosmology Telescope, ACT. The overlapping observations cover 8.6 deg(sup 2) in an area relatively free of Galactic dust near the south ecliptic pole (SEP). The ACT bands are sensitive to radiation from the CMB, the Sunyaev-Zel'dovich (SZ) effect from galaxy clusters, and to emission by radio and dusty star-forming galaxies (DSFGs), while the dominant contribution to the BLAST bands is from DSFGs. We confirm and extend the BLAST analysis of clustering with an independent pipeline, and also detect correlations between the ACT and BLAST maps at over 25(sigma) significance, which we interpret as a detection of the DSFGs in the ACT maps. In addition to a Poisson component in the cross-frequency power spectra, we detect a clustered signal at 4(sigma), and using a model for the DSFG evolution and number counts, we successfully fit all our spectra with a linear clustering model and a bias that depends only on red shift and not on scale. Finally, the data are compared to, and generally agree with, phenomenological models for the DSFG population. This study represents a first of its kind, and demonstrates the constraining power of the cross-frequency correlation technique to constrain models for the DSFGs. Similar analyses with more data will impose tight constraints 011 future models.

Hajian, Amir↗
NASA NTRS2016

Time Series Explorer: Bayesian Blocks with Generalized Profiles and in Higher Dimensions

The Time Series Explorer (TSE) is a project aimed at provided new and advanced time series analysis algorithms in two forms: a tool kit and an automated pipeline applying selected tools in machine learning settings. I will present a sketch of TSE with emphasis on time-domain modeling in general and recent improvements of the Bayesian Block (BB) algorithm in particular. This includes generalizing the shape of the elementary blocks from the current constant-rate model to general shapes, such as two-sided exponentials. Related topics will include extension of BB to higher dimensions and a novel way to detect and characterize short time-scale bursts in time-tagged event data. The Fermi Gamma Ray Space Telescope light curve for the Crab Nebula will be used as an example for all of the algorithms discussed. This work is in collaboration with Tom Loredo.

Bayesian Block (BB) algorithm↗
NASA NTRS1994

Flatfielding and photometric accuracy of the first Hubble Space Telescope Wide Field Camera

Long exposures with the original Hubble Space Telescope (HST) Wide Field Camera (WFC) through the F555W and F785LP filters show gradients in the background following standard pipeline calibration. We show that these gradients also appear in stellar photometry, and thus must be predominantly the result of inaccurate flatfielding at a level of 10 to 20%. Color errors may be even larger. Applying corrections to the flatfield frames based on the background structure leads to an improved accuracy of approximately 4% for single-measurement photometry within a single CCD chip, compared to the approximately 10% accuracy suggested by previous studies. We have reanalyzed the F555W and F785LP calibration photometry to derive zero points appropriate for corrected data; these new zero points have internal consistency at a level of approximately 1.2%, based on comparison between the chip-to-chip offsets and the sky levels observed in corrected images. This indicates that relative photometry approaching 1 to 2% is achievable with the WFC. The new zero point values for corrected data are 22.90, 23.04, 23.04, and 22.96 (F555W), and 21.56, 21.64, 21.44, and 21.47 (F785LP) for chips WF1-WF4, respectively. Comparison is made with other zero points, and the applicability of 'delta flats' is briefly discussed.

Phillips, Andrew C.↗
NASA NTRS1993

Feed-forward volume rendering algorithm for moderately parallel MIMD machines

Algorithms for direct volume rendering on parallel and vector processors are investigated. Volumes are transformed efficiently on parallel processors by dividing the data into slices and beams of voxels. Equal sized sets of slices along one axis are distributed to processors. Parallelism is achieved at two levels. Because each slice can be transformed independently of others, processors transform their assigned slices with no communication, thus providing maximum possible parallelism at the first level. Within each slice, consecutive beams are incrementally transformed using coherency in the transformation computation. Also, coherency across slices can be exploited to further enhance performance. This coherency yields the second level of parallelism through the use of the vector processing or pipelining. Other ongoing efforts include investigations into image reconstruction techniques, load balancing strategies, and improving performance.

Yagel, Roni↗
NASA NTRSDate not supplied

GeoAI advances in specific landform mapping

Landform mapping (also referred to as geomorphology or geomorphometry) can be divided into two domains: general and specific (Evans 2012). Whereas general landform mapping categorizes all elements of the study area into landform classes, such as ridges, valleys, peaks, and depressions, the mapping of specific landforms requires the delineation (even if fuzzy) of individual landforms. The former is mainly driven by physical properties such as elevation, slope, and curvature. The latter, however, must consider the cognitive (human) reasoning that discriminates individual landforms in addition to these physical properties (Arundel and Sinha 2018). Both mapping forms are important. General geomorphometry is needed to understand geological and ecological processes and as boundary layer input to climate and environmental models. Specific geomorphometry supports such activities as disaster management and recovery, emergency response, transportation, and navigation. In the United States, individual landforms of interest are named in the U.S. Geological Survey (USGS) Geographic Names Information System, a point dataset captured specifically to digitize geographic names from the USGS Historical Topographic Map Collection (HTMC). Named landform extent is represented only by the name placement in the HTMC. Recent work has investigated CNN-based deep learning methods to capture these extents in machine-readable form. These studies first relied on physical properties (Arundel et al. 2020) and then included the HTMC as a band in RGB images in limited testing (Arundel et al. 2023). Results from the HTMC dataset surpassed those using just physical properties and using the HTMC alone performed best due to the hillshading and elevation (contour) data incorporated into the topographic maps. However, results fell short of an operational capacity to map all named landforms in the United States. Thus, our current work expands upon past research by focusing on the HTMC and physical information as inputs and the named landform label extents. Specifically, we propose to leverage pre-trained foundation models for segmentation and optical character recognition (OCR) models to jointly map landforms in the United States. Our approach aims to bridge the disparities among the independent information sources to facilitate informed decision-making. The modeling pipeline performs (1) segmentation using the physical information and (2) information extraction using OCR, in parallel. Then a computer vision approach merges the two branches into a labeled segmentation. References: Arundel, Samantha T., Wenwen Li, and Sizhe Wang. 2020. “GeoNat v1.0: A Dataset for Natural Feature Mapping with Artificial Intelligence and Supervised Learning.” Transactions in GIS 24 (3): 556–72. https://doi.org/10.1111/tgis.12633. Arundel, Samantha T, and Gaurav Sinha. 2018. “Validating GEOBIA Based Terrain Segmentation and Classification for Automated Delineation of Cognitively Salient Landforms BT - Proceedings of Workshops and Posters at the 13th International Conference on Spatial Information Theory (COSIT 2017).” In Proceedings of Workshops and Posters at the 13th International Conference on Spatial Information Theory (COSIT 2017), Lecture Notes in Geoinformation and Cartography, edited by Paolo Fogliaroni, Andrea Ballatore, and Eliseo Clementini, 9–14. Cham: Springer International Publishing. Arundel, Samantha T., Gaurav Sinha, Wenwen Li, David P. Martin, Kevin G. McKeehan, and Philip T. Thiem. 2023. “Historical Maps Inform Landform Cognition in Machine Learning.” Abstracts of the ICA 6 (August): 1–2. https://doi.org/10.5194/ica-abs-6-10-2023. Evans, Ian S. 2012. “Geomorphometry and Landform Mapping: What Is a Landform?” Geomorphology 137 (1): 94–106. https://doi.org/10.1016/j.geomorph.2010.09.029.

machine learning↗
NASA NTRSDate not supplied

GeoAI Advances in Specific Landform Mapping

Landform mapping (also referred to as geomorphology or geomorphometry) can be divided into two domains: general and specific (Evans 2012). Whereas general landform mapping categorizes all elements of the study area into landform classes, such as ridges, valleys, peaks, and depressions, the mapping of specific landforms requires the delineation (even if fuzzy) of individual landforms. The former is mainly driven by physical properties such as elevation, slope, and curvature. The latter, however, must consider the cognitive (human) reasoning that discriminates individual landforms in addition to these physical properties (Arundel and Sinha 2018). Both mapping forms are important. General geomorphometry is needed to understand geological and ecological processes and as boundary layer input to climate and environmental models. Specific geomorphometry supports such activities as disaster management and recovery, emergency response, transportation, and navigation. In the United States, individual landforms of interest are named in the U.S. Geological Survey (USGS) Geographic Names Information System, a point dataset captured specifically to digitize geographic names from the USGS Historical Topographic Map Collection (HTMC). Named landform extent is represented only by the name placement in the HTMC. Recent work has investigated CNN-based deep learning methods to capture these extents in machine-readable form. These studies first relied on physical properties (Arundel et al. 2020) and then included the HTMC as a band in RGB images in limited testing (Arundel et al. 2023). Results from the HTMC dataset surpassed those using just physical properties and using the HTMC alone performed best due to the hillshading and elevation (contour) data incorporated into the topographic maps. However, results fell short of an operational capacity to map all named landforms in the United States. Thus, our current work expands upon past research by focusing on the HTMC and physical information as inputs and the named landform label extents. Specifically, we propose to leverage pre-trained foundation models for segmentation and optical character recognition (OCR) models to jointly map landforms in the United States. Our approach aims to bridge the disparities among the independent information sources to facilitate informed decision-making. The modeling pipeline performs (1) segmentation using the physical information and (2) information extraction using OCR, in parallel. Then a computer vision approach merges the two branches into a labeled segmentation.

machine learning↗
NASA NTRSDate not supplied

MOC Automation with GMSEC and the Generic Extendable Message Utility (GEMU)

Automation has become critical for ground systems, improving efficiency and reliability while reducing costs across mission operations. The Goddard Mission Services Evolution Center (GMSEC) software suite has played a significant role in enabling this automation, leveraging its publish/subscribe paradigm through a message bus architecture to facilitate seamless communication and data flow. Historically, the GMSEC suite, through components like Criteria Action Table (CAT) has been pivotal in automating ground system capabilities. However, as technology advances, limitations in automation with CAT have emerged, creating an opportunity to enhance ground system automation through the introduction of GEMU. This new GMSEC component brings new capabilities and addresses specific automation constraints that CAT could not overcome, allowing for more sophisticated, flexible, and efficient message processing. GEMU, at its core, is designed to accelerate the development of custom GMSEC-compliant applications. It enables users to construct automated message processing pipelines quickly, supporting both drag-and-drop web-based configuration and scripting through a simple domain-specific language. This advancement not only simplifies the process but also reduces the time needed for implementing automated solutions. This presentation will outline GEMU’s potential value in improving mission operations automation. It will highlight the benefits of transitioning from CAT to GEMU and offer insights into how GEMU can drive operational efficiencies. We will also provide an overview of the automation capabilities of GEMU and its potential impact on mission operations centers (MOCs).

GMSEC↗
NASA NTRS2010

Photometric Analysis in the Kepler Science Operations Center Pipeline

We describe the Photometric Analysis (PA) software component and its context in the Kepler Science Operations Center (SOC) Science Processing Pipeline. The primary tasks of this module are to compute the photometric flux and photocenters (centroids) for over 160,000 long cadence (~thirty minute) and 512 short cadence (~one minute) stellar targets from the calibrated pixels in their respective apertures. We discuss science algorithms for long and short cadence PA: cosmic ray cleaning; background estimation and removal; aperture photometry; and flux-weighted centroiding. We discuss the end-to-end propagation of uncertainties for the science algorithms. Finally, we present examples of photometric apertures, raw flux light curves, and centroid time series from Kepler flight data. PA light curves, centroid time series, and barycentric timestamp corrections are exported to the Multi-mission Archive at Space Telescope [Science Institute] (MAST) and are made available to the general public in accordance with the NASA/Kepler data release policy.

photocenter↗
NASA NTRS2010

Photometric Analysis in the Kepler Science Operations Center Pipeline

We describe the Photometric Analysis (PA) software component and its context in the Kepler Science Operations Center (SOC) pipeline. The primary tasks of this module are to compute the photometric flux and photocenters (centroids) for over 160,000 long cadence (~thirty minute) and 512 short cadence (~one minute) stellar targets from the calibrated pixels in their respective apertures. We discuss the science algorithms for long and short cadence PA: cosmic ray cleaning; background estimation and removal; aperture photometry; and flux-weighted centroiding. We discuss the end-to-end propagation of uncertainties for the science algorithms. Finally, we present examples of photometric apertures, raw flux light curves, and centroid time series from Kepler flight data. PA light curves, centroid time series, and barycentric timestamp corrections are exported to the Multi-mission Archive at Space Telescope [Science Institute] (MAST) and are made available to the general public in accordance with the NASA/Kepler data release policy.

Twicken, Joseph D.↗
NASA NTRS2010

Rapid Corner Detection Using FPGAs

In order to perform precision landings for space missions, a control system must be accurate to within ten meters. Feature detection applied against images taken during descent and correlated against the provided base image is computationally expensive and requires tens of seconds of processing time to do just one image while the goal is to process multiple images per second. To solve this problem, this algorithm takes that processing load from the central processing unit (CPU) and gives it to a reconfigurable field programmable gate array (FPGA), which is able to compute data in parallel at very high clock speeds. The workload of the processor then becomes simpler; to read an image from a camera, it is transferred into the FPGA, and the results are read back from the FPGA. The Harris Corner Detector uses the determinant and trace to find a corner score, with each step of the computation occurring on independent clock cycles. Essentially, the image is converted into an x and y derivative map. Once three lines of pixel information have been queued up, valid pixel derivatives are clocked into the product and averaging phase of the pipeline. Each x and y derivative is squared against itself, as well as the product of the ix and iy derivative, and each value is stored in a WxN size buffer, where W represents the size of the integration window and N is the width of the image. In this particular case, a window size of 5 was chosen, and the image is 640 480. Over a WxN size window, an equidistance Gaussian is applied (to bring out the stronger corners), and then each value in the entire window is summed and stored. The required components of the equation are in place, and it is just a matter of taking the determinant and trace. It should be noted that the trace is being weighted by a constant k, a value that is found empirically to be within 0.04 to 0.15 (and in this implementation is 0.05). The constant k determines the number of corners available to be compared against a threshold sigma to mark a valid corner. After a fixed delay from when the first pixel is clocked in (to fill the pipeline), a score is achieved after each successive clock. This score corresponds with an (x,y) location within the image. If the score is higher than the predetermined threshold sigma, then a flag is set high and the location is recorded.

Morfopoulos, Arin C.↗
NASA NTRS1991

Compile-time estimation of communication costs in multicomputers

An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Any strategy for automatic data partitioning needs a mechanism for estimating the performance of a program under a given partitioning scheme, the most crucial part of which involves determining the communication costs incurred by the program. A methodology is described for estimating the communication costs at compile-time as functions of the numbers of processors over which various arrays are distributed. A strategy is described along with its theoretical basis, for making program transformations that expose opportunities for combining of messages, leading to considerable savings in the communication costs. For certain loops with regular dependences, the compiler can detect the possibility of pipelining, and thus estimate communication costs more accurately than it could otherwise. These results are of great significance to any parallelization system supporting numeric applications on multicomputers. In particular, they lay down a framework for effective synthesis of communication on multicomputers from sequential program references.

Gupta, Manish↗
NASA NTRS2015

Development and Testing of a Post-Installable Deepwater Monitoring System Using Fiber-Optic Sensors

This paper addresses the design and development of a fiber-optic monitoring system that can be deployed on existing deepwater risers and flowlines; and provides a summary of test article fabrication and the subsequent laboratory testing performed at the National Aeronautics and Space Administration-Johnson Space Center (NASA-JSC). A major challenge of a post-installed instrumentation system is to ensure adequate coupling between the instruments and the riser or flowline of interest. This work investigates the sensor coupling for pipelines that are suspended in a water column (from topside platform to seabed) using a fiber-optic sensor clamp and subsea bonding adhesive. The study involved the design, fabrication, and test of several prototype clamps that contained fiber-optic sensors. A mold was produced by NASA using 3-D printing methods that allowed the casting of polyurethane clamp test articles to accommodate 4-inch and 8-inch diameter pipes. The prototype clamps were installed with a subsea adhesive in a "wet" environment and then tested in the NASA Structures Test Laboratory (STL). The tension, compression, and bending test data showed that the prototype sensor clamps achieved good structural coupling, and could provide high quality strain measurement for active monitoring.

Seaman, Calvin H.↗