Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph drawing”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Neural Networks and Graph Algorithms with Next-Generation Processors

The use of graphical processors for distributed computation revolutionized the field of high performance scientific computing. As the Moore's Law era of computing draws to a close, the development of non-Von Neumann systems: neuromorphic processing units, and quantum annealers; again are redefining new territory for computational methods. While these technologies are still in their nascent stages, we discuss their potential to advance computing in two domains: machine learning, and solving constraint satisfaction problems. Each of these processors utilize fundamentally different theoretical models of computation. This raises questions about how to best use them in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. This provides hints at the future infrastructure needed to integrate many next-generation processing units into conventional high-performance computing systems.

Hamilton, Kathleen↗
DOE OSTI2026

Vulcan-Forge: Architecture and Design of a Multi-Modal Forensic Analysis Plugin for CALDERA

Forge and VULCAN together describe an open-architecture cybersecurity analysis ecosystem that unifies forensic artifact processing, detection engineering, and vulnerability intelligence within integrated platforms. Forge operates as a plugin for MITRE CALDERA, ingesting diverse evidence formats—including EVTX, PCAP/PCAPNG, CSV, JSON, YAML, XML, binaries, and archives—to construct a unified artifact graph enriched with severity scoring, TLP classification, and audit trails. It provides subsystems for artifact parsing, streaming structured-data visualization, NetworkMiner-based packet inspection, PE/.NET binary analysis, and LLM-assisted triage and rule generation, with outputs validated against CCCS-YARA and pySigma schemas. VULCAN complements this by serving as a cybersecurity analyst platform that integrates a Neo4j knowledge graph, Qdrant vector retrieval, SSVC-based triage, and a local LLM to deliver CVE intelligence and forensic analysis through a multi-source ingest pipeline drawing from NVD, CISA KEV, EPSS, MITRE ATT&CK, and CAPEC. Together, they bridge structured threat intelligence with automated forensic analysis and detection workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Electricity Market Dynamics as Smooth Games: Organizing Gradient-Based Learners and Identifying Instabilities

Wide-spread adoption of machine learning and distributed energy production has the potential to fundamentally change behaviours of energy markets. In practice, along with the benefits, previously unseen instabilities have begun emerging in markets currently embracing these technologies. In this report we study electricity markets as dynamical systems arising in smooth games, where energy consumers are modelled as gradient-based learners who interact on a graph through distributed energy producers. We give simple examples of how instabilities can arise even when the consumers’ local objectives seem reasonable and how these instabilities can be remedied. Drawing insights from these examples, we begin developing a general model of optimization-driven electricity market dynamics and give conditions for ensuring local Nash equilibria of the system are stable fixed points of the dynamics. Our results demonstrate how models of electricity market dynamics might be used for deriving formal guarantees in order to stabilize markets and enact regulatory policies in the face of market shocks.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

Distributed Energy Resources Customer Adoption Model - Graphical User Interface, Version 2.1.8

The DER-CAM Graphical User Interface has been redesigned to consist of a dynamic tree structure on the left side of the application window to allow users to quickly navigate between different data categories and views. Views can either be tables with model parameters and input data, the optimization results, or a graphical interface to draw circuit topology and visualize investment results. The model parameters and input data consist of tables where values are assigned to specific keys. The aggregation of all model parameters and input data amounts to the data required to build a DER-CAM model, and is passed to the GAMS solver when users initiate the DER-CAM optimization process. Passing data to the GAMS solver relies on the use of a Java server that handles DER-CAM requests, queuing, and results delivery. This component of the DER-CAM GUI can be deployed either locally or remotely, and constitutes an intermediate step between the user data input and manipulation, and the execution of a DER-CAM optimization in the GAMS engine. The results view shows the results of the DER-CAM optimization and distinguishes between a single and a multi-objective process. The single optimization runs the DER-CAM optimization once and presents the results as a combination of summary charts and hourly dispatch profiles. The multi-objective optimization process consists of a sequence of runs initiated by the GUI, including: 1) CO2 minimization, 2) cost minimization, 3) a user defined number of points in-between objectives 1) and 2). The multi-objective results view includes both access to the detailed results of each point generated by the process as well as the generation of a Pareto Frontier graph to illustrate the trade-off between objectives. DER-CAM GUI 2.1.8 also introduces the ability to graphically generate circuit topologies, enabling support to DER-CAM 5.0.0. This feature consists of: 1) The drawing area, where users can manually create nodes and define their properties (e.g. point of common coupling, slack bus, load) and connect them through edges representing either power lines, transformers, or heat pipes, all with user defined characteristics (e.g., length, ampacity, inductance, or heat loss); 2) The tables, which display the user-defined topology in the final numerical form that will be passed to the DER-CAM optimization. Finally, the DER-CAM GUI is also deployed with a database schema that allows users to provide different energy load profiles, solar irradiance profiles, and tariff data, that can be stored locally and later used in any DER-CAM model. However, no real data will be delivered with this version.

