Search NASA⌕ Search

SEARCH · Search NASA

Results for “automatic scheme selection”

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 19 records

CUBIT: Geometry and Mesh Generation Toolkit (15.1 User Documentation)

CUBIT is a full-featured software toolkit for robust generation of two- and three-dimensional finite element meshes (grids) and geometry preparation. Its main goal is to reduce the time to generate meshes, particularly large hex meshes of complicated, interlocking assemblies. It is a solid-modeler based preprocessor that meshes volumes and surfaces for finite element analysis. Mesh generation algorithms include quadrilateral and triangular paving, 2D and 3D mapping, hex sweeping and multi-sweeping, tetrahedral meshing, and various special purpose primitives. CUBIT contains many algorithms for controlling and automating much of the meshing process, such as automatic scheme selection, interval matching, sweep grouping, and also includes state-of-the-art smoothing algorithms.

97 MATHEMATICS AND COMPUTING↗

Automatic selection of dynamic data partitioning schemes for distributed memory multicomputers

For distributed memory multicomputers such as the Intel Paragon, the IBM SP-2, the NCUBE/2, and the Thinking Machines CM-5, the quality of the data partitioning for a given application is crucial to obtaining high performance. This task has traditionally been the user's responsibility, but in recent years much effort has been directed to automating the selection of data partitioning schemes. Several researchers have proposed systems that are able to produce data distributions that remain in effect for the entire execution of an application. For complex programs, however, such static data distributions may be insufficient to obtain acceptable performance. The selection of distributions that dynamically change over the course of a program's execution adds another dimension to the data partitioning problem. In this paper, we present a technique that can be used to automatically determine which partitionings are most beneficial over specific sections of a program while taking into account the added overhead of performing redistribution. This system is being built as part of the PARADIGM (PARAllelizing compiler for DIstributed memory General-purpose Multicomputers) project at the University of Illinois. The complete system will provide a fully automated means to parallelize programs written in a serial programming model obtaining high performance on a wide range of distributed-memory multicomputers.

Palermo, Daniel J.↗

Projection-based multifidelity linear regression for data-scarce applications

Surrogate modeling for systems with high-dimensional quantities of interest remains challenging, particularly when training data are costly to acquire. This work develops multifidelity methods for multiple-input multiple-output linear regression targeting data-limited applications with high-dimensional outputs. Multifidelity methods integrate many inexpensive low-fidelity model evaluations with limited, costly high-fidelity evaluations. We introduce two projection-based multifidelity linear regression approaches with linear and nonlinear features that leverage principal component basis vectors for dimensionality reduction and combine multifidelity data through: (i) a direct data augmentation using low-fidelity data, and (ii) a data augmentation incorporating explicit linear corrections between low-fidelity and high-fidelity data. The data augmentation approaches combine high-fidelity and low-fidelity data into a unified training set and train the linear regression model through weighted least squares with fidelity-specific weights. We introduce a proximity-based weighting scheme with automatic weight selection strategy through cross-validation. Here, the proposed multifidelity linear regression methods are demonstrated on approximating the surface pressure field of a hypersonic vehicle in flight and the temperature field on an aircraft disc braking system. In an ultra low-data regime of no more than twelve high-fidelity samples, multifidelity linear regression achieves approximately 2% – 12% improvement in median accuracy and a higher R 2 score relative to single-fidelity methods at comparable computational cost.

data augmentation↗

Ground Communication Facility (GCF) upgrade task for Deep Space Network

The GCF upgrade task for NASA's Deep Space Network (DSN) is described. The DSN is a multimission telecommunications and radiometric data facility used to support space science, exploration, and applications by communicating with spacecraft and observing other radio sources. The GCF upgrade task is a six-year project designed to increase the data rate throughout capacity from 280 kbps to 2.272 Mbps from each tracking area to JPL, and 224 kbps from JPL to each tracking area. This would be accomplished by using a selective automatic repeat request error correction scheme in all throughput data.

Hung, Chaw-Kwei↗

Multiatlas whole heart segmentation of CT data using conditional entropy for atlas ranking and selection

