Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “TaN”

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,405 records · Page 78

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

Explicit Monotone Stable Super-Time-stepping Methods for Finite Time Singularities

We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) super-time-stepping methods were originally developed for nonlinear complex physics problems with diffusion. These are multistage single step second-order, forward-in-time methods with no implicit solves. The advantage is that the time-step size for stability scales with stage number 𝑠 as $\mathcal{O}$⁡(𝑠 2 ). Many interesting nonlinear PDEs have finite-time singularities, and the presence of diffusion often limits one to using implicit or semi-implicit time-step methods for stability constraints. Finite-time singularities are particularly challenging due to the large range of scales that one desires to resolve, often with adaptive spatial grids and adaptive time steps. Here, in this study, we show two examples of nonlinear PDEs for which the self-similar singularity structure has time and space scales that are resolvable using the RKL and RKG methods, without forcing even smaller time steps. Compared to commonly used implicit numerical methods, we achieve a significantly smaller run time while maintaining comparable accuracy. We also prove numerical monotonicity for both the RKL and RKG methods under their linear stability conditions for the constant coefficient heat equation, in the case of infinite domain and periodic boundary condition, leading to a theoretical guarantee of the superiority of the RKL and RKG methods over traditional super-time-stepping methods, such as the Runge-Kutta-Chebyshev and the orthogonal Runge-Kutta-Chebyshev methods. Code can be found at https://github.com/ZT220501/SRK-Singularity.

97 MATHEMATICS AND COMPUTING↗

Experiments towards a neutron target for measurements in inverse kinematics

Neutron-induced reactions play an important role in fundamental nuclear physics, nuclear astrophysics, and applications. In the case of reactions on rare isotopes, there are limited options for direct experimental measurements. The Neutron Target Demonstrator project at Los Alamos National Laboratory seeks to test the feasibility of moderating spallation neutrons within a 1 m 3 graphite cube to create a standing neutron target for neutron-induced reaction measurements in inverse kinematics. This paper presents the results of experimental neutron flux distribution tests using neutron sources (ranging from 1 keV to 50 MeV) created by accelerators at the University of Notre Dame and Texas A&M University. Measurements were made with both the full graphite cube as well as a ”half cube” setup in which half of the graphite cube was removed. The measured distributions agree with simulated distributions in the case of the full cube moderator, although there remain discrepancies in certain cases for the half cube moderator. The results shown here will provide useful information for an upcoming experimental campaign to test the neutron target proof-of-principle.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Substitution of Pb with (Li 1/2 Bi 1/2 ) in PbZrO 3 -based antiferroelectric ceramics

PbZrO 3 -based antiferroelectric (AFE) ceramics are promising dielectrics for high-energy-density capacitors due to their reversible phase transitions during charge–discharge cycles. In this work, a new composition series, [Pb 0.93–x La 0.02 (Li 1/2 Bi 1/2 ) x Sr 0.04 ][Zr 0.57 Sn 0.34 Ti 0.09 ]O 3 , with Li + and Bi 3+ substitution of Pb 2+ at x=0 , 0.04, 0.08, 0.12, 0.16 is investigated for the microstructure evolution, ferroelectric (FE) and dielectric properties. It is found that Li + and Bi 3+ substitution can significantly reduce the sintering temperature and simultaneously enhance the dielectric breakdown strength. An ultrahigh energy efficiency (94.0%) and a large energy density (3.22J/cm 3 ) are achieved in the composition of x = 0.12 with a low sintering temperature (1075°C).

36 MATERIALS SCIENCE↗

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗

Scalable HPC & AI infrastructure for COVID-19 therapeutics

COVID-19 has claimed more than 2.7 × 10^6 lives and resulted in over 124 × 10^6 infections. There is an urgent need to identify drugs that can inhibit SARS-CoV-2. We discuss innovations in computational infrastructure and methods that are accelerating and advancing drug design. Specifically, we describe several methods that integrate artificial intelligence and simulation-based approaches, and the design of computational infrastructure to support these methods at scale. We discuss their implementation, characterize their performance, and highlight science advances that these capabilities have enabled.

Lee, Hyungro↗

An MLIR-based Compiler Flow for System-Level Design and Hardware Acceleration