Ewald, Friedrich↗
DOE OSTI2023

A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks

Hyperbolic neural networks have recently gained significant attention due to their promising results on several graph problems including node classification and link prediction. The primary reason for this success is the effectiveness of hyperbolic space in capturing the inherent hierarchy of graph datasets. However, they are limited in terms of generalization, scalability, and have inferior performance when applied to non-hierarchical datasets. In this paper, we take a completely different perspective for modeling hyperbolic networks and answer the following question: is an Euclidean model able to approximate a function or behavior in the hyperbolic space? Extending the universal approximation theory developed for Euclidean models, We draw an analogy from the hyperbolic components to the Euclidean counterparts and conclude that, in order to capture hierarchical features, it is possible to generalize hyperbolic models to be a special case of Euclidean models with the proposed Pseudo-Poincaré technique. We applied our non-linear hyperbolic normalization to the current state-of-the-art homogeneous and multi-relational graph networks and demonstrate significant improvements in performance compared to both Euclidean and hyperbolic counterparts. The primary impact of this work lies in its ability to capture hierarchical features in the Euclidean space, and thus, can replace hyperbolic networks without any loss in performance metrics while simultaneously leveraging the power of Euclidean networks such as interpretability and efficient execution of various model components.

Khatir, Mehrdad↗
DOE OSTI2017

Considerations on the Use of Custom Accelerators for Big Data Analytics

Accelerators, including Graphic Processing Units (GPUs) for gen- eral purpose computation, many-core designs with wide vector units (e.g., Intel Phi), have become a common component of many high performance clusters. The appearance of more stable and reliable tools tools that can automatically convert code written in high-level specifications with annotations (such as C or C++) to hardware de- scription languages (High-Level Synthesis - HLS), is also setting the stage for a broader use of reconfigurable devices (e.g., Field Pro- grammable Gate Arrays - FPGAs) in high performance system for the implementation of custom accelerators, helped by the fact that new processors include advanced cache-coherent interconnects for these components. In this chapter, we briefly survey the status of the use of accelerators in high performance systems targeted at big data analytics applications. We argue that, although the progress in the use of accelerators for this class of applications has been sig- nificant, differently from scientific simulations there still are gaps to close. This is particularly true for the ”irregular” behaviors exhibited by no-SQL, graph databases. We focus our attention on the limits of HLS tools for data analytics and graph methods, and discuss a new architectural template that better fits the requirement of this class of applications. We validate the new architectural templates by mod- ifying the Graph Engine for Multithreaded System (GEMS) frame- work to support accelerators generated with such a methodology, and testing with queries coming from the Lehigh University Benchmark (LUBM). The architectural template enables better supporting the task and memory level parallelism present in graph methods by sup- porting a new control model and a enhanced memory interface. We show that out solution allows generating parallel accelerators, pro- viding speed ups with respect to conventional HLS flows. We finally draw conclusions and present a perspective on the use of reconfig- urable devices and Design Automation tools for data analytics.

Data Analytics↗
DOE OSTI2013

