Search NASA⌕ Search

SEARCH · Search NASA

Results for “functions and mappings”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

A transformation method for constrained-function minimization

A direct method for constrained-function minimization is discussed. The method involves the construction of an appropriate function mapping all of one finite dimensional space onto the region defined by the constraints. Functions which produce such a transformation are constructed for a variety of constraint regions including, for example, those arising from linear and quadratic inequalities and equalities. In addition, the computational performance of this method is studied in the situation where the Davidon-Fletcher-Powell algorithm is used to solve the resulting unconstrained problem. Good performance is demonstrated for 19 test problems by achieving rapid convergence to a solution from several widely separated starting points.

Park, S. K.↗
NASA NTRS1980

Description of a user-oriented geographic information system - The resource analysis program

This paper describes the Resource Analysis Program, an applied geographic information system. Several applications are presented which utilized soil, and other natural resource data, to develop integrated maps and data analyses. These applications demonstrate the methods of analysis and the philosophy of approach used in the mapping system. The applications are evaluated in reference to four major needs of a functional mapping system: data capture, data libraries, data analysis, and mapping and data display. These four criteria are then used to describe an effort to develop the next generation of applied mapping systems. This approach uses inexpensive microcomputers for field applications and should prove to be a viable entry point for users heretofore unable or unwilling to venture into applied computer mapping.

Tilmann, S. E.↗
NASA NTRS1985

Algebraic grid generation using tensor product B-splines

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

Saunders, B. V.↗
NASA NTRS1994

Control theory based airfoil design for potential flow and a finite volume discretization

This paper describes the implementation of optimization techniques based on control theory for airfoil design. In previous studies it was shown that control theory could be used to devise an effective optimization procedure for two-dimensional profiles in which the shape is determined by a conformal transformation from a unit circle, and the control is the mapping function. The goal of our present work is to develop a method which does not depend on conformal mapping, so that it can be extended to treat three-dimensional problems. Therefore, we have developed a method which can address arbitrary geometric shapes through the use of a finite volume method to discretize the potential flow equation. Here the control law serves to provide computationally inexpensive gradient information to a standard numerical optimization method. Results are presented, where both target speed distributions and minimum drag are used as objective functions.

Reuther, J.↗
NASA NTRS1994

Optimum aerodynamic design via boundary control

These lectures describe the implementation of optimization techniques based on control theory for airfoil and wing design. In previous studies it was shown that control theory could be used to devise an effective optimization procedure for two-dimensional profiles in which the shape is determined by a conformal transformation from a unit circle, and the control is the mapping function. Recently the method has been implemented in an alternative formulation which does not depend on conformal mapping, so that it can more easily be extended to treat general configurations. The method has also been extended to treat the Euler equations, and results are presented for both two and three dimensional cases, including the optimization of a swept wing.

Jameson, Antony↗
NASA NTRS1994

Unsupervised texture image segmentation by improved neural network ART2

We here propose a segmentation algorithm of texture image for a computer vision system on a space robot. An improved adaptive resonance theory (ART2) for analog input patterns is adapted to classify the image based on a set of texture image features extracted by a fast spatial gray level dependence method (SGLDM). The nonlinear thresholding functions in input layer of the neural network have been constructed by two parts: firstly, to reduce the effects of image noises on the features, a set of sigmoid functions is chosen depending on the types of the feature; secondly, to enhance the contrast of the features, we adopt fuzzy mapping functions. The cluster number in output layer can be increased by an autogrowing mechanism constantly when a new pattern happens. Experimental results and original or segmented pictures are shown, including the comparison between this approach and K-means algorithm. The system written in C language is performed on a SUN-4/330 sparc-station with an image board IT-150 and a CCD camera.

Wang, Zhiling↗
NASA NTRS2015

Real-Time Prognostics of a Rotary Valve Actuator

Valves are used in many domains and often have system-critical functions. As such, it is important to monitor the health of valves and their actuators and predict remaining useful life. In this work, we develop a model-based prognostics approach for a rotary valve actuator. Due to limited observability of the component with multiple failure modes, a lumped damage approach is proposed for estimation and prediction of damage progression. In order to support the goal of real-time prognostics, an approach to prediction is developed that does not require online simulation to compute remaining life, rather, a function mapping the damage state to remaining useful life is found offline so that predictions can be made quickly online with a single function evaluation. Simulation results demonstrate the overall methodology, validating the lumped damage approach and demonstrating real-time prognostics.

actuator↗
NASA NTRS1995

Neurofilament protein defines regional patterns of cortical organization in the macaque monkey visual system: a quantitative immunohistochemical analysis