The generation of custom hardware accelerators for applications implemented within high-level productive programming frameworks requires considerable manual effort. To automate this process, we introduce \sodaopt, a compiler tool that extends the MLIR infrastructure. \sodaopt automatically searches, outlines, tiles, and pre-optimizes relevant code regions to generate high-quality accelerators through high-level synthesis. \sodaopt can support any high-level programming framework and domain-specific language that interface with the MLIR infrastructure. By leveraging MLIR, \sodaopt solves compiler optimization problems with specialized abstractions. Backend synthesis tools connect to \sodaopt through progressive intermediate representation lowerings. \sodaopt interfaces to a design space exploration engine to identify the combination of compiler optimization passes and options that provides high-performance generated designs for different backends and targets. We demonstrate the practical applicability of the compilation flow by exploring the automatic generation of accelerators for deep neural networks operators outlined at arbitrary granularity and by combining outlining with tiling on large convolution layers. Experimental results with kernels from the PolyBench benchmark show that \sodaopt high-level optimizations improve execution delays of synthesized accelerators up to 60x. We also show that for the selected kernels, our solution outperforms the current of state-of-the art in more than 70% of the benchmarks and provides better average speedup in 55% of them.

Bohm Agostini, Nicolas↗

ASAP: Automatic Synthesis of Area-Efficient and Precision-Aware CGRAs

Coarse-grained reconfigurable accelerators (CGRAs) are a promising accelerator design choice that strikes a balance between performance and adaptability to different computing patterns across various applications domains. Designing a CGRA for a specific application domain involves enormous software/hardware engineering effort. Recent research works explore loop transformations, functional unit types, network topology, and memory size to identify optimal CGRA designs given a set of kernels from a specific application do- main. Unfortunately, the impact of functional units with different precision support has rarely been investigated. To address this gap, we propose ASAP – a hardware/software co-design framework that automatically identifies and synthesizes optimal precision-aware CGRA for a set of applications of interest. Our evaluation shows that ASAP generates specialized designs 3.2×, 4.21×, and 5.8× more efficient (in terms of performance per unit of energy or area) than non-specialized homogeneous CGRAs, for the scientific computing, embedded, and edge machine learning domains, respectively, with limited accuracy loss. Moreover, ASAP provides more efficient designs than other state-of-the-art synthesis frameworks for specialized CGRAs.

artificial intelligence↗

Properly Learning Decision Trees in almost Polynomial Time

We give an n O (log log n ) -time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over { ± 1} n . Even in the realizable setting, the previous fastest runtime was n O (log n ) , a consequence of a classic algorithm of Ehrenfeucht and Haussler. Our algorithm shares similarities with practical heuristics for learning decision trees, which we augment with additional ideas to circumvent known lower bounds against these heuristics. To analyze our algorithm, we prove a new structural result for decision trees that strengthens a theorem of O’Donnell, Saks, Schramm, and Servedio. While the OSSS theorem says that every decision tree has an influential variable, we show how every decision tree can be “pruned” so that every variable in the resulting tree is influential.

Computer Science↗

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗

SmartFuse: Reconfigurable Smart Switches to Accelerate Fused Collectives in HPC Applications

Communication switches have sometimes been augmented to process collectives (e.g., the IBM BlueGene project and the Mellanox SHArP switch). In this work, we find that there is a great acceleration opportunity through the further augmentation of switches to accelerate more complex functions that combine communication with computation. We consider three types of such functions. The first is fully-fused collectives built by fusing multiple existing collectives like Allreduce with Alltoall. The second is semi-fused collectives built by combining a collective with another computation. The third we refer to as higher-order collectives built by combining multiple computations and communications, such as to perform matrix-matrix multiply (PGEMM). In this work, we propose a framework called SmartFuse to accelerate fused collective functions. The core of SmartFuse is a reconfigurable smart switch to support these operations. The semi/fully fused collectives are implemented with a CGRAlike architecture, while higher-order collectives are implemented with a more specialized computational unit that can also schedule communication. Supporting our framework is software to evaluate and translate relevant parts of the input program, compile them into a control data flow graph, and then map this graph to the switch hardware. The proposed framework, once deployed, has the strong potential to accelerate existing HPC applications transparently by encapsulation within an MPI implementation. Experimental results show that this approach improves the performance of the PGEMM kernel, MINIFE, and AMG by, on average, 94%, 15%, and 13%, respectively.

Haghi, Pouya↗