Adaptive Sampling Algorithms for Probabilistic Risk Assessment of Nuclear Simulations

Nuclear simulations are often computationally expensive, time-consuming, and high-dimensional with respect to the number of input parameters. Thus exploring the space of all possible simulation outcomes is infeasible using finite computing resources. During simulation-based probabilistic risk analysis, it is important to discover the relationship between a potentially large number of input parameters and the output of a simulation using as few simulation trials as possible. This is a typical context for performing adaptive sampling where a few observations are obtained from the simulation, a surrogate model is built to represent the simulation space, and new samples are selected based on the model constructed. The surrogate model is then updated based on the simulation results of the sampled points. In this way, we attempt to gain the most information possible with a small number of carefully selected sampled points, limiting the number of expensive trials needed to understand features of the simulation space. We analyze the specific use case of identifying the limit surface, i.e., the boundaries in the simulation space between system failure and system success. In this study, we explore several techniques for adaptively sampling the parameter space in order to reconstruct the limit surface. We focus on several adaptive sampling schemes. First, we seek to learn a global model of the entire simulation space using prediction models or neighborhood graphs and extract the limit surface as an iso-surface of the global model. Second, we estimate the limit surface by sampling in the neighborhood of the current estimate based on topological segmentations obtained locally. Our techniques draw inspirations from topological structure known as the Morse-Smale complex. We highlight the advantages and disadvantages of using a global prediction model versus local topological view of the simulation space, comparing several different strategies for adaptive sampling in both contexts. One of the most interesting models we propose attempt to marry the two by obtaining a coarse global representation using prediction models, and a detailed local representation based on topology. Our methods are validated on several analytical test functions as well as a small nuclear simulation dataset modeled after a simplified Pressurized Water Reactor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

LA-R43S6-L1 Postshot Report [Slides]

The Ranchero LA-R43S6-L1 test (formerly referred to as LA-43S-L1. The R specifically designates it is a Ranchero device and the 6 indicates a 6” high explosive charge diameter in anticipation of using larger diameters in the future.) was conducted on 3/8/17 with good success. The experiment was the first test of a “Swooped” Ranchero flux compression generator (FCG), and the load for the test was an aluminum imploding liner. In addition to the swoop, the stator was anodized to provide an insulating layer instead of one or more layers of polyethylene as had been the case for all earlier Ranchero tests. Using the Firing point TA-39-88 capacitor bank, 3.5 MA was delivered to the FCG for the initial magnetic field, and 36.4 MA were delivered to the load having an initial inductance of 2.5 nH. Implosion speeds over 1.1 cm/us were recorded, which exceeds previous LANL solid liner experimental results. The test was diagnosed with 18 PDV channels, 12 of which recorded liner implosion data, and the other 6 of which tracked the FCG armature during flux compression. These armature expansion data recorded during flux compression are the first of their kind, and it was previously unknown, due to unknown effects of the SF 6 in the flux compression volume, whether or not the expansion could be recorded using the PDV technique. Post shot 2D MHD calculations employed a complete external circuit model, and an improved flux diffusion model not available prior to the test. Results from these simulations show very good agreement with the experimental result. Four PDV channels recorded the liner implosion viewed radially outward from the center of the liner. All four of these probes recorded implosion velocities greater that 1 cm/µs, with the cylindrical center displaced by ~2 mm from actual center. Four PDV channels looked at +10° angles from the CMU wall, and four looked at -10° angles. A glide plane interaction is shown moving toward the center of the liner in MHD calculations, and PDV probes provide confirmation. The high explosive (HE) in the LA-R43S6-L1 test was PBX 9501 which had to be glued together in many pieces, and the test was preceded by a camera test to verify that the PBX 9501 could be assembled with acceptable tolerance in glue joints to prevent severing the armature during expansion. The camera test verified an acceptable armature performance, and results are given in complete detail in a post shot report LA-UR-19-20124, and summarized here. This report provides complete detail of the considerable body of data obtained on the test and in the post shot calculations. It is prepared in Power Point for ease of preparation and future review. Shot documentation available in the LANL on-line library are included as references, and non-referenceable documents will be cited and stored in an LA- R43S6-L1 post shot folder stored on an M-6 shared drive. Fabrication drawings are also maintained in an M-6 shared drive and paper files are available from M-6 personnel. This report will be maintained as a PowerPoint document on the shared drive, as well, since included movies will play and graphs from Excel files retain information in the PowerPoint versions. PDF versions are required for clearance and are not to large to send by e-mail.

