Search NASA⌕ Search

SEARCH · Search NASA

Results for “computers”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2011

Comparison of Computed Tomography Scout Based Reference Point Localization to Conventional Film and Axial Computed Tomography

Identification of source positions after implantation is an important step in brachytherapy planning. Reconstruction is traditionally performed from films taken by conventional simulators, but these are gradually being replaced in the clinic by computed tomography (CT) simulators. The present study explored the use of a scout image-based reconstruction algorithm that replaces the use of traditional film, while exhibiting low sensitivity to metal-induced artifacts that can appear in 3D CT methods. In addition, the accuracy of an in-house graphical software implementation of scout-based reconstruction was compared with seed location reconstructions for 2 phantoms by conventional simulator and CT measurements. One phantom was constructed using a planar fixed grid of 1.5-mm diameter ball bearings (BBs) with 40-mm spacing. The second was a Fletcher-Suit applicator embedded in Styrofoam (Dow Chemical Co., Midland, MI) with one 3.2-mm-diameter BB inserted into each of 6 surrounding holes. Conventional simulator, kilovoltage CT (kVCT), megavoltage CT, and scout-based methods were evaluated by their ability to calculate the distance between seeds (40 mm for the fixed grid, 30-120 mm in Fletcher-Suit). All methods were able to reconstruct the fixed grid distances with an average deviation of <1%. The worst single deviations (approximately 6%) were exhibited in the 2 volumetric CT methods. In the Fletcher-Suit phantom, the intermodality agreement was within approximately 3%, with the conventional sim measuring marginally larger distances, with kVCT the smallest. All of the established reconstruction methods exhibited similar abilities to detect the distances between BBs. The 3D CT-based methods, with lower axial resolution, showed more variation, particularly with the smaller BBs. With a software implementation, scout-based reconstruction is an appealing approach because it simplifies data acquisition over film-based reconstruction without requiring any specialized equipment and does not carry risk of misreads caused by artifacts.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2022

Sub 20 cm -1 computational prediction of the CH bond energy – a case of systematic error in computational thermochemistry

Here, the bond dissociation energy of methylidyne, D 0 (CH), is studied using an improved version of the High-Accuracy Extrapolated ab initio Thermochemistry (HEAT) approach as well as the Feller–Peterson–Dixon (FPD) model chemistry. These calculations, which include basis sets up to nonuple (aug-cc-pCV9Z) quality, are expected to be capable of providing results substantially more accurate than the ca. 1 kJ mol -1 level that is characteristic of standard high-accuracy protocols for computational thermochemistry. The calculated 0 K CH bond energy (27 954 ± 15 cm -1 for HEAT and 27 956 ± 15 cm -1 for FPD), along with equivalent treatments of the CH ionization energy and the CH + dissociation energy (85 829 ± 15 cm -1 and 32 946 ± 15 cm -1 , respectively), were compared to the existing benchmarks from Active Thermochemical Tables (ATcT), uncovering an unexpected difference for D 0 (CH). This has prompted a detailed reexamination of the provenance of the corresponding ATcT benchmark, allowing the discovery and subsequent correction of a systematic error present in several published high-level calculations, ultimately yielding an amended ATcT benchmark for D 0 (CH). Finally, the current theoretical results were added to the ATcT Thermochemical Network, producing refined ATcT estimates of 27 957.3 ± 6.0 cm -1 for D0(CH), 32 946.7 ± 0.6 cm -1 for D 0 (CH + ), and 85 831.0 ± 6.0 cm -1 for IE(CH).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2013

Computational analysis of a pipe flow distributor for a thermocline based thermal energy storage system