Purpose: Cardiac computed tomography (CT) is widely used in clinical diagnosis of cardiovascular diseases. Whole heart segmentation (WHS) plays a vital role in developing new clinical applications of cardiac CT. However, the shape and appearance of the heart can vary greatly across different scans, making the automatic segmentation particularly challenging. The objective of this work is to develop and evaluate a multiatlas segmentation (MAS) scheme using a new atlas ranking and selection algorithm for automatic WHS of CT data. Research on different MAS strategies and their influence on WHS performance are limited. This work provides a detailed comparison study evaluating the impacts of label fusion, atlas ranking, and sizes of the atlas database on the segmentation performance. Methods: Atlases in a database were registered to the target image using a hierarchical registration scheme specifically designed for cardiac images. A subset of the atlases were selected for label fusion, according to the authors’ proposed atlas ranking criterion which evaluated the performance of each atlas by computing the conditional entropy of the target image given the propagated atlas labeling. Joint label fusion was used to combine multiple label estimates to obtain the final segmentation. The authors used 30 clinical cardiac CT angiography (CTA) images to evaluate the proposed MAS scheme and to investigate different segmentation strategies. Results: The mean WHS Dice score of the proposed MAS method was 0.918 ± 0.021, and the mean runtime for one case was 13.2 min on a workstation. This MAS scheme using joint label fusion generated significantly better Dice scores than the other label fusion strategies, including majority voting (0.901 ± 0.276, p < 0.01), locally weighted voting (0.905 ± 0.0247, p < 0.01), and probabilistic patch-based fusion (0.909 ± 0.0249, p < 0.01). In the atlas ranking study, the proposed criterion based on conditional entropy yielded a performance curve with higher WHS Dice scores compared to the conventional schemes (p < 0.03). In the atlas database study, the authors showed that the MAS using larger atlas databases generated better performance curves than the MAS using smaller ones, indicating larger atlas databases could produce more accurate segmentation. Conclusions: The authors have developed a new MAS framework for automatic WHS of CTA and investigated alternative implementations of MAS. With the proposed atlas ranking algorithm and joint label fusion, the MAS scheme is able to generate accurate segmentation within practically acceptable computation time. This method can be useful for the development of new clinical applications of cardiac CT.

60 APPLIED LIFE SCIENCES↗

Performance analysis of an optimal file transfer protocol for integrated mobile satellite services

A file-transfer protocol based on the selective-repeat automatic-retransmission-request (ARQ) scheme has been developed for the Mobile Satellite Experiment (MSAT-X). In this protocol, each file is divided into packets, which are error-detected and acknowledge individually. A file can be transferred in either the open- or closed-end connection. In the open-end connection, the file is transmitted continuously according to the selective-repeat scheme until all packets are positively acknowledged; in the closed-end connection, each retransmission will initiate its own connection request. The relationship between the packet size and the average end-to-end delay in the mobile fading environment is investigated. The communications channel uses trellis-coded modulation with symbol interleaving, packet replication, and error detection. The packet error performance in such a channel is evaluated by simulation, and the optimal packet size for various operating conditions is derived, using the simulated results. It is shown that for a symbol-energy-to-noise ratio of 12 dB, each file should be divided into packets of length between 256 bits and 512 bits (excluding the overhead) to minimize the average end-to-end delay.

Wang, Charles C.↗

Design and implementation of I/O performance prediction scheme on HPC systems through large-scale log analysis

Abstract Large-scale high performance computing (HPC) systems typically consist of many thousands of CPUs and storage units used by hundreds to thousands of users simultaneously. Applications from large numbers of users have diverse characteristics, such as varying computation, communication, memory, and I/O intensity. A good understanding of the performance characteristics of each user application is important for job scheduling and resource provisioning. Among these performance characteristics, I/O performance is becoming increasingly important as data sizes rapidly increase and large-scale applications, such as simulation and model training, are widely adopted. However, predicting I/O performance is difficult because I/O systems are shared among all users and involve many layers of software and hardware stack, including the application, network interconnect, operating system, file system, and storage devices. Furthermore, updates to these layers and changes in system management policy can significantly alter the I/O behavior of applications and the entire system. To improve the prediction of the I/O performance on HPC systems, we propose integrating information from several different system logs and developing a regression-based approach to predict the I/O performance. Our proposed scheme can dynamically select the most relevant features from the log entries using various feature selection algorithms and scoring functions, and can automatically select the regression algorithm with the best accuracy for the prediction task. The evaluation results show that our proposed scheme can predict the write performance with up to 90% prediction accuracy and the read performance with up to 99% prediction accuracy using the real logs from the Cori supercomputer system at NERSC.