42 ENGINEERING↗
DOE OSTI2024

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗
DOE OSTI2016

SU-F-T-99: Data Visualization From a Treatment Planning Tracking System for Radiation Oncology

Purpose: A treatment planning process tracker database with input forms and a TV-viewable display webpage was developed and implemented in our clinic to collect time data points throughout the process. Tracking plan times is important because it directly affects the patient quality of care. Simply, the longer a patient waits after their initial simulation CT for treatment to begin, the more time the cancer has to progress. The tracker helps to drive workflow through the clinic, while the data collected can be used to understand and manage the process to find and eliminate inefficiencies. Methods: The overall process steps tracked are CT-simulation, mark patient, draw normal contours, draw target volumes, create plan, and review/approve plan. Time stamps for task completion were extracted and used to generate a set of clinic metrics, among which include average time for each step in the process split apart by type of treatment, average time to completion for plans started in a given week, and individual overall completion time per plan. Results: Trends have been tracked for fourteen weeks of clinical data (196 plans). On average, drawing normal contours and target volumes is taking 2–5 times as long as creating the plan itself. This is potentially an issue because it could mean the process is taking too long initially, and it could be forcing the planning step to be done in a short amount of time. We also saw from our graphs that there appears to be no clear trend on the average amount of time per plan week-to-week. Conclusion: A tracker of this type has the potential to provide insight into how time is utilized in our clinic. By equipping our dosimetrists, radiation oncologists, and physicists with individualized metric sets, the tracker can help provide visibility and drive workflow. Funded in part by CPRIT (RP140105).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

SU-F-T-242: A Method for Collision Avoidance in External Beam Radiation Therapy

Purpose: We proposed a method for collision avoidance (CA) in external beam radiation therapy (EBRT). The method encompasses the analysis of all positions of the moving components of the beam delivery system such as the treatment table and gantry, including patient specific information obtained from the CT images. This method eliminates the need for time-consuming dry-runs prior to the actual treatments. Methods: The QA procedure for EBRT requires that the collision should be checked prior to treatment. We developed a system capable of a rigorous computer simulation of all moving components including positions of the couch and gantry during the delivery, position of the patients, and imaging equipment. By running this treatment simulation it is possible to quantify and graphically represent all positions and corresponding trajectories of all points of the moving parts during the treatment delivery. The development of the workflow for implementation of the CA includes several steps: a) derivation of combined dynamic equation of motion of the EBRT delivery systems, b) developing the simulation model capable of drawing the motion trajectories of the specific points, c) developing the interface between the model and the treatment plan parameters such as couch and gantry parameters for each field. Results: The patient CT images were registered to the treatment couch so the patient dimensions were included into the simulation. The treatment field parameters were structured in the xml-file which was used as the input into the dynamic equations. The trajectories of the moving components were plotted on the same graph using the dynamic equations. If the trajectories intersect that was the signal that collision exists. Conclusion: This CA method was proved to be effective in the simulation of treatment delivery. The proper implementation of this system can potentially improve the QA program and increase the efficacy in the clinical setup.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Tidal Turbine Test, Downeast Turbines, July 12, 2021

