Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

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,009 records · Page 56

Feature selection, statistical modeling and its applications to universal JPEG steganalyzer

Steganalysis deals with identifying the instances of medium(s) which carry a message for communication by concealing their exisitence. This research focuses on steganalysis of JPEG images, because of its ubiquitous nature and low bandwidth requirement for storage and transmission. JPEG image steganalysis is generally addressed by representing an image with lower-dimensional features such as statistical properties, and then training a classifier on the feature set to differentiate between an innocent and stego image. Our approach is two fold: first, we propose a new feature reduction technique by applying Mahalanobis distance to rank the features for steganalysis. Many successful steganalysis algorithms use a large number of features relative to the size of the training set and suffer from a ”curse of dimensionality”: large number of feature values relative to training data size. We apply this technique to state-of-the-art steganalyzer proposed by Tom´as Pevn´y (54) to understand the feature space complexity and effectiveness of features for steganalysis. We show that using our approach, reduced-feature steganalyzers can be obtained that perform as well as the original steganalyzer. Based on our experimental observation, we then propose a new modeling technique for steganalysis by developing a Partially Ordered Markov Model (POMM) (23) to JPEG images and use its properties to train a Support Vector Machine. POMM generalizes the concept of local neighborhood directionality by using a partial order underlying the pixel locations. We show that the proposed steganalyzer outperforms a state-of-the-art steganalyzer by testing our approach with many different image databases, having a total of 20000 images. Finally, we provide a software package with a Graphical User Interface that has been developed to make this research accessible to local state forensic departments.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Optimization of Sparse Matrix-Vector Multiplication on Emerging Multicore Platforms

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific-optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD quad-core, AMD dual-core, and Intel quad-core designs, the heterogeneous STI Cell, as well as one of the first scientific studies of the highly multithreaded Sun Victoria Falls (a Niagara2 SMP). We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural trade-offs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.

97 MATHEMATICS AND COMPUTING↗

Modeling Stakeholder/Value Dependency through Mean Failure Cost

In an earlier series of works, Boehm et al. discuss the nature of information system dependability and highlight the variability of system dependability according to stakeholders. In a recent paper, the dependency patterns of this model are analyzed. In our recent works, we presented a stakeholder dependent quantitative security model, where we quantify security for a given stakeholder by the mean of the loss incurred by the stakeholder as a result of security threats. We show how this mean can be derived from the security threat configuration (represented as a vector of probabilities that reflect the likelihood of occurrence of the various security threats). We refer to our security metric as MFC, for Mean Failure Cost. In this paper, we analyze Boehm's model from the standpoint of the proposed metric, and show whether, to what extent, and how our metric addresses the issues raised by Boehm's Stakeholder/Value definition of system dependability.

99 GENERAL AND MISCELLANEOUS↗

Search for narrow and broad dijet resonances in proton-proton collisions at $ \sqrt{s}=13 $ TeV and constraints on dark matter mediators and other new particles

Searches for resonances decaying into pairs of jets are performed using proton-proton collision data collected at $\sqrt{s} =$ 13 TeV corresponding to an integrated luminosity of up to 36 fb$^{-1}$. A low-mass search, for resonances with masses between 0.6 and 1.6 TeV, is performed based on events with dijets reconstructed at the trigger level from calorimeter information. A high-mass search, for resonances with masses above 1.6 TeV, is performed using dijets reconstructed offline with a particle-flow algorithm. The dijet mass spectrum is well described by a smooth parameterization and no evidence for the production of new particles is observed. Upper limits at 95% confidence level are reported on the production cross section for narrow resonances with masses above 0.6 TeV. In the context of specific models, the limits exclude string resonances with masses below 7.7 TeV, scalar diquarks below 7.2 TeV, axigluons and colorons below 6.1 TeV, excited quarks below 6.0 TeV, color-octet scalars below 3.4 TeV, W' bosons below 3.3 TeV, Z' bosons below 2.7 TeV, Randall-Sundrum gravitons below 1.8 TeV and in the range 1.9 to 2.5 TeV, and dark matter mediators below 2.6 TeV. The limits on both vector and axial-vector mediators, in a simplified model of interactions between quarks and dark matter particles, are presented as functions of dark matter particle mass and coupling to quarks. Searches are also presented for broad resonances, including for the first time spin-1 resonances with intrinsic widths as large as 30% of the resonance mass. As a result, the broad resonance search improves and extends the exclusions of a dark matter mediator to larger values of its mass and coupling to quarks.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fault isolation and fault-tolerant control for Takagi-Sugeno fuzzy time-varying delay stochastic distribution systems