97 MATHEMATICS AND COMPUTING↗

Automatic Selection of High-Fidelity Models and Surrogates for Uncertainty Analysis

Surrogate models (SMs) with distinct features developed in the last decade provide an efficient substitute to the high-fidelity physical simulations. However, it is generally challenging to quantify the accuracy of surrogate models in a region of interest and examine reliability in the overall domain without additional system evaluations. This paper introduces a new scheme, automated adaptive model selection, to adaptively construct and quantify a set of surrogate models and automatically switch between the surrogates and a high-fidelity code. Cross-validation approaches, such as KFold, Leave One Out (LOO) and Leave P Out (LPO), are employed to assess the global accuracy of the surrogates. The switching strategy is based on local validation metrics, crowding distance, that are able to provide an assessment on the goodness of the prediction made by the surrogates. This decision metric decides whether the surrogates are good enough for a certain realization or whether the high-fidelity code needs to be executed. This new scheme has been implemented in Risk Analysis in Virtual ENvironment (RAVEN) software, which can be employed to accelerate the Probabilistic Risk Assessment (PRA) and Uncertainty Quantification (UQ) processes.

97 MATHEMATICS AND COMPUTING↗

Experimental and simulation study results of an Adaptive Video Guidance System /AVGS/

Studies relating to stellar-body exploration programs have pointed out the need for an adaptive guidance scheme capable of providing automatic real-time guidance and site selection capability. For the case of a planetary lander, without such guidance, targeting is limited to what are believed to be generally benign areas in order to ensure a reasonable landing-success probability. Typically, the Mars Viking Lander will be jeopardized by obstacles exceeding 22 centimers in diameter. The benefits of on-board navigation and real-time selection of a landing site and obstacle avoidance have been demonstrated by the Apollo lunar landings, in which man performed the surface sensing and steering functions. Therefore, an Adaptive Video Guidance System (AVGS) has been developed, bread-boarded, and flown on a six-degree-of-freedom simulator.

Schappell, R. T.↗

Multiobjective Optimization of Regional and Teleseismic Data to Constrain the Source of the 12 September 2016 Mw 5.4 Earthquake in South Korea

In this paper, we propose a new approach for source inversion with automatic criteria for the station selection process and using a multiobjective optimization scheme combining teleseismic body-wave and regional surface-wave observations. To illustrate the approach, we determine the source parameters of the 12 September 2016 M w 5.4 South Korea earthquake, as well as its foreshock (same day) and its main aftershock on 19 September 2016. Available teleseismic (short period and broadband) and regional (broadband) seismograms from the Incorporated Research Institutions for Seismology International–Federation of Digital Seismograph Networks (IRIS-FDSN) webservice are selected (see Data and Resources). First, all teleseismic data with signal-to-noise ratio (SNR) above 2 in the 0.3–1.5 Hz frequency band are selected and a cepstrum function is blindly applied to help detect reflected wave arrivals inside a P coda. This method allows the identification of records with weak P-coda and clear depth phase (pP, sP) arrivals and can be used to select an optimal set of teleseismic seismograms to be used for the inversion. Second, regional seismograms are selected according to the fit between their observed and theoretical dispersion curves extracted from local 1D velocity model. Depending on the epicentral distance, two frequency bands are proposed for regional data: 15–50 s for epicentral distances smaller than 2° and 30–80 s otherwise. Finally, we explore the space parameters from exhaustive grid searches for the two objective functions Tf and Rf for teleseismic and regional data, respectively. We show that the seismic moment parameters can be exclusively derived from Rf and can be fixed for Tf. However, the depth parameter is not sensitive to Rf and can be simultaneously inverted from both. The selection of the optimal solution satisfying both cost functions uses the optimum Pareto front that allows a decrease in epistemic uncertainty. Lastly, we discuss the advantage of this approach for improving the characterization of moderate earthquake sources in areas with limited regional instrumentation.

58 GEOSCIENCES↗

Multichannel temperature controller for hot air solar house