Downeast Turbines tested a tidal turbine prototype with novel rotor/channel system and lateral effluent discharge apparatus (LEDA), during five days of testing in the flume at Alden Lab. Three days of testing (July 12-14, 2021) focused on turbine power metrics of torque and rpm, which were low, and then two days of follow-up testing (July 27-28, 2021) focused on LEDA performance metrics of pressure differential and rates of volumetric flow, with encouraging results. Next step is to to characterize, and even optimize, configurations of the LEDA, using 3D-CFD as a helpful tool, to refine its shape and explore its limits of performance as a means of effluent discharge that augments performance of an instream turbine. An improved configuration of the LEDA will be re-combined with the rotor/channel system of the turbine prototype, and ultimately, the rotor will be re-sized (enlarged), to better match the LEDA's performance capabilities in drawing through a rate of volumetric flow. This submission is Downeast Turbines' Post Access Report for the test event. It includes the files described here (next below), and several reference links. "Downeast TEAMER-Post-Access-Report...docx" is a document file containing the report. "Appendices A, B, and C" are included in this file, and so are "Figures #1-7." "Appendix D - Test Data Workbooks.zip" is an archive file containing all post access data (raw data tables, calculating tables, and graphs), presented in fourteen Excel workbooks as described in the report. "Appendix E - Post Access Figures.zip" is an archive file containing "Figures #8-52," of the report.

16 TIDAL AND WAVE POWER↗
DOE OSTI2023

Natural Language Processing-Enhanced Nuclear Industry Operating Experience Data Analysis: Aggregation and Interpretation of Multi-Report Analysis Results

Industry-wide operating experience is a critical source of raw data for reliability and risk model parameter estimations for nuclear power plants. A large portion of operating experience data are failure events stored as reports that contain unstructured data, such as narratives. In current practice, a failure report is usually reviewed and manually coded by analysts. The coding is based on extracting several event characteristics such as system name, component type, sub-part type, failure mode, and failure cause. Event narratives are mostly used to help understand events and extract their characteristics. In this line of research, we aim to maximize the usage of event narratives by leveraging natural language processing (NLP) methods to automatically convert an event narrative to a causal graph. This research has promise to improve physical understanding of failure initiation and propagation and to facilitate use of non-failure data (e.g., near-misses and degradations) to complement the limited data pool of failures. In our previous work, we developed an NLP tool and applied it to analyze a number of licensee event reports submitted by U.S. nuclear power plants to the Nuclear Regulatory Commission. In this paper, we will report our recent research progress in aggregating the results of multiple reports, developing network model(s), and drawing statistical insights.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2013

Geographic Information System Tools for Management of US DOE Sites - 13489

The DOE Office of Legacy Management (LM) uses a variety of GIS tools to support long-term surveillance and maintenance (LTS and M) activities at DOE closure sites. These geo-spatial applications provide access to data both for external public viewing and for internal analysis and decision making. LM uses a custom geo-spatial application called geo-spatial Environmental Mapping System (GEMS) that draws validated information from a database of 4.6 million analytical results and 232,000 water level measurements for 58 LTS and M sites. These data were collected from transferred sites over a period of 40 years. The database is used to capture and store historical environmental information such as analytical chemistry data, groundwater depths and elevations, well logs, well construction data, geo-referenced boundaries, site physical features, and sampling locations from LTS and M sites. Stakeholders, regulators, and project personnel can use this Web-based application and data to display information in several forms, such as a tabular report, a graph, and a geo-spatial display, or the data can be labeled or highlighted in a map view. Institutional controls, with their LTS and M requirements and documentation, have recently been incorporated into a prototype GEMS Web page for the Weldon Spring, Missouri, Site. LM uses multiple internal GIS viewers to help ensure the future protection of human health and the environment. For example, at the Rocky Flats, Colorado, Site, LM uses a GIS application to display real property interests on authoritative maps. Another project is used to facilitate discussions at stakeholder meetings for the Rocky Flats site's Original Landfill. The Uranium Leasing Program uses multiple interactive maps that assist in ongoing monitoring and the oversight of lease-holders' activities. (authors)

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

SHAD: the Scalable High-performance Algorithms and Data-structures Library

