Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer 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 1,783 records · Page 99

Massively Parallel Latent Semantic Analyzes using a Graphics Processing Unit

Latent Semantic Indexing (LSA) aims to reduce the dimensions of large Term-Document datasets using Singular Value Decomposition. However, with the ever expanding size of data sets, current implementations are not fast enough to quickly and easily compute the results on a standard PC. The Graphics Processing Unit (GPU) can solve some highly parallel problems much faster than the traditional sequential processor (CPU). Thus, a deployable system using a GPU to speedup large-scale LSA processes would be a much more effective choice (in terms of cost/performance ratio) than using a computer cluster. Due to the GPU s application-specific architecture, harnessing the GPU s computational prowess for LSA is a great challenge. We present a parallel LSA implementation on the GPU, using NVIDIA Compute Unified Device Architecture and Compute Unified Basic Linear Algebra Subprograms. The performance of this implementation is compared to traditional LSA implementation on CPU using an optimized Basic Linear Algebra Subprograms library. After implementation, we discovered that the GPU version of the algorithm was twice as fast for large matrices (1000x1000 and above) that had dimensions not divisible by 16. For large matrices that did have dimensions divisible by 16, the GPU algorithm ran five to six times faster than the CPU version. The large variation is due to architectural benefits the GPU has for matrices divisible by 16. It should be noted that the overall speeds for the CPU version did not vary from relative normal when the matrix dimensions were divisible by 16. Further research is needed in order to produce a fully implementable version of LSA. With that in mind, the research we presented shows that the GPU is a viable option for increasing the speed of LSA, in terms of cost/performance ratio.

99 GENERAL AND MISCELLANEOUS↗

Comparing, optimizing, and benchmarking quantum-control algorithms in a unifying programming framework

For paving the way to novel applications in quantum simulation, computation, and technology, increasingly large quantum systems have to be steered with high precision. It is a typical task amenable to numerical optimal control to turn the time course of pulses, i.e., piecewise constant control amplitudes, iteratively into an optimized shape. Here, we present a comparative study of optimal-control algorithms for a wide range of finite-dimensional applications. We focus on the most commonly used algorithms: GRAPE methods which update all controls concurrently, and Krotov-type methods which do so sequentially. Guidelines for their use are given and open research questions are pointed out. Moreover, we introduce a unifying algorithmic framework, DYNAMO (dynamic optimization platform), designed to provide the quantum-technology community with a convenient matlab-based tool set for optimal control. In addition, it gives researchers in optimal-control techniques a framework for benchmarking and comparing newly proposed algorithms with the state of the art. It allows a mix-and-match approach with various types of gradients, update and step-size methods as well as subspace choices. Open-source code including examples is made available at http://qlib.info.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Software Package Using a Mesh-grid Method for Simulating HPGe Detector Efficiencies

Traditional ways of determining the absolute full-energy peak efficiencies of high-purity germanium (HPGe) detectors are often time consuming, cost prohibitive, or not feasible. A software package, KMESS (Kevin’s Mesh Efficiency Simulator Software), was developed to assist in predicting these efficiencies. It uses a semiempirical mesh-grid method and works for arbitrary source shapes and counting geometries. The model assumes that any gamma-ray source shape can be treated as a large enough collection of point sources. The code is readily adaptable, has a web-based graphical front-end, and could easily be coupled to a 3D scanner. As will be shown, this software can estimate absolute full-energy peak efficiencies with good accuracy in reasonable computation times. It has applications to the field of gamma-ray spectroscopy because it is a quick and accurate way to assist in performing quantitative analyses using HPGe detectors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Compiler-Assisted Detection of Transient Memory Errors

The probability of bit flips in hardware memory systems is projected to increase significantly as memory systems continue to scale in size and complexity. Effective hardware-based error detection and correction requires that the complete data path, involving all parts of the memory system, be protected with sufficient redundancy. First, this may be costly to employ on commodity computing platforms and second, even on high-end systems, protection against multi-bit errors may be lacking. Therefore, augmenting hardware error detection schemes with software techniques is of consider- able interest. In this paper, we consider software-level mechanisms to comprehensively detect transient memory faults. We develop novel compile-time algorithms to instrument application programs with checksum computation codes so as to detect memory errors. Unlike prior approaches that employ checksums on computational and architectural state, our scheme verifies every data access and works by tracking variables as they are produced and consumed. Experimental evaluation demonstrates that the proposed comprehensive error detection solution is viable as a completely software-only scheme. We also demonstrate that with limited hardware support, overheads of error detection can be further reduced.

