SEARCH · Engineering Papers
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.
A system of fracturing a geological formation penetrated by a borehole. At least one borehole is drilled into or proximate the geological formation. An energetic charge is placed in the borehole. The energetic charge is detonated fracturing the geological formation.
Abstract not provided.
Abstract not provided.
In the present work, quantum clustering is extended to provide a dynamical approach for data clustering using a time-dependent Schrodinger equation. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering. Additionally, the parameters of the analysis can be modified in order to improve the efficiency of the dynamic quantum clustering processes.
Abstract not provided.
Abstract not provided.
A method for optimization of photonic devices is disclosed. The method includes receiving a set of unconstrained latent variables; mapping the set of unconstrained latent variables to a constrained space to generate a constrained device; calculating the permittivity across each element of the constrained device; determining a permittivity-constrained width gradient based at least partially on the permittivity across each element; and optimizing the set of unconstrained latent variables by at least partially using the permittivity-constrained width gradient.
The existing methods that determine heliostat aiming strategies for concentrating solar power (CSP) central receiver plants typically use heuristics and/or are computationally expensive, and they lack flexibility for different desired flux profiles and receiver geometries. Because of the interaction between layout and aimpoint strategy, considering the former without accounting for the latter may yield solutions with superfluous heliostats that cannot be used efficiently without compromising receiver flux constraints. To that end, we develop a software decision tool that uses innovative optimization methods to both optimize aimpoint strategies and improve candidate layouts for the solar collection field of a CSP central receiver plant. A CSP plant’s effectiveness relies on the optical efficiency of the solar field, which may be limited by losses due to (i) the cosine effect, (ii) atmospheric attenuation, (iii) interference (i.e., shading and blocking) between heliostats, (iv) spillage as a result of heliostat positioning and geometry, and (iv) some heliostats’ inability to direct irradiance to the receiver without damage due to excessive thermal flux. The goal of this work is to obtain optimized aiming strategies and improved solar field layouts that reduce capital cost and increase field optical efficiency and utilization, while meeting the power requirements of a given CSP receiver design. We formulate the aimpoint optimization problem as a mixed-integer linear programming model, which we then decompose into submodels that we solve in parallel. The decomposition subdivides the solar field into sections, and aimpoint strategies for each section are obtained independently of the others. To improve existing layouts, we develop a utilization-weighted efficiency metric that we use to relocate heliostats to sections of the solar field with similar efficiency and higher utilization. Finally, to connect our software to high-fidelity flux models, we develop a Python application programming interface for SolarPILOT, a mature software package that characterizes solar field performance and generates the heliostat layouts and flux maps that serve as input to our models.
Metaproteomics is a powerful tool for the characterization of metabolism, physiology, and functional interactions in microbial communities, including plant-associated microbiota. However, the metaproteomic methods that have been used to study plant-associated microbiota are very laborious and require large amounts of plant tissue, hindering wider application of these methods. We optimized and evaluated different protein extraction methods for metaproteomics of plant-associated microbiota in two different plant species (Arabidopsis and maize). Our main goal was to identify a method that would work with low amounts of input material (40 to 70 mg) and that would maximize the number of identified microbial proteins. We tested eight protocols, each comprising a different combination of physical lysis method, extraction buffer, and cell-enrichment method on roots from plants grown with synthetic microbial communities. We assessed the performance of the extraction protocols by liquid chromatography-tandem mass spectrometry–based metaproteomics and found that the optimal extraction method differed between the two species. For Arabidopsis roots, protein extraction by beating whole roots with small beads provided the greatest number of identified microbial proteins and improved the identification of proteins from gram-positive bacteria. For maize, vortexing root pieces in the presence of large glass beads yielded the greatest number of microbial proteins identified. Based on these data, we recommend the use of these two methods for metaproteomics with Arabidopsis and maize. Furthermore, detailed descriptions of the eight tested protocols will enable future optimization of protein extraction for metaproteomics in other dicot and monocot plants.
Monte Carlo (MC) radiation transport simulations, like those performed using Monte Carlo N-Particle (MCNP), can be highly accurate but require time to reduce the statistical uncertainties in the calculated detector response(s). Many different 'variance reduction' techniques devised over the years increase the efficiency of MC calculations, but these methods can be more art than science. Many of these methods are problem specific or require careful tuning of parameters for good performance. One of the best variance reduction methods, in terms of both reliable performance increases and ease of use, is the use of weight windows. Weight windows are derived from an importance map in space and energy that allows the transport code to focus more simulation time on particles that have a higher likelihood of being important to the final detector response. Less time is spent simulating particles that have little chance of making a contribution to the detector response. MCNP already includes the abilities to generate and use weight windows. Unfortunately, generating weight windows can take a very long time, perhaps longer than the original problem. Oak Ridge National Laboratory has led the development of hybrid methods using a discrete ordinates adjoint calculation to quickly develop an importance map (weight windows) for use in a Monte Carlo code. The Consistent Adjoint Driven Importance Sampling (CADIS) method uses an adjoint calculation to develop both an importance map and a biased source distribution that work together. This method is reasonably automatic, is easy to use, and has been implemented in the Automated Variance reduction Generator (ADVANTG) package that works with MCNP5. ADVANTG reads an MCNP input file and a small amount of extra user information and then runs an adjoint deterministic calculation using Denovo. The importance map and biased source distribution derived from the CADIS method can then be incorporated back into the original MCNP input file to enhance the figure-of-merit (FOM) of the calculation. The FOM is a measure of the efficiency of the calculation using the amount of run time and corresponding level of statistical uncertainty in the detector result. ADVANTG-enhanced MCNP input files have been shown to increase the FOM of many types of problems, obtaining the same level of statistical uncertainty in a shorter time compared to standard MCNP. ADVANTG can also generate variance reduction parameters (importance map and biased source) using the Forward-Weighted CADIS (FW-CADIS) method for optimizing mesh tallies. The CADIS method creates variance reduction parameters that optimize a tally's total quantity (flux, dose rate, interaction rate, etc.) and will not generally increase performance for all parts of a segmented tally. To optimize a segmented tally, the FW-CADIS method uses two discrete ordinates calculations to make variance reduction parameters that help compute a segmented tally with uniform relative uncertainties in each bin. This report will demonstrate that using ADVANTG for neutron and photon radiation shielding problems will (1) preserve the standard MCNP results and (2) obtain those results either with less statistical uncertainty or in shorter times than the standard MCNP calculation. The four demonstration problems in this report are based on simple neutron or photon transmission measurements through different materials. All of the problems here used the CADIS method and still saw improvement across the flux tallies segmented by particle energy. (authors)
Stellarators remain an enticing route to steady-state fusion power. However, to achieve the required confinement, the magnetic geometry must be highly optimized. This optimization requires navigating high-dimensional spaces, often necessitating the use of gradient-based methods. The gradient of the neoclassical fluxes is expensive to compute with classical methods, requiring $O(N)$ flux computations, where $N$ is the number of parameters. To reduce the cost of the gradient computation, we present an adjoint method for computing the derivatives of moments of the neoclassical distribution function for stellarator optimization. The linear adjoint method allows derivatives of quantities which depend on solutions of a linear system, such as moments of the distribution function, to be computed with respect to many parameters from the solution of only two linear systems. This reduces the cost of computing the gradient to the point that the finite-collisionality neoclassical fluxes can be used within an optimization loop. With the neoclassical adjoint method, we compute solutions of the drift kinetic equation and an adjoint drift kinetic equation to obtain derivatives of neoclassical quantities with respect to geometric parameters. When the number of parameters in the derivative is large ( $O(10^{2})$ ), this adjoint method provides up to a factor of 200 reduction in cost. We demonstrate adjoint-based optimization of the field strength to obtain minimal bootstrap current on a surface. With adjoint-based derivatives, we also compute the local sensitivity to magnetic perturbations on a flux surface and identify regions where tight tolerances on error fields are required for control of the bootstrap current or radial transport. Moreover, the solve for the ambipolar electric field is accelerated using a Newton method with derivatives obtained from the adjoint method.
Scalability of today’s superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature. One active research area in both industry and academia is to push the classical controllers to the dilution refrigerator in order to increase the scalability of quantum computers. Superconducting Single Flux Quantum (SFQ) is a classical logic technology with low power consumption and ultra-high speed, and thus is a promising candidate for in-fridge classical controllers with maximized scalability. Prior work has demonstrated high-fidelity SFQ-based single-qubit gates. However, little research has been done on SFQ-based multi-qubit gates, which are necessary to realize SFQ-based universal quantum computing.In this paper, we present the first thorough analysis of SFQ-based two-qubit gates. Our observations show that SFQ-based two-qubit gates tend to have high leakage to qubit non-computational subspace, which presents severe design challenges. We show that despite these challenges, we can realize gates with high fidelity by carefully designing optimal control methods and qubit architectures. We develop optimal control methods that suppress leakage, and also investigate various qubit architectures that reduce the leakage. After carefully engineering our SFQ-friendly quantum system, we show that it can achieve similar gate fidelity and gate time to microwave-based quantum systems. Furthermore, the promising results of this paper show that (1) SFQ-based universal quantum computation is both feasible and effective; and (2) SFQ is a promising approach in designing classical controller for quantum machines because it can increase the scalability while preserving gate fidelity and performance.
The large scale structure (LSS) of the universe is generated by the linear density gaussian modes, which are evolved into the observed nonlinear LSS. Given a set of data the posterior surface of the modes is convex in the linear regime, leading to a unique global maximum (MAP), but this is no longer guaranteed in the nonlinear regime. In this paper we investigate the nature of posterior surface using the recently developed MAP reconstruction method, with a simplified but realistic N-body simulation as the forward model. The reconstruction method uses optimization with analytic gradients from back-propagation through the simulation. For low noise cases we recover the initial conditions well into the nonlinear regime (k~ 1 h/Mpc) nearly perfectly. We show that the large scale modes can be recovered more precisely than the linear expectation, which we argue is a consequence of nonlinear mode coupling. For noise levels achievable with current and planned LSS surveys the reconstruction cannot recover very small scales due to noise. We see some evidence of non-convexity, specially for smaller scales where the non-injective nature of the mappings: several very different initial conditions leading to the same near perfect final data reconstruction. We investigate the nature of these phenomena further using a 1-d toy gravity model, where many well separated local maximas are found to have identical data likelihood but differ in the prior. We also show that in 1-d the prior favors some solutions over the true solution, though no clear evidence of these in 3-d. Our main conclusion is that on very small scales and for a very low noise the posterior surface is multi-modal and the global maximum may be unreachable with standard methods, while for realistic noise levels in the context of the current and next generation LSS surveys MAP optimization method is likely to be nearly optimal.
Objective: Improve the resiliency of power systems with optimization-based methods that leverage advanced microgrid technologies to reduce system recovery times after extreme event induced outages. Outcome: First-of-kind, high-fidelity physics-based optimization method for modeling networked microgrids which includes key engineering constraints associated with system recovery after extreme events.
Abstract This article presents an explicit topology optimization approach using boundary element method based moving morphable void (MMV). Structural analysis in the conventional MMV approach is performed on a fixed mesh over the entire design domain. However, in the proposed method structural boundaries are described using B‐splines and discretized with boundary elements making explicit representation of the boundaries possible. In this regard, the proposed approach has following merits: a) the use of weak material, which is often adopted to mimic voids can be completely avoided; b) exact and explicit description of voids in MMV allows the capture of tiny structural features in a robust and effective way; c) numerical instabilities stemming from the use of fixed meshes can be naturally avoided. Several numerical examples are provided to demonstrate the effectiveness of the proposed approach.
A method is presented for addressing constraints within the context of large-scale combinatorial optimization problems. The method, based on constraint annealing, eliminates the use of traditional constraint penalty factors by treating each constraint as separate and concurrently solved minimization problems within a global optimization search framework. Results are demonstrated for a core loading pattern optimization problem. (authors)
Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.
Off-road vehicles, such as wheel loaders, excavators, and harvesters, are extensively utilized across a wide range of industries, including construction, agriculture, and mining. These machines have become indispensable in supporting the day-to-day operational needs of a nation, playing a critical role in various sectors' infrastructure and productivity. However, despite their utility, off-road vehicles are significant consumers of fossil fuels, resulting in substantial emissions that contribute to environmental degradation. This highlights the pressing need for research and technological advancements aimed at improving their energy efficiency and reducing their carbon footprint. There are, however, two primary challenges that must be addressed to achieve these goals. First, off-road vehicles typically perform both driving and working tasks simultaneously, which introduces a high level of complexity into their overall dynamic systems. Analysis the interactions between these functions is challenging. Second, research into off-road vehicles is inherently interdisciplinary, demanding expertise across several domains such as fluid power systems, vehicle dynamics, control theory, optimization techniques, and real-world implementation. Recognizing these challenges, we proposed the project titled "Optimization and Evaluation of Energy Savings for Connected and Autonomous Off-Road Vehicles" as a comprehensive solution to enhance fuel efficiency while simultaneously improving productivity. This project specifically focuses on autonomous off-road vehicles, with particular attention to wheel loaders, and seeks to develop novel methods to optimize energy consumption without sacrificing operational performance. The project integrates real-time control algorithms, vehicle dynamics modeling, and co-optimization of powertrain system and vehicle system to achieve these goals. Our optimization strategy dynamically co-optimizes critical parameters at both the powertrain and vehicle levels, including vehicle speed, working tool movements, powertrain dynamics, and engine operations in real-time. To streamline this optimization process, we developed a vehicle model that captures the key dynamics while significantly enhancing computational efficiency. This allows the system to intelligently minimize fuel consumption, all while maintaining or even improving productivity through real-time calculations during various off-road operations. To validate the effectiveness of this energy optimization method, we introduced a state-of-the-art Hardware-in-the-Loop (HIL) testbed. This reconfigurable testbed seamlessly integrates the actual engine with virtual models of the wheel loader's subsystems, allowing for accurate emulation of real-world operational loads and environments. By simulating these conditions, the HIL testbed enables us to evaluate the wheel loader’s performance under diverse working scenarios, ensuring the developed solution is applicable in real-world operations. This testbed proved to be instrumental in validating the optimization algorithms and demonstrating the system's practical effectiveness. During the evaluation and testing phase, we employed the HIL testbed to rigorously assess the energy savings and productivity improvements generated by the optimized system. The results were highly encouraging, revealing that the automated wheel loader achieved over 30% fuel savings compared to traditional, human-operated cycles, with comparable or even enhanced levels of productivity. The insights gained from this HIL-based testing provided critical validation of our approach and highlighted the potential for deploying these optimized autonomous technologies in real-world off-road vehicles.