The unprecedented amount of data that needs to be processed in emerging data analytics applications poses novel challenges to industry and academia. Scalability and high performance become more than a desirable feature because, due to the scale and the nature of the problems, they draw the line between what is achievable and what is unfeasible. In this paper, we propose SHAD, the Scalable High-performance Algorithms and Data-structures library. SHAD adopts a modular design that confines low level details and promotes reuse. SHAD's core is built on an Abstract Runtime Interface which enhances portability and identifies the minimal set of features of the underlying system required by the framework. The core library includes common data-structures such as: Array, Vector, Map and Set. These are designed to accommodate significant amount of data which can be accessed in massively parallel environments, and used as building blocks for SHAD extensions, i.e. higher level software libraries. We have validated and evaluated our design with a performance and scalability study of the core components of the library. We have validated the design flexibility by proposing a Graph Library as an example of SHAD extension, which implements two different graph data-structures; we evaluate their performance with a set of graph applications. Experimental results show that the approach is promising in terms of both performance and scalability. On a distributed system with 320 cores, SHAD Arrays are able to sustain a throughput of 65 billion operations per second, while SHAD Maps sustain 1 billion of operations per second. Algorithms implemented using the Graph Library exhibit performance and scalability comparable to a custom solution, but with smaller development effort.

Castellana, Vito G.↗
DOE OSTI2012

Uncertainty Quantification of Hypothesis Testing for the Integrated Knowledge Engine

The Integrated Knowledge Engine (IKE) is a tool of Bayesian analysis, based on Bayesian Belief Networks or Bayesian networks for short. A Bayesian network is a graphical model (directed acyclic graph) that allows representing the probabilistic structure of many variables assuming a localized type of dependency called the Markov property. The Markov property in this instance makes any node or random variable to be independent of any non-descendant node given information about its parent. A direct consequence of this property is that it is relatively easy to incorporate new evidence and derive the appropriate consequences, which in general is not an easy or feasible task. Typically we use Bayesian networks as predictive models for a small subset of the variables, either the leave nodes or the root nodes. In IKE, since most applications deal with diagnostics, we are interested in predicting the likelihood of the root nodes given new observations on any of the children nodes. The root nodes represent the various possible outcomes of the analysis, and an important problem is to determine when we have gathered enough evidence to lean toward one of these particular outcomes. This document presents criteria to decide when the evidence gathered is sufficient to draw a particular conclusion or decide in favor of a particular outcome by quantifying the uncertainty in the conclusions that are drawn from the data. The material in this document is organized as follows: Section 2 presents briefly a forensics Bayesian network, and we explore evaluating the information provided by new evidence by looking first at the posterior distribution of the nodes of interest, and then at the corresponding posterior odds ratios. Section 3 presents a third alternative: Bayes Factors. In section 4 we finalize by showing the relation between the posterior odds ratios and Bayes factors and showing examples these cases, and in section 5 we conclude by providing clear guidelines of how to use these for the type of Bayesian networks used in IKE.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Using Water-Level Models to Conceptualize Groundwater-Flow Systems: Examples from the Nevada National Security Site - 17044

Analysis of water-level trends in well hydro-graphs can be used to better understand and conceptualize a groundwater-flow system. A water-level trend reflects the summation of all natural and anthropogenic stresses acting on the aquifer at the well location. Common stresses include recharge, evapotranspiration, barometric pressure, earth tides, and pumping. A water-level model (WLM) can be used as a tool to distinguish which stresses are affecting the trend and quantify the impact of each stress on the trend. A WLM is an analytical model that fits measured water levels to a synthetic curve representing the sum of one or more time-series components that explain the water-level trend. Time-series components include recharge pulses simulated with Gamma transforms of precipitation; long-term climatic trends and barometric-pressure responses simulated with moving averages of barometric pressure and water levels in background wells; tidal responses computed from theoretical tidal signals; and pumping drawdown simulated with Theis models. WLM examples are presented to show how to: (1) determine and decompose stresses affecting long-term water levels in wells; and (2) estimate short-term draw-downs in observation wells where drawdown is masked by environmental water-level fluctuations. (authors)

58 GEOSCIENCES↗
DOE OSTI2020

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