Representations of Materials for Machine Learning

High-throughput data generation methods and machine learning (ML) algorithms have given rise to a new era of computational materials science by learning the relations between composition, structure, and properties and by exploiting such relations for design. However, to build these connections, materials data must be translated into a numerical form, called a representation, that can be processed by an ML model. Data sets in materials science vary in format (ranging from images to spectra), size, and fidelity. Predictive models vary in scope and properties of interest. Here, we review context-dependent strategies for constructing representations that enable the use of materials as inputs or outputs for ML models. Furthermore, we discuss how modern ML techniques can learn representations from data and transfer chemical and physical information between tasks. Finally, we outline high-impact questions that have not been fully resolved and thus require further investigation.

36 MATERIALS SCIENCE↗

Innovations Toward the Valorization of Plastics Waste

Plastics are an extremely important class of materials that are prevalent in all facets of society; however, their widespread use over time, combined with limited end-of-life strategies, has led to increasing levels of waste accumulation. Although currently considered a burden, plastics waste is potentially an untapped feedstock for numerous chemical and manufacturing processes. In this study, we discuss the state of the art of approaches for valorization of plastics waste from a materials research perspective, including previous efforts to utilize plastics waste and recent innovations that have opportunities to add significant value. Although additional progress is necessary, we present several diverse capabilities and strategies for valorization that, when brought together, address end-of-life challenges for plastics at every stage of design and product consumption. In short, a materials research–based framework offers a unique perspective to address the urgent issues posed by plastics, unlocking the potential of polymers and plastics waste.

36 MATERIALS SCIENCE↗

A Structural Perspective on the Alphavirus Life Cycle

Alphaviruses are mosquito-borne, enveloped viruses with a positive-sense, single-stranded RNA genome. Alphaviruses enter host cells via receptor-mediated endocytosis, using various cellular surface receptors such as matrix remodeling-associated protein 8 (MXRA8), low-density lipoprotein receptor class A domain-containing 3 (LDLRAD3), and very low-density lipoprotein receptor (VLDLR), which facilitate binding to the viral glycoproteins. Following entry, viral proteins are expressed and nonstructural proteins assemble into replication complexes in host cells, driving RNA synthesis and genome replication. Viral assembly occurs at the plasma membrane, where nascent virions bud from the host cell in a process driven by capsid and spike proteins. Recent combinatorial structural studies have provided detailed molecular insights into various steps of the alphavirus life cycle. These structural insights into the alphavirus life cycle enhance our understanding of viral replication and assembly, with significant implications for antiviral strategies and the development of alphavirus-based vaccine vectors.

RNA virus↗

Improved Low Temperature Performance of Graphite/Li Cells Using Isoxazole as a Novel Cosolvent in Electrolytes

An investigation of novel electrolyte formulations to improve low temperature performance of Li/graphite half cells has been conducted. A novel electrolyte co-solvent, isoxazole (IZ), has been investigated in electrolyte systems composed of lithium difluoro(oxalato)borate (LiDFOB) in fluoroethylene carbonate (FEC) and LiDFOB in ethylene carbonate (EC). Cells containing 1 M LiDFOB FEC: IZ electrolyte have a significant improvement in capacity retention and reversible capacity at −10 °C. Ex-situ surface analysis of the cycled electrodes suggests that reduction of LiDFOB results in an oxalate rich solid electrolyte interphase (SEI). Addition of FEC, results in improved stability of the anode SEI preventing further decomposition of isoxazole solvent and improving cycling performance.

25 ENERGY STORAGE↗

Facile Surface Coatings for Performance Improvement of NMC811 Battery Cathode Material

High nickel content layered oxide LiNi 0.8 Mn 0.1 Co 0.1 O 2 (NMC811) is a promising cathode material with a high theoretical capacity of 200 mAh g -1 for use in high energy density lithium-ion batteries. However, its surface can easily get passivated by LiOH and Li 2 CO 3 due to its surface residual Li 2 O being reacting with ambient moisture and CO 2 . Herein, NMC811 was treated in a 3.0 M solution of lithium bis(fluorosulfonyl)imide (LiFSI) in dimethyl carbonate (DMC) at 60 °C for 8 h, 16 h and 24 h, respectively, resulting in coating of the NMC811 surface with LiF due to the basic nature of those residual lithium salts that react with LiFSI. The facile treatment of NMC811 in LiFSI/DMC not only improves the cycling stability but also enhances the capacity of the Li/NMC811 cells, mainly because of the thinning of the Li 2 CO 3 layer as suggested by cyclic voltammograms and impedance analyses. This method opens a new avenue for activation of passivated NMC811 particles for practical battery applications.

