Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete optimization”

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 991 records · Page 55

The Pheno-Evo Model: Evolution of Microbial Phenotypic Diversity in 2D Space

Biologists appreciate microbes for their simplicity and predictability: we assume that a population of genetically identical cells in a uniform environment will all behave the same way. While this assumption is often useful, it is also often wrong. Not only might microbes in a clonal population act differently from one another, the differences may be categorical (growing v. non-growing; toxin-sensitive v. tolerant), and this diversity might be an evolved trait conferring increased fitness on the population. How does such phenotypic heterogeneity evolve? And how does a population find the optimal distribution of phenotypes for a given environment? Efforts at modeling microbial phenotypic heterogeneity often focus on populations with two discrete phenotypic types; phenotypes in continuous distributions remain poorly explored. To address this gap and to explore the role of spatial relationships, we use agent-based modeling to simulate a phenotypically diverse population of microbial cells evolving in the presence of periodic toxic stress. Cells on patches in a 2D grid may degrade toxin, suffer damage from toxin, switch phenotype, and reproduce. An individual's phenotype its toxin degradation rate-- for which there is a tradeoff with reproduction-- and the genotype encodes the distribution of phenotypic values in the population. The rate of toxin diffusion determines how individuals influence their neighbors' environments. We examine the effects of toxin concentration, diffusion rate, and environmental predictability on the survival success of populations with different phenotype distributions, and populations' evolutionary trajectories when phenotype distribution is allowed to evolve. We conduct all simulations on the platform NetLogo, which provides a friendly interface allowing users of any experience level to tweak parameters and run their own simulations. We have also created custom tools in R for analyzing and visualizing the results of multiple runs.

microbial evolution↗

Variational Integration for Ideal Magnetohydrodynamics and Formation of Current Singularities

Coronal heating has been a long-standing conundrum in solar physics. Parker's conjecture that spontaneous current singularities lead to nanoflares that heat the corona has been controversial. In ideal magnetohydrodynamics (MHD), can genuine current singularities emerge from a smooth 3D line-tied magnetic field? To numerically resolve this issue, the schemes employed must preserve magnetic topology exactly to avoid artificial reconnection in the presence of (nearly) singular current densities. Structure-preserving numerical methods are favorable for mitigating numerical dissipation, and variational integration is a powerful machinery for deriving them. However, successful applications of variational integration to ideal MHD have been scarce. In this thesis, we develop variational integrators for ideal MHD in Lagrangian labeling by discretizing Newcomb's Lagrangian on a moving mesh using discretized exterior calculus. With the built-in frozen-in equation, the schemes are free of artificial reconnection, hence optimal for studying current singularity formation. Using this method, we first study a fundamental prototype problem in 2D, the Hahm-Kulsrud-Taylor (HKT) problem. It considers the effect of boundary perturbations on a 2D plasma magnetized by a sheared field, and its linear solution is singular. We find that with increasing resolution, the nonlinear solution converges to one with a current singularity. The same signature of current singularity is also identified in other 2D cases with more complex magnetic topologies, such as the coalescence instability of magnetic islands. We then extend the HKT problem to 3D line-tied geometry, which models the solar corona by anchoring the field lines in the boundaries. The effect of such geometry is crucial in the controversy over Parker's conjecture. The linear solution, which is singular in 2D, is found to be smooth. However, with finite amplitude, it can become pathological above a critical system length. The nonlinear solution turns out smooth for short systems. Nonetheless, the scaling of peak current density vs. system length suggests that the nonlinear solution may become singular at a finite length. With the results in hand, we cannot confirm or rule out this possibility conclusively, since we cannot obtain solutions with system lengths near the extrapolated critical value.

solar corona↗

SCALE Enhancements for Detailed Cask Dose Rate Analysis - Paper 37