def-use analysis↗

Theoretical Chemical Dynamics Studies of Elementary Combustion Reactions

The objective of this research was to develop and apply methods for more accurate predictions of reaction rates based on high-level quantum chemistry. We have developed and applied efficient, robust methods for fitting global ab initio potential energy surfaces (PESs) for both spectroscopy and dynamics calculations and for performing direct dynamics simulations. Our approach addresses the problem that high-level quantum calculations are often too costly in computer time for practical applications resulting in the use of levels of theory that are often inadequate for reactions. A critical objective was to develop practical methods that require the minimum number of electronic structure calculations for acceptable fidelity to the ab initio PES. Our method does this by a procedure that determines the optimal configurations at which ab initio points are computed, and that ensures that the final fitted PES is uniformly accurate to a prescribed tolerance. Our fitting methods can be done automatically, with little or no human intervention, and with no prior knowledge of the topology of the PES. The methods are based on local fitting schemes using interpolating moving least-squares (IMLS). IMLS has advantages over the very effective modified-Shepard methods developed by Collins and others in that higher-order polynomials can be used and does not require derivatives but can benefit from them if available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Knowns and unknowns in metabolomics identified by multidimensional NMR and hybrid MS/NMR methods

Metabolomics continues to make rapid progress through the development of new and better methods and their applications to gain insight into the metabolism of a wide range of different biological systems from a systems biology perspective. Customization of NMR databases and search tools allows the faster and more accurate identification of known metabolites, whereas the identification of unknowns, without a need for extensive purification, requires new strategies to integrate NMR with mass spectrometry, cheminformatics, and computational methods. For some applications, the use of covalent and non-covalent attachments in the form of labeled tags or nanoparticles can significantly reduce the complexity of these tasks.

Bingol, Kerem↗

Exascale workflow applications and middleware: An ExaWorks retrospective

Exascale computers offer transformative capabilities to combine data-driven and learning-based approaches with traditional simulation applications to accelerate scientific discovery and insight. However, these software combinations and integrations are difficult to achieve due to the challenges of coordinating and deploying heterogeneous software components on diverse and massive platforms. Here, we present the ExaWorks project, which addresses many of these challenges. We developed a workflow Software Development Toolkit (SDK), a curated collection of workflow technologies that can be composed and interoperated through a common interface, engineered following current best practices, and specifically designed to work on HPC platforms. ExaWorks also developed PSI/J, a job management abstraction API, to simplify the construction of portable software components and applications that can be used over various HPC schedulers. The PSI/J API is a minimal interface for submitting and monitoring jobs and their execution state across multiple and commonly used HPC schedulers. We also describe several leading and innovative workflow examples of ExaWorks tools used on DOE leadership platforms. Furthermore, we discuss how our project is working with the workflow community, large computing facilities, and HPC platform vendors to address the requirements of workflows sustainably at the exascale.

97 MATHEMATICS AND COMPUTING↗

Multiscale Structure of UXO Site Characterization: Spatial Estimation and Uncertainty Quantification

Unexploded ordnance (UXO) site characterization must consider both how the contamination is generated and how we observe that contamination. Within the generation and observation processes, dependence structures can be exploited at multiple scales. We describe a conceptual site characterization process, the dependence structures available at several scales, and consider their statistical estimation aspects. It is evident that most of the statistical methods that are needed to address the estimation problems are known but their application-specific implementation may not be available. We demonstrate estimation at one scale and propose a representation for site contamination intensity that takes full account of uncertainty, is flexible enough to answer regulatory requirements, and is a practical tool for managing detailed spatial site characterization and remediation. The representation is based on point process spatial estimation methods that require modern computational resources for practical application. These methods have provisions for including prior and covariate information.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Algorithm and Architecture Independent Benchmarking with SEAK