Visual function in monkeys is subserved at the cortical level by a large number of areas defined by their specific physiological properties and connectivity patterns. For most of these cortical fields, a precise index of their degree of anatomical specialization has not yet been defined, although many regional patterns have been described using Nissl or myelin stains. In the present study, an attempt has been made to elucidate the regional characteristics, and to varying degrees boundaries, of several visual cortical areas in the macaque monkey using an antibody to neurofilament protein (SMI32). This antibody labels a subset of pyramidal neurons with highly specific regional and laminar distribution patterns in the cerebral cortex. Based on the staining patterns and regional quantitative analysis, as many as 28 cortical fields were reliably identified. Each field had a homogeneous distribution of labeled neurons, except area V1, where increases in layer IVB cell and in Meynert cell counts paralleled the increase in the degree of eccentricity in the visual field representation. Within the occipitotemporal pathway, areas V3 and V4 and fields in the inferior temporal cortex were characterized by a distinct population of neurofilament-rich neurons in layers II-IIIa, whereas areas located in the parietal cortex and part of the occipitoparietal pathway had a consistent population of large labeled neurons in layer Va. The mediotemporal areas MT and MST displayed a distinct population of densely labeled neurons in layer VI. Quantitative analysis of the laminar distribution of the labeled neurons demonstrated that the visual cortical areas could be grouped in four hierarchical levels based on the ratio of neuron counts between infragranular and supragranular layers, with the first (areas V1, V2, V3, and V3A) and third (temporal and parietal regions) levels characterized by low ratios and the second (areas MT, MST, and V4) and fourth (frontal regions) levels characterized by high to very high ratios. Such density trends may correspond to differential representation of corticocortically (and corticosubcortically) projecting neurons at several functional steps in the integration of the visual stimuli. In this context, it is possible that neurofilament protein is crucial for the unique capacity of certain subsets of neurons to perform the highly precise mapping functions of the monkey visual system.

Non-NASA Center↗
NASA NTRS2012

The Algorithm Theoretical Basis Document for the Atmospheric Delay Correction to GLAS Laser Altimeter Ranges

NASA s Ice, Cloud, and Land Elevation Satellite (ICESat) mission will be launched late 2001. It s primary instrument is the Geoscience Laser Altimeter System (GLAS) instrument. The main purpose of this instrument is to measure elevation changes of the Greenland and Antarctic icesheets. To accurately measure the ranges it is necessary to correct for the atmospheric delay of the laser pulses. The atmospheric delay depends on the integral of the refractive index along the path that the laser pulse travels through the atmosphere. The refractive index of air at optical wavelengths is a function of density and molecular composition. For ray paths near zenith and closed form equations for the refractivity, the atmospheric delay can be shown to be directly related to surface pressure and total column precipitable water vapor. For ray paths off zenith a mapping function relates the delay to the zenith delay. The closed form equations for refractivity recommended by the International Union of Geodesy and Geophysics (IUGG) are optimized for ground based geodesy techniques and in the next section we will consider whether these equations are suitable for satellite laser altimetry.

Herring, Thomas A.↗
NASA NTRS1995

Aerodynamic shape optimization of wing and wing-body configurations using control theory

This paper describes the implementation of optimization techniques based on control theory for wing and wing-body design. In previous studies it was shown that control theory could be used to devise an effective optimization procedure for airfoils and wings in which the shape and the surrounding body-fitted mesh are both generated analytically, and the control is the mapping function. Recently, the method has been implemented for both potential flows and flows governed by the Euler equations using an alternative formulation which employs numerically generated grids, so that it can more easily be extended to treat general configurations. Here results are presented both for the optimization of a swept wing using an analytic mapping, and for the optimization of wing and wing-body configurations using a general mesh.

Reuther, James↗
NASA NTRS1977

Serotonin involvement in pituitary-adrenal function

Experiments clarifying the effects of serotonin (5-HT) in the regulation of the hypothalamic-pituitary-adrenocortical system are surveyed. Lesion experiments which seek to determine functional maps of serotonergic input to areas involved in regulation are reported. Investigations of the effects of 5-HT levels on the plasma ACTH response to stress and the diurnal variation in basal plasma corticosterone are summarized, and the question of whether serotonergic transmission is involved in the regulation of all aspects of pituitary-adrenal function is considered with attention to the stimulatory and inhibitory action of 5-HT.

Vernikos-Danellis, J.↗
NASA NTRSDate not supplied

Towards Energy Scale Calibration and Drift Correction of TES Detectors for Athena X-IFU

