SEARCH · Search NASA

Results for “Shape memory”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 865 records · Page 48

All sources NASA NTRS DOE OSTI

NASA NTRS1975

ATS-6 - Radio Beacon Experiment: The first years

The Radio Beacon Experiment aboard Applications Technology Satellite-6 (ATS-6) is designed to measure the total electron content and the ionospheric electron content between the satellite and ground. The spaceborne beacon transmits signals on frequencies of 40, 140, and 360 MHz with amplitude modulations of 1 MHz and/or 0.1 MHz for the measurement of modulation phase, Faraday rotation, and amplitude. The modulation phase delays are calibrated in the satellite and in the ground equipment, and the polarization of the emitted signals are predetermined by standard antenna range techniques. The design of the ATS-6 receiver in Boulder, Colorado, is discussed. The antennae are of the short backfire type described by Ehrenspeck (1967), with nominal gains of 13, 19, and 22 dB at 40, 140, and 360 MHz, respectively. Data recording and overall supervision of the receiver is carried out by a 16-bit minicomputer with 8 k of memory. Overall performance of the system is satisfactory. Sample data on the monthly median hourly values of the total electron content, plasmospheric content, and shape factor show distinct seasonal and diurnal variations.

Davies, K.↗

NASA NTRS1987

Flexible structure control laboratory development and technology demonstration

An experimental structure is described which was constructed to demonstrate and validate recent emerging technologies in the active control and identification of large flexible space structures. The configuration consists of a large, 20 foot diameter antenna-like flexible structure in the horizontal plane with a gimballed central hub, a flexible feed-boom assembly hanging from the hub, and 12 flexible ribs radiating outward. Fourteen electrodynamic force actuators mounted to the hub and to the individual ribs provide the means to excite the structure and exert control forces. Thirty permanently mounted sensors, including optical encoders and analog induction devices provide measurements of structural response at widely distributed points. An experimental remote optical sensor provides sixteen additional sensing channels. A computer samples the sensors, computes the control updates and sends commands to the actuators in real time, while simultaneously displaying selected outputs on a graphics terminal and saving them in memory. Several control experiments were conducted thus far and are documented. These include implementation of distributed parameter system control, model reference adaptive control, and static shape control. These experiments have demonstrated the successful implementation of state-of-the-art control approaches using actual hardware.

Vivian, H. C.↗

NASA NTRS1991

SEU hardened memory cells for a CCSDS Reed-Solomon encoder

A design technique to harden CMOS memory circuits against single event upset (SEU) in the space environment is reported. The design technique provides a recovery mechanism which is independent of the shape of the upsetting event. A RAM cell and flip-flop design are presented to demonstrate the method. The flip-flop was used in the control circuitry for a Reed-Solomon encoder designed for the Space Station and Explorer platforms.

Whitaker, Sterling↗

NASA NTRS1994

Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications

The straightforward automatic-differentiation and the hand-differentiated incremental iterative methods are interwoven to produce a hybrid scheme that captures some of the strengths of each strategy. With this compromise, discrete aerodynamic sensitivity derivatives are calculated with the efficient incremental iterative solution algorithm of the original flow code. Moreover, the principal advantage of automatic differentiation is retained (i.e., all complicated source code for the derivative calculations is constructed quickly with accuracy). The basic equations for second-order sensitivity derivatives are presented; four methods are compared. Each scheme requires that large systems are solved first for the first-order derivatives and, in all but one method, for the first-order adjoint variables. Of these latter three schemes, two require no solutions of large systems thereafter. For the other two for which additional systems are solved, the equations and solution procedures are analogous to those for the first order derivatives. From a practical viewpoint, implementation of the second-order methods is feasible only with software tools such as automatic differentiation, because of the extreme complexity and large number of terms. First- and second-order sensitivities are calculated accurately for two airfoil problems, including a turbulent flow example; both geometric-shape and flow-condition design variables are considered. Several methods are tested; results are compared on the basis of accuracy, computational time, and computer memory. For first-order derivatives, the hybrid incremental iterative scheme obtained with automatic differentiation is competitive with the best hand-differentiated method; for six independent variables, it is at least two to four times faster than central finite differences and requires only 60 percent more memory than the original code; the performance is expected to improve further in the future.

Taylor, Arthur C., III↗

DOE OSTI2018

A Flexible-blocking Based Approach for Performance Tuning of Matrix Multiplication Routines for Large Matrices with Edge Cases