The Nuclear Fuels Storage and Transportation Planning Project and the Used Fuel Disposition Campaign, both under the US Department of Energy (DOE) Office of Nuclear Energy, require the ability to predict k{sub eff}, heat generation and temperature distributions, and external dose rates from any combination of commercial spent nuclear fuel assemblies loaded into any type of licensed cask. Work in the Reactor and Nuclear Systems Division at Oak Ridge National Laboratory has begun to develop the UNF-ST[and]DARDS system (Used Nuclear Fuel Storage, Transportation and Disposal Analysis Resource and Data System) that uses many of the nuclear analysis codes from the SCALE package, a comprehensive database of used nuclear fuel inventories from utilities, and a library of model template files to produce complete input files for the various types of UNF computational analyses. UNF-ST[and]DARDS uses the template files and input parameters that are applicable to a safety analysis to assemble and execute a complete input file, collect the output files and relevant information for subsequent calculations, and illustrate calculation results as a function of decay time and other relevant analysis parameters. This paper will focus on the shielding aspects and the ability to predict external dose rates from as-loaded casks. Realistic dose rate values based on actual canister fuel contents may be used in developing appropriate plans, procedures, and methods to keep personnel radiation exposures as low as reasonably achievable during cask repackaging and transportation operations, as well as in performing total system analyses and transportation risk evaluations. The MAVRIC shielding sequence of the SCALE package was created for the US Nuclear Regulatory Commission for analyzing dose rates outside of storage, transfer, or transportation casks loaded with spent nuclear fuel. MAVRIC contains automated variance reduction capabilities based on the CADIS and FW-CADIS methods that are effective for optimizing deep penetration Monte Carlo shielding problems for achieving low relative uncertainties in short computing times. MAVRIC uses the Denovo discrete ordinates code to compute importance maps and biased source terms for the Monaco fixed-source Monte Carlo code, which can use multi-group or continuous-energy cross section data. ORIGEN (Oak Ridge Isotope Generation and Depletion) is the SCALE computer code for calculating time-dependent isotopic concentrations during irradiation and decay for more than 2,200 nuclides that can be produced by nuclear fuel irradiation and activation. A series of SCALE enhancements was implemented to enable automatic decay heat and radiation source term generation and shielding safety analysis of as-loaded casks. The enhancements to SCALE made under this project will be a part of the SCALE 6.2 release expected in fall 2014. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Design, Modeling and Performance Optimization of a Novel Rotary Piezoelectric Motor

This work has demonstrated a proof of concept for a torsional inchworm type motor. The prototype motor has shown that piezoelectric stack actuators can be used for rotary inchworm motor. The discrete linear motion of piezoelectric stacks can be converted into rotary stepping motion. The stacks with its high force and displacement output are suitable actuators for use in piezoelectric motor. The designed motor is capable of delivering high torque and speed. Critical issues involving the design and operation of piezoelectric motors were studied. The tolerance between the contact shoes and the rotor has proved to be very critical to the performance of the motor. Based on the prototype motor, a waveform optimization scheme was proposed and implemented to improve the performance of the motor. The motor was successfully modeled in MATLAB. The model closely represents the behavior of the prototype motor. Using the motor model, the input waveforms were successfully optimized to improve the performance of the motor in term of speed, torque, power and precision. These optimized waveforms drastically improve the speed of the motor at different frequencies and loading conditions experimentally. The optimized waveforms also increase the level of precision of the motor. The use of the optimized waveform is a break-away from the traditional use of sinusoidal and square waves as the driving signals. This waveform optimization scheme can be applied to any inchworm motors to improve their performance. The prototype motor in this dissertation as a proof of concept was designed to be robust and large. Future motor can be designed much smaller and more efficient with lessons learned from the prototype motor.

Duong, Khanh A.↗

Coupled Experimental and High-Temperature Discrete-Element Method Modeling Studies of Aluminosilicate Particle Handling in Concentrated Solar Power Environments