Many applications of high performance embedded computing are limited by performance or power bottlenecks. We have designed the Suite for Embedded Applications & Kernels (SEAK), a new benchmark suite, (a) to capture these bottlenecks in a way that encourages creative solutions; and (b) to facilitate rigorous, objective, end-user evaluation for their solutions. To avoid biasing solutions toward existing algorithms, SEAK benchmarks use a mission-centric (abstracted from a particular algorithm) and goal-oriented (functional) specification. To encourage solutions that are any combination of software or hardware, we use an end-user black-box evaluation that can capture tradeoffs between performance, power, accuracy, size, and weight. The tradeoffs are especially informative for procurement decisions. We call our benchmarks future proof because each mission-centric interface and evaluation remains useful despite shifting algorithmic preferences. It is challenging to create both concise and precise goal-oriented specifications for mission-centric problems. This paper describes the SEAK benchmark suite and presents an evaluation of sample solutions that highlights power and performance tradeoffs.

algorithms and kernels↗

Unobtrusive Sensor-Based Occupancy Facing Direction Detection and Tracking Using Advanced Machine Learning Algorithms

Facing direction detection plays a critical role in human-computer interaction and has a wide application in surveillance systems, driving awareness recognition, smart home appliances, computer games, and so on. Current detection methods are mainly focused on extracting specific patterns from user's optical images, which raises concerns on privacy invasion and these detection techniques do not usually work in a dark environment. To address these concerns, here this paper proposes an activity recognition system guided by an unobtrusive sensor (ARGUS). By using a low pixel infrared thermopile array sensor, ARGUS is capable of identifying five facing directions (left 45°/90°, right 45°/90°, and front) through the support vector machine classifier. Also two feature extraction methods are compared. One is manually-defined and the other is based on a pre-trained convolutional neural network (CNN) model. The facing direction detection accuracy resulting from manually-defined features reaches 85.3%, 90.6%, and 85.2% at detection distance of 0.6, 1.2, and 1.8 m, respectively. The level of accuracy resulted from using pre-trained CNN features demonstrates a much more reliable performance (89.1%, 95.3%, and 95.1% at distance of 0.6, 1.2, and 1.8 m, respectively). In addition, ARGUS has been successfully applied for occupancy tracking with a root mean square error of 0.19 m.

42 ENGINEERING↗

Performance on HPC Platforms Is Possible Without C++

Computing at large scales has become extremely challenging due to increasing heterogeneity in both hardware and software. More and more scientific workflows must tackle a range of scales and use machine learning and AI intertwined with more traditional numerical modeling methods, placing more demands on computational platforms. These constraints indicate a need to fundamentally rethink the way computational science is done and the tools that are needed to enable these complex workflows. The current set of C++-based solutions may not suffice, and relying exclusively upon C++ may not be the best option, especially because several newer languages and boutique solutions offer more robust design features to tackle the challenges of heterogeneity. In June 2023, we held a mini symposium that explored the use of newer languages and heterogeneity solutions that are not tied to C++ and that offer options beyond template metaprogramming and Parallel. For for performance and portability. In conclusion, we describe some of the presentations and discussion from the mini symposium in this article.

97 MATHEMATICS AND COMPUTING↗

From Reproducible Edge–Cloud Experimentation to Real-World Practice: The E2Clab Experience

Reproducibility is already difficult in distributed systems; on the computing continuum, it becomes substantially harder. Applications that span sensing devices, edge and fog resources, and cloud platforms must be evaluated across heterogeneous hardware, variable network conditions, cross-layer orchestration decisions, and long-running workflow lifecycles. We use E2Clab as a case study to examine these challenges and their implications for experimental methodology. We explain why reproducible experimentation is harder on the continuum, then revisit E2Clab as an initial response based on explicit modeling of infrastructure, workflow lifecycle, and artifacts. Lastly, we discuss how its evolution toward more realistic application settings can be understood through the lens of Translational Computer Science. We argue that reproducible continuum experimentation requires methods that are rigorous enough for research while remaining adaptable to real-world practice.