A fault isolation, estimation, and fault-tolerant control (FTC) scheme for nonlinear time-varying delay stochastic distribution control systems was presented in this paper. The Takagi-Sugeno fuzzy model was adopted to approach the nonlinear dynamics of time-varying delay systems. According to the output equivalence principle and Laplace transformation, an augmented state vector was given to solve the time-varying delay problem. When multiple actuator faults and interference occur simultaneously, fault detection, isolation and fault estimation was designed to obtained the fault information. To decouple faults and obtain the value and location information of the fault, the system was separated into two parts through the designed multiple conversion matrices, in which one subsystem was only affected by one actuator fault. This has simplified the design of fault isolation and estimation. A adaptive observer for fault estimation was given. Then, fault information such as the time, location, and size was determined. The observer gain matrices were calculated using linear matrix inequality (LMI). When a fault was detected and diagnosed, a FTC algorithm was devised using the proportional-integral control scheme to compensate the fault as much as possible. It has been shown that even if multiple faults actuator occurred simultaneously, the FTC controller still ensured the output probability density function of the system traced the desired probability density function when a fault occurred. Finally, the expected results were obtained through the simulation example, which confirmed the effectiveness of the method.

42 ENGINEERING↗

PETSc Users Manual (Rev. 3.3)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear, nonlinear equation solvers and time integrators that may be used in application codes written in Fortran, C, C++, Python, and MATLAB (sequential). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++ or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself; For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. PETSc also has a MATLAB interface, so portions of your code can be written in MATLAB to “try out” the PETSc solvers. The resulting code will not be scalable however because currently MATLAB is inherently not scalable; and PETSc should not be used to attempt to provide a “parallel linear solver” in an otherwise sequential code. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect any kind of reasonable performance. Do not expect to generate your matrix sequentially and then “use PETSc” to solve the linear system in parallel. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc is supported; see the web site http://www.mcs.anl.gov/petsc for information on contacting support. A http://www.mcs.anl.gov/petsc/publications may be found a list of publications and web sites that feature work involving PETSc. We welcome any reports of corrections for this document.

97 MATHEMATICS AND COMPUTING↗

PETSc Users Manual (Rev. 3.4)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear, nonlinear equation solvers and time integrators that may be used in application codes written in Fortran, C, C++, Python, and MATLAB (sequential). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++ or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself; For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. PETSc also has a MATLAB interface, so portions of your code can be written in MATLAB to “try out” the PETSc solvers. The resulting code will not be scalable however because currently MATLAB is inherently not scalable; and PETSc should not be used to attempt to provide a “parallel linear solver” in an otherwise sequential code. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect any kind of reasonable performance. Do not expect to generate your matrix sequentially and then “use PETSc” to solve the linear system in parallel. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc is supported; see the web site http://www.mcs.anl.gov/petsc for information on contacting support. A http://www.mcs.anl.gov/petsc/publications may be found a list of publications and web sites that feature work involving PETSc. We welcome any reports of corrections for this document.

97 MATHEMATICS AND COMPUTING↗

PETSc Users Manual (Rev. 3.5)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear, nonlinear equation solvers and time integrators that may be used in application codes written in Fortran, C, C++, Python, and MATLAB (sequential). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++ or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. ;For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. PETSc also has a MATLAB interface, so portions of your code can be written in MATLAB to “try out” the PETSc solvers. The resulting code will not be scalable however because currently MATLAB is inherently not scalable; and PETSc should not be used to attempt to provide a “parallel linear solver” in an otherwise sequential code. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect any kind of reasonable performance. Do not expect to generate your matrix sequentially and then “use PETSc” to solve the linear system in parallel. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc is supported; see the web site http://www.mcs.anl.gov/petsc for information on contacting support. A http://www.mcs.anl.gov/petsc/publications may be found a list of publications and web sites that feature work involving PETSc. We welcome any reports of corrections for this document.