Chemically inert, aluminosilicate based particles have been investigated as both a thermal transport and sensible energy storage medium for concentrated solar power facilities. These particles will experience a wide range of operating temperatures (300-1000 K) and handling conditions (dense to dilute falling particle curtains, dense granular flows, or dense structures), requiring specially-designed and optimized infrastructures. The relative influence of collisional and frictional interactions between particles varies based on temperature-dependent particulate properties and greatly impacts the bulk, granular flow behavior. These underlying physics are captured using discrete element method modeling tools. However, this modeling method is computationally expensive as each particle position and interaction is tracked during the simulation. These modeling methods are further complicated by introducing temperature-dependent particle properties, high-temperature radiative exchange, and directional irradiation sources experienced by granular flows in concentrated solar power environments. Coupled experimental and numerical studies of aluminosilicate particles in rotary kilns and dense particle curtains were performed for bulk temperatures up to 1073 K. The three particle types investigated included Carbobead HSP 30 /60, Carbobead CP 30/60, and Granusil 4030. Temperature, spatial, and velocity profile data were extracted from experimental runs using embedded K-type thermocouple probes and particle image velocimetry techniques. Experimental and numerical studies were compared using spatial temperature profiles, velocity fields, and shape profiles of the bulk, granular flows. Numerical models were developed using commercially available discrete element method modeling software, Aspherix®. Existing Aspherix® functionality was expanded by introducing coupled radiative exchange modeling tools. The laboratory-scale rotary kiln was developed to investigate the steady-state heat and mass transfer performance of aluminosilicate particles based on particle type, bulk handling temperature, and wall roughness. The rotational speed of the rotary kiln was varied to control the relative impact of collisional and frictional effects upon the granular flow behavior. Heat and mass transfer performance was categorized based on the Froude number and the observed flow regimes of slipping, rolling, cascading, and centrifuging. Coupled discrete element method modeling studies were used to evaluate the effects of temperature-dependent, particulate mechanical properties upon bulk flow behavior and upon the relative effects of radiative, advective, and/or conductive heat transfer. A high-temperature (< 1073 K) falling particle curtain was similarly fabricated to investigate the heat and mass transfer performance of aluminosilicate particles in particle handling situations dominated by inter-particle collisions. The impact of particle type, flow preheat temperatures (< 1073K), and bulk mass flow rates were investigated upon the particle curtain shape, temperature, and velocity profiles. Coupled discrete element method modeling studies were performed to evaluate the varying impact of temperature-dependent, particulate mechanical properties on the bulk flow behavior and the temperature profile of the particle curtain.

14 SOLAR ENERGY↗

Discovering mechanisms for materials microstructure optimization via reinforcement learning of a generative model

Abstract The design of materials structure for optimizing functional properties and potentially, the discovery of novel behaviors is a keystone problem in materials science. In many cases microstructural models underpinning materials functionality are available and well understood. However, optimization of average properties via microstructural engineering often leads to combinatorically intractable problems. Here, we explore the use of the reinforcement learning (RL) for microstructure optimization targeting the discovery of the physical mechanisms behind enhanced functionalities. We illustrate that RL can provide insights into the mechanisms driving properties of interest in a 2D discrete Landau ferroelectrics simulator. Intriguingly, we find that non-trivial phenomena emerge if the rewards are assigned to favor physically impossible tasks, which we illustrate through rewarding RL agents to rotate polarization vectors to energetically unfavorable positions. We further find that strategies to induce polarization curl can be non-intuitive, based on analysis of learned agent policies. This study suggests that RL is a promising machine learning method for material design optimization tasks, and for better understanding the dynamics of microstructural simulations.

36 MATERIALS SCIENCE↗

PetIGA-MF: A multi-field high-performance toolbox for structure-preserving B-splines spaces

We describe the development of a high-performance solution framework for isogeometric discrete differential forms based on B-splines: PetIGA-MF. Built on top of PetIGA, PetIGA-MF is a general multi-field discretization tool. To test the capabilities of our implementation, we solve different viscous flow problems such as Darcy, Stokes, Brinkman, and Navier-Stokes equations. Several convergence benchmarks based on manufactured solutions are presented assuring optimal convergence rates of the approximations, showing the accuracy and robustness of our solver.

97 MATHEMATICS AND COMPUTING↗

Battery Electric Vehicles: Range Optimization and Diversification for the U.S. Drivers

