Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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,261 records · Page 70

SU-E-I-92: Is Photon Starvation Preventing Metal Artifact Reduction Algorithm From Working in KVCT?

Purpose: High density/high atomic number metallic objects create shading and streaking metal artifacts in the CT image that can cause inaccurate delineation of anatomical structures or inaccurate radiation dose calculation. A modified iterative maximum-likelihood polychromatic algorithm for CT (mIMPACT) that models the energy response of detectors, photon interaction processes and beam polychromaticity has successfully reduced metal artifacts in MVCT. Our extension of mIMPACT in kVCT did not significantly reduce metal artifacts for high density metal like steel. We hypothesize that photon starvation may result in the measured data in a commercial kVCT imaging beam. Methods: We measured attenuation of a range of steel plate thicknesses, sandwiched between two 12cm thick solid water blocks, using a Phillips Big Bore CTTM scanner in scout acquisition mode with 120kVp and 200mAs. The transmitted signal (y) was normalized to the air scan signal (y{sub 0}) to get attenuation [i.e., ln(y/y{sub 0})] data for a detector. Results: Below steel plate thickness of 13.4mm, the variations in measured attenuation as a function of view number are characterized by a quantum noise and show increased attenuation with metal thickness. On or above this thickness the attenuation shows discrete levels in addition to the quantum noise. Some views have saturated attenuation value. The histograms of the measured attenuation for up to 36.7mm of steel show this trend. The detector signal is so small that the quantization levels in the analog to digital (A-to-D) converter are visible, a clear indication of photon starvation. Conclusion: Photons reaching the kVCT detector after passing through a thick metal plate are either so low in number that the signal measured has large quantum noise, or are completely absorbed inside the plate creating photon starvation. This is un-interpretable by the mIMPACT algorithm and cannot reduce metal artifacts in kVCT for certain realistic thicknesses of steel hip implants. Moti Raj Paudel is supported by the Vanier Canada Graduate Scholarship, the Endowed Graduate Scholarship in Oncology and the Dissertation Fellowship at the University of Alberta. The authors acknowledge the CIHR operating grant number MOP 53254.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Adaptive Machine Learning for Bragg Coherent Diffraction Imaging (BCDI) of 3D Electron Density Maps with Application to La 2-x Ba x CuO 4 (LBCO) High Temperature Superconductor Studies [PowerPoint]

Understanding mesoscale heterogeneity is important for evaluating fatigue and failure of structural materials and for manufacturing processes. Data-driven tools can facilitate in guiding effort investment (measurements and computations) at various stages of the materials development. Our 3D reconstruction approach is to find a set of coefficients which define a bounding surface of the electron density. Data for training the 3D CNN was generated by sampling coefficients from uniform distributions. Test vs. prediction values are shown for the 28 even-valued coefficients for 1000 test structures, with the best and worst performers highlighted. The adaptive part of this work utilized a model independent extremum seeking (ES). The predictions of the CNN were used as the starting point for the ES algorithm. The convergence of the ES algorithm for 3 different structures is illustrated, and the robustness of the adaptive ML approach was demonstrated on experimentally measured 3D crystal from high energy diffraction microscopy. Reconstruction of a non-uniform density volume with different levels of Poisson noise is also shown. Preliminary attempts at reconstructing measured La 2-x Ba x CuO 4 diffraction patterns have so far failed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Structure retrieval from four-dimensional scanning transmission electron microscopy: Statistical analysis of potential pitfalls in high-dimensional data

Four-dimensional (4D) scanning transmission electron microscopy is one of the most rapidly growing modes of electron microscopy imaging. The advent of fast pixelated cameras and the associated data infrastructure have greatly accelerated this process. Yet conversion of the 4D datasets into physically meaningful structure images in real space remains an open issue. In this work, we demonstrate that it is possible to systematically create filters that will affect the apparent resolution or even qualitative features of the real-space structure image, reconstructing artificially generated patterns. As initial efforts, we explore statistical model selection algorithms, aiming for robustness and reliability of estimated filters. This statistical model selection analysis demonstrates the need for regularization and cross validation of inversion methods to robustly recover structure from high-dimensional diffraction datasets.

