A Conformal Decomposition Finite Element Method with Guaranteed Quality.
Abstract not provided.
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.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Interface-conforming elements generated by the conformal decomposition finite element method can have arbitrarily poor quality due to the arbitrary intersection of the base triangular or tetrahedral mesh with material interfaces. This can have severe consequences for both the solvability of linear systems and for the interpolation error of fields represented on these meshes. The present work demonstrates that snapping the base mesh nodes to the interface whenever the interface cuts close to a node results in conforming meshes of good quality. Theoretical limits on the snapping tolerance are derived, and even conservative tolerance choices result in limiting the stiffness matrix condition number to within a small multiple of that of the base mesh. Interpolation errors are also well controlled in the norms of interest. In 3D, use of node-to-interface snapping also permits a simpler and more robust vertex ID-based element decomposition algorithm to be used with no serious detriment to mesh quality.
Purpose: To efficiently find quality-guaranteed treatment plans with the minimum number of beams for stereotactic body radiation therapy using RayStation. Methods: For a pre-specified pool of candidate beams we use RayStation (a treatment planning software for clinical use) to identify the deliverable plan which uses all the beams with the minimum dose to organs at risk (OARs) and dose to the tumor and other structures in specified ranges. Then use the dose matrix information for the generated apertures from RayStation to solve a linear program to find the ideal plan with the same objective and constraints allowing use of all beams. Finally we solve a mixed integer programming formulation of the beam angle optimization problem (BAO) with the objective of minimizing the number of beams while remaining in a predetermined epsilon-optimality of the ideal plan with respect to the dose to OARs. Since the treatment plan optimization is a multicriteria optimization problem, the planner can exploit the multicriteria optimization capability of RayStation to navigate the ideal dose distribution Pareto surface and select a plan of desired target coverage versus OARs sparing, and then use the proposed technique to reduce the number of beams while guaranteeing quality. For the numerical experiments two liver cases and one lung case with 33 non-coplanar beams are considered. Results: The ideal plan uses an impractically large number of beams. The proposed technique reduces the number of beams to the range of practical application (5 to 9 beams) while remaining in the epsilon-optimal range of 1% to 5% optimality gap. Conclusion: The proposed method can be integrated into a general algorithm for fast navigation of the ideal dose distribution Pareto surface and finding the treatment plan with the minimum number of beams, which corresponds to the delivery time, in epsilon-optimality range of the desired ideal plan. The project was supported by the Federal Share of program income earned by Massachusetts General Hospital on C06 CA059267, Proton Therapy Research and Treatment Center and partially by RaySearch Laboratories.
Abstract not provided.
Abstract not provided.
ROL-PEBBL is a C++, MPI-based parallel code for mixed-integer PDE-constrained optimization (MIPDECO). In these problems we wish to optimize (control, design, etc.) physical systems, which must obey the laws of physics, when some of the decision variables must take integer values. ROL-PEBBL combines a code to efficiently search over integer choices (PEBBL = Parallel Enumeration Branch-and-Bound Library) and a code for efficient nonlinear optimization, including PDE-constrained optimization (ROL = Rapid Optimization Library). In this report, we summarize the design of ROL-PEBBL and initial applications/results. For an artificial source-inversion problem, finding sources of pollution on a grid from sparse samples, ROL-PEBBLs solution for the nest grid gave the best optimization guarantee for any general solver that gives both a solution and a quality guarantee.
Systems, apparatuses, and methods for enforcing processor quality of service guarantees when servicing system service requests (SSRs) are disclosed. A system includes a first processor executing an operating system and a second processor executing an application which generates SSRs for the first processor to service. The first processor monitors the number of cycles spent servicing SSRs over a previous time interval, and if this number of cycles is above a threshold, the first processor starts delaying the servicing of subsequent SSRs. In one implementation, if the previous delay was non-zero, the first processor increases the delay used in the servicing of subsequent SSRs. If the number of cycles is less than or equal to the threshold, then the first processor services SSRs without delay. As the delay is increased, the second processor begins to stall and its SSR generation rate falls, reducing the load on the first processor.
Highlights: Black-Right-Pointing-Pointer Definition of parameters characterising agricultural plastic waste (APW) quality. Black-Right-Pointing-Pointer Analysis of samples to determine APW quality for recycling or energy recovery. Black-Right-Pointing-Pointer Majority of APW samples from various countries have very good quality for recycling. Black-Right-Pointing-Pointer Upper limit of 50% w/w soil contamination in APW acceptable for energy recovery. Black-Right-Pointing-Pointer Chlorine and heavy metals content in APW below the lowest limit for energy recovery. - Abstract: A holistic environmentally sound waste management scheme that transforms agricultural plastic waste (APW) streams into labelled guaranteed quality commodities freely traded in open market has been developed by the European research project LabelAgriWaste. The APW quality is defined by the APW material requirements, translated to technical specifications, for recycling or energy recovery. The present work investigates the characteristics of the APW quality and the key factors affecting it from the introduction of the virgin product to the market to the APW stream reaching the disposer. Samples of APW from different countries were traced from their application to the field through their storage phase and transportation to the final destination. The test results showed that the majority of APW retained their mechanical properties after their use preserving a 'very good quality' for recycling in terms of degradation. The degree of soil contamination concerning the APW recycling and energy recovery potential fluctuates depending on the agricultural plastic category and application. The chlorine and heavy metal content of the tested APW materials was much lower than the maximum acceptable limits for their potential use in cement industries.
Managing traffic between the Earth-Moon and Earth-Mars is a complex process requiring significant investment in resources and expertise at NASA. INSPiRE improves the performance of space networks by enabling a dynamic re-configuration process that works for any mixed topology over a heterogeneous and multi-vendor network. To achieve the desired functionality, INSPiRE incorporates a set of algorithms, machine learning processes, and policy inference to handle unpredictable, disruptive events. INSPiRE draws parallels from the current notion of the 3GPP (5G and beyond) Network Slicing approach, where the same physical network divides into several virtual networks, and for each of these virtual networks, there is a guaranteed Quality of Service for the missions that they serve.
We present several formulations to solve the MPBP for the recovery of REE/CMs from produced water and propose a decomposition approach thatleverages strategies in general disjunctive programming to enhance its performance. We compare these proposed formulations/strategies via two illustrative case studies on recovering lithium from a network of produced water sources.
This paper investigates the ability of a collection of deferrable heating, ventilation and air conditioning (HVAC) loads to directly emulate energy storage devices (ESD), that is, to absorb any low frequency fluctuations in solar generation. We find the optimal number of aggregated HVAC loads to absorb solar fluctuation in the same frequency band based on frequency analysis. To guarantee quality of service in afleet of residential buildings, an optimization problem is formed to compute optimal schedule of the HVAC loads considering temperature comfort band and available solar generation. By minimizing the tracking error between solar generation and total consumption, the proposed method also quantifies the minimum capacity of ESD (battery or fly-wheel) . The simulation results show that the proposed techniques are able to achieve good solar tracking performance as well as obtain a minimal ESD capacity. Therefore, we show that most of the renewable generation can be consumed locally through an intelligent coordination of HVAC loads, their impacts on the grid would be minimal and the required ESD capacity can be minimized.
One fundamental task in network analysis is detecting “hotspots” or “anomalies” in the network; that is, detecting subgraphs where there is significantly more activity than one would expect given historical data or some baseline process. Scan statistics is one popular approach used for anomalous subgraph detection. This methodology involves maximizing a score function over all connected subgraphs, which is a challenging computational problem. A number of heuristics have been proposed for these problems, but they do not provide any quality guarantees. Here, we propose a framework for designing algorithms for optimizing a large class of scan statistics for networks, subject to connectivity constraints. Our algorithms run in time that scales linearly on the size of the graph and depends on a parameter we call the “effective solution size,” while providing rigorous approximation guarantees. In contrast, most prior methods have super-linear running times in terms of graph size. Extensive empirical evidence demonstrates the effectiveness and efficiency of our proposed algorithms in comparison with state-of-the-art methods. Our approach improves on the performance relative to all prior methods, giving up to over 25% increase in the score. Further, our algorithms scale to networks with up to a million nodes, which is 1–2 orders of magnitude larger than all prior applications.
Finding similarities between protein structures is a crucial task in molecular biology. Most of the existing tools require proteins to be aligned in order-preserving way and only find single alignments even when multiple similar regions exist. We propose a new seed-based approach that discovers multiple pairs of similar regions. Its computational complexity is polynomial and it comes with a quality guarantee—the returned alignments have both root mean squared deviations (coordinate-based as well as internal-distances based) lower than a given threshold, if such exist. We do not require the alignments to be order preserving (i.e., we consider nonsequential alignments), which makes our algorithm suitable for detecting similar domains when comparing multidomain proteins as well as to detect structural repetitions within a single protein. Because the search space for nonsequential alignments is much larger than for sequential ones, the computational burden is addressed by extensive use of parallel computing techniques: a coarse-grain level parallelism making use of available CPU cores for computation and a fine-grain level parallelism exploiting bit-level concurrency as well as vector instructions.
The optical design of the miniature Cassegrainian concentrator (MCC) element was improved for both offpoint and onpoint power capability. The cell stack design has shown no losses under the high short term thermal stresses imposed by component level test and is projected to be capable of greater than five years thermal cycle life in low Earth orbit. The structural design met all requirements for stiffness and flatness and requires adjustable inserts for fine tuning of the GFRP structure to meet flatness goals. The completed, fully populated small and large MCC panels deliverable under this contract perform electrically as expected. A solid acceptance inspection program to guarantee quality of all purchased parts, and continued manufacturing process improvements will make the MCC design a viable low cost alternative to standard flat panel technology. Minor improvements to the cell stack design of the MCC element can make significant improvements in both the performance and manufacturability of the MCC system.
A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity/topology components of the generated models. The highly efficient triangular mesh compression compacts the connectivity information at the rate of 1.5-4 bits per vertex (on average for triangle meshes), while reducing the 3D geometry by 40-50 percent. Finally, taking into consideration the characteristics of 3D terrain data, and using the innovative, regularized binary decomposition mesh modeling, a multistage, pattern-drive modeling, and compression technique has been developed to provide an effective framework for compressing digital elevation model (DEM) surfaces, high-resolution aerial imagery, and other types of NASA data.
Previous NREL research shows that solar photovoltaic (PV) customers tend to obtain lower installation quote prices on online quote platforms. In new research reported in Solar Buyer's Markets: Unlocking Lower Photovoltaic and Battery Prices on Online Quote Platforms, we corroborate those results using data from the Pick My Solar quote platform. Furthermore, for the first time, we evaluate quote prices for batteries on online quote platforms. Given that few customers currently use quote platforms, we discuss various pathways to increase use of online quote platforms, including developing strategic partnerships, building customer trust, increasing market transparency, and providing quality guarantees.