Properly selecting the driving range is critical for accurately predicting the market acceptance and the resulting social benefits of BEVs. Analysis of transportation technology transition could be biased against battery electric vehicles (BEV) and mislead policy making, if BEVs are not represented with optimal ranges. This study proposes a coherent method to optimize the BEV driving range by minimizing the range-related cost, which is formulated as a function of range, battery cost, energy prices, charging frequency, access to backup vehicles, and the cost and refueling hassle of operating the backup vehicle. This method is implemented with a sample of 36,664 drivers, representing U.S. new car drivers, based on the 2009 National Household Travel Survey data. Key findings are: 1) Assuming the near term (2015) battery cost at $405/kWh, about 98% of the sampled drivers are predicted to prefer a range below 200 miles, and about 70% below 100 miles. The most popular 20-mile band of range is 57 to77 miles, unsurprisingly encompassing the Leaf s EPA-certified 73-mile range. With range limited to 4 or 7 discrete options, the majority are predicted to choose a range below 100 miles. 2) Found as a statistically robust rule of thumb, the BEV optimal range is approximately 0.6% of one s annual driving distance. 3) Reducing battery costs could motivate demand for larger range, but improving public charging may cause the opposite. 4) Using a single range to represent BEVs in analysis could significantly underestimate their competitiveness e.g. by $3226/vehicle if BEVs are represented with 73-mile range only or by $7404/BEV if with 150-mile range only. Range optimization and diversification into 4 or 7 range options reduce such analytical bias by 78% or 90%, respectively.

33 ADVANCED PROPULSION SYSTEMS↗

A Discrete Component Low-Noise Preamplifier Readout for a Linear (1x16) SiC Photodiode Array

A compact, low-noise and inexpensive preamplifier circuit has been designed and fabricated to optimally readout a common cathode (1x16) channel 4H-SiC Schottky photodiode array for use in ultraviolet experiments. The readout uses an operational amplifier with 10 pF capacitor in the feedback loop in parallel with a low leakage switch for each of the channels. This circuit configuration allows for reiterative sample, integrate and reset. A sampling technique is given to remove Johnson noise, enabling a femtoampere level readout noise performance. Commercial-off-the-shelf acquisition electronics are used to digitize the preamplifier analogue signals. The data logging acquisition electronics has a different integration circuit, which allows the bandwidth and gain to be independently adjusted. Using this readout, photoresponse measurements across the array between spectral wavelengths 200 nm and 370 nm are made to establish the array pixels external quantum efficiency, current responsivity and noise equivalent power.

low-noise preamplifier↗

Localized Evaluation for Constructing Discrete Vector Fields

Topological abstractions offer a method to summarize the behavior of vector fields, but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach, which constructs a collection of pairs of simplices in the input mesh that satisfies criteria introduced by Forman's discrete Morse theory. While numerous approaches exist to compute pairs in the restricted case of the gradient of a scalar field, state-of-the-art algorithms for the general case of vector fields require expensive optimization procedures. This paper introduces a fast, novel approach for pairing simplices of two-dimensional, triangulated vector fields that do not vary in time. The key insight of our approach is that we can employ a local evaluation, inspired by the approach used to construct a discrete gradient field, where every simplex in a mesh is considered by no more than one of its vertices. Specifically, we observe that for any edge in the input mesh, we can uniquely assign an outward direction of flow. We can further expand this consistent notion of outward flow at each vertex, which corresponds to the concept of a downhill flow in the case of scalar fields. Working with outward flow enables a linear-time algorithm that processes the (outward) neighborhoods of each vertex one-by-one, similar to the approach used for scalar fields. Here, we couple our approach to constructing discrete vector fields with a method to extract, simplify, and visualize topological features. Empirical results on analytic and simulation data demonstrate drastic improvements in running time, produce features similar to the current state-of-the-art, and show the application of simplification to large, complex flows.

97 MATHEMATICS AND COMPUTING↗

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗

Galerkin v. least-squares Petrov–Galerkin projection in nonlinear model reduction

Least-squares Petrov–Galerkin (LSPG) model-reduction techniques such as the Gauss–Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. Furthermore, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge–Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be ‘matched’ to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MO-AB-BRA-07: Prompt Gamma-Ray Spectroscopy for Range Verification of Clinical Proton Beams