This paper describes an electronic controller that is optimized to operate a hot air solar system. Thermal information is obtained from copper constantan thermocouples and a wall-type thermostat. The signals from the thermocouples are processed through a single amplifier using a multiplexing scheme. The multiplexing reduces the component count and automatically calibrates the thermocouple amplifier. The processed signals connect to some simple logic that selects one of the four operating modes. This simple, inexpensive, and reliable scheme is well suited to control hot air solar systems.

Currie, J. R.↗

Visualization and Quantification of Rotor Tip Vortices in Helicopter Flows

Helicopter aeromechanics encompasses a highly vortical flow field. The vortices generated at each blade tip contain unsteady, complex, three-dimensional structures, which interact with each other, other blades, the fuselage and various components of the helicopter. It is crucial to understand vortex kinematics and their subsequent dynamic evolution. Much research has been devoted to the understanding of helicopter vortex dynamics, including a number of experimental studies.1-6 In May 2010 Particle Image Velocimetry (PIV) measurements of a full-scale UH-60A rotor were acquired in the National Full-Scale Aerodynamics Complex (NFAC) 40- by 80-Foot Wind Tunnel.1 These measurements were taken at a plane just downstream of the advancing blade in the vicinity of the blade tip—the so-called PIV plane. The resulting PIV data were then processed using an ensemble-average approach to create graphical representations of the vortical wake velocity and vorticity fields, which, in turn, have enhanced the understanding of rotorcraft vortical wake flow field physics and have provided a more detailed validation of vortical wake computer simulations.7 A common approach used to analyze flow field features is to compute and plot color contour maps of various scalar quantities such as pressure, velocity magnitude and vorticity magnitude. For example, the color map of the vorticity magnitude is typically used to determine vortical flow structure. With this approach the vortex core may appear larger or smaller, depending on the contour levels that are selected. Thus, the resulting visualization is sensitive to user-specified contour levels. For vortex core radius measurements, it is more accurate to calculate the vortex core radius using the cross-flow velocity profile across the vortex core. The task of extracting the cross-flow velocity profile can be time consuming with existing tools since the user needs to manually select the core center then specify sampling points along the profile axis. The task becomes even more challenging when the associated grid system uses AMR (Adaptive Mesh Refinement) where the profile axis could span multiple grid blocks. There are a number of existing techniques for profiling of vortex core attributes;8-9 however, these techniques are not fully automatic in that the user still needs to select the vortex core center to compute the cross-flow velocity profile. The present study introduces a new color map scheme that is based on the vortex core radius, which is fully automatic and does not require user intervention. Analysis and visualization of blade tip vortices on the PIV plane using the proposed new color map scheme are described in Section II. The new approach is evaluated using two case studies, which are described in Section III. The paper ends with a summary in Section IV.

Quantification↗

Automatic learning-based beam angle selection for thoracic IMRT

Purpose: The treatment of thoracic cancer using external beam radiation requires an optimal selection of the radiation beam directions to ensure effective coverage of the target volume and to avoid unnecessary treatment of normal healthy tissues. Intensity modulated radiation therapy (IMRT) planning is a lengthy process, which requires the planner to iterate between choosing beam angles, specifying dose–volume objectives and executing IMRT optimization. In thorax treatment planning, where there are no class solutions for beam placement, beam angle selection is performed manually, based on the planner’s clinical experience. The purpose of this work is to propose and study a computationally efficient framework that utilizes machine learning to automatically select treatment beam angles. Such a framework may be helpful for reducing the overall planning workload. Methods: The authors introduce an automated beam selection method, based on learning the relationships between beam angles and anatomical features. Using a large set of clinically approved IMRT plans, a random forest regression algorithm is trained to map a multitude of anatomical features into an individual beam score. An optimization scheme is then built to select and adjust the beam angles, considering the learned interbeam dependencies. The validity and quality of the automatically selected beams evaluated using the manually selected beams from the corresponding clinical plans as the ground truth. Results: The analysis included 149 clinically approved thoracic IMRT plans. For a randomly selected test subset of 27 plans, IMRT plans were generated using automatically selected beams and compared to the clinical plans. The comparison of the predicted and the clinical beam angles demonstrated a good average correspondence between the two (angular distance 16.8° ± 10°, correlation 0.75 ± 0.2). The dose distributions of the semiautomatic and clinical plans were equivalent in terms of primary target volume coverage and organ at risk sparing and were superior over plans produced with fixed sets of common beam angles. The great majority of the automatic plans (93%) were approved as clinically acceptable by three radiation therapy specialists. Conclusions: The results demonstrated the feasibility of utilizing a learning-based approach for automatic selection of beam angles in thoracic IMRT planning. The proposed method may assist in reducing the manual planning workload, while sustaining plan quality.