36 MATERIALS SCIENCE↗

Synchronized multiartifact reduction with tomographic reconstruction (SMART-RECON): A statistical model based iterative image reconstruction method to eliminate limited-view artifacts and to mitigate the temporal-average artifacts in time-resolved CT

Purpose: In x-ray computed tomography (CT), a violation of the Tuy data sufficiency condition leads to limited-view artifacts. In some applications, it is desirable to use data corresponding to a narrow temporal window to reconstruct images with reduced temporal-average artifacts. However, the need to reduce temporal-average artifacts in practice may result in a violation of the Tuy condition and thus undesirable limited-view artifacts. In this paper, the authors present a new iterative reconstruction method, synchronized multiartifact reduction with tomographic reconstruction (SMART-RECON), to eliminate limited-view artifacts using data acquired within an ultranarrow temporal window that severely violates the Tuy condition. Methods: In time-resolved contrast enhanced CT acquisitions, image contrast dynamically changes during data acquisition. Each image reconstructed from data acquired in a given temporal window represents one time frame and can be denoted as an image vector. Conventionally, each individual time frame is reconstructed independently. In this paper, all image frames are grouped into a spatial–temporal image matrix and are reconstructed together. Rather than the spatial and/or temporal smoothing regularizers commonly used in iterative image reconstruction, the nuclear norm of the spatial–temporal image matrix is used in SMART-RECON to regularize the reconstruction of all image time frames. This regularizer exploits the low-dimensional structure of the spatial–temporal image matrix to mitigate limited-view artifacts when an ultranarrow temporal window is desired in some applications to reduce temporal-average artifacts. Both numerical simulations in two dimensional image slices with known ground truth and in vivo human subject data acquired in a contrast enhanced cone beam CT exam have been used to validate the proposed SMART-RECON algorithm and to demonstrate the initial performance of the algorithm. Reconstruction errors and temporal fidelity of the reconstructed images were quantified using the relative root mean square error (rRMSE) and the universal quality index (UQI) in numerical simulations. The performance of the SMART-RECON algorithm was compared with that of the prior image constrained compressed sensing (PICCS) reconstruction quantitatively in simulations and qualitatively in human subject exam. Results: In numerical simulations, the 240{sup ∘} short scan angular span was divided into four consecutive 60{sup ∘} angular subsectors. SMART-RECON enables four high temporal fidelity images without limited-view artifacts. The average rRMSE is 16% and UQIs are 0.96 and 0.95 for the two local regions of interest, respectively. In contrast, the corresponding average rRMSE and UQIs are 25%, 0.78, and 0.81, respectively, for the PICCS reconstruction. Note that only one filtered backprojection image can be reconstructed from the same data set with an average rRMSE and UQIs are 45%, 0.71, and 0.79, respectively, to benchmark reconstruction accuracies. For in vivo contrast enhanced cone beam CT data acquired from a short scan angular span of 200{sup ∘}, three 66{sup ∘} angular subsectors were used in SMART-RECON. The results demonstrated clear contrast difference in three SMART-RECON reconstructed image volumes without limited-view artifacts. In contrast, for the same angular sectors, PICCS cannot reconstruct images without limited-view artifacts and with clear contrast difference in three reconstructed image volumes. Conclusions: In time-resolved CT, the proposed SMART-RECON method provides a new method to eliminate limited-view artifacts using data acquired in an ultranarrow temporal window, which corresponds to approximately 60{sup ∘} angular subsectors.

60 APPLIED LIFE SCIENCES↗

Graph Learning in Knowledge Bases

