SOLID STATE LASER TRIGGERING SYSTEM FOR THE HERMES-III ACCELERATOR.
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.
High-frequency solar variability is an important to grid integration studies, but ground measurements are scarce. The high resolution irradiance algorithm (HRIA) has the ability to produce 4-sceond resolution global horizontal irradiance (GHI) samples, at locations across North America. However, the HRIA has not been extensively validated. In this work, we evaluate the HRIA against a database of 10 high-frequency ground-based measurements of irradiance. The evaluation focuses on variability-based metrics. This results in a greater understanding of the errors in the HRIA as well as suggestions for improvement to the HRIA.
In a previous study, we described a new abstract circuit model for reversible computation called Asynchronous Ballistic Reversible Computing (ABRC), in which localized information bearing pulses propagate ballistically along signal paths between stateful abstract devices, and elastically scatter off those devices serially, while updating the device state in a logically-reversible and deterministic fashion. The ABRC model has been shown to be capable of universal computation. In the research reported here, we begin exploring how the ABRC model might be realized in practice using single flux quantum (SFQ) solitons (fluxons) in superconducting Josephson junction (JJ) circuits. One natural family of realizations could utilize fluxon polarity to represent binary data in individual pulses propagating near-ballistically along discrete or continuous long Josephson junctions (LJJs) or microstrip passive transmission lines (PTLs), and utilize the flux charge (-1, 0, +1) of a JJ-containing superconducting loop with Φ 0 < I c L < 2Φ 0 to encode a ternary state variable internal to a device. A natural question then arises as to which of the definable abstract ABRC device functionalities using this data representation might be implementable using a JJ circuit that dissipates only a small fraction of the input fluxon energy. We discuss conservation rules and symmetries considered as constraints to be obeyed in these circuits, and begin the process of classifying the possible ABRC devices in this family having up to 3 bidirectional I/O terminals, and up to 3 internal states.
Abstract not provided.
Memory technologies are under active development. Meanwhile, workloads on contemporary computing systems are increasing rapidly in size and diversity. Such dynamics in hardware and software further widen the gap between memory system design and performance evaluation. In this work, we propose a data-centric abstraction of high-performance computing applications for fast exploration of new memory technologies. We also provide a framework that uses a formal modeling language to describe the abstraction, automatically translates abstractions into memory traffic, and directly interfaces with cycle-accurate simulators. We evaluated the framework using 20 workloads and validated the memory traffic profile, the simulation results, and the relative memory changes of four memory technologies. Our results show that the data-centric abstraction can accurately capture application behavior adaptable to different input problems and can expedite system exploration.
Abstract not provided.
Abstract In this work, we highlight the often-overlooked effects of doping on the microstructure and performance of bulk thermoelectric materials to offer a broader perspective on how dopants interact with their parent material. Using PbSe doped with Na, Ag, and K as a model material system, we combine original computational, experimental, and microscopy data with established trends in material behavior, to provide an in-depth discussion of the relationship between dopants, processing, and microstructure, and their effects on thermoelectric efficiency and thermal stability. Notable observations include differences in the microstructure and mass loss of thermally treated samples of Na- and Ag-doped PbSe, as well as findings that Na and K cations exist predominantly as substitutional point defects while Ag also occupies interstitial sites and exhibits lower solubility. We discuss how these differences in point defect populations are known to affect a dopants’ ability to alter carrier concentration and how they may affect the mechanical properties of PbSe during processing. Graphic Abstract
Abstract The oxidation resistance of FeCrAl based on alloying composition and oxidizing conditions is predicted using a combinatorial experimental and artificial intelligence approach. A neural network (NN) classification model was trained on the experimental FeCrAl dataset produced at GE Research. Furthermore, using the SHapley Additive exPlanations (SHAP) explainable artificial intelligence (XAI) tool, we explore how the NN can showcase further material insights that are unavailable directly from a black-box model. We report that high Al and Cr content forms protective oxide layer, while Mo in FeCrAl creates thick unprotective oxide scale that is vulnerable to spallation due to thermal expansion. Graphical abstract
A series of organometallic compounds containing the tris(dimethylsilyl)methyl ligand are described. The potassium carbanions KC(SiHMe 2 ) 3 and KC(SiHMe 2 }) 3 TMEDA are synthesized by deprotonation of the hydrocarbon HC(SiHMe 2 ) 3 with potassium benzyl. KC(SiHMe 2 ) 3 TMEDA crystallizes as a dimer with two types of three-center-two-electron KH- Si interactions. Homoleptic Ln(III) tris(silylalkyl) complexes containing β-SiH groups M{C(SiHMe 2 ) 3 } 3 (Ln = Y, Lu, La) are synthesized from salt elimination of the corresponding lanthanide halide and 3 equiv. of KC(SiHMe 2 ) 3 . The related reactions with Sc yield bis(silylalkyl) ate-complexes containing either LiCl or KCl. The divalent calcium and ytterbium compounds M{C(SiHMe 2 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) are prepared from MI 2 and 2 equiv of KC(SiHMe 2 ) 3 . The compounds M{C(SiHMe 2 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) and La{C(SiHMe 2 ) 3 } 3 react with 1 equiv of B(C 6 F 5 ) 3 to give 1,3- disilacyclobutane {Me2Si-C(SiHMe2)2}2 and MC(SiHMe2)3HB(C6F5)3L, and La{C(SiHMe 2 ) 3 } 2 HB(C 6 F 5 ) 3 , respectively. The corresponding reactions of Ln{C(SiHMe 2 ) 3 } 3 (Ln = Y, Lu) give the β-SiH abstraction product [{(Me 2 HSi) 3 C} 2 LnC(SiHMe 2 ) 2 SiMe 2 ][HB(C 6 F 5 ) 3 ] (Ln = Y, Lu), but the silene remains associated with the Y or Lu center. The abstraction reactions of M{C(SiHMe 2 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) and Ln{C(SiHMe 2 ) 3 } 3 (Ln = Y, Lu, La) and 2 equiv of B(C 6 F 5 ) 3 give the expected dicationic M{HB(C 6 F 5 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) and dicationic mono(silylalkyl) LnC(SiHMe 2 ) 3 {HB(C 6 F 5 ) 3 } 2 (Ln = Y, Lu, La), respectively. Salt metathesis reactions of Cp 2 (NR 2 )ZrX (X = Cl, I, OTf; R = t-Bu, SiHMe 2 ) and lithium hydrosilazide ultimately afford hydride products Cp 2 (NR 2 )ZrH that suggest unusual β-hydrogen elimination processes. A likely intermediate in one of these reactions, Cp 2 Zr[N(SiHMe 2 )t-Bu][N(SiHMe 2 ) 2 ], is isolated under controlled synthetic conditions. Addition of alkali metal salts to this zirconium hydrosilazide compound produces the corresponding zirconium hydride. However as conditions are varied, a number of other pathways are also accessible, including C-H/Si-H dehydrocoupling, γ-abstraction of a CH, and β-abstraction of a SiH. Our observations suggest that the conversion of (hydrosilazido)zirconocene to zirconium hydride does not follow the classical four-center β- elimination mechanism.
Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.
Methods and a system are provided. A method includes implementing a function, which a compiler for a first language does not have, using a compiler for a second language. The implementing step includes generating, by the compiler for the first language, a first abstract syntax tree. The implementing step further includes converting, by a converter, the first abstract syntax tree to a second abstract syntax tree of the compiler for the second language using a conversion table from data representation types in the first language to data representation types in the second language. When a compilation error occurs, the implementing step also includes generating a special node for error processing in the second abstract syntax tree and storing an error token in the special node. When unparsing, the implementing step additionally includes outputting the error token, in the form of source code written in the first language.
Methods and a system are provided. A method includes implementing a function, which a compiler for a first language does not have, using a compiler for a second language. The implementing step includes generating, by the compiler for the first language, a first abstract syntax tree. The implementing step further includes converting, by a converter, the first abstract syntax tree to a second abstract syntax tree of the compiler for the second language using a conversion table from data representation types in the first language to data representation types in the second language. When a compilation error occurs, the implementing step also includes generating a special node for error processing in the second abstract syntax tree and storing an error token in the special node. When unparsing, the implementing step additionally includes outputting the error token, in the form of source code written in the first language.
Methods and a system are provided. A method includes implementing a function, which a compiler for a first language does not have, using a compiler for a second language. The implementing step includes generating, by the compiler for the first language, a first abstract syntax tree. The implementing step further includes converting, by a converter, the first abstract syntax tree to a second abstract syntax tree of the compiler for the second language using a conversion table from data representation types in the first language to data representation types in the second language. When a compilation error occurs, the implementing step also includes generating a special node for error processing in the second abstract syntax tree and storing an error token in the special node. When unparsing, the implementing step additionally includes outputting the error token, in the form of source code written in the first language.
The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. along with hierarchical-heterogeneous memory, the system typically has a high-performing network ad a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also for running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models and software layer have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. A programming abstraction to address this problem. The programming abstraction is implemented as a software library and runs on pre-exascale and exascale systems supporting current and emerging system architecture. Using distributed data-structures as a central concept, it provides (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications.
The bay-capping mechanism on PAH armchair edges and the kinetics of acetylene addition to 6–6–5 and 5–6–5 bays have been explored by ab initio/RRKM-ME calculations. The bays on the edges were modeled by C 21 H 11 and C 20 H 9 radicals produced by H abstractions from 7H-benzo[c]cyclopenta[e]pyrene and dicyclopenta[cf]pyrene. The C 20 H 9 + C 2 H 2 reaction is shown to have a low entrance barrier and to rapidly form the capped product, indaceno[2,1,8,7-cdefg]pyrene, along with ethynyl substituted dicyclopenta[cf]pyrene at temperatures above 1400 K. The reactivity of C 21 H 11 is shown to be governed by the location of the unpaired electron; the π radical R1 formed by H abstraction from the CH 2 group in 7H-benzo[c]cyclopenta[e]pyrene reacts with C 2 H 2 very slowly owing to a high entrance barrier, with the bay-capping rate constant approaching 10 -16 cm 3 molecule -1 s -1 only at temperatures above 2000K. Further, this result reaffirms that the growth of π aryl radicals via acetylene addition is inefficient and reflects the generally low reactivity of such radicals where the spin density is highly delocalized over the entire polyaromatic system. Alternatively, the σ C 21 H 11 radical R2 produced by H abstraction from the five-membered ring at the bay rapidly reacts with C 2 H 2 forming the bay-capped product, with the rate constant on the order of 10 -12 cm 3 molecule -1 s -1 at T≥1500K. Rate constants for the capping reactions at the 6–6–5 and 5–6–5 bays are compared with those at the 6–0–6, 6–6–6, and 6–5–6 bays. The site-specific bay-capping rate constants have been utilized in kMC simulations of the PAH growth and the results showed measurable differences when the 6–6–5 and 5–6–5 bay-capping reactions are taken into account, including an increase of the growth rate and the formation of closed-shell PAH and a rise of the number of embedded five-membered rings accompanied with a slight decrease of their overall amount.