60 APPLIED LIFE SCIENCES↗

Recent developments in shock-capturing schemes

The development of the shock capturing methodology is reviewed, paying special attention to the increasing nonlinearity in its design and its relation to interpolation. It is well-known that higher-order approximations to a discontinuous function generate spurious oscillations near the discontinuity (Gibbs phenomenon). Unlike standard finite-difference methods which use a fixed stencil, modern shock capturing schemes use an adaptive stencil which is selected according to the local smoothness of the solution. Near discontinuities this technique automatically switches to one-sided approximations, thus avoiding the use of discontinuous data which brings about spurious oscillations.

Harten, Ami↗

RENDEZVOUS AND DOCKING TECHNIQUES

To implement the primary space mission of this decade – manned lunar exploration -- the operational assistance of rendezvous and docking is being considered as an alternative to possible problems in obtaining a boost vehicle capable of direct flight. This paper concentrates on the mechanization of the rendezvous and docking phase of such a lunar mission. As indicated in previous papers, rendezvous can take place in either an earth or lunar orbit (or on the lunar surface); it can involve the mating of stages, transfer of fuel, or the return of a shuttle to a “mother” ship; direct ascent or parking orbits can be used; the orbits can be circular or more general ellipses; finally, either or both of the spacecraft can participate in the rendezvous maneuvers. Since there is no intent here to discuss the pros and cons of each approach or to cover all possible mission profiles, guidance schemes and hardware configurations, one particular profile has been selected to display the significant features of most rendezvous missions. In many respects, rendezvous is less difficult than aircraft interception since the target is friendly and there is no severe time constraint. The latter feature allows considerable freedom of design especially with the great versatility of a human in the loop. This remains true even for a purely automatic mode. Perhaps the largest design problem concerns the selection of the mission to be implemented followed by the optimization or systems engineering of a mechanization from the multitude of possible schemes and techniques. A most important factor in the optimization is that of reliability and the redundancy, alternate or backup modes, etc., associated with the approach. While a primary system can be rather easily mechanized with modest equipment requirements, reliability considerations will result in additional hardware, tighter specifications and more safety factors (e. g., propellant margin). This is a very complex area and will only briefly be mentioned in the following discussion.

Rendezvous↗

A scheme for fault tolerance in earth sensors

A system is presented that uses dual-redundant earth sensors to measure pitch and roll errors of a three-axis stabilized spacecraft, with provision for (1) autonomously detecting and identifying a faulty earth sensor, and (2) automatically selecting the outputs of the fault-free sensor for closed-loop attitude control, before failures cause major problems. A brief description is given of the system, and various failure modes of earth sensors and their effects are discussed. Novel techniques and algorithms for automatic fault detection, identification, and reconfiguration (FDIR) of dual-redundant earth sensors are developed. The algorithms are validated through computer simulations, and the results are presented. The proposed scheme can easily be implemented without much penalty on hardware, power consumption, and processing time.

Murugesan, S.↗

ELAS: A general-purpose computer program for the equilibrium problems of linear structures. Volume 2: Documentation of the program

A general purpose digital computer program for the in-core solution of linear equilibrium problems of structural mechanics is documented. The program requires minimum input for the description of the problem. The solution is obtained by means of the displacement method and the finite element technique. Almost any geometry and structure may be handled because of the availability of linear, triangular, quadrilateral, tetrahedral, hexahedral, conical, triangular torus, and quadrilateral torus elements. The assumption of piecewise linear deflection distribution insures monotonic convergence of the deflections from the stiffer side with decreasing mesh size. The stresses are provided by the best-fit strain tensors in the least squares at the mesh points where the deflections are given. The selection of local coordinate systems whenever necessary is automatic. The core memory is used by means of dynamic memory allocation, an optional mesh-point relabelling scheme and imposition of the boundary conditions during the assembly time.

Utku, S.↗