The amount of text data has been growing exponentially in recent years, giving rise to automatic information extraction methods that store text annotations in a database. The current state-of-theart structured prediction methods, however, are likely to contain errors and it’s important to be able to manage the overall uncertainty of the database. On the other hand, the advent of crowdsourcing has enabled humans to aid machine algorithms at scale. As part of this project we introduced pi-CASTLE , a system that optimizes and integrates human and machine computing as applied to a complex structured prediction problem involving conditional random fields (CRFs). We proposed strategies grounded in information theory to select a token subset, formulate questions for the crowd to label, and integrate these labelings back into the database using a method of constrained inference. On both a text segmentation task over academic citations and a named entity recognition task over tweets we showed an order of magnitude improvement in accuracy gain over baseline methods.

97 MATHEMATICS AND COMPUTING↗

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗

rascalc : a jackknife approach to estimating single- and multitracer galaxy covariance matrices

ABSTRACT To make use of clustering statistics from large cosmological surveys, accurate and precise covariance matrices are needed. We present a new code to estimate large-scale galaxy two-point correlation function (2PCF) covariances in arbitrary survey geometries that, due to new sampling techniques, runs ∼104 times faster than previous codes, computing finely binned covariance matrices with negligible noise in less than 100 CPU-hours. As in previous works, non-Gaussianity is approximated via a small rescaling of shot noise in the theoretical model, calibrated by comparing jackknife survey covariances to an associated jackknife model. The flexible code, rascalc, has been publicly released, and automatically takes care of all necessary pre- and post-processing, requiring only a single input data set (without a prior 2PCF model). Deviations between large-scale model covariances from a mock survey and those from a large suite of mocks are found to be indistinguishable from noise. In addition, the choice of input mock is shown to be irrelevant for desired noise levels below ∼105 mocks. Coupled with its generalization to multitracer data sets, this shows the algorithm to be an excellent tool for analysis, reducing the need for large numbers of mock simulations to be computed.

79 ASTRONOMY AND ASTROPHYSICS↗

A general higher-order remap algorithm for ALE calculations

A numerical technique for solving the equations of fluid dynamics with arbitrary mesh motion is presented. The three phases of the Arbitrary Lagrangian Eulerian (ALE) methodology are outlined: the Lagrangian phase, grid relaxation phase and remap phase. The Lagrangian phase follows a well known approach from the HEMP code; in addition the strain rate andflow divergence are calculated in a consistent manner according to Margolin. A donor cell method from the SALE code forms the basis of the remap step, but unlike SALE a higher order correction based on monotone gradients is also added to the remap. Four test problems were explored to evaluate the fidelity of these numerical techniques, as implemented in a simple test code, written in the C programming language, called Cercion. Novel cell-centered data structures are used in Cercion to reduce the complexity of the programming and maximize the efficiency of memory usage. The locations of the shock and contact discontinuity in the Riemann shock tube problem are well captured. Cercion demonstrates a high degree of symmetry when calculating the Sedov blast wave solution, with a peak density at the shock front that is similar to the value determined by the RAGE code. For a flyer plate test problem both Cercion and FLAG give virtually the same velocity temporal profile at the target-vacuum interface. When calculating a cylindrical implosion of a steel shell, Cercion and FLAG agree well and the Cercion results are insensitive to the use of ALE.

36 MATERIALS SCIENCE↗

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).

hypergraph algorithms, graph algorithms, parallel ↗

Towards a unified description of the hydrogen bond network of liquid water: A dynamics based approach

The definition of a hydrogen bond (H-bond) is intimately related to the topological and dynamic properties of the hydrogen bond network within liquid water. The development of a universal H-bond definition for water is an active area of research as it would remove many ambiguities in the network properties that derive from the fixed definition employed to assign whether a water dimer is hydrogen bonded. This work investigates the impact that an electronic-structure based definition, an energetic, and a geometric definition of the H-bond has upon both topological and dynamic network behavior of simulated water. In each definition, the use of a cutoff (either geometric or energetic) to assign the presence of a H-bond leads to the formation of transiently bonded or broken dimers, which have been quantified within the simulation data. The relative concentration of transient species, and their duration, results in two of the three definitions sharing similarities in either topological or dynamic features (H-bond distribution, H-bond lifetime, etc.), however no two definitions exhibit similar behavior for both classes of network properties. In fact, two networks with similar local network topology (as indicated by similar average H-bonds) can have dramatically different global network topology (as indicated by the defect state distributions) and altered H-bond lifetimes. A dynamics based correction scheme is then used to remove artificially transient H-bonds and to repair artificially broken bonds within the network such that the corrected network exhibits the same structural and dynamic properties for two H-bond definitions (the properties of the third definition being significantly improved). The algorithm described represents a significant step forward in the development of a unified hydrogen bond network whose properties are independent of the original hydrogen bond definition that is employed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Geometric characterization and simulation of planar layered elastomeric fibrous biomaterials