42 ENGINEERING↗

Next Generation, Explicitly Correlated Electronic Structure Methods

All common wave function methods of electronic structure theory have a fundamental and troublesome flaw: the inability to correctly describe the exact mathematical cusp behavior of many-electron wave functions in the vicinity of coalescence points (Coulomb singularities), and hence to fully account for instantaneous, short-range correlation among electrons. To achieve high thermochemical accuracy, next-generation methodologies were needed that solve the electron cusp problem by explicitly incorporating interelectronic variables (r 12 ) into molecular wave functions. We pursued a long-term research program to develop practical explicitly-correlated methods, to create attendant, freely available, state-of-the-art computer codes, and to undertake chemical applications of unprecedented size. Our work allows conventional CCSD(T) computations to be conjoined with explicitly-correlated second-order perturbation methods within a focal point extrapolation scheme for pinpointing the ab initio limit of electronic structure theory.

99 GENERAL AND MISCELLANEOUS↗

Energetic Light Fragment Production Capability in MCNP6

Monte Carlo Methods, Codes, and Applications group within the Computational Physics Division at Los Alamos National Laboratory has led the development of the transport code MCNP6 (Monte Carlo N-Particle transport code, version 6). MCNP6 is a general-purpose, continuous energy, generalized-geometry, time-dependent, Monte-Carlo radiation-transport code designed to track many particle types over broad ranges of energies. It is used around the world in applications ranging from radiation protection and dosimetry, nuclear-reactor design, nuclear criticality safety, detector design and analysis, decontamination and decommissioning, accelerator applications, medical physics, space research, and beyond. At lower energies, the code uses tables of evaluated nuclear data, while for higher energies (> 150 MeV), MCNP6 uses the cascade-exciton model, version 03.03 (CEM03.03), and the Los Alamos quark-gluon string model, version 03.03 (LAQGSM03.03) to model nuclear reactions. Emission of energetic heavy clusters heavier than {sup 4}He from nuclear reactions play a critical role in several applications, including electronics performance in space, human radiation dosages in space or other extreme radiation environments, proton- and hadron-therapy in medical physics, accelerator and shielding applications, and more. None of the available models are able to accurately predict emission of light fragments (LF) from arbitrary reactions. The CEM and LAQGSM event generators in MCNP6 describe quite well the spectra of fragments with sizes up to {sup 4}He across a broad range of target masses and incident energies (up to ∼ 5 GeV for CEM and up to ∼ 1 TeV/A for LAQGSM). However, they do not predict the high-energy tails of LF spectra heavier than {sup 4}He well. Most LF with energies above several tens of MeV are emitted during the precompound stage of a reaction. The 03.03 versions of CEM and LAQGSM do not account for precompound emission of LF larger than {sup 4}He. The goal of this research is to enable MCNP6 to produce high-energy light fragments. These energetic LF may be emitted by our models through three processes: Fermi breakup, preequilibrium, and coalescence. We explore the emission of light fragments through each of these mechanisms and demonstrate an improved agreement with experimental data achieved by extending precompound models to include emission of fragments heavier than {sup 4}He. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A cloud computing approach to massively-parallel distributed stochastic optimization with application to geomechanical reservoir characterization

Many search strategies used to optimize parameters during hydrologic model calibration are inherently limited in that simulations must be performed sequentially in order for the algorithm to converge. As a result, the overall time required to reach a solution increases linearly with the number of steps necessary. In contrast, sampling strategies that attempt to approximate the posterior distribution of the parameters do not require the model simulations to be run in sequence and therefore invite the use of a massively parallel approach across heterogeneous computing environments. We apply a cloud computing methodology to this problem where a head node running on Amazon Web Services continuously produces candidate models that are distributed to arbitrary compute environments to run the simulation, in our case Clemson’s Palmetto cluster computer. Thus the time required to obtain a sufficient number of samples to produce an adequate approximation of the posterior distribution of the parameters is limited by the number of available compute sites. Monte Carlo sampling of the posterior space would be duplicative and inefficient, thus we combine Latin hypercube methods with genetic algorithms to ensure that no large regions of the parameter space are left unexplored, and that high probability regions are investigated thoroughly. We independently assess the fit to different types of data sets without the need to construct a single objective function. Sets of Pareto optimal models are particularly valuable when the quality and information content of data is poorly known or conceptual model errors exist in our simulation. We illustrate our approach for a problem where in situ strain data are used to calibrate the parameters of an oil reservoir in the Avant oil field in Oklahoma. We use well injection and shut-in to stress a deep (500m) confined formation, and observe the geomechanical response using borehole strainmeters installed in the shallow subsurface (30m). These data were then used to calibrate the poroelastic properties of the reservoir and caprock along with the geometry of an elliptic channel associated with the formation. Using our approach we are able to identify issues with model error as well as substantial tradeoffs that occur within the parameters.