97 MATHEMATICS AND COMPUTING↗

Heterogeneous local dynamics revealed by classification analysis of spatially disaggregated time series data

Time series data provide a crucial window into infectious disease dynamics, yet their utility is often limited by the spatially aggregated form in which they are presented. When working with time series data, violating the implicit assumption of homogeneous dynamics below the scale of spatial aggregation could bias inferences about underlying processes. We tested this assumption in the context of the 2015–2016 Zika epidemic in Colombia, where time series of weekly case reports were available at national, departmental, and municipal scales. First, we performed a descriptive analysis, which showed that the timing of departmental-level epidemic peaks varied by three months and that departmental-level estimates of the time-varying reproduction number, R(t), showed patterns that were distinct from a national-level estimate. Second, we applied a classification algorithm to six features of proportional cumulative incidence curves, which showed that variability in epidemic duration, the length of the epidemic tail, and consistency with a cumulative normal density curve made the greatest contributions to distinguishing groups. Third, we applied this classification algorithm to data simulated with a stochastic transmission model, which showed that group assignments were consistent with simulated differences in the basic reproduction number, R0. This result, along with associations between spatial drivers of transmission and group assignments based on observed data, suggests that the classification algorithm is capable of detecting differences in temporal patterns that are associated with differences in underlying drivers of incidence patterns. Overall, this diversity of temporal patterns at local scales underscores the value of spatially disaggregated time series data.

60 APPLIED LIFE SCIENCES↗

WE-H-207A-02: Attenuation Correction in 4D-PET Using a Single-Phase Attenuation Map

Purpose: 4D-PET imaging has been proposed as a potential solution to the respiratory motion effect in thoracic region. CT-based attenuation correction (AC) is an essential step toward quantitative imaging for PET. However, due to the temporal difference of 4D-PET and a single breath-hold CT, motion artifacts are observed in the attenuation-corrected PET images that can lead to error in tumor shape and uptake. We introduce a practical method for aligning single-phase CT to all other 4D-PET phases using a penalized non-rigid demons registration. Methods: Individual 4D-PET frames were reconstructed without AC. Non-rigid Demons registration was used to derive deformation vector fields (DVFs) between the PET matched with CT phase and other 4D-PET images. While attenuated PET images provide enough useful data for organ borders such as lung and liver, tumors are not distinguishable from background due to loss of contrast. To preserve tumor shape in different phases, from CT image an ROI covering tumor was excluded from non-rigid transformation. Mean DVF of the central region of the tumor was assigned to all voxels in the ROI. This process mimics a rigid transformation of tumor along with a non-rigid transformation of other organs. 4D XCAT phantom with spherical tumors in lung with diameters ranging from 10 to 40 mm was used to evaluate the algorithm. Results: Motion related induced artifacts in attenuation-corrected 4D-PET images were significantly reduced. For tumors smaller than 20 mm, non-rigid transformation was capable to provide quantitative results. However, for larger tumors, where tumor self-attenuation is considerable, our combined method yields superior results. Conclusion: We introduced a practical method for deforming a single CT to match all 4D-PET images for accurate AC. Although 4D-PET data include insignificant anatomical information, we showed that they are still useful to estimate DVFs for aligning attenuation map and accurate AC.

60 APPLIED LIFE SCIENCES↗

Theoretical Analysis of the EPR Spectrum Saturation Effect with Account for Spectral Diffusion in a System with a Gaussian Distribution of Spin Resonance Frequencies