Purpose: We developed a pre-clinical prototype system for range verification of proton pencil-beam scanning fields. The system was evaluated using phantom treatment plans delivered with a clinical dose rate. Methods: The absolute range of proton pencil-beams was verified through an optimization procedure, which matches energy- and time-resolved prompt gamma-ray measurements with models, based on cross sections for discrete prompt gamma-ray line excitations. Phantom experiments were performed with a pre-clinical prototype detector, using treatment plans delivered with a clinical pencil-beam scanning system. The detector consisted of an actively shielded lanthanum(III) bromide scintillator. Tungsten was used to collimate the gamma-rays. To support high event rates, the detector readout featured custom amplifiers and an active voltage divider for the photomultiplier. The detector signals were acquired by fast analog-to-digital converters and processed using digital algorithms. The data acquisition was also synchronized with the pencil-beam scanning and dosimetry systems. Results: We successfully acquired prompt gamma-ray spectra during the delivery of proton pencil-beams with a clinical beam current of 2 nA at the exit of the treatment head. The number of events in the primary detector ranged from 1 x 10{sup 6} to 2 x 10{sup 6} per second. In phantom experiments, non-uniform range errors were introduced by placing strips of plastic in the beam path. The magnitudes and positions of these range errors were correctly detected in two-dimensional range maps that were generated from the measurements. With our small scale prototype, a 1.0 mm standard deviation on the absolute range required about 5 x 10{sup 8} protons per delivered pencil-beam. Conclusions: Prompt gamma-ray spectroscopy to verify the absolute range of proton beams was demonstrated under clinical pencil-beam delivery conditions. A 1 mm to 2 mm range verification accuracy for a field delivering 1 Gy, appears feasible with a full scale system. This work was supported by the Federal Share of program income earned on C06-CA059267, Proton Therapy Research and Treatment Center.

60 APPLIED LIFE SCIENCES↗

SU-C-207A-01: A Novel Maximum Likelihood Method for High-Resolution Proton Radiography/proton CT

Purpose: Multiple Coulomb scattering is the largest contributor to blurring in proton imaging. Here we tested a maximum likelihood least squares estimator (MLLSE) to improve the spatial resolution of proton radiography (pRad) and proton computed tomography (pCT). Methods: The object is discretized into voxels and the average relative stopping power through voxel columns defined from the source to the detector pixels is optimized such that it maximizes the likelihood of the proton energy loss. The length spent by individual protons in each column is calculated through an optimized cubic spline estimate. pRad images were first produced using Geant4 simulations. An anthropomorphic head phantom and the Catphan line-pair module for 3-D spatial resolution were studied and resulting images were analyzed. Both parallel and conical beam have been investigated for simulated pRad acquisition. Then, experimental data of a pediatric head phantom (CIRS) were acquired using a recently completed experimental pCT scanner. Specific filters were applied on proton angle and energy loss data to remove proton histories that underwent nuclear interactions. The MTF10% (lp/mm) was used to evaluate and compare spatial resolution. Results: Numerical simulations showed improvement in the pRad spatial resolution for the parallel (2.75 to 6.71 lp/cm) and conical beam (3.08 to 5.83 lp/cm) reconstructed with the MLLSE compared to averaging detector pixel signals. For full tomographic reconstruction, the improved pRad were used as input into a simultaneous algebraic reconstruction algorithm. The Catphan pCT reconstruction based on the MLLSE-enhanced projection showed spatial resolution improvement for the parallel (2.83 to 5.86 lp/cm) and conical beam (3.03 to 5.15 lp/cm). The anthropomorphic head pCT displayed important contrast gains in high-gradient regions. Experimental results also demonstrated significant improvement in spatial resolution of the pediatric head radiography. Conclusion: The proposed MLLSE shows promising potential to increase the spatial resolution (up to 244%) in proton imaging.

60 APPLIED LIFE SCIENCES↗

FutureTense

