Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Information Sharing”

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.

849 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

WETO Software Stack Best Practices

Wind energy researchers typically share one key characteristic: a passion for increasing wind energy in the global energy mix. The U.S. Department of Energy (DOE) supports this mission in a number of ways including allocating funding directly to various aspects of wind energy research through the Office of Energy Efficiency and Renewable Energy (EERE) via the Wind Energy Technologies Office (WETO). While the traditional output of research is academic publication, software development efforts are increasingly a major focus. Software tools in the research environment allow researchers to describe an idea and quickly increase the scope and scale as they study it further. As a product of research, these tools represent a direct pipeline from researcher to industry practitioners since they are the implementation of ideas described in academic publications. Given this vital role in wind energy research and commercial development, the broad research software portfolio supported by WETO must maintain a minimum level of quality to support the wind energy field in the growing transition to renewable energy. This report outlines a series o f best practices to be adopted by all WETO-supported software projects, as well as expectations that the communities interacting with these projects should have of the developers and tools themselves. Wind energy research software has a unique standing in the field of scientific software. The stakeholders are varied with a subset being: (1) DOE EERE leadership, (2) DOE WETO leadership and program managers, (3) National lab leadership, (4) Associated project principle investigators, (5) Research software engineers, (6) Wind energy researchers in academia (including graduate students, post docs, and national lab staff), (7) Industry researchers and practitioners, (8) Commercial software developers, and (9) The general public interested in wind energy. These software are typically the end-user of other generic software libraries, so the funding cycles are often tied to applied research rather than the development of the software itself. Since the developers are also wind energy researchers, these tools are typically designed in a way that closely resembles the application in which they're used. Additionally, the expertise and incentives for the developers have a high variability, and often neither are aligned with software engineering or computer science. Given the unique environment in which wind energy research software is produced and consumed, it is critical for model owners to understand the context of their software. A framework for developing this understanding is to answer the following questions of a given software project: What is it's purpose? What is its role in the field of wind energy? What is the profile of the expected users? For how long will it be relevant? What is the expected impact? These questions allow model owners to identify the appropriate methods for the design, development, and long term maintenance of their software. Additionally, the answer provide context for future planners to understand why particular decisions were made and discern the consequences of changing course. The information is aggregated from experience within WETO-supported software development groups as well as external organizations and efforts to define the craft of research software engineering. These best practices aim to make the collaborative development process efficient and effective while improving the model understanding across stakeholders. Additionally, the general adoption of a common framework for software quality ensures that the end users of WETO software can trust these tools and accurately understand the risks to workflow integration.

17 WIND ENERGY↗
DOE OSTI2026

Bypassing the yellow phase for extremely stable formamidinium lead iodide perovskite solar cells

INTRODUCTION Formamidinium lead iodide (FAPI) emerged as an ideal material for single-junction perovskite solar cells owing to its near optimal bandgap of 1.45 to 1.5 eV and outstanding thermal stability. However, the photoactive cubic α-phase (3C-FAPI) of FAPI is structurally unstable and undergoes a reconstructive phase transition to the nonperovskite yellow hexagonal δ-phase (2H-FAPI) at ambient temperature. The phase reconstruction from 3C-FAPI to 2H-FAPI could be prevented by alloying methylammonium (MA) or Cs or both at the A-site and Br at the halide site, but this limits long-term durability owing to phase segregation or materials instability. Addressing these challenges requires a rational design strategy to stabilize 3C-FAPI by restricting lattice reconstruction without compromising thermal stability. RATIONALE Two main strategies have emerged to improve the phase stability and film quality of FAPI. Here, the first is a lattice-templating approach, which enables the slow formation of perovskite but it eventually degrades through the formation of yellow phases. The second approach, which has been widely explored, involves additive engineering, using alkyl ammonium halide or mostly chloride-based additives, which provide better control over the crystallization route. However, the FAPI films fabricated using these additives are often alloyed and compromise long-term stability. Moreover, the exact role of Cl has been unclear and speculative, specifically when Cl-based additives are used. Even after using a high additive concentration, the incorporation of Cl in perovskite lattice is rare. RESULTS Guided by synergistic modeling and experimental studies, we developed a coadditive strategy using 15 mol % FACl and 0.5 mol % BA 2 PbI 4 perovskites in combination (where BA is butylammonium) to enable a highly oriented (100) Cl-doped FAPI film with exceptional durability. Synchrotron-based in situ wide-angle x-ray scattering revealed a favorable transition for the coadditive-treated FAPI (FAPI-CA) to the corner-sharing 3C black phase through a progressive transformation through the 2H, 4H, 6H, and 8H phases. Moreover, solid-state 35 Cl nuclear magnetic resonance (NMR) revealed Cl incorporation in the perovskite lattice and, as predicted by modeling, indicated that Cl plays a key role in altering the energetics of both the formation and degradation pathways. The Cl-doped perovskite can completely bypass the expected and energetically favorable degradation pathway via the yellow phase or the 2H-PbI 2 phase. Instead, it undergoes degradation only upon exposure to harsh conditions such as 15-sun illumination and 90°C through the energetically uphill 3R-PbI 2 phase path. A p-i-n device fabricated with FAPI-CA film demonstrated a power conversion efficiency (PCE) of 25.1% with an average of 24.1% (40 devices). The notable film stability translated to other devices and retained 98% of its initial PCE under open-circuit conditions at 85° ± 5°C for 1200 hours. CONCLUSION Our study highlights the decisive role of chloride in regulating both the formation and degradation pathways. This regulation is critical for creating a perovskite film with commercially relevant durability.

Garai, Rabindranath [Rice Univ., Houston, TX (Unit↗
DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