SEARCH · Engineering Papers
Results for “Scalable”
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.
Tunable and scalable fabrication of plasmonic dimer arrays with sub-10nm nanogaps by area-selective atomic layer deposition
Nanogaps in metallic nanostructures produce local field enhancements with potential applications in surface enhanced spectroscopy, solar energy conversion, and photocatalysis. Atomic layer deposition is applied as a conformal coating to modify nanogap sizes and tune the optical properties of plasmonic dimer arrays with sub-10 nm nanogaps. Nanostructures are fabricated using layers of gold and palladium to combine features of plasmonics and area-selective atomic layer deposition, where copper metal is deposited on palladium-covered surfaces. Direct measurements of optical extinction for successive smaller nanogaps and thicker copper coatings show that spectral features become broadened at first due to heating-induced shape changes but subsequently sharpen as copper coatings form on palladium structures. Furthermore, longitudinal resonances of plasmonic dimers blue shift for thin coatings due to heating and decreasing aspect ratio, but thicker coatings lead to red shifts due to narrowing nanogaps. Together, these results show that area-selective atomic layer deposition is a promising tool for achieving large area arrays of plasmonic dimers with sub-10 nm nanogaps.
Scalable synthesis of supported catalysts using fluidized bed atomic layer deposition
Overcoating layers deposited on the surface of heterogeneous catalysts using atomic layer deposition (ALD) have been shown to increase catalyst activity, lifetime, and selectivity. In this study, we performed Al 2 O 3 ALD and Pd ALD in a commercial fluidized bed reactor on high surface area mesoporous powder supports to create overcoated catalysts with high precursor utilization. We investigated the reaction mechanism for both Al 2 O 3 ALD and Pd ALD using in situ mass spectrometry and developed a mathematical model to understand the precursor saturation behaviors. We characterized the catalyst samples using a variety of techniques to measure the surface area, porosity, composition, and surface chemistry of the overcoated catalysts. Finally, we used propane dehydrogenation as a probe reaction to evaluate the performance of the catalysts prepared by fluidized bed ALD.
Design of a custom vapor transport co-deposition system for scalable production of perovskite solar cells
Vacuum-deposited perovskites provide a more direct path to manufacturing large area solar cells because of ready compatibility with multilayered architectures and historic use in the electronics industry. However, vacuum compatible co-deposition of organic-inorganic perovskites remains difficult due to issues of precisely controlling the organic precursor flux. Here, we demonstrate a manufacturing prototype specifically designed for co-depositing organic-inorganic perovskites and evaluate it with respect to the influence of process parameters on film growth. Through depositing and characterizing methylammonium lead iodide (MAPbI3) perovskite films, we highlight the necessary design requirements while measuring the influence of film growth parameters on deposition rate and perovskite phases.
A nonvoxel-based dose convolution/superposition algorithm optimized for scalable GPU architectures
Purpose: Real-time adaptive planning and treatment has been infeasible due in part to its high computational complexity. There have been many recent efforts to utilize graphics processing units (GPUs) to accelerate the computational performance and dose accuracy in radiation therapy. Data structure and memory access patterns are the key GPU factors that determine the computational performance and accuracy. In this paper, the authors present a nonvoxel-based (NVB) approach to maximize computational and memory access efficiency and throughput on the GPU. Methods: The proposed algorithm employs a ray-tracing mechanism to restructure the 3D data sets computed from the CT anatomy into a nonvoxel-based framework. In a process that takes only a few milliseconds of computing time, the algorithm restructured the data sets by ray-tracing through precalculated CT volumes to realign the coordinate system along the convolution direction, as defined by zenithal and azimuthal angles. During the ray-tracing step, the data were resampled according to radial sampling and parallel ray-spacing parameters making the algorithm independent of the original CT resolution. The nonvoxel-based algorithm presented in this paper also demonstrated a trade-off in computational performance and dose accuracy for different coordinate system configurations. In order to find the best balance between the computed speedup and the accuracy, the authors employed an exhaustive parameter search on all sampling parameters that defined the coordinate system configuration: zenithal, azimuthal, and radial sampling of the convolution algorithm, as well as the parallel ray spacing during ray tracing. The angular sampling parameters were varied between 4 and 48 discrete angles, while both radial sampling and parallel ray spacing were varied from 0.5 to 10 mm. The gamma distribution analysis method (γ) was used to compare the dose distributions using 2% and 2 mm dose difference and distance-to-agreement criteria, respectively. Accuracy was investigated using three distinct phantoms with varied geometries and heterogeneities and on a series of 14 segmented lung CT data sets. Performance gains were calculated using three 256 mm cube homogenous water phantoms, with isotropic voxel dimensions of 1, 2, and 4 mm. Results: The nonvoxel-based GPU algorithm was independent of the data size and provided significant computational gains over the CPU algorithm for large CT data sizes. The parameter search analysis also showed that the ray combination of 8 zenithal and 8 azimuthal angles along with 1 mm radial sampling and 2 mm parallel ray spacing maintained dose accuracy with greater than 99% of voxels passing the γ test. Combining the acceleration obtained from GPU parallelization with the sampling optimization, the authors achieved a total performance improvement factor of >175 000 when compared to our voxel-based ground truth CPU benchmark and a factor of 20 compared with a voxel-based GPU dose convolution method. Conclusions: The nonvoxel-based convolution method yielded substantial performance improvements over a generic GPU implementation, while maintaining accuracy as compared to a CPU computed ground truth dose distribution. Such an algorithm can be a key contribution toward developing tools for adaptive radiation therapy systems.
Concurrent Monte Carlo transport and fluence optimization with fluence adjusting scalable transport Monte Carlo
Purpose: The future of radiation therapy will require advanced inverse planning solutions to support single-arc, multiple-arc, and “4π” delivery modes, which present unique challenges in finding an optimal treatment plan over a vast search space, while still preserving dosimetric accuracy. The successful clinical implementation of such methods would benefit from Monte Carlo (MC) based dose calculation methods, which can offer improvements in dosimetric accuracy when compared to deterministic methods. The standard method for MC based treatment planning optimization leverages the accuracy of the MC dose calculation and efficiency of well-developed optimization methods, by precalculating the fluence to dose relationship within a patient with MC methods and subsequently optimizing the fluence weights. However, the sequential nature of this implementation is computationally time consuming and memory intensive. Methods to reduce the overhead of the MC precalculation have been explored in the past, demonstrating promising reductions of computational time overhead, but with limited impact on the memory overhead due to the sequential nature of the dose calculation and fluence optimization. The authors propose an entirely new form of “concurrent” Monte Carlo treat plan optimization: a platform which optimizes the fluence during the dose calculation, reduces wasted computation time being spent on beamlets that weakly contribute to the final dose distribution, and requires only a low memory footprint to function. In this initial investigation, the authors explore the key theoretical and practical considerations of optimizing fluence in such a manner. Methods: The authors present a novel derivation and implementation of a gradient descent algorithm that allows for optimization during MC particle transport, based on highly stochastic information generated through particle transport of very few histories. A gradient rescaling and renormalization algorithm, and the concept of momentum from stochastic gradient descent were used to address obstacles unique to performing gradient descent fluence optimization during MC particle transport. The authors have applied their method to two simple geometrical phantoms, and one clinical patient geometry to examine the capability of this platform to generate conformal plans as well as assess its computational scaling and efficiency, respectively. Results: The authors obtain a reduction of at least 50% in total histories transported in their investigation compared to a theoretical unweighted beamlet calculation and subsequent fluence optimization method, and observe a roughly fixed optimization time overhead consisting of ∼10% of the total computation time in all cases. Finally, the authors demonstrate a negligible increase in memory overhead of ∼7–8 MB to allow for optimization of a clinical patient geometry surrounded by 36 beams using their platform. Conclusions: This study demonstrates a fluence optimization approach, which could significantly improve the development of next generation radiation therapy solutions while incurring minimal additional computational overhead.
A scalable solid-state nanoporous network with atomic-level interaction design for carbon dioxide capture
Carbon capture and sequestration reduces carbon dioxide emissions and is critical in accomplishing carbon neutrality targets. Here, we demonstrate new sustainable, solid-state, polyamine-appended, cyanuric acid–stabilized melamine nanoporous networks (MNNs) via dynamic combinatorial chemistry (DCC) at the kilogram scale toward effective and high-capacity carbon dioxide capture. Polyamine-appended MNNs reaction mechanisms with carbon dioxide were elucidated with double-level DCC where two-dimensional heteronuclear chemical shift correlation nuclear magnetic resonance spectroscopy was performed to demonstrate the interatomic interactions. We distinguished ammonium carbamate pairs and a mix of ammonium carbamate and carbamic acid during carbon dioxide chemisorption. The coordination of polyamine and cyanuric acid modification endows MNNs with high adsorption capacity (1.82 millimoles per gram at 1 bar), fast adsorption time (less than 1 minute), low price, and extraordinary stability to cycling by flue gas. This work creates a general industrialization method toward carbon dioxide capture via DCC atomic-level design strategies.
Scalable submicrometer additive manufacturing
High-throughput fabrication techniques for generating arbitrarily complex three-dimensional structures with nanoscale features are desirable across a broad range of applications. Two-photon lithography (TPL)–based submicrometer additive manufacturing is a promising candidate to fill this gap. However, the serial point-by-point writing scheme of TPL is too slow for many applications. Attempts at parallelization either do not have submicrometer resolution or cannot pattern complex structures. We overcome these difficulties by spatially and temporally focusing an ultrafast laser to implement a projection-based layer-by-layer parallelization. This increases the throughput up to three orders of magnitude and expands the geometric design space. We demonstrate this by printing, within single-digit millisecond time scales, nanowires with widths smaller than 175 nanometers over an area one million times larger than the cross-sectional area.
A scalable metal-organic framework as a durable physisorbent for carbon dioxide capture
A hydrophobic CO 2 physisorbent Most materials for carbon dioxide (CO 2 ) capture of fossil fuel combustion, such as amines, rely on strong chemisorption interactions that are highly selective but can incur a large energy penalty to release CO 2 . Lin et al . show that a zinc-based metal organic framework material can physisorb CO 2 and incurs a lower regeneration penalty. Its binding site at the center of the pores precludes the formation of hydrogen-bonding networks between water molecules. This durable material can preferentially adsorb CO2 at 40% relative humidity and maintains its performance under flue gas conditions of 150°C. —PDS
Quantum learning advantage on a scalable photonic platform
Recent advances in quantum technologies have demonstrated that quantum systems can outperform classical ones in specific tasks, a concept known as quantum advantage. Although previous efforts have focused on computational speedups, a definitive and provable quantum advantage that is unattainable by any classical system has remained elusive. Here, in this work, we demonstrate a provable photonic quantum advantage by implementing a quantum-enhanced protocol for learning a high-dimensional physical process. Using imperfect Einstein–Podolsky–Rosen entanglement, we achieve a sample complexity reduction of 11.8 orders of magnitude compared to classical methods without entanglement. These results show that large-scale, provable quantum advantage is achievable with current photonic technology and represent a key step toward practical quantum-enhanced learning protocols in quantum metrology and machine learning.
Alkylidene functionalization produces highly recyclable and scalable polyhydroxyalkanoates
Recyclable polymers that can be produced at scale and readily tuned within the same polymer framework for specific properties are important to achieving a circular materials economy. To this end, synthetic poly(3-hydroxyalkanoate)s (PHAs) have emerged as high-performance, chemically recyclable variants of biological PHAs, but their difficult monomer syntheses and suboptimal recycling efficiencies pose challenges for large-scale deployment. In this study, we investigated a β-isopropylidene PHA, i-PHA, for which the lactone monomer can be synthesized by existing industrial methods from biomass-derived isobutyric acid. The alkylidene substituent prevents decarboxylative degradation typically observed during PHA depolymerization, enabling near-quantitative chemical recycling to monomer. Controlled hydrogenation of the β-isopropylidene side group produces PHAs with diverse performance metrics that are competitive with a range of commodity polymers, spanning strong fibers to ductile thermoplastics to superglue epoxy resins.
A Data Scalable Augmented Lagrangian KKT Preconditioner for Large-Scale Inverse Problems
Not provided.
Scalable Tensor Methods for Nonuniform Hypergraphs
While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.
Scalable Regression Tree Learning on Hadoop using OpenPlanet
As scientific and engineering domains attempt to effectively analyze the deluge of data arriving from sensors and instruments, machine learning is becoming a key data mining tool to build prediction models. Regression tree is a popular learning model that combines decision trees and linear regression to forecast numerical target variables based on a set of input features. Map Reduce is well suited for addressing such data intensive learning applications, and a proprietary regression tree algorithm, PLANET, using MapReduce has been proposed earlier. In this paper, we describe an open source implement of this algorithm, OpenPlanet, on the Hadoop framework using a hybrid approach. Further, we evaluate the performance of OpenPlanet using realworld datasets from the Smart Power Grid domain to perform energy use forecasting, and propose tuning strategies of Hadoop parameters to improve the performance of the default configuration by 75% for a training dataset of 17 million tuples on a 64-core Hadoop cluster on FutureGrid.
Toward a Data Scalable Solution for Facilitating Discovery of Scientific Data Resources
Science is increasingly motivated by the need to process larger quantities of data. It is facing severe challenges in data collection, management, and processing, so much so that the computational demands of "data scaling" are competing with, and in many fields surpassing, the traditional objective of decreasing processing time. Example domains with large datasets include astronomy, biology, genomic, climate and weather, and material sciences. This paper presents a real-world use case in which we wish to answer queries provided by domain scientists in order to facilitate discovery of relevant science resources. The problem is that the metadata for these science resources is very large and is growing quickly, rapidly increasing the need for a data scaling solution. We propose the use of our SGEM stack -- a system designed for answering graph-based queries over large datasets on cluster architectures -- for answering complex queries over the metadata, and we report early results for our current capability.
Asynchronous Parallel Evolutionary Algorithms: Leveraging Heterogeneous Fitness Evaluation Times for Scalability and Elitist Parsimony Pressure.
Abstract not provided.