The Athena X-Ray Integral Field Unit (X-IFU) comprises a 2376-pixel array of transition edge sensors (TES) read out with time-division multiplexing (TDM). X-IFU will provide spatially resolved, high-resolution spectroscopy (2.5 eV full-width-half-maximum up to 7 keV) over the energy range 0.2 to 12 keV, with an absolute energy scale accuracy of 0.4 eV. The energy scale function maps the optimally filtered pulse height, in arbitrary engineering units, to real calibrated energy. Uncertainties in the calibration can result from imperfect fitting of the energy scale between the known calibration points. Furthermore, temporal changes in the TES operating environment, such as heat-sink temperature, magnetic field and bias voltage, can cause significant variations in the detector gain function over time. If not properly corrected, this can result in degradation of the energy resolution, and systematic errors in the absolute energy scale. The non-linear nature of TES detectors, coupled with the possibility of multiple simultaneously occurring sources of drift, can make effective corrections over the full bandpass of the instrument extremely challenging. Athena X-IFU will employ an on-board calibration source that provides known reference x-ray lines. This provides real-time monitoring of the gain stability of the detector system and information that can be used to correct for gain drifts. For X-IFU the baseline approach is to measure a series of calibration curves under different environmental conditions, which bound the expected drifts the instrument is predicted to see over the course of the mission. Using the information from the in-flight calibration source, these energy scale functions can be interpolated to generate a new corrected energy scale as a function of time. In this paper we discuss progress towards demonstrating that the X-IFU energy scale requirements can be met. We present measurements on ~ 200 pixels in a prototype X-IFU array read out with 8-column x 32-row TDM. We use a rotating target source containing 12 fluorescent targets to generate x-ray lines covering the energy range 4 keV (Sc-Kα) to 12 keV (Br-Kα). We present measurements of the non-linear energy scale function and show how variations in heat-sink temperature, TES bias voltage and magnetic field affect the shape of TES energy scale differently and introduce different residual gain errors over the bandpass. We explore different drift correction algorithms that use either a single or multiple referential lines to track and correct the gain from these various sources of drift. In addition to the pulse-height, the DC ‘baseline’ level of the TES can contain information about its bias conditions. Thus, we test a multi-parameter gain correction algorithm that attempts to incorporate both the pulse height and the additional baseline information into the algorithm.

Stephen J Smith↗
NASA NTRS1992

Mechanically verified hardware implementing an 8-bit parallel IO Byzantine agreement processor

Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.

Moore, J. Strother↗
NASA NTRS2000

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.↗
NASA NTRS2004

Accessing FMS Functionality: The Impact of Design on Learning

In modern commercial and military aircraft, the Flight Management System (FMS) lies at the heart of the functionality of the airplane. The nature of the FMS has also caused great difficulties learning and accessing this functionality. This study examines actual Air Force pilots who were qualified on the newly introduced advanced FMS and shows that the design of the system itself is a primary source of difficulty learning the system. Twenty representative tasks were selected which the pilots could be expected to accomplish on an ' actual flight. These tasks were analyzed using the RAFIV stage model (Sherry, Polson, et al. 2002). This analysis demonstrates that a great burden is placed on remembering complex reformulation of the task to function mapping. 65% of the tasks required retaining one access steps in memory to accomplish the task, 20% required two memorized access steps, and 15% required zero memorized access steps. The probability that a participant would make an access error on the tasks was: two memorized access steps - 74%, one memorized access step - 13%, and zero memorized access steps - 6%. Other factors were analyzed as well, including experience with the system and frequency of use. This completed the picture of a system with many memorized steps causing difficulty with the new system, especially when trying to fine where to access the correct function.

Fennell, Karl↗
NASA NTRS1977

Dilation of force-free magnetic flux tubes

A general study is presented of the mapping functions which relate the magnetic-field profiles across a force-free rope in segments subjected to various external pressures. The results reveal that if the external pressure falls below a certain critical level (dependent on the flux-current relation which defines the tube), the magnetic profile consists of an invariant core sheathed in a layer permeated by an azimuthal magnetic field.

Frankenthal, S.↗
NASA NTRS1981

NASTRAN modifications for recovering strains and curvatures

NASTRAN, NASA's general-purpose finite-element structural analysis program, has been modified to allow recovery of surface strains, reference plane strains, and local curvatures at nodes of general plane elements. NASTRAN routines that operate on element stress/strain/temperature relationships and strain/temperature relationships have been modified to incorporate generation and return of strains and curvatures in lieu of stresses. Strains and curvatures are then transformed to material axes and interpolated to generate corresponding strains and curvatures at nodes of element. This interpolation is accomplished using special surface-mapping function.

Chamis, C. C.↗
NASA NTRS1980

CAS2D: FORTRAN program for nonrotating blade-to-blade, steady, potential transonic cascade flows

An exact, full-potential-equation (FPE) model for the steady, irrotational, homentropic and homoenergetic flow of a compressible, homocompositional, inviscid fluid through two dimensional planar cascades of airfoils was derived, together with its appropriate boundary conditions. A computer program, CAS2D, was developed that numerically solves an artificially time-dependent form of the actual FPE. The governing equation was discretized by using type-dependent, rotated finite differencing and the finite area technique. The flow field was discretized by providing a boundary-fitted, nonuniform computational mesh. The mesh was generated by using a sequence of conforming mapping, nonorthogonal coordinate stretching, and local, isoparametric, bilinear mapping functions. The discretized form of the FPE was solved iteratively by using successive line overrelaxation. The possible isentropic shocks were correctly captured by adding explicitly an artificial viscosity in a conservative form. In addition, a three-level consecutive, mesh refinement feature makes CAS2D a reliable and fast algorithm for the analysis of transonic, two dimensional cascade flows.

Dulikravich, D. S.↗