Efficient and scalable matrix operations are being highly demanding in the recent era of Machine Learning, Deep Learning, and Big Data Analytics. The two commonly used matrix-matrix operations in the Basic Linear Algebra Subprograms (BLAS) specification are General Matrix-Matrix multiplication (GEMM) and Symmetric Rank-k update (SYRK). The SYRK routine is a specialization of the GEMM routine, where half of the multiplications are skipped as the resultant matrix is known to be symmetric. Fortunately, several linear algebra libraries implement these BLAS routines quite efficiently. The libraries usually partition the input matrices into blocks and place them in processor caches, thus improving performance by leveraging the caches. However, the contemporary libraries are highly optimized for squarish matrices, but the performance degrades significantly for the matrices with edge case (strictly thin or strictly fat shapes) in the multicore machine. The primary reason is that the current state-of-the-art libraries make fixed block shapes based on a processor architecture, and do not consider the shape of the input matrices. In this paper, we propose a new blocking approach, we name it Flexible-blocking, to mitigate the scalability issues. In contrast to the contemporary libraries, our approach formulates the blocks of the input matrices based on the shapes of the matrices as well as the number of threads used in the implementation. Our proposed technique shows noticeable performance improvement on multicore shared-memory machines for the edge case matrices.

Hossain, Md Mosharaf↗

NASA NTRS1989

An image compression algorithm for a high-resolution digital still camera

The Electronic Still Camera (ESC) project will provide for the capture and transmission of high-quality images without the use of film. The image quality will be superior to video and will approach the quality of 35mm film. The camera, which will have the same general shape and handling as a 35mm camera, will be able to send images to earth in near real-time. Images will be stored in computer memory (RAM) in removable cartridges readable by a computer. To save storage space, the image will be compressed and reconstructed at the time of viewing. Both lossless and loss-y image compression algorithms are studied, described, and compared.

Nerheim, Rosalee↗

DOE OSTI2022

Proximity Portability and in Transit , M-to-N Data Partitioning and Movement in SENSEI [Book Chapter]

In high-performance parallel in situ processing, the term in transit processing refers to those configurations where data must move from a producer to a consumer that runs on separate resources. In the context of parallel and distributed computing on an HPC platform one of the central challenges is to determine a mapping of data from producer ranks to consumer ranks. This problem is complicated by the heterogeneity that arises in producer-consumer pairs, such as when producer and consumer codes have different levels of concurrency, different scaling characteristics, or different data models. The resulting mapping and movement of data from M producer to N consumer ranks can have a significant impact on aggregate application performance, particularly when the data consumer requires only a subset of the overall data for its task. This chapter focuses on the design considerations that underlie SENSEI’s implementation to this challenging problem. These design considerations extend the core SENSEI architecture and include ideas like the need to accommodate flexibility in the choice of different partitioning methods, the ability for a data consumer to request and receive only the subset of data needed for its particular operation, and the ability to leverage any of several different data transport tools. The idea of proximity portability, being able to use different data transport methods as part of an in transit workflow, is illustrated through the use of three different transport layers where switching from one transport tool to another is accomplished with only a configuration file change. Here, the chapter also includes a performance analysis summary showing the performance gains that are possible in terms of multiple metrics, such as memory footprint, time to solution, and amount of data moved, when using optimized partitioners in an in transit setting, gains that are made possible by the implementation shaped by specific design considerations.

Bethel, E. Wes↗

DOE OSTI2025

GRAPH — an readout ASIC for large MCP based detectors

We present a programmable 16 channel, mixed signal, low power readout ASIC, having the project historically named Gigasample Recorder of Analog waveforms from a PHotodetector (GRAPH). It is designed to read large aperture single photon imaging detectors using micro channel plates for charge multiplication, and measuring the detector's response on crossed strips anodes to extrapolate the incoming photon position. Each channel consists of a fast, low power and low noise charge sensitive amplifier, which provides a myriad of coarse and fine programmable options for gain and shaping settings. Further, the amplified signal is recorded using, to our knowledge novel, the Hybrid Universal sampLing Architecture (HULA) ADC. A kind of mixed signal double buffer memory, that enables concurrent waveform recording, and selected event digitized data extraction. The sampling frequency is freely adjustable between few kHz up to 125 MHz, while the chip's internal digital memory holds a history 2048 samples for each channel, with a digital headroom of 12 bits. An optimized region of interest sample-read algorithm allows to extract the information just around the event pulse peak, while selecting the next event, thus substantially reducing the operational dead time. The chip is designed in 130 nm TSMC CMOS technology, and its power consumption is around 47 mW per channel.

47 OTHER INSTRUMENTATION↗

NASA NTRS1996