Many important biomaterials are composed of multiple layers of networked fibers. While there is a growing interest in modeling and simulation of the mechanical response of these biomaterials, a theoretical foundation for such simulations has yet to be firmly established. Moreover, correctly identifying and matching key geometric features is a critically important first step for performing reliable mechanical simulations. This paper addresses these issues in two ways. First, using methods of geometric probability, we develop theoretical estimates for the mean linear and areal fiber intersection densities for 2-D fibrous networks. These densities are expressed in terms of the fiber density and the orientation distribution function, both of which are relatively easy-to-measure properties. Secondly, we develop a random walk algorithm for geometric simulation of 2-D fibrous networks which can accurately reproduce the prescribed fiber density and orientation distribution function. Furthermore, the linear and areal fiber intersection densities obtained with the algorithm are in agreement with the theoretical estimates. Both theoretical and computational results are compared with those obtained by post-processing of scanning electron microscope images of actual scaffolds. These comparisons reveal difficulties inherent to resolving fine details of multilayered fibrous networks. Finally, the methods provided herein can provide a rational means to define and generate key geometric features from experimentally measured or prescribed scaffold structural data.

36 MATERIALS SCIENCE↗

Analytical estimation of emission zone mean position and width in organic light-emitting diodes from emission pattern image-source interference fringes

We present an analytical method for evaluating the first and second moments of the effective exciton spatial distribution in organic light-emitting diodes (OLED) from measured emission patterns. Specifically, the suggested algorithm estimates the emission zone mean position and width, respectively, from two distinct features of the pattern produced by interference between the emission sources and their images (induced by the reflective cathode): the angles in which interference extrema are observed, and the prominence of interference fringes. The relations between these parameters are derived rigorously for a general OLED structure, indicating that extrema angles are related to the mean position of the radiating excitons via Bragg's condition, and the spatial broadening is related to the attenuation of the image-source interference prominence due to an averaging effect. The method is applied successfully both on simulated emission patterns and on experimental data, exhibiting a very good agreement with the results obtained by numerical techniques. We investigate the method performance in detail, showing that it is capable of producing accurate estimations for a wide range of source-cathode separation distances, provided that the measured spectral interval is large enough; guidelines for achieving reliable evaluations are deduced from these results as well. As opposed to numerical fitting tools employed to perform similar tasks to date, our approximate method explicitly utilizes physical intuition and requires far less computational effort (no fitting is involved). Hence, applications that do not require highly resolved estimations, e.g., preliminary design and production-line verification, can benefit substantially from the analytical algorithm, when applicable. This introduces a novel set of efficient tools for OLED engineering, highly important in the view of the crucial role the exciton distribution plays in determining the device performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Machine-learning prediction for quasiparton distribution function matrix elements

There have been rapid developments in the direct calculation in lattice QCD (LQCD) of the Bjorken-x dependence of hadron structure through large-momentum effective theory (LaMET). LaMET overcomes the previous limitation of LQCD to moments (that is, integrals over Bjorken x) of hadron structure, allowing LQCD to directly provide the kinematic regions where the experimental values are least known. LaMET requires large-momentum hadron states to minimize its systematics and allow us to reach small- x reliably. This means that very fine lattice spacing to minimize lattice artifacts at order $(P_za)^n$ will become crucial for next-generation LaMET-like structure calculations. Furthermore, such calculations require operators with long Wilson-link displacements, especially in finer lattice units, increasing the communication costs relative to that of the propagator inversion. In this work, we explore whether machine-learning algorithms can make predictions of correlators to reduce the computational cost of these LQCD calculations. We consider two algorithms, gradient-boosting decision tree and linear models, applied to LaMET data, the matrix elements needed to determine the kaon and $η_s$ unpolarized parton distribution functions (PDFs), meson distribution amplitude (DA), and the nucleon gluon PDF. We find that both algorithms can reliably predict the target observables with different prediction accuracy and systematic errors. The predictions from smaller displacement z to larger ones work better than those for momentum p due to the higher correlation among the data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