We have analyzed the effect of saturation of the EPR spectrum for the model situation when a set of resonance frequencies of spin packets is described by a Gaussian distribution and spectral diffusion, which is a random process without correlation, exists. We have obtained the form of the spectrum for arbitrary values of magnetic–resonant parameters: relaxation times for the longitudinal and transverse components of the magnetization vector of the system, the spectral diffusion rate, the dispersion of the Gaussian distribution of resonance frequency, and the magnetic induction of the microwave field. We have derived an analytic expression for the saturation curve of the EPR spectrum. Detailed analysis of the dependence of the spectrum saturation curve on the spin system parameters is performed for the optimal case when the microwave field frequency coincides with the average frequency of the Gaussian distribution for resonance frequencies. The value of the microwave field induction at which the peak of the saturation curve is attained has been determined for arbitrary values of the paramagnetic relaxation time, spectral diffusion rate, and dispersion of the Gaussian spin frequency distribution. We have formulated the algorithm for determining the spin–lattice relaxation time using the experimentally determined microwave field induction for which the saturation curve passes through the peak. It should be noted that numerical calculations have been performed for parameters typical of EPR spectroscopy. The general analytic expression derived for the shape of the spectrum in the saturation conditions and qualitative conclusions concerning the effect of spectral diffusion on the saturation of stationary spectra obtained in this study can also be used in other fields of spectroscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PETSc Users Manual (Rev. 3.13)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear solvers, nonlinear solvers, and time integrators that may be used in application codes written in Fortran, C, C++, and Python. PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than \rolling them" yourself.

97 MATHEMATICS AND COMPUTING↗

The Buzzard Flock: Dark Energy Survey Synthetic Sky Catalogs

We present a suite of 18 synthetic sky catalogs designed to support science analysis of galaxies in the Dark Energy Survey Year 1 (DES Y1) data. For each catalog, we use a computationally efficient empirical approach, ADDGALS, to embed galaxies within light-cone outputs of three dark matter simulations that resolve halos with masses above ~5x10^12 h^-1 m_sun at z <= 0.32 and 10^13 h^-1 m_sun at z~2. The embedding method is tuned to match the observed evolution of galaxy counts at different luminosities as well as the spatial clustering of the galaxy population. Galaxies are lensed by matter along the line of sight --- including magnification, shear, and multiple images --- using CALCLENS, an algorithm that calculates shear with 0.42 arcmin resolution at galaxy positions in the full catalog. The catalogs presented here, each with the same LCDM cosmology (denoted Buzzard), contain on average 820 million galaxies over an area of 1120 square degrees with positions, magnitudes, shapes, photometric errors, and photometric redshift estimates. We show that the weak-lensing shear catalog, redMaGiC galaxy catalogs and redMaPPer cluster catalogs provide plausible realizations of the same catalogs in the DES Y1 data by comparing their magnitude, color and redshift distributions, angular clustering, and mass-observable relations, making them useful for testing analyses that use these samples. We make public the galaxy samples appropriate for the DES Y1 data, as well as the data vectors used for cosmology analyses on these simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Geometry optimization speedup through a geodesic approach to internal coordinates

We present a new geodesic-based method for geometry optimization in a basis set of redundant internal coordinates. Overall, our method updates the molecular geometry by following the geodesic generated by a displacement vector on the internal coordinate manifold, which dramatically reduces the number of steps required to converge to a minimum. Our method can be implemented in any existing optimization code, requiring only implementation of derivatives of the Wilson B-matrix and the ability to numerically solve an ordinary differential equation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Generalizing mkFit and its Application to HL-LHC

mkFit is an implementation of the Kalman filter-based track reconstruction algorithm that exploits both thread- and data-level parallelism. In the past few years the project transitioned from the R&D phase to deployment in the Run-3 offline workflow of the CMS experiment. The CMS tracking performs a series of iterations, targeting reconstruction of tracks of increasing difficulty after removing hits associated to tracks found in previous iterations. mkFit has been adopted for several of the tracking iterations, which contribute to the majority of reconstructed tracks. When tested in the standard conditions for production jobs, speedups in track pattern recognition are on average of the order of 3.5x for the iterations where it is used (3-7x depending on the iteration). Multiple factors contribute to the observed speedups, including vectorization and a lightweight geometry description, as well as improved memory management and single precision. Efficient vectorization is achieved with both the icc and the gcc (default in CMSSW) compilers and relies on a dedicated library for small matrix operations, Matriplex, which has recently been released in a public repository. While the mkFit geometry description already featured levels of abstraction from the actual Phase-1 CMS tracker, several components of the implementations were still tied to that specific geometry. We have further generalized the geometry description and the configuration of the run-time parameters, in order to enable support for the Phase-2 upgraded tracker geometry for the HL-LHC and potentially other detector configurations. The implementation strategy and high-level code changes required for the HL-LHC geometry are presented. Speedups in track building from mkFit imply that track fitting becomes a comparably time consuming step of the tracking chain.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗

Incorporating the Impacts of Climate Change on Hydrology in a Performance Assessment Model - 20403

The evidence of climate change is increasingly well-documented and impacts should be incorporated in performance assessment studies. The current climate literature provides both observational evidence and climate model projections of climate trends and/or climate change in the late 20. and early 21. centuries for North America and the northeast United States. Probabilistic modeling is a core requirement for quantifying uncertainty and evaluating its impacts. Not evaluating future climate states in a performance assessment because of the existence of uncertainty is contradictory to good modeling practices - the most uncertain issues and parameters require the most attention in effective probabilistic modeling. Excluding climate change limits development of modeling information that could aid in effective decision making. In this work we develop methods to use the output from hydrologic models and analysis of historical aerial imagery to quantify and implement the impacts of climate change on hydrologic processes at a nuclear waste site in West Valley, New York. Specifically, we used the HELP (Hydraulic Performance of Landfill Performance) model to characterize key hydrologic processes under both current and future climate conditions to assess the impacts of changing climate on hydrology. A suite of previous climatic models were reviewed and synthesized to produce a cohesive representation of the current state of knowledge of the impact of climate change on important model inputs such as precipitation. Output from the HELP simulations was coupled to the GoldSim model that was used to develop the Probabilistic Performance Assessment (PPA) approach through the application of a novel 'nearest neighbor' technique. First, several thousand realizations were generated from the HELP model using a Latin Hypercube experimental design to ensure adequate coverage of the parameter space of explanatory variables used to drive HELP. For example, porosity is a physical parameter that is used as an input to both HELP and the GoldSim PA model. We then ran sensitivity analysis (SA) algorithms on the output of HELP for each of the responses of interest. For each predictor, each time we build an SA model we get a different value for the sensitivity index (SI). From the collection of all the SA models, the average was computed among all of the SIs to represent the predictor within the context of the nearest neighbor approach. That is, we conduct SA on each HELP outcome for each scenario. This gives us parameter sensitivity indices for the outcomes. We average the parameter sensitivity indices across the outcomes to get the average SI for a scenario. For each realization that is generated from the Goldsim PA model, Goldsim generates random values for physical/empirical parameters that HELP uses as well. For each vector of physical/empirical parameters that Goldsim generates, the vector from the 5,000 HELP runs that is most 'similar' to the Goldsim vector is computed using the nearest neighbor approach. In this context 'similar' means minimization of the SA-weighted sum of the absolute differences among the 5,000 values computed for this statistic, where each value corresponds to a different HELP realization. In order to account for the impacts of climate change, this process was repeated using the spatially downscaled future climate projections. For each of the key parameters of interest, it was assumed that a linear change depicted the relationship between the values for the present day and those for 2100. In this way, the climatically-driven changes in key parameters used to inform the GoldSim model are quantified and incorporated into the PA model output for the future. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Quantum subspace expansion in the presence of hardware noise

Finding ground state energies on current quantum processing units (QPUs) using algorithms such as the variational quantum eigensolver (VQE) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parameterized quantum circuits, limiting them to shallow depths in practice. Here, we demonstrate that both issues can be addressed by synergistically integrating VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs. We perform a systematic benchmark analysis of the iterative quantum-assisted eigensolver in the presence of hardware noise. We determine ground state energies of 1D and 2D mixed-field Ising spin models on noisy simulators and the IBM QPUs ibmq_quito (5 qubits) and ibmq_guadalupe (16 qubits). To maximize accuracy, we propose a suitable criterion to select the subspace basis vectors according to the trace of the noisy overlap matrix. Finally, we show how to systematically approach the exact solution by performing controlled quantum error mitigation based on probabilistic error reduction on the noisy backend fake_guadalupe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