Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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,243 records · Page 69

Agent-Centric Approach for Cybersecurity Decision-Support with Partial Observability

Generating automated cyber resilience policies for real-world settings is a challenging research problem that must account for uncertainties in system state over time and dynamics between attackers and defenders. In addition to understanding attacker and defender motives and tools, and identifying “relevant” system and attack data, it is also critical to develop rigorous mathematical formulations representing the defender’s decision-support problem under uncertainty. Game-theoretic approaches involving cyber resource allocation optimization with Markov decision processes (MDP) have been previously proposed in the literature. Moreover, advancements in reinforcement learning approaches have motivated the development of partially observable stochastic games (POSGs) in various multi-agent problem domains with partial information. Recent advances in cyber-system state space modeling have also generated interest in potential applicability of POSGs for cybersecurity. However, as is the case in strategic card games such as poker, research challenges using game-theoretic approaches for practical cyber defense applications include: 1) solving for equilibrium and designing efficient algorithms for large-scale, general problems; 2) establishing mathematical guarantees that equilibrium exists; 3) handling possible existence of multiple equilibria; and 4) exploitation of opponent weaknesses. Inspired by advances in solving strategic card games while acknowledging practical challenges associated with the use of game-theoretic approaches in cyber settings, this paper proposes an agent-centric approach for cybersecurity decision-support with partial system state observability.

Tipireddy, Ramakrishna↗

Ultra-Short-Term Spatiotemporal Forecasting of Renewable Resources: An Attention Temporal Convolutional Network Based Approach

The rapid increase in the penetration of renewable energy resources characterized by high variability and uncertainty is bringing new challenges to the power system operation. To ensure the efficient and reliable operation of electric grid, an accurate and general short-term forecasting algorithm with interpretability is desired. Moreover, the extensive off-site information provided by the proliferation of new renewable plants stimulates the interests in the spatiotemporal forecasting. In this paper, an attention temporal convolutional network, which is built on stacked dilated causal convolutional networks and attention mechanisms, is proposed to perform the ultra-short-term spatiotemporal forecasting of renewable resources. Compared with the existing spatiotemporal forecasting methods, the presented model needs no domain knowledge and can be applied to different forecasting tasks such as solar generation and wind speed forecasting. Here, the attention mechanism improves the interpretability. The algorithm can be used to produce both point and probabilistic forecasts. Numerical results on the data sets from National Renewable Energy Laboratory show superior performance over five baselines, in terms of skill scores. Compared with the baselines, the average improvements of accuracy introduced by the proposed method for the point and probabilistic forecasting are 15.08% and 15.85%, respectively.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Passive Infrared Hyperspectral Imaging for Standoff Detection of Tetryl Explosive Residue on a Steel Surface

A commercial imaging FTIR spectrometer that operates between 850 and 1300 cm{sup -1} was used to passively image a galvanized steel plate stained with a residue of the explosive tetryl (2,4,6,N-tetranitro-N-methylaniline). The tetryl was coated onto the plate in a 30 cm diameter spot with an areal dosage of 90 {mu}g tetryl/cm{sup 2}. The stain on the plate was easily detected at standoff distances of 14 and 31 m by examining the hyperspectral data cubes using maximum autocorrelation factors and a slight modification to a generalized least squares target detection algorithm. End-member extraction showed good comparison in a few key bands between the target end-member and laboratory reflectance spectra; however, significant differences were also observed

36 MATERIALS SCIENCE↗

Evaluation of superficial dosimetry between treatment planning system and measurement for several breast cancer treatment techniques