In this paper, the overall efficiency of a concentrating solar power (CSP) plant depends on the effectiveness of thermal energy storage (TES) system. A single tank TES system consists of a thermocline region which produces the temperature gradient between hot and cold storage fluid by density difference. Preservation of this thermocline region in the tank during charging and discharging cycles depends on the uniformity of the velocity profile at any horizontal plane. Our objective is to maximize the uniformity of the velocity distribution using a pipe-network distributor by varying the number of holes, distance between the holes, position of the holes and number of distributor pipes. For simplicity, we consider that the diameter of the inlet, main pipe, the distributor pipes and the height and the width of the tank are constant. We use Hitec ® molten salt as the storage medium and the commercial software Gambit 2.4.6 and Fluent 6.3 for the computational analysis. We analyze the standard deviation in the velocity field and compare the deviations at different positions of the tank height for different configurations. Since the distance of the holes from the inlet and their respective arrangements affects the flow distribution throughout the tank; we investigate the impacts of rearranging the holes position on flow distribution. Impact of the number of holes and distributor pipes are also analyzed. We analyze our findings to determine a configuration for the best case scenario.

14 SOLAR ENERGY↗
DOE OSTI2015

Large-scale compute-intensive analysis via a combined in-situ and co-scheduling workflow approach, In: SC '15 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

Large-scale simulations can produce hundreds of terabytes to petabytes of data, complicating and limiting the efficiency of workflows. Traditionally, outputs are stored on the file system and analyzed in post-processing. With the rapidly increasing size and complexity of simulations, this approach faces an uncertain future. Trending techniques consist of performing the analysis in-situ, utilizing the same resources as the simulation, and/or off-loading subsets of the data to a compute-intensive analysis system. We introduce an analysis framework developed for HACC, a cosmological N-body code, that uses both in-situ and co-scheduling approaches for handling petabyte-scale outputs. We compare different analysis set-ups ranging from purely off-line, to purely in-situ to in-situ/co-scheduling. The analysis routines are implemented using the PISTON/VTK-m framework, allowing a single implementation of an algorithm that simultaneously targets a variety of GPU, multi-core, and many-core architectures.

Computer Science↗
DOE OSTI2015

2015 Neuro-Inspired Computational Elements (NICE) Workshop: Information Processing and Computation Systems beyond von Neumann/Turing Architecture and Moore’s Law Limits (Summary Report)

The third Neuro-Inspired Computational Elements (NICE) Workshop was held February 23-25, 2015 in Albuquerque, New Mexico. The goal of the Workshop was to bring together researchers from different scientific disciplines and application areas to provide a common point from which to develop the next generation of information processing/computing architectures that go beyond stored program architecture and Moore’s Law limits.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

A Computer Program for the Computation of Running Gear Temperatures Using Green's Function

A new technique has been developed to study two dimensional heat transfer problems in gears. This technique consists of transforming the heat equation into a line integral equation with the use of Green's theorem. The equation is then expressed in terms of eigenfunctions that satisfy the Helmholtz equation, and their corresponding eigenvalues for an arbitrarily shaped region of interest. The eigenfunction are obtalned by solving an intergral equation. Once the eigenfunctions are found, the temperature is expanded in terms of the eigenfunctions with unknown time dependent coefficients that can be solved by using Runge Kutta methods. The time integration is extremely efficient. Therefore, any changes in the time dependent coefficients or source terms in the boundary conditions do not impose a great computational burden on the user. The method is demonstrated by applying it to a sample gear tooth. Temperature histories at representative surface locatons are given.

GREENS FUNCTIONS↗
DOE OSTI2012

Computationally Efficient Use of Derivatives in Emulation of Complex Computational Models

We will investigate the use of derivative information in complex computer model emulation when the correlation function is of the compactly supported Bohman class. To this end, a Gaussian process model similar to that used by Kaufman et al. (2011) is extended to a situation where first partial derivatives in each dimension are calculated at each input site (i.e. using gradients). A simulation study in the ten-dimensional case is conducted to assess the utility of the Bohman correlation function against strictly positive correlation functions when a high degree of sparsity is induced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Low latency, high bandwidth data communications between compute nodes in a parallel computer

Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Low latency, high bandwidth data communications between compute nodes in a parallel computer

Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Low latency, high bandwidth data communications between compute nodes in a parallel computer

Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

97 MATHEMATICS AND COMPUTING↗