Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Process optimization and mapping”

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 91 records · Page 5

Mission-Maps For Outbound Cislunar Transfer Trajectories

This study quantifies the robustness and sensitivity of an outbound cislunar trajectory for a lunar lander in the form of mission-maps, or topological maps that allows either a computer program or mission designer to intuitively optimize the placement of critical outbound correction burns from the derived sensitivity data. The non-linear multi-body dynamics are applied to generate an outbound cislunar reference profile used by a linear covariance analysis (LinCov) tool to compute the expected Δv and trajectory dispersions due to the initial state uncertainty, sensor errors, maneuver execution errors, and disturbance accelerations along the outbound cislunar profile. The rapid performance analysis capabilities of LinCov are complimented with parallel processing techniques to evaluate hundreds and thousands of different translational burn locations, placements, and targeting constraints to identify the combination that minimizes the total Δv usage (nominal plus 3σ Δv) and trajectory dispersions at lunar orbit insertion. This study utilizes a generalized reference targeting algorithm to quickly assess the integrated closed-loop GN&C system performance due to different targeting configurations and constraints. The resulting mission maps provide an intuitive insight to ascertain each trajectory correction maneuver’s (TCM) sensitivity to different burn times along an outbound cislunar trajectory and quickly identify desirable engineering tradeoffs when performing analysis on the number and placement of these burns that nominally zero. Multiple mission maps are generated for a variety of different performance parameters that allow engineers to visually identify optimal solutions for trajectory correction maneuver placements, the number of correction burns, and the targeting constraints for each burn.

GN&C

Using Flory–Huggins-informed human-in-the-loop Bayesian optimization to map the phase diagram of polymer blends

Mapping the phase diagram of polymer blends is an essential step in controlling the structure–property relationship of polymer-based materials. However, traditional grid-based approaches are inefficient and rely on subjective judgements for terminating the experimental campaign. Artificial intelligence-guided experimentation offers a compelling alternative, especially when data-driven decision-making is interfaced with established polymer thermodynamics to improve efficiency and interpretability. Here, we introduce a physics-informed Bayesian optimization approach to guide the mapping of the phase diagram of a model blend containing poly(methyl methacrylate) and poly(styrene-ran-acrylonitrile). Physical information is derived from a Flory–Huggins representation of the spinodal curve, which is integrated into the Bayesian optimization process as a structured prior mean that acts as a soft constraint. Implemented as a human-in-the-loop workflow, the approach leverages optical imaging of film cloudiness with iterative Gaussian process surrogate modeling and a parameter selection decision policy to identify the composition-temperature conditions for sequential iterations. Convergence of kernel and Flory–Huggins-based hyperparameters provided a stopping criterion, ensuring an objective and interpretable termination of the experimental campaign. The framework recovered the known lower critical solution temperature (∼160 °C), while increasing material efficiency through targeted sampling. This work establishes a proof-of-concept for the application of Bayesian optimization workflows to study polymer blend miscibility.

36 MATERIALS SCIENCE

Simulation driven adaptive sampling for neutron-diffraction based strain mapping of additively manufactured parts

Neutron diffraction based strain mapping is a useful technique for measuring residual strains in additively manufactured (AM) metal parts. The measurement is traditionally done by scanning the sample in a point-wise raster pattern to extract the strain at each position. Since the overall scan can span several hours, adaptive sampling approaches using Bayesian optimization based on Gaussian process (BO-GP) regression have been introduced—demonstrating that even with a fraction of the typically made measurements the dominant strain patterns in the sample can be reconstructed. However, the parameters of the BO-GP algorithm have to be carefully chosen for best performance, and the movement time between arbitrary points can offset the time savings from a reduced number of measurement locations. In this paper, we propose algorithms to refine the BO-GP based methods by using simulations of strain patterns in AM parts based on the materials and the process used to print them. We demonstrate that the simulated strain patterns can be used to help choose better parameters for the BO-GP based framework—leading to low reconstruction error for the final strain pattern. Furthermore, we show that the strain mapping experiment can be initialized with a sampling pattern learnt from the simulation data and ordered to reduce movement time, dramatically enabling reduction in the overall time required to run the baseline BO-GP method.

Gaussian process regression

SAR image enhancement via post-correlation signal processing

Seventeen interpreters ranked sets of computer-generated radar imagery to assess the value of post-correlation processing on the interpretability of SAR (synthetic aperture radar) imagery. The post-correlation processing evaluated amounts to a nonlinear mapping of the signal exiting a digital correlator and allows full use of signal bandwidth for improving the spatial resolution or for noise reduction. The results indicate that it is reasonable to hypothesize an optimal SAR presentation format for specific applications even though this study was too limited to be specific.