CASP11 – An Evaluation of a Modular BCL::Fold-Based Protein Structure Prediction Pipeline

In silico prediction of a protein’s tertiary structure remains an unsolved problem. The community-wide Critical Assessment of Protein Structure Prediction (CASP) experiment provides a double-blind study to evaluate improvements in protein structure prediction algorithms. We developed a protein structure prediction pipeline employing a three-stage approach, consisting of low-resolution topology search, high-resolution refinement, and molecular dynamics simulation to predict the tertiary structure of proteins from the primary structure alone or including distance restraints either from predicted residue-residue contacts, nuclear magnetic resonance (NMR) nuclear overhauser effect (NOE) experiments, or mass spectroscopy (MS) cross-linking (XL) data. The protein structure prediction pipeline was evaluated in the CASP11 experiment on twenty regular protein targets as well as thirty-three ‘assisted’ protein targets, which also had distance restraints available. Although the low-resolution topology search module was able to sample models with a global distance test total score (GDT_TS) value greater than 30% for twelve out of twenty proteins, frequently it was not possible to select the most accurate models for refinement, resulting in a general decay of model quality over the course of the prediction pipeline. In this study, we provide a detailed overall analysis, study one target protein in more detail as it travels through the protein structure prediction pipeline, and evaluate the impact of limited experimental data.

59 BASIC BIOLOGICAL SCIENCES↗

3D Seismic Experimentation and Advanced Processing/Inversion Development for Investigations of the Shallow Subsurface

The work plan for this project was to develop and apply advanced seismic reflection and wide-angle processing and inversion techniques to high resolution seismic data for the shallow subsurface to seismically characterize the shallow subsurface at hazardous waste sites as an aid to containment and cleanup activities. We proposed to continue work on seismic data that we had already acquired under a previous DoE grant, as well as to acquire additional new datasets for analysis. The project successfully developed and/or implemented the use of 3D reflection seismology algorithms, waveform tomography and finite-frequency tomography using compressional and shear waves for high resolution characterization of the shallow subsurface at two waste sites. These two sites have markedly different near-surface structures, groundwater flow patterns, and hazardous waste problems. This is documented in the list of refereed documents, conference proceedings, and Rice graduate theses, listed below.

54 ENVIRONMENTAL SCIENCES↗

Tools and Models for Integrating Multiple Cellular Networks

In this grant, we have systematically investigated the integrated networks, which are responsible for the coordination of activity between metabolic pathways in prokaryotes. We have developed several computational tools to analyze the topology of the integrated networks consisting of metabolic, regulatory, and physical interaction networks. The tools are all open-source, and they are available to download from Github, and can be incorporated in the Knowledgebase. Here, we summarize our work as follow. Understanding the topology of the integrated networks is the first step toward understanding its dynamics and evolution. For Aim 1 of this grant, we have developed a novel algorithm to determine and measure the hierarchical structure of transcriptional regulatory networks [1]. The hierarchy captures the direction of information flow in the network. The algorithm is generally applicable to regulatory networks in prokaryotes, yeast and higher organisms. Integrated datasets are extremely beneficial in understanding the biology of a system in a compact manner due to the conflation of multiple layers of information. Therefore for Aim 2 of this grant, we have developed several tools and carried out analysis for integrating system-wide genomic information. To make use of the structural data, we have developed DynaSIN for protein-protein interactions networks with various dynamical interfaces [2]. We then examined the association between network topology with phenotypic effects such as gene essentiality. In particular, we have organized E. coli and S. cerevisiae transcriptional regulatory networks into hierarchies. We then correlated gene phenotypic effects by tinkering with different layers to elucidate which layers were more tolerant to perturbations [3]. In the context of evolution, we also developed a workflow to guide the comparison between different types of biological networks across various species using the concept of rewiring [4], and Furthermore, we have developed CRIT for correlation analysis in systems biology [5]. For Aim 3, we have further investigated the scaling relationship that the number of Transcription Factors (TFs) in a genome is proportional to the square of the total number of genes. We have extended the analysis from transcription factors to various classes of functional categories, and from individual categories to joint distribution [6]. By introducing a new analytical framework, we have generalized the original toolbox model to take into account of metabolic network with arbitrary network topology [7].