Frequency scanning capaciflector for capacitively determining the material properties

A capaciflector sensor system scanned in frequency is used to detect the permittivity of the material of an object being sensed. A capaciflector sensor element, coupled to current-measuring voltage follower circuitry, is driven by a frequency swept oscillator and generates an output which corresponds to capacity as a function of the input frequency. This swept frequency information is fed into apparatus e.g. a digital computer for comparing the shape of the capacitance vs. frequency curve against characteristic capacitor vs. frequency curves for a variety of different materials which are stored, for example, in a digital memory of the computer or a database. Using a technique of pattern matching, a determination is made as to the identification of the material. Also, when desirable, the distance between the sensor and the object can be determined.

Campbell, Charles E.↗

DOE OSTI2017

Critical current oscillations of elliptical Josephson junctions with single-domain ferromagnetic layers

We report that josephson junctions containing ferromagnetic layers are of considerable interest for the development of practical cryogenic memory and superconducting qubits. Such junctions exhibit a ground-state phase shift of π for certain ranges of ferromagnetic layer thicknesses. We present studies of Nb based micron-scale elliptically shaped Josephson junctions containing ferromagnetic barriers of Ni 81 Fe 19 or Ni 65 Fe 15 Co 20 . By applying an external magnetic field, the critical current of the junctions is found to follow characteristic Fraunhofer patterns and display sharp switching behavior suggestive of single-domain magnets. The high quality of the Fraunhofer patterns enables us to extract the maximum value of the critical current even when the peak is shifted significantly outside the range of the data due to the magnetic moment of the ferromagnetic layer. The maximum value of the critical current oscillates as a function of the ferromagnetic barrier thickness, indicating transitions in the phase difference across the junction between values of zero and π. Lastly, we compare the data to previous work and to models of the 0-π transitions based on existing theories.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS1996

Aerodynamic Shape Optimization of Supersonic Aircraft Configurations via an Adjoint Formulation on Parallel Computers

This work describes the application of a control theory-based aerodynamic shape optimization method to the problem of supersonic aircraft design. The design process is greatly accelerated through the use of both control theory and a parallel implementation on distributed memory computers. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods. The resulting problem is then implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) Standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on higher order computational fluid dynamics methods (CFD). In our earlier studies, the serial implementation of this design method was shown to be effective for the optimization of airfoils, wings, wing-bodies, and complex aircraft configurations using both the potential equation and the Euler equations. In our most recent paper, the Euler method was extended to treat complete aircraft configurations via a new multiblock implementation. Furthermore, during the same conference, we also presented preliminary results demonstrating that this basic methodology could be ported to distributed memory parallel computing architectures. In this paper, our concern will be to demonstrate that the combined power of these new technologies can be used routinely in an industrial design environment by applying it to the case study of the design of typical supersonic transport configurations. A particular difficulty of this test case is posed by the propulsion/airframe integration.

Reuther, James↗

NASA NTRS1996

Aerodynamic Shape Optimization of Supersonic Aircraft Configurations via an Adjoint Formulation on Parallel Computers