Matthews, N. D.

LCTV Holographic Imaging

Astronauts are required to interface with complex systems that require sophisticated displays to communicate effectively. Lightweight, head-mounted real-time displays that present holographic images for comfortable viewing may be the ideal solution. We describe an implementation of a liquid crystal television (LCTV) as a spatial light modulator (SLM) for the display of holograms. The implementation required the solution of a complex set of problems. These include field calculations, determination of the LCTV-SLM complex transmittance characteristics and a precise knowledge of the signal mapping between the LCTV and frame grabbing board that controls it. Realizing the hologram is further complicated by the coupling that occurs between the phase and amplitude in the LCTV transmittance. A single drive signal (a gray level signal from a framegrabber) determines both amplitude and phase. Since they are not independently controllable (as is true in the ideal SLM) one must deal with the problem of optimizing (in some sense) the hologram based on this constraint. Solutions for the above problems have been found. An algorithm has been for field calculations that uses an efficient outer product formulation. Juday's MEDOF 7 (Minimum Euclidean Distance Optimal Filter) algorithm used for originally for filter calculations has been successfully adapted to handle metrics appropriate for holography. This has solved the problem of optimizing the hologram to the constraints imposed by coupling. Two laboratory methods have been developed for determining an accurate mapping of framegrabber pixels to LCTV pixels. A friendly software system has been developed that integrates the hologram calculation and realization process using a simple set of instructions. The computer code and all the laboratory measurement techniques determining SLM parameters have been proven with the production of a high quality test image.

Knopp, Jerome

Method Development for In-situ Detection of Latent Herpesvirus DNA from Saliva using Nanopore Sequencing

Research toward latent herpesvirus reactivation has been intensively addressed through Space Shuttle and International Space Station (ISS) investigations. This work has provided the understanding that persistent reactivation of herpesviruses from asymptomatic crew can be detected through viral shedding in saliva, urine, and blood. Occasionally, viral reactivation from the latency stage can pose a threat to crew health (clinical manifestation) before, during, and after flight missions. Furthermore, previous work detailing correlations with immunity indicate that monitoring viral reactivation could be implemented to assess potential immune dysfunction. While in-flight monitoring is desirable, there is no well-established procedure or method for real-time evaluations, and research to date has relied on postflight, ground-based analysis. The development of portable molecular technologies like the miniPCR™ (miniPCR Bio) thermal cycler and the MinION™ sequencer (Oxford Nanopore Technologies) have confirmed that real-time monitoring is possible in extreme and low resource environments. These devices, combined with simple sample preparation methods, have been used to demonstrate bacterial identification onboard the ISS, as well as rapid viral detection in remote locations on Earth. The work here builds upon previous molecular advancements onboard the ISS toward the development and validation of a spaceflight-compatible method for viral detection from crew samples. Several herpesviruses can be detected in saliva, which provides a non-invasive means to collect samples for monitoring. While the basis for this method lies in previous spaceflight investigations, key points for method optimization include DNA extraction from saliva, viral primer selection, and bioinformatic processes for data analysis. To increase viral yield, numerous DNA extraction methods have been evaluated and will be discussed in detail. For initial development and testing, varicella-zoster virus (VZV) is being targeted though open reading frame 51 and 63 (ORF51, ORF63), as the replication origin-binding protein is highly expressed during latency. Optimization of the thermal cycling parameters has resulted in the ability to test the entire process. The full method has been tested with both viral VZV DNA standards and saliva spiked with varying concentrations of VZV. Viral sequence data were mapped to the reference sequence using minimap2. Prior to mapping, DNA sequencing reads were filtered for length and quality, barcodes were removed, and alignment identity calculated. Following further assessments, statistics were compared across multiple sequencing experiments and are being used to determine the success of the protocols. Forward work will include the incorporation of herpes simplex virus 1 (HSV-1) and Epstein-Barr virus (EBV) primers as well as the validation of results to the terrestrial qPCR standard assay. Upon full validation of the developed method, saliva will be collected from 20 healthy subjects and spiked with viral DNA. These samples will be split and assayed with the MinION and standard qPCR assay.

Hang N Nguyen

Optimization of an aerostructural machining process using physics-guided Bayesian stability modelling

