Search NASA⌕ Search

SEARCH · Search NASA

Results for “Science Applications”

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 631 records · Page 35

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

MEASUREMENT OF THE TRANSVERSE BEAM DYNAMICS IN A TESLA-TYPE SUPERCONDUCTING CAVITY

Superconducting linacs are capable of producing intense, ultra-stable, high-quality electron beams that have widespread applications in Science and Industry. Many project are based on the 1.3-GHz TESLA-type superconducting cavity. In this paper we provide an update on a recent experiment aimed at measuring the transfer matrix of a TESLA cavity at the Fermilab Accelerator Science and Technology (FAST) facility. The results are discussed and compared with analytical and numerical simulations.

Halavanau, A.↗

COMMISSIONING AND FIRST RESULTS FROM CHANNELING RADIATION AT FAST

X-rays have widespread applications in science and industry, but developing a simple, compact, and high-quality X-ray source remains a challenge. Our collaboration has explored the possible use of channeling radiation driven by a 50 MeV low-emittance electron beam to produce narrowband hard X-rays with photon energy of 40 to 140 keV [8,9,11]. Here we present the simulated X-ray spectra including the background bremsstrahlung contribution, and a description of the required optimization of the relevant electron-beam parameters necessary to maximize brilliance of the resulting X-ray beam. Results are presented from our test of this, carried out at the Fermilab Accelerator Science & Technology (FAST) facility’s 50-MeV low-energy electron injector. As a result of the beam parameters, made possible by the photo-injector based SRF linac, the average brilliance at FAST was expected to be about one order of magnitude higher than that in previous experiments.

43 PARTICLE ACCELERATORS↗

Feature-based Data Assimilation in Geophysics

Many applications in science require that computational models and data be combined. In a Bayesian framework, this is usually done by denying likelihoods based on the mismatch of model outputs and data. However, matching model outputs and data in this way can be unnecessary or impossible. Using large amounts of steady state data is unnecessary because these data are redundant. It is impossible to assimilate data of complex systems into low-dimensional models, or to assimilate data, collected over long time scales, into chaotic models. One can address these issues by denying likelihoods based on suitable low-dimensional \features" of the data, rather than by the mismatch of model output and \raw" data. Our goal is to contribute to a more fundamental understanding of such a feature-based approach to data assimilation. We present noise models based on perturbed observations to de ne feature-based likelihood functions that lead to computationally efficient solutions. We also explain how a feature-based approach enables us to effectively assimilate selected aspects of data into models, and how this can be interpreted by a reduction in effective dimension. Numerical implementation of these ideas are illustrated in four examples.

97 MATHEMATICS AND COMPUTING↗

Modification on Surface Oxide Layer Structure and Surface Morphology of Niobium by GCIB Treatments

Recently, it was demonstrated1 that significant reductions in field emission on Nb surfaces could be achieved by means of a new surface treatment technique called gas cluster ion beam (GCIB). Further study revealed that GCIB treatments could also modify surface irregularities and remove surface asperities leading to a smoother surface finish as demonstrated through measurements using a 3-D profilometer, an atomic force microscope, and a scanning electron microscope. These experimental observations were supported by computer simulation via atomistic molecular dynamics and a phenomenological surface dynamics. Measurements employing a secondary ion mass spectrometry found that GCIB could also alter Nb surface oxide layer structure. Possible implications of the experimental results on the performance of Nb superconducting radio frequency cavities treated by GCIB will be discussed. 1: A.T. Wu et al, invited contribution to the book ?Neural Computation and Particle Accelerators: Research, Technology, and Applications?, NOVA Science Publishers, New York, USA, 2009, In press

Wu, Andy↗

Accelerating Genome Sequencing 100-1000X with FPGAs

The performance of FPGAs on Cray XD1 and SGI/RASC systems (with Virtex-II Pro 50 and Virtex-4 LX160 FPGAs) was evaluated for human genome sequencing using FASTA1 and BLAST2, respectively. Scalable speedups of 100X for a Virtex-4 FPGA (and exceeding 1000X for multiple FPGAs) over a 2.2 GHz Opteron were achieved. Similar FPGA speedups were achieved using BLAST on a SGI/RASC system at Oak Ridge National Laboratory.

42 ENGINEERING↗