09 BIOMASS FUELS↗

Using Whole-Building Electric Load Data in Continuous or Retro-Commissioning

Whole-building electric load data can often reveal problems with building equipment or operations. In this paper, we present methods for analyzing 15-minute-interval electric load data. These methods allow building operators, energy managers, and commissioning agents to better understand a building's electricity consumption over time and to compare it to other buildings, helping them to 'ask the right questions' to discover opportunities for electricity waste elimination, energy efficiency, peak load management, and demand response. For example: Does the building use too much energy at night, or on hot days, or in the early evening? Knowing the answer to questions like these can help with retro-commissioning or continuous commissioning. The methods discussed here can also be used to assess how building energy performance varies with time. Comparing electric load before and after fixing equipment or changing operations can help verify that the fixes have the intended effect on energy consumption. Analysis methods discussed in this paper include: ways to graphically represent electric load data; the definition of various parameters that characterize facility electricity loads; and a regression-based electricity load model that accounts for both time of week and outdoor air temperature. The methods are illustrated by applying them to data from commercial buildings. We demonstrate the ability to recognize changes in building operation, and to quantify changes in energy performance. Some key findings are: 1) Plotting time series electric load data is useful for understanding electricity consumption patterns and changes to those patterns, but results may be misleading if data from different time intervals are not weather-normalized. 2) Parameter plots can highlight key features of electric load data and may be easier to interpret than plots of time series data themselves. 3) A time-of-week indicator variable (as compared to time-of-day and day-of-week indicator variables) improves the accuracy of regression models of electric load. 4) A piecewise linear and continuous outdoor air temperature dependence can be derived without the use of a change-point model (which would add complexity to the modeling algorithm) or assumptions about when structural changes occur (which could introduce inaccuracy). 5) A model that includes time-of-week and temperature dependence can be used for weather normalization and can determine whether the building is unusually temperature-sensitive, which can indicate problems with HVAC operation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Determination of Optimal Operating Schemes for a Multi-Reservoir System Under Environmental Constraints

In strati ed reservoirs, both dam tailwater discharge and thermal plant intake water quality and temperature can be highly dependent on structure depth. A two- dimensional laterally-averaged model allows for better prediction of water quality over time at specfi c depths. Because high- fidelity models are typically too computationally expensive for direct inclusion within optimization algorithms, water quality is incorporated using one dimensional models are simple flow requirements. Water quality predictions can be incorporated within the optimization process through using surrogate modeling methods, in this application artificial neural network (ANN) models. ANNs are flexible machine learning tools for function approximation composed of a structure of neurons assembled within a multi-layer architecture. They are capable of handling large amounts of training data and modeling nonlinear dynamic systems, making ANNs a well-suited method for this application. This report illustrates the development of ANN models to emulate the hydrodynamic and water quality modeling capabilities of the high- fidelity, two-dimensional CE-QUAL-W2 (W2) model, as well as a linked riverine reservoir system optimization process which accounts for energy generation, water balance and hydraulics, and compliance point water quality. A process for hourly hydropower generation planning is demonstrated on a pair of reservoirs linked in series. The two reservoirs are U.S. Army Corps of Engineers projects with hydropower capabilities on the Cumberland River near Nashville, Tennessee, USA.

13 HYDRO ENERGY↗