This work describes the application of a control theory-based aerodynamic shape optimization method to the problem of supersonic aircraft design. The design process is greatly accelerated through the use of both control theory and a parallel implementation on distributed memory computers. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods (13, 12, 44, 38). The resulting problem is then implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) Standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on higher order computational fluid dynamics methods (CFD). In our earlier studies, the serial implementation of this design method (19, 20, 21, 23, 39, 25, 40, 41, 42, 43, 9) was shown to be effective for the optimization of airfoils, wings, wing-bodies, and complex aircraft configurations using both the potential equation and the Euler equations (39, 25). In our most recent paper, the Euler method was extended to treat complete aircraft configurations via a new multiblock implementation. Furthermore, during the same conference, we also presented preliminary results demonstrating that the basic methodology could be ported to distributed memory parallel computing architectures [241. In this paper, our concem will be to demonstrate that the combined power of these new technologies can be used routinely in an industrial design environment by applying it to the case study of the design of typical supersonic transport configurations. A particular difficulty of this test case is posed by the propulsion/airframe integration.

Reuther, James↗

NASA NTRS2018

Comparison of Iced Aerodynamic Measurements on a Swept Wing from Two Wind Tunnels

Artificial ice shapes of various geometric fidelity were tested on a wing model based on the Common Research Model. Low Reynolds number tests were conducted at Wichita State University's Beech Memorial Wind Tunnel, and high Reynolds number tests were conducted at ONERA's F1 wind tunnel. The aerodynamic performance data from the two facilities were compared at matched or similar Reynolds and Mach number to ensure that the results and trends observed at low Reynolds number could be applied and continued to high Reynolds number. For both clean and iced configurations, the data from Wichita State University and F1 agreed well at matched or similar Reynolds and Mach numbers. The lift and pitching moment curves agreed very well for most configurations. There appeared to be 0.2-0.3deg offset in the angle of attack between the Wichita State University and F1 data, possibly due to different flow angularities in the test sections of the two facilities. There was also an offset in the drag values between the two facilities from an unknown cause. Overall, the data compared very well between the low Reynolds number test at Wichita State University tunnel and the high Reynolds number test at F1. This indicated that data from the low Reynolds number tests could be used to understand iced-swept-wing aerodynamics at high Reynolds number.

Federal Aviation Administration↗

NASA NTRS1981

An implicit marching procedure for the treatment of supersonic flow fields using the conservative full potential equation

A new aerodynamic prediction technique based on the conservative full potential equation is developed for the treatment of supersonic flow fields. This new technique bridges the gap between simplistic linear theory methods and complex Euler solvers. A novel local density linearization concept and a second order accurate retarded density scheme, both producing the correct artificial viscosity, are introduced in developing an implicit marching scheme for solving the scalar phi. The method produces results that compare well with Euler solvers and requires an order of magnitude less computer time and significantly less computer memory over existing nonlinear codes. The scalar phi formulation can be extended to handle subsonic pockets in the marching direction and also is suitable for developing inverse procedures where the shape corresponding to a prescribed loading is sought.

Shankar, V.↗

NASA NTRS2003

Sonoluminescence Bubble Measurements using Vision-Based Algorithms

Vision-based measurement methods were used to measure bubble sizes in this sonoluminescence experiment. Bubble imaging was accomplished by placing the bubble between a bright light source and a microscope-CCD camera system. A collimated light-emitting diode was operated in a pulsed model with an adjustable time delay with respect to the piezo-electric transducer drive signal. The light-emitting diode produced a bubble shadowgraph consisting of a multiple exposure made by numerous light pulses imaged onto a charge-couple device camera. Each image was transferred from the camera to a computer-controlled machine vision system via a frame grabber. The frame grabber was equipped with on-board memory to accomodate sequential image buffering while images were transferred to the host processor and analyzed. This configuration allowed the host computer to perform diameter measurements, centroid position measurements and shape estimation in "real-time" as the next image was being acquired. Bubble size measurement accuracy with an uncertainty of 3 microns was achieved using standard lenses and machine vision algorithms. Bubble centroid position accuracy was also within the 3 micron tolerance of the vision system. This uncertainty estimation accounted for the optical spatial resolution, digitization errors and the edge detection algorithm accuracy. The vision algorithms include camera calibration, thresholding, edge detection, edge position determination, distance between two edges computations and centroid position computations.

Hall, Nancy R.↗

NASA NTRS1977

Mask and display program

Program is used to create complex lines, shapes, circles and alpha-numeric characters rapidly and easily, and format them for use on some pattern generation. System is applicable as aid to designers of microelectronics, integrated optics, bubble memories and other devices requiring precise artwork.

Routh, D.↗

NASA NTRS1976

Computer-aided analysis of CCD linear image sensors

Special test equipment and techniques to collect and process image information from charge coupled devices (CCDs) by digital computer were reviewed. The video channel was traced from the CCD to the direct memory access bus of the Interdata Computer. Software was developed to evaluate and characterize a CCD for (1) dark signal versus temperature relationship, (2) calculation of temporal noise magnitude and noise shape for each pixel, (3) spatial noise into the video chain due to dark signal, (4) response versus illumination relationship (gamma), (5) response versus wavelength of illumination (spectral), (6) optimization of forcing functions, and (7) evaluation of an image viewed by a CCD. The basic software differences and specific examples of each program operating on real data are presented.

Prince, S. S.↗

NASA NTRS2004

A Scalable Nonuniform Pointer Analysis for Embedded Program

In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and elements of arrays. The main contribution consists of an efficient yet precise algorithm that can handle multithreaded programs. We first perform an inexpensive flow-sensitive analysis of each function in the program that generates semantic equations describing the effect of the function on the memory graph. These equations bear numerical constraints that describe nonuniform points-to relationships. We then iteratively solve these equations in order to obtain an abstract storage graph that describes the shape of data structures at every point of the program for all possible thread interleavings. We bring experimental evidence that this approach is tractable and precise for real-size embedded applications.

Venet, Arnaud↗