Existing algorithms for predicting milling chatter have not been widely adopted in industry since they require specialized instruments to measure the stability inputs. This study describes how the machining process for a meter-scale aluminum aerostructure was optimized using a physics-guided Bayesian stability model. The study was performed in collaboration with an industrial partner on production machines to evaluate the practicality of the proposed method under real-world conditions. For each cutting tool, the Bayesian approach automatically selected a small number of cutting tests, which were monitored using a microphone to observe the chatter frequency. The algorithm learned the system dynamics, cutting forces, and stability map from these test results. A novel algorithm for predicting tool bending stress was incorporated into the test selection algorithm to avoid tool breakage. On average, each set of optimized cutting parameters required less than six tests to identify and were 97% more productive than baseline parameters from the cutting tool manufacturer. The machining program was then further optimized using commercial feedrate scheduling software to remove cutting force spikes and reduce air cutting time. Five components were machined using the optimized process. These results demonstrate the potential for physics-guided Bayesian models to improve productivity in industrial settings.

Cornelius, Aaron [UT Knoxville]

New approaches in interferometric SAR data processing

It is well established that interferometric synthetic aperture radar (SAR) images can be inverted to perform surface elevation mapping. Among the factors critical to the mapping accuracy are registration of the interfering SAR images and phase unwrapping. A novel registration algorithm is presented that determines the registration parameters through optimization. A new figure of merit is proposed that evaluates the registration result during the optimization. The phase unwrapping problem is approached through a new method involving fringe line detection. The algorithms are tested with two SEASAT SAR images of terrain near Yellowstone National Park. These images were collected on Seasat orbits 1334 and 1420, which were very close together in space, i.e., less than 100 m. The resultant elevation map is compared with the USGS digital terrain elevation model.

Lin, Qian

On Developing a Taxonomy for Multidisciplinary Design Optimization: A Decision-Based Perspective

In this paper, we approach MDO from a Decision-Based Design (DBD) perspective and explore classification schemes for designing complex systems and processes. Specifically, we focus on decisions, which are only a small portion of the Decision Support Problem (DSP) Technique, our implementation of DBD. We map coupled nonhierarchical and hierarchical representations from the DSP Technique into the Balling-Sobieski (B-S) framework (Balling and Sobieszczanski-Sobieski, 1994), and integrate domain-independent linguistic terms to complete our taxonomy. Application of DSPs to the design of complex, multidisciplinary systems include passenger aircraft, ships, damage tolerant structural and mechanical systems, and thermal energy systems. In this paper we show that Balling-Sobieski framework is consistent with that of the Decision Support Problem Technique through the use of linguistic entities to describe the same type of formulations. We show that the underlying linguistics of the solution approaches are the same and can be coalesced into a homogeneous framework with which to base the research, application, and technology MDO upon. We introduce, in the Balling-Sobieski framework, examples of multidisciplinary design, namely, aircraft, damage tolerant structural and mechanical systems, and thermal energy systems.

Lewis, Kemper

Performance evaluation and geologic utility of LANDSAT-4 thematic mapper data