25 ENERGY STORAGE↗

Isoxazole-Based Electrolytes for Lithium Metal Protection and Lithium-Sulfurized Polyacrylonitrile (SPAN) Battery Operating at Low Temperature

A new electrolyte system using isoxazole as the salt dissolving solvent has been developed and studied for lithium metal batteries. By using fluoroethylene carbonate (FEC) as an additive and 1,1,2,2-tetrafluoroethyl-2,2,3,3-tetrafluoropropyl ether (TTE) as a diluent for localized high concentration electrolyte (LHCE), isoxazole-based electrolytes were successfully implemented in lithium metal batteries, demonstrating excellent lithium metal protection capability. Utilizing several advanced characterization techniques (including synchrotron-based X-ray absorption spectroscopy and photoelectron spectroscopy), the solid electrolyte interphase (SEI) formed on the Li-metal anode after employing these electrolytes was thoroughly investigated. The high ionic conductivity of isoxazole at low temperature and the low impedance of SEI formed in LHCE significantly improved the low-temperature performance of Li-sulfurized polyacrylonitrile (SPAN) batteries, delivering 273.8 mAh g −1 capacity at −30 °C with 99.85% capacity retention after 50 cycles.

25 ENERGY STORAGE↗

A Systematic Review and Meta-Analysis of Tai Chi Training in Cardiorespiratory Fitness of Elderly People

Objectives. The purpose of this study was to investigate the influence of Tai Chi on cardiorespiratory fitness (CRF) in elderly people using meta-analysis. Methods. This study used seven electronic databases and data retrieved from randomized controlled trials (RCTs) investigating the role of Tai Chi on CRF in the elderly. All these 24 RCTs were screened and selected from 7 literature databases. The Stata 11.2 software (StataCorp, USA) was used for the meta-analysis, subgroup analysis, and bias test, while the Cochrane Collaboration’s tool was used for the assessment of the risk of bias (RoB). 4 researchers independently participated in sample selection, data extraction, and RoB assessment. Results. Following the inclusion criteria, 24 eligible studies were included in our analysis. The meta-analysis indicated that Tai Chi practice significantly increased the maximum rate of oxygen consumption (VO2 max) (weighted mean difference (WMD) = 3.76, 95% CI: 1.25 to 6.26, P < 0.1 ), leading to an overall reduction in the heart rate (HR) (WMD = −1.84, 95% CI: −2.04 to −1.63, P ≤ 0.001 ) and an increase in the O2 pulse (WMD = 0.94, 95% CI: 0.60 to 1.28, P ≤ 0.001 ) in individuals who practiced Tai Chi regularly compared with those who did not. The subgroup analysis suggested that overall in those who practiced Tai Chi, males (WMD = 1.48, 95% CI: 0.85 to 2.12, P ≤ 0.001 ) had higher O2 pulse than females (WMD = 0.73, 95% CI: 0.33 to 1.12, P ≤ 0.001 ). The subgroup analysis also showed an increase in the vital capacity (VC) (WMD = 316.05, 95% CI: 239.74 to 392.35, P ≤ 0.001 ) in individuals practicing Tai Chi. When the samples were further stratified by Tai Chi practicing time, the subgroup analysis suggested that individuals practicing Tai Chi over a period of 24 weeks showed no significant difference in VC (WMD = 82.95, 95% CI: -98.34 to 264.23, P = 0.370 ), while those practicing Tai Chi over a period of 48 weeks showed a significant increase (WMD = 416.62, 95% CI: 280.68 to 552.56, P ≤ 0.001 ). Furthermore, the subgroup analysis demonstrated that the increase in VC is significantly correlated with the Tai Chi practicing time (WMD = 344.97, 95% CI: 227.88 to 442.06, P ≤ 0.001 ). Conclusion. Regular Tai Chi practice could improve the CRF in the elderly, as indicated by significant improvement in indicators including VO2max, O2pulse, VC, and HR. However, gender and practice time might influence the overall beneficial outcomes.

Tan, Tianyang↗