Protective vaccines and reliable diagnostics are essential tools for controlling viral diseases. However, the efficacy of these tools can be diminished by mutations in viral genomes. The delay between the emergence of new viral strains and the redesign of vaccines and diagnostics allows for continued viral transmission. Is it possible to address this challenge by computationally predicting viral genome sequence evolution? Can we “future-proof” vaccines and diagnostics by targeting both current and anticipated future sequence variants? While predicting viral evolution is still an unsolved, “grand challenge” problem in biology, the large, and rapidly growing, number of SARS-CoV-2 genome sequences provide an opportunity to quantify the ability of machine learning to predict viral genome sequence evolution. Towards this end, we have developed a simple computational model for predicting viral evolution at the level of individual nucleotides. The key metric for quantifying the per-base, prediction accuracy for viral evolution is the Mann-Whitney U statistic (or, equivalently, the area under the receiver operator curve). Since the Mann-Whitney U statistic is not a differentiable function, existing deep leaning packages (like Pytorch and Keras/TensorFlow) are not useful, as they require that the accuracy metric/objective function be analytically differentiable with respect to the model parameters. To overcome this challenge, we have implemented custom software, “FutureTense”, that can train a machine learning model by maximizing the non-differentiable Mann-Whitney U statistic. This software trains a machine learning model by exploring along the direction of the discrete gradient of the Mann-Whitney U statistic in the model parameter space. Parallel computing and genome sequence-specific optimizations are used to accelerate model training. The resulting machine learning model learns the observed high C->U mutation rates in the SARS-CoV-2 genome (which are potentially induced by host defenses) and provides prediction accuracies that are significantly better than one would expect from random chance. While predicting viral evolution is still quite far from a solved problem, the surprising performance of this simple model gives hope that the accuracy of predicting viral genome evolution can be further increased by more sophisticated approaches.

Gans, Jason↗

Radiation Source Mapping with Bayesian Inverse Methods

In this work, we present a method to map the spectral and spatial distributions of radioactive sources using a limited number of detectors. Locating and identifying radioactive materials is important for border monitoring, in accounting for special nuclear material in processing facilities, and in cleanup operations following a radioactive material spill. Most methods to analyze these types of problems make restrictive assumptions about the distribution of the source. In contrast, the source mapping method presented here allows an arbitrary three-dimensional distribution in space and a gamma peak distribution in energy. To apply the method, the problem is cast as an inverse problem where the system’s geometry and material composition are known and fixed, while the radiation source distribution is sought. A probabilistic Bayesian approach is used to solve the resulting inverse problem since the system of equations is ill-posed. The posterior is maximized with a Newton optimization method. The probabilistic approach also provides estimates of the confidence in the final source map prediction. A set of adjoint, discrete ordinates flux solutions, obtained in this work by the Denovo code, is required to efficiently compute detector responses from a candidate source distribution. These adjoint fluxes form the linear mapping from the state space to the response space. The test of the method’s success is simultaneously locating a set of 137 Cs and 60 Co gamma sources in a room. This test problem is solved using experimental measurements that we collected for this purpose. Because of the weak sources available for use in the experiment, some of the expected photopeaks were not distinguishable from the Compton continuum. However, by supplanting 14 flawed measurements (out of a total of 69) with synthetic responses computed by MCNP, the proof-of-principle source mapping was successful. The locations of the sources were predicted within 25 cm for two of the sources and 90 cm for the third, in a room with an ~4-x 4-m floor plan. Finally, the predicted source intensities were within a factor of ten of their true value.

07 ISOTOPE AND RADIATION SOURCES↗

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗

Advances and trends in computational structural mechanics

The development status and applicational range of techniques in computational structural mechanics (CSM) are evaluated with a view to advances in computational models for material behavior, discrete-element technology, quality assessment, the control of numerical simulations of structural response, hybrid analysis techniques, techniques for large-scale optimization, and the impact of new computing systems on CSM. Primary pacers of CSM development encompass prediction and analysis of novel materials for structural components, computational strategies for large-scale structural calculations, and the assessment of response prediction reliability together with its adaptive improvement.

Noor, Ahmed K.↗