The overall objective of the project was to evaluate LANDSAT-4 Thematic Mapper (TM) data in the context of geologic applications. This involved a quantitative assessment of the data quality including the spatial and spectral characteristics realized by the instrument. Three test sites were selected for the study: (1) Silver Bell, Arizona; (2) Death Valley, California; and (3) Wind River/Bighorn Basin area, Wyoming. Conclusions include: (1) Artificial and natural targets can be used to atmospherically calibrate TM data and investigate scanner radiometry, atmospheric parameters, and construction of atmospheric Modulation Transfer Functions (MTF's), (2) No significant radiometric degradation occurs in TM data as a result of SCROUNGE processing; however, the data exhibit narrow digital number (DN) distributiosn suggesting that the configuration of the instrument is not optimal for each science applications, (30 Increased spatial resolution, 1:24,000 enlargement capability, and good geometric fidelity of TM data allow accurate photogeologic/geomorphic mapping, including relative age dating of alluvial fans, measurement of structural and bedding attitudes, and construction of such things as structural cross sections and stratigraphic columns. (4) TM bands 5 and 7 are particularly useful for geologic applications because they span a region of the spectrum not previously sampled by multispectral scanner data and are important for characterizing clay and carbonate materials.

Paylor, E. D.

Implementation of ADI: Schemes on MIMD parallel computers

In order to simulate the effects of the impingement of hot exhaust jets of High Performance Aircraft on landing surfaces a multi-disciplinary computation coupling flow dynamics to heat conduction in the runway needs to be carried out. Such simulations, which are essentially unsteady, require very large computational power in order to be completed within a reasonable time frame of the order of an hour. Such power can be furnished by the latest generation of massively parallel computers. These remove the bottleneck of ever more congested data paths to one or a few highly specialized central processing units (CPU's) by having many off-the-shelf CPU's work independently on their own data, and exchange information only when needed. During the past year the first phase of this project was completed, in which the optimal strategy for mapping an ADI-algorithm for the three dimensional unsteady heat equation to a MIMD parallel computer was identified. This was done by implementing and comparing three different domain decomposition techniques that define the tasks for the CPU's in the parallel machine. These implementations were done for a Cartesian grid and Dirichlet boundary conditions. The most promising technique was then used to implement the heat equation solver on a general curvilinear grid with a suite of nontrivial boundary conditions. Finally, this technique was also used to implement the Scalar Penta-diagonal (SP) benchmark, which was taken from the NAS Parallel Benchmarks report. All implementations were done in the programming language C on the Intel iPSC/860 computer.

Vanderwijngaart, Rob F.

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.

Data-Analysis System for Entry, Descent, and Landing

A report describes the Entry Descent Landing Data Analysis (EDA), which is a system of signal-processing software and computer hardware for acquiring status data conveyed by multiple-frequency-shift-keying tone signals transmitted by a spacecraft during descent to the surface of a remote planet. The design of the EDA meets the challenge of processing weak, fluctuating signals that are Doppler-shifted by amounts that are only partly predictable. The software supports both real-time and post processing. The software performs fast-Fourier-transform integration, parallel frequency tracking with prediction, and mapping of detected tones to specific events. The use of backtrack and refinement parallel-processing threads helps to minimize data gaps. The design affords flexibility to enable division of a descent track into segments, within each of which the EDA is configured optimally for processing in the face of signal conditions and uncertainties. A dynamic-lock-state feature enables the detection of signals using minimum required computing power less when signals are steadily detected, more when signals fluctuate. At present, the hardware comprises eight dual-processor personal-computer modules and a server. The hardware is modular, making it possible to increase computing power by adding computers.

Pham, Timothy

Biweekly Maps of Wind Stress for the North Pacific from the ERS-1 Scatterometer

The European Remote-sensing Satellite (ERS-1) was launched in July 1991 and contained several instruments for observing the Earth's ocean including a wind scatterometer. The scatterometer measurements were processed by the European Space Agency (ESA) and the Jet Propulsion Laboratory (JPL). JPL reprocessed (Freilich and Dunbar, 1992) the ERS-1 backscatter measurements to produced a 'value added' data set that contained the ESA wind vector as well as a set of up to four ambiguities. These ambiguities were further processed using a maximum-likelihood estimation (MLE) and a median filter to produce a 'selected vector.' This report describes a technique developed to produce time-averaged wind field estimates with their expected errors using only scatterometer wind vectors. The processing described in this report involved extracting regions of interest from the data tapes, checking the quality and creating the wind field estimate. This analysis also includes the derivation of biweekly average wind vectors over the North Pacific Ocean at a resolution of 0.50 x 0.50. This was done with an optimal average algorithm temporally and an over-determined biharmonic spline spatially. There have been other attempts at creating gridded wind files from ERS-1 winds, e.g., kriging techniques (Bentamy et al., 1996) and successive corrections schemes (Tang and Liu, 1996). There are several inherent problems with the ERS-1 scatterometer. Since this is a multidisciplinary mission, the satellite is flown in different orbits optimized for each phase of the mission. The scatterometer also shares several sub-systems with the Synthetic Aperture Radar (SAR) and cannot be operated while the SAR is in operation. The scatterometer is also a single-sided instrument and only measures backscatter along the right side of the satellite. The processing described here generates biweekly wind maps during the wktwo years analysis period regardless of the satellite orbit or missing data.

SYNTHETIC APERTURE RADAR

Incremental Parallelization of Non-Data-Parallel Programs Using the Charon Message-Passing Library

Message passing is among the most popular techniques for parallelizing scientific programs on distributed-memory architectures. The reasons for its success are wide availability (MPI), efficiency, and full tuning control provided to the programmer. A major drawback, however, is that incremental parallelization, as offered by compiler directives, is not generally possible, because all data structures have to be changed throughout the program simultaneously. Charon remedies this situation through mappings between distributed and non-distributed data. It allows breaking up the parallelization into small steps, guaranteeing correctness at every stage. Several tools are available to help convert legacy codes into high-performance message-passing programs. They usually target data-parallel applications, whose loops carrying most of the work can be distributed among all processors without much dependency analysis. Others do a full dependency analysis and then convert the code virtually automatically. Even more toolkits are available that aid construction from scratch of message passing programs. None, however, allows piecemeal translation of codes with complex data dependencies (i.e. non-data-parallel programs) into message passing codes. The Charon library (available in both C and Fortran) provides incremental parallelization capabilities by linking legacy code arrays with distributed arrays. During the conversion process, non-distributed and distributed arrays exist side by side, and simple mapping functions allow the programmer to switch between the two in any location in the program. Charon also provides wrapper functions that leave the structure of the legacy code intact, but that allow execution on truly distributed data. Finally, the library provides a rich set of communication functions that support virtually all patterns of remote data demands in realistic structured grid scientific programs, including transposition, nearest-neighbor communication, pipelining, gather/scatter, and redistribution. At the end of the conversion process most intermediate Charon function calls will have been removed, the non-distributed arrays will have been deleted, and virtually the only remaining Charon functions calls are the high-level, highly optimized communications. Distribution of the data is under complete control of the programmer, although a wide range of useful distributions is easily available through predefined functions. A crucial aspect of the library is that it does not allocate space for distributed arrays, but accepts programmer-specified memory. This has two major consequences. First, codes parallelized using Charon do not suffer from encapsulation; user data is always directly accessible. This provides high efficiency, and also retains the possibility of using message passing directly for highly irregular communications. Second, non-distributed arrays can be interpreted as (trivial) distributions in the Charon sense, which allows them to be mapped to truly distributed arrays, and vice versa. This is the mechanism that enables incremental parallelization. In this paper we provide a brief introduction of the library and then focus on the actual steps in the parallelization process, using some representative examples from, among others, the NAS Parallel Benchmarks. We show how a complicated two-dimensional pipeline-the prototypical non-data-parallel algorithm- can be constructed with ease. To demonstrate the flexibility of the library, we give examples of the stepwise, efficient parallel implementation of nonlocal boundary conditions common in aircraft simulations, as well as the construction of the sequence of grids required for multigrid.

VanderWijngaart, Rob F.

Legacy Code Modernization

Over the past decade, high performance computing has evolved rapidly; systems based on commodity microprocessors have been introduced in quick succession from at least seven vendors/families. Porting codes to every new architecture is a difficult problem; in particular, here at NASA, there are many large CFD applications that are very costly to port to new machines by hand. The LCM ("Legacy Code Modernization") Project is the development of an integrated parallelization environment (IPE) which performs the automated mapping of legacy CFD (Fortran) applications to state-of-the-art high performance computers. While most projects to port codes focus on the parallelization of the code, we consider porting to be an iterative process consisting of several steps: 1) code cleanup, 2) serial optimization,3) parallelization, 4) performance monitoring and visualization, 5) intelligent tools for automated tuning using performance prediction and 6) machine specific optimization. The approach for building this parallelization environment is to build the components for each of the steps simultaneously and then integrate them together. The demonstration will exhibit our latest research in building this environment: 1. Parallelizing tools and compiler evaluation. 2. Code cleanup and serial optimization using automated scripts 3. Development of a code generator for performance prediction 4. Automated partitioning 5. Automated insertion of directives. These demonstrations will exhibit the effectiveness of an automated approach for all the steps involved with porting and tuning a legacy code application for a new architecture.