inversion, stochastic, geomechanics, poroelastic, ↗

Induced p-wave superfluidity in two dimensions: Brane world in cold atoms and nonrelativistic defect CFTs

We propose to use a two-species Fermi gas with the interspecies s-wave Feshbach resonance to realize p-wave superfluidity in two dimensions. By confining one species of fermions in a two-dimensional plane immersed in the background three-dimensional Fermi sea of the other species, an attractive interaction is induced between two-dimensional fermions. We compute the pairing gap in the weak-coupling regime and show that it has the symmetry of p{sub x}+ip{sub y}. Because the magnitude of the pairing gap increases toward the unitarity limit, it is possible that the critical temperature for the p{sub x}+ip{sub y}-wave superfluidity becomes within experimental reach. The resulting system has a potential application to topological quantum computation using vortices with non-Abelian statistics. We also discuss aspects of our system in the unitarity limit as a 'nonrelativistic defect conformal field theory (CFT)'. The reduced Schroedinger algebra, operator-state correspondence, scaling dimensions of composite operators, and operator product expansions are investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SIPMaP: A Tool for Modeling Irregular Parallel Computations in the Super Instruction Architecture

Performance modeling is becoming an increasingly important part of the parallel application development process, particularly for expensive computations that will be run on very high-end systems where resources are scarce. We describe a performance modeling tool SIPMaP (Super Instruction Processor Modeling and Prediction) developed for the Super-Instruction Architecture (SIA). The SIA is designed for applications where the dominant data structures are large multi-dimensional arrays and it comprises a DSL, the Super-Instruction Assembly Language (SIAL) that supports expressing algorithms in terms of blocks (tiles), and its runtime system Super Instruction Processor (SIP) that manages distribution and disk storage of the arrays. SIPMaP generates performance models from the SIAL source code. In comparison with many applications where useful performance models have been developed and reported, these programs are irregular and have other difficult to model characteristics such as extensive overlapping of communication and computation.

Computer Science↗

Precise and Fast Computation of the Gravitational Field of a General Finite Body and Its Application to the Gravitational Study of Asteroid Eros

In order to obtain the gravitational field of a general finite body inside its Brillouin sphere, we developed a new method to compute the field accurately. First, the body is assumed to consist of some layers in a certain spherical polar coordinate system and the volume mass density of each layer is expanded as a Maclaurin series of the radial coordinate. Second, the line integral with respect to the radial coordinate is analytically evaluated in a closed form. Third, the resulting surface integrals are numerically integrated by the split quadrature method using the double exponential rule. Finally, the associated gravitational acceleration vector is obtained by numerically differentiating the numerically integrated potential. Numerical experiments confirmed that the new method is capable of computing the gravitational field independently of the location of the evaluation point, namely whether inside, on the surface of, or outside the body. It can also provide sufficiently precise field values, say of 14–15 digits for the potential and of 9–10 digits for the acceleration. Furthermore, its computational efficiency is better than that of the polyhedron approximation. This is because the computational error of the new method decreases much faster than that of the polyhedron models when the number of required transcendental function calls increases. As an application, we obtained the gravitational field of 433 Eros from its shape model expressed as the 24 × 24 spherical harmonic expansion by assuming homogeneity of the object.

79 ASTRONOMY AND ASTROPHYSICS↗