Purpose: Dosimetric accuracy in radiation treatment of breast cancer is critical for the evaluation of cosmetic outcomes and survival. It is often considered that treatment planning systems (TPS) may not be able to provide accurate dosimetry in the buildup region. This was investigated in various treatment techniques such as tangential wedges, field-in-field (FF), electronic compensator (eComp), and intensity-modulated radiotherapy (IMRT). Methods: Under Institutional Review Board (IRB) exemption, radiotherapy treatment plans of 111 cases were retrospectively analyzed. The distance between skin surface and 95% isodose line was measured. For measurements, Gafchromic EBT2 films were used on a humanoid unsliced phantom. Multiple layers of variable thickness of superflab bolus were placed on the breast phantom and CT scanned for planning. Treatment plans were generated using four techniques with two different grid sizes (1 Multiplication-Sign 1 and 2.5 Multiplication-Sign 2.5 mm{sup 2}) to provide optimum dose distribution. Films were placed at different depths and exposed with the selected techniques. A calibration curve for dose versus pixel values was also generated on the same day as the phantom measurement was conducted. The DICOM RT image, dose, and plan data were imported to the in-house software. On axial plane of CT slices, curves were drawn at the position where EBT2 films were placed, and the dose profiles on the lines were acquired. The calculated and measured dose profiles were separated by check points which were marked on the films before irradiation. The segments of calculated profiles were stretched to match their resolutions to that of film dosimetry. Results: On review of treatment plans, the distance between skin and 95% prescribed dose was up to 8 mm for plans of 27 patients. The film measurement revealed that the medial region of phantom surface received a mere 45%-50% of prescribed dose. For wedges, FF, and eComp techniques, region around the nipple received approximately 80% of prescribed dose, although only IMRT showed inhomogeneous dose profile. At deeper depths mainly (6-11 mm depths), film dosimetry showed good agreement with the TPS calculation. In contrast, the measured dose at a 3-mm depth was higher than TPS calculation by 15%-30% for all techniques. For the tangential and IMRT techniques, 1 Multiplication-Sign 1 mm{sup 2} grid size showed a smaller difference than that with a 2.5 Multiplication-Sign 2.5 mm{sup 2} grid size compared to the measurements. Conclusions: In general, TPS even with advanced algorithms do not provide accurate dosimetry in the buildup region, as verified by EBT2 film for all treatment techniques. For all cases, TPS and measured doses were in agreement from 6 mm in depth but differed at shallower depths. Grid size plays an important role in dose calculation. For accurate dosimetry small grid size should be used where differences are lower between TPS and measurements.

60 APPLIED LIFE SCIENCES↗

PDEHats

This is code used to train and evaluate neural partial differential equation solvers on an open source fluid flow data. We evaluate two standard deep learning algorithms for their ability to generalize, a desirable capability for trusthworthy and performant models.

Amarel, James↗

Encoding the complete electric field of an ultraviolet ultrashort laser pulse in a near-infrared nonlinear-optical signal

We introduce a variation on the cross-correlation frequency-resolved optical gating (XFROG) technique that uses a near-infrared (NIR) nonlinear-optical signal to characterize pulses in the ultraviolet (UV). Using a transient-grating XFROG beam geometry, we create a grating using two copies of the unknown UV pulse and diffract a NIR reference pulse from it. We show that, by varying the delay between the UV pulses creating the grating, the UV pulse intensity-and-phase information can be encoded into a NIR signal. We also implemented a modified generalized-projections phase-retrieval algorithm for retrieving the UV pulses from these spectrograms. We performed proof-of-principle measurements of chirped pulses and double pulses, all at 400 nm. This approach should be extendable deeper into the UV and potentially even into the extreme UV or x-ray range.

47 OTHER INSTRUMENTATION↗

Strong correlation between stress drop and peak ground acceleration for recent M1–4 earthquakes in the San Francisco Bay Area

Theoretical and observational studies suggest that between-event variability in the median ground motions of larger ( M≥5 ) earthquakes is controlled primarily by the dynamic properties of the earthquake source, such as Brune-type stress drop. Analogous results remain equivocal for smaller events due to the lack of comprehensive and overlapping ground-motion and source-parameter datasets in this regime. Here in this paper, we investigate the relationship between peak ground acceleration (PGA) and dynamic stress drop for a new dataset of 5297 earthquakes that occurred in the San Francisco Bay area from 2002 through 2016. For each event, we measure PGA on horizontal-component channels of stations within 100 km and estimate stress drop from P-wave spectra recorded on vertical-component channels of the same stations. We then develop a nonparametric ground-motion prediction equation (GMPE) applicable for the moderate (M 1–4) earthquakes in our study region, using a mixed-effects generalization of the Random Forest algorithm. We use the Random Forest GMPE to model the joint influence of magnitude, distance, and near-site effects on observed PGA. We observe a strong correlation between dynamic stress drop and the residual PGA of each event, with the events with higher-than-expected PGA associated with higher values of stress drop. The strength of this correlation increases as a function of magnitude but remains significant even for smaller magnitude events with corner frequencies that approach the observable bandwidth of the acceleration records. Mainshock events are characterized by systematically higher stress drop and PGA than aftershocks of equivalent magnitude. Coherent local variations in the distribution of dynamic stress drop provide observational constraints to support the future development of nonergodic GMPEs that account for variations in median stress drop at different source locations.

