Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
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 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↗
DOE OSTI2015

Self-pacing direct memory access data transfer operations for compute nodes in a parallel computer

Methods, apparatus, and products are disclosed for self-pacing DMA data transfer operations for nodes in a parallel computer that include: transferring, by an origin DMA on an origin node, a RTS message to a target node, the RTS message specifying an message on the origin node for transfer to the target node; receiving, in an origin injection FIFO for the origin DMA from a target DMA on the target node in response to transferring the RTS message, a target RGET descriptor followed by a DMA transfer operation descriptor, the DMA descriptor for transmitting a message portion to the target node, the target RGET descriptor specifying an origin RGET descriptor on the origin node that specifies an additional DMA descriptor for transmitting an additional message portion to the target node; processing, by the origin DMA, the target RGET descriptor; and processing, by the origin DMA, the DMA transfer operation descriptor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Transforming Energy through Computational Excellence. Exascale Computing: Combustion; Simulating Effects of Fuel Injection Location in Supersonic Jet Engines

Computational tractable simulations using an adaptive-mesh-refinement solverfor compressible reacting flows help researchers understand how variations in fuel injection location within the supersonic flow cavity impacts combustion efficiency. By identifying the important physical determinants of the combustion processes, this study shows a promising pathway to improving flame stability and combustion efficiency, as well as reducing emissions.

adaptive mesh refinement↗
DOE OSTI2015

Image Registration of Cone-Beam Computer Tomography and Preprocedural Computer Tomography Aids in Localization of Adrenal Veins and Decreasing Radiation Dose in Adrenal Vein Sampling

PurposeWe assessed whether image registration of cone-beam computed tomography (CT) (CBCT) and contrast-enhanced CT (CE-CT) images indicating the locations of the adrenal veins can aid in increasing the success rate of first-attempts adrenal vein sampling (AVS) and therefore decreasing patient radiation dose.Materials and Methods CBCT scans were acquired in the interventional suite (Philips Allura Xper FD20) and rigidly registered to the vertebra in previously acquired CE-CT. Adrenal vein locations were marked on the CT image and superimposed with live fluoroscopy and digital-subtraction angiography (DSA) to guide the AVS. Seventeen first attempts at AVS were performed with image registration and retrospectively compared with 15 first attempts without image registration performed earlier by the same 2 interventional radiologists. First-attempt AVS was considered successful when both adrenal vein samples showed representative cortisol levels. Sampling time, dose-area product (DAP), number of DSA runs, fluoroscopy time, and skin dose were recorded.ResultsWithout image registration, the first attempt at sampling was successful in 8 of 15 procedures indicating a success rate of 53.3 %. This increased to 76.5 % (13 of 17) by adding CBCT and CE-CT image registration to AVS procedures (p = 0.266). DAP values (p = 0.001) and DSA runs (p = 0.026) decreased significantly by adding image registration guidance. Sampling and fluoroscopy times and skin dose showed no significant changes.ConclusionGuidance based on registration of CBCT and previously acquired diagnostic CE-CT can aid in enhancing localization of the adrenal veins thereby increasing the success rate of first-attempt AVS with a significant decrease in the number of used DSA runs and, consequently, radiation dose required.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2021

Computational study of the effect of core–skin structure on the mechanical properties of carbon nanofibers

The effect of the core–skin structure on the mechanical properties of carbon nanofibers is investigated in large-scale molecular dynamics simulations of tensile deformation of carbon nanofibers with the core–skin and homogeneous structures. Contrary to an established notion of the deleterious effect of the skin layer on the strength of carbon fibers, the presence of a high-quality skin layer is found to increase both the Young’s modulus and tensile strength of the nanofiber. A detailed analysis of the fracture process indicates that the nanofiber strengthening is related to the ability of skin layer to suppress crack nucleation at the core–skin interface. Furthermore, the computational predictions suggest that the design of new approaches to carbon fiber manufacturing and processing leading to the generation of a high-quality skin layer while avoiding the introduction of structural defects at the core–skin interface may yield a significant enhancement of the mechanical properties of carbon fibers.

36 MATERIALS SCIENCE↗
DOE OSTI2017

astroABC : An Approximate Bayesian Computation Sequential Monte Carlo sampler for cosmological parameter estimation

Given the complexity of modern cosmological parameter inference where we arefaced with non-Gaussian data and noise, correlated systematics and multi-probecorrelated data sets, the Approximate Bayesian Computation (ABC) method is apromising alternative to traditional Markov Chain Monte Carlo approaches in thecase where the Likelihood is intractable or unknown. The ABC method is called"Likelihood free" as it avoids explicit evaluation of the Likelihood by using aforward model simulation of the data which can include systematics. Weintroduce astroABC, an open source ABC Sequential Monte Carlo (SMC) sampler forparameter estimation. A key challenge in astrophysics is the efficient use oflarge multi-probe datasets to constrain high dimensional, possibly correlatedparameter spaces. With this in mind astroABC allows for massive parallelizationusing MPI, a framework that handles spawning of jobs across multiple nodes. Akey new feature of astroABC is the ability to create MPI groups with differentcommunicators, one for the sampler and several others for the forward modelsimulation, which speeds up sampling time considerably. For smaller jobs thePython multiprocessing option is also available. Other key features include: aSequential Monte Carlo sampler, a method for iteratively adapting tolerancelevels, local covariance estimate using scikit-learn's KDTree, modules forspecifying optimal covariance matrix for a component-wise or multivariatenormal perturbation kernel, output and restart files are backed up everyiteration, user defined metric and simulation methods, a module for specifyingheterogeneous parameter priors including non-standard prior PDFs, a module forspecifying a constant, linear, log or exponential tolerance level,well-documented examples and sample scripts. This code is hosted online athttps://github.com/EliseJ/astroABC

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2014

The role of histone tails in the nucleosome: A computational study

Histone tails play an important role in gene transcription and expression. We present here a systematic computational study of the role of histone tails in the nucleosome, using replica exchange molecular dynamics simulations with an implicit solvent model and different well-established force fields. We performed simulations for all four histone tails, H4, H3, H2A, and H2B, isolated and with inclusion of the nucleosome. The results confirm predictions of previous theoretical studies for the secondary structure of the isolated tails but show a strong dependence on the force field used. In the presence of the entire nucleosome for all force fields, the secondary structure of the histone tails is destabilized. Specific contacts are found between charged lysine and arginine residues and DNA phosphate groups and other binding sites in the minor and major DNA grooves. Using cluster analysis, we found a single dominant configuration of binding to DNA for the H4 and H2A histone tails, whereas H3 and H2B show multiple binding configurations with an equal probability. The leading stabilizing contribution for those binding configurations is the attractive interaction between the positively charged lysine and arginine residues and the negatively charged phosphate groups, and thus the resulting charge neutralization. Lastly, we present results of molecular dynamics simulations in explicit solvent to confirm our conclusions. Results from both implicit and explicit solvent models show that large portions of the histone tails are not bound to DNA, supporting the complex role of these tails in gene transcription and expression and making them possible candidates for binding sites of transcription factors, enzymes, and other proteins.

59 BASIC BIOLOGICAL SCIENCES↗