Hribar, Michelle R.

Likelihood-based interactive local docking into cryo-EM maps in ChimeraX

The interpretation of cryo-EM maps often includes the docking of known or predicted structures of the components, which is particularly useful when the map resolution is worse than 4 Å. Although it can be effective to search the entire map to find the best placement of a component, the process can be slow when the maps are large. However, frequently there is a well-founded hypothesis about where particular components are located. In such cases, a local search using a map subvolume will be much faster because the search volume is smaller, and more sensitive because optimizing the search volume for the rotation-search step enhances the signal to noise. A Fourier-space likelihood-based local search approach, based on the previously published em_placement software, has been implemented in the new emplace_local program. Tests confirm that the local search approach enhances the speed and sensitivity of the computations. An interactive graphical interface in the ChimeraX molecular-graphics program provides a convenient way to set up and evaluate docking calculations, particularly in defining the part of the map into which the components should be placed.

59 BASIC BIOLOGICAL SCIENCES

Classification of wetlands vegetation using small scale color infrared imagery

A classification system for Chesapeake Bay wetlands was derived from the correlation of film density classes and actual vegetation classes. The data processing programs used were developed by the Laboratory for the Applications of Remote Sensing. These programs were tested for their value in classifying natural vegetation, using digitized data from small scale aerial photography. Existing imagery and the vegetation map of Farm Creek Marsh were used to determine the optimal number of classes, and to aid in determining if the computer maps were a believable product.

Williamson, F. S. L.