58 GEOSCIENCES↗

ZettaBricks: A Language Compiler and Runtime System for Anyscale Computing

This grant supported the ZettaBricks and OpenTuner projects. ZettaBricks is a new implicitly parallel language and compiler where defining multiple implementations of multiple algorithms to solve a problem is the natural way of programming. ZettaBricks makes algorithmic choice a first class construct of the language. Choices are provided in a way that also allows our compiler to tune at a finer granularity. The ZettaBricks compiler autotunes programs by making both fine-grained as well as algorithmic choices. Choices also include different automatic parallelization techniques, data distributions, algorithmic parameters, transformations, and blocking. Additionally, ZettaBricks introduces novel techniques to autotune algorithms for different convergence criteria. When choosing between various direct and iterative methods, the ZettaBricks compiler is able to tune a program in such a way that delivers near-optimal efficiency for any desired level of accuracy. The compiler has the flexibility of utilizing different convergence criteria for the various components within a single algorithm, providing the user with accuracy choice alongside algorithmic choice. OpenTuner is a generalization of the experience gained in building an autotuner for ZettaBricks. OpenTuner is a new open source framework for building domain-specific multi-objective program autotuners. OpenTuner supports fully-customizable configuration representations, an extensible technique representation to allow for domain-specific techniques, and an easy to use interface for communicating with the program to be autotuned. A key capability inside OpenTuner is the use of ensembles of disparate search techniques simultaneously; techniques that perform well will dynamically be allocated a larger proportion of tests.

97 MATHEMATICS AND COMPUTING↗

Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangular AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.

42 ENGINEERING↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Machine-Learning of Nonlocal Kernels for Anomalous Subsurface Transport from Breakthrough Curves

Anomalous behavior is ubiquitous in subsurface solute transport due to the presence of high degrees of heterogeneity at different scales in the media. Although fractional models have been extensively used to describe the anomalous transport in various subsurface applications, their application is hindered by computational challenges. Simpler nonlocal models characterized by integrable kernels and finite interaction length represent a computationally feasible alternative to fractional models; yet, the informed choice of their kernel functions still remains an open problem. We propose a general data-driven framework for the discovery of optimal kernels on the basis of very small and sparse data sets in the context of anomalous subsurface transport. Using spatially sparse breakthrough curves recovered from fine-scale particle-density simulations, we learn the best coarse-scale nonlocal model using a nonlocal operator regression technique. Predictions of the breakthrough curves obtained using the optimal nonlocal model show good agreement with fine-scale simulation results even at locations and time intervals different from the ones used to train the kernel, confirming the excellent generalization properties of the proposed algorithm. A comparison with trained classical models and with black-box deep neural networks confirms the superiority of the predictive capability of the proposed model.

97 MATHEMATICS AND COMPUTING↗

Reducing Randomized Quantum Algorithm Cost [Slides]

We derive the optimal sampling strategy for minimizing total resource cost in randomized quantum algorithms. Our framework is completely general, allowing for resources as diverse as gate counts circuit depth, runtime, or even dissipated energy.

97 MATHEMATICS AND COMPUTING↗

A Bayesian Approach to Period Searching in Solar Coronal Loops

We have applied a Bayesian generalized Lomb–Scargle period searching algorithm to movies of coronal loop images obtained with the Hinode X-ray Telescope (XRT) to search for evidence of periodicities that would indicate resonant heating of the loops. The algorithm makes as its only assumption that there is a single sinusoidal signal within each light curve of the data. Both the amplitudes and noise are taken as free parameters. It is argued that this procedure should be used alongside Fourier and wavelet analyses to more accurately extract periodic intensity modulations in coronal loops. The data analyzed are from XRT Observation Program 129C: “MHD Wave Heating (Thin Filters),” which occurred during 2006 November 13 and focused on active region 10293, which included coronal loops. The first data set spans approximately 10 min with an average cadence of 2 s, 2″ per pixel resolution, and used the Al-mesh analysis filter. The second data set spans approximately 4 min with a 3 s average cadence, 1″ per pixel resolution, and used the Al-poly analysis filter. The final data set spans approximately 22 min at a 6 s average cadence, and used the Al-poly analysis filter. In total, 55 periods of sinusoidal coronal loop oscillations between 5.5 and 59.6 s are discussed, supporting proposals in the literature that resonant absorption of magnetic waves is a viable mechanism for depositing energy in the corona.

79 ASTRONOMY AND ASTROPHYSICS↗

Error-Bounded Graph Construction for Semi-supervised Manifold Learning

Graphs are commonly used in semi-supervised learning to represent a manifold on which the data reside in a high-dimensional ambient space. The graph can then be utilized in different ways, typically via the Laplacian of the graph, in order to leverage associations among the unlabeled data to improve learning. One common way to leverage the graph Laplacian is as a regularization term, where models that would disagree with the graph are penalized. More often the spectrum of the graph Laplacian is used to find a lower dimensional embedding in which neighboring relations encoded via the graph are preserved. Most manifold-based methods of semi-supervised learning depend upon geometric structure in the ambient feature space in order to construct a graph whose edges encode similarity that should be useful in selecting a model. A critical assumption is that some standard measure of similarity applied to the ambient space can be used to construct a graph that is error-free or of low error, meaning that examples (i.e., vertices) from distinct classes are not connected. However, this assumption often precludes the use of such methods in noisy or complex feature spaces, even though such spaces often arise in problems that can most benefit from structure that might be uncovered within the unlabeled data. This paper presents a method of graph construction for manifold-based semi-supervised learning that respects the manifold assumptions underlying these methods and bounds the error on the graph itself, which then permits bounds on the overall generalization error of the learning algorithms without relying on assumptions that do not hold in many modern problem domains.

Symons, Christopher T↗

Uncertainty identification in mass estimation applications with imaging detectors

Mass quantification using standoff gamma imaging techniques is a boon to the special nuclear material holdup monitoring community, but before the method is deemed acceptable as a replacement for historical gamma detection-based methods, there are several considerable sources of uncertainty that must be addressed. These uncertainty sources have received sparse coverage in the literature, but provide the bulk of the uncertainty estimated in practice outside of standard counting statistics. For imaging, there is a fundamental difference between detection/localization and mass estimation operating modalities, where detection/localization can tolerate significantly larger uncertainty because the goal is detection of a distant source, rather than the quantification of that source. Historically, quantification requires a known geometry between source and detector, as well as a calibrated efficiency correction curve, which is well suited to laboratory practice for a stationary detector; however, this requires some corrections and assumptions (e.g., generalized geometry) for field applications, since additional degrees of freedom are present in the source-to-detector position, intervening materials, and non-uniform source distributions, when compared against the laboratory case. Use of an imaging detector during holdup measurements would address these issues by calculating the spatial geometry of the distant source as seen by the detector, with efficiency corrected according to the source-to-detector angle. While this aim promises a better estimation accuracy than generalized geometry assumptions, additional uncertainties are added from the imaging mechanism itself. Of these uncertainties, some are readily mitigated and methods to do so are included in the discussion, while some uncertainties are specific to the imaging class of instruments and are investigated and discussed in detail. Uncertainties are categorized into two general areas: instrument design and algorithmic. Instrument design-based uncertainties include basic detector characteristics for timing and energy resolution, handling of list mode data for coincidence detection, and geometric layout of and propagation of spatial uncertainty into imaging uncertainty. Algorithmic-based uncertainties discussed herein pertain to image reconstruction, the weight assignment problem from cone interactions, and the effects of spatial discretization on mass estimation. With these major sources of uncertainty identified, the path towards acceptance of imaging as a holdup monitoring method becomes clearer.

61 RADIATION PROTECTION AND DOSIMETRY↗

Radiometric characterization process for locating radioactivity hold-up and measuring non-uniformly distributed sources - 15342

A novel approach to facility radiometric characterization for non-uniformly distributed radiation sources has been developed by ANTECH and is currently being employed at the Argonne National Laboratory. It is being applied to the measurement of a wide range of objects and the interiors and contents of laboratories and buildings. The integrated non destructive assay measurement process involves the use of a scanning spectroscopic gamma ray camera as well as high purity Germanium detectors with different collimators and hence differing detector fields of view to measure and quantify non-uniformly distributed sources of radioactivity in laboratory equipment, glove boxes, storage tanks, pipework and general laboratory objects and process components. The purpose of the radiometric characterization is to quantify radiation sources and radioactive contamination levels in facilities containing nuclear material and to ensure compliance with facility characterization requirements and for decontamination and decommissioning planning and execution. The integrated measurement process also involves automated data capture and processing software and a database with which both measurement instrument operators and subject matter expert analysts can interact. An appropriate measuring instrument (gamma camera, scintillation detector, high purity Germanium detector system, neutron detector or alpha-beta counter) records the measurement data and the measurement site is recorded in a photograph. All of the data relevant to the measurement (or set of measurements for a particular object) are recorded in the database including measured gamma ray spectra, equipment description and relevant calibration, measurement site photograph and measurement descriptive data. Once data analysis protocols are established for specific geometries and measurement situations they can be applied to the measured data in a partially automated manner, reducing analysis and transcription errors. In addition to measurements and data analysis the process also utilises radiometric modelling computer codes including MicroShield and Monte Carlo Neutrons Photons in order to perform model calculations where appropriate. In a typical measurement, the ANTECH RadSearch spectroscopic gamma camera is utilized to find areas of concentrated activity so that these areas can be measured and calculated separately from areas with diffuse contamination. The use of the gamma camera in scanning mode helps to ensure that the assay does not overestimate the detected radiation source, which is a frequent consequence of using standard far field geometry and attenuation analysis codes that assume uniformity of both density and radioactive source distribution. Once the hot spots are identified, high purity Germanium detector measurements are made using various collimators with wide or narrow fields of view as required. These measurements are then processed through a semi-automatic calculation process assuming an appropriate source configuration as identified by RadSearch. These source configurations include point sources, line sources or surface sources. The Generalized Geometry Hold-up algorithms are employed to determine an estimate of the activity of the various sources that are identified in a measurement. The ANTECH integrated measurement process provides an automated calculation procedure where the analyst can select the source type, geometry and appropriate input data, and then the software calculates the activity by radionuclide for all sources identified in the measurement. The measurement and analysis process is controlled under the ANTECH ISO9001: 2008 Quality Assurance System and managed by a site specific Quality Assurance Plan. Both Argonne National Laboratory and Department of Energy technical reviewers have vetted the Integrated Measurement and Analysis Process. The application of the measurement and analysis process is described and measurement examples are provided. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

The Half Monte Carlo Method: Combining Total Monte Carlo with Nuclear Data Sensitivity Profiles

Both Total Monte Carlo (TMC) and Generalized Linear Least Squares (GLLS) algorithms have been used extensively to perform nuclear uncertainty propagation. Both methods have strengths and weaknesses, for example, the time required to perform TMC limits its attractiveness, while GLLS cannot generate higher order moments of output distributions and also has trouble dealing with nonlinear distributions. This work uses a new method that overcomes many of the aforementioned limitations of TMC and GLLS, while at the same time reasonably reproduces the TMC result. The concept is a simple combination of the two methods i.e., generate the random nuclear data files using the TMC approach, and then propagate the effect on the integral parameters like k{sub eff} using sensitivity coefficients, as opposed to cumbersome neutron transport calculations. Agreement is demonstrated for the Jezebel sphere ICSBEP benchmark. Since the method is part TMC part GLLS, the term Half Monte Method (HMM) will be used.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