Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse data set”

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 253 records · Page 14

Learning an Algebriac Multrigrid Interpolation Operator Using a Modified GraphNet Architecture

This work, building on previous efforts, develops a suite of new graph neural network machine learning architectures that generate data-driven prolongators for use in Algebraic Multigrid (AMG). Algebraic Multigrid is a powerful and common technique for solving large, sparse linear systems. Its effectiveness is problem dependent and heavily depends on the choice of the prolongation operator, which interpolates the coarse mesh results onto a finer mesh. Previous work has used recent developments in graph neural networks to learn a prolongation operator from a given coefficient matrix. In this paper, we expand on previous work by exploring architectural enhancements of graph neural networks. A new method for generating a training set is developed which more closely aligns to the test set. Asymptotic error reduction factors are compared on a test suite of 3-dimensional Poisson problems with varying degrees of element stretching. Results show modest improvements in asymptotic error factor over both commonly chosen baselines and learning methods from previous work.

97 MATHEMATICS AND COMPUTING↗

WE-G-207-02: Full Sequential Projection Onto Convex Sets (FS-POCS) for X-Ray CT Reconstruction

Purpose: To develop an iterative reconstruction method for X-ray CT, in which the reconstruction can quickly converge to the desired solution with much reduced projection views. Methods: The reconstruction is formulated as a convex feasibility problem, i.e. the solution is an intersection of three convex sets: 1) data fidelity (DF) set – the L2 norm of the difference of observed projections and those from the reconstructed image is no greater than an error bound; 2) non-negativity of image voxels (NN) set; and 3) piecewise constant (PC) set - the total variation (TV) of the reconstructed image is no greater than an upper bound. The solution can be found by applying projection onto convex sets (POCS) sequentially for these three convex sets. Specifically, the algebraic reconstruction technique and setting negative voxels as zero are used for projection onto the DF and NN sets, respectively, while the projection onto the PC set is achieved by solving a standard Rudin, Osher, and Fatemi (ROF) model. The proposed method is named as full sequential POCS (FS-POCS), which is tested using the Shepp-Logan phantom and the Catphan600 phantom and compared with two similar algorithms, TV-POCS and CP-TV. Results: Using the Shepp-Logan phantom, the root mean square error (RMSE) of reconstructed images changing along with the number of iterations is used as the convergence measurement. In general, FS- POCS converges faster than TV-POCS and CP-TV, especially with fewer projection views. FS-POCS can also achieve accurate reconstruction of cone-beam CT of the Catphan600 phantom using only 54 views, comparable to that of FDK using 364 views. Conclusion: We developed an efficient iterative reconstruction for sparse-view CT using full sequential POCS. The simulation and physical phantom data demonstrated the computational efficiency and effectiveness of FS-POCS.

60 APPLIED LIFE SCIENCES↗

Streaming data analytics via message passing with application to graph algorithms

The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of either message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.

97 MATHEMATICS AND COMPUTING↗

TH-CD-206-09: Learning-Based MRI-CT Prostate Registration Using Spare Patch-Deformation Dictionary

Purpose: To enable MRI-guided prostate radiotherapy, MRI-CT deformable registration is required to map the MRI-defined tumor and key organ contours onto the CT images. Due to the intrinsic differences in grey-level intensity characteristics between MRI and CT images, the integration of MRI into CT-based radiotherapy is very challenging. We are developing a learning-based registration approach to address this technical challenge. Methods: We propose to estimate the deformation between MRI and CT images in a patch-wise fashion by using the sparse representation technique. Specifically, we assume that two image patches should follow the same deformation if their patch-wise appearance patterns are similar. We first extract a set of key points in the new CT image. Then, for each key point, we adaptively construct a coupled dictionary from the training MRI-CT images, where each coupled element includes both appearance and deformation of the same image patch. After calculating the sparse coefficients in representing the patch appearance of each key point based on the constructed dictionary, we can predict the deformation for this point by applying the same sparse coefficients to the respective deformations in the dictionary. Results: This registration technique was validated with 10 prostate-cancer patients’ data and its performance was compared with the commonly used free-form-deformation-based registration. Several landmarks in both images were identified to evaluate the accuracy of our approach. Overall, the averaged target registration error of the intensity-based registration and the proposed method was 3.8±0.4 mm and 1.9±0.3 mm, respectively. Conclusion: We have developed a novel prostate MR-CT registration approach based on patch-deformation dictionary, demonstrated its clinical feasibility, and validated its accuracy. This technique will either reduce or compensate for the effect of patient-specific treatment variation measured during the course of radiotherapy, is therefore well-suited for a number of MRI-guided adaptive radiotherapy, and potentially enhance prostate radiotherapy treatment outcome.

60 APPLIED LIFE SCIENCES↗

Building Alternative Indices of Socioeconomic Status for Population Modeling in Data-Sparse Contexts (Short Paper)

Population modeling requires clear definitions of socioeconomic status (SES) to ensure overall estimate accuracy and locate potentially underserved subpopulations. This presents a challenge as SES can be measured in myriad ways and for divergent purposes, and the data required to calculate these metrics may be lacking, particularly in low and middle income countries (LMICs). To support more refined SES measurement, we explore improvements upon the Demographic and Health Survey’s (DHS) Wealth Index (DHS-WI) using alternative characterizations of SES based on multiple correspondence analysis (MCA) and hierarchical clustering. We produce the MCA-derived metrics first on a full suite of household economic, demographic, and dwelling variables, then on a reduced set of occupant-only SES characteristics. We explore the utility of these metrics relative to DHS-WI based on their ability to 1) differentiate DHS household types and 2) identify mixtures of SES levels within DHS samples and mapped at high spatial resolution. We find that our full suite MCA yields more clearly defined SES segments and that our reduced MCA delineates occupant SES most clearly, suggesting potential pathways to improve upon the DHS-WI in future population modeling efforts for LMICs.

Cunningham, Angela↗

Effects of EMF Emissions from Cables and Junction Boxes on Marine Species

Studies have shown that diverse aquatic species are electrosensitive. Many fishes, and marine mammals, can either detect, navigate by, or are affected by electromagnetic fields (EMF) with various sensitivities, and their behavior may be impacted by unnatural EMF emissions in the water column. Sharks, rays and skates are known to have the highest sensitivity to electric fields. Electric field emissions in the range 0.5–100 micro volt/m appear to attract them, and emissions over 100 micro volt/m to repulse them. A marine hydrokinetic MHK device will have multiple components and associated multiple submarine cables on the seafloor and running through the water column and would potentially increase the level of EMF emissions to which the marine species at the site may be exposed to. There are therefore concerns amongst stakeholders that EMF emissions associated with MHK devices and their components may act as barriers to species migration, cause disorientation, change community compositions and ecosystems, and that they may attract sharks, leading to a local increase in the risk of shark attacks. However, field data to validate and model potential relationships between observed responses and the EMF emissions in situ are sparse. A program of experimental field surveys were conducted off the coast of South Florida, USA to characterize the electromagnetic field (EMF) emissions in the water column from a submarine cable, and to monitor for responses of local aquatic species. The field surveys were conducted at the South Florida Ocean Measurement Facility (SFOMF) off Fort Lauderdale, which is a cabled offshore in-water navy range. It consists of multiple active submarine power cables and a number of junction boxes, with the capability to transmit AC/DC power at a range of strength and frequencies. The site includes significant marine life activities and community structure, including highly mobile species, such as sharks, stingrays, mammals and turtles. SFOMF therefore typifies a setting representative of an offshore location where a MHK device may be sited. Background electromagnetic field (EMF) levels and EMF emissions due to submarine cables were measured using a custom E-field sensor and a commercial magnetometer deployed from an autonomous underwater vehicle (AUV) at various fixed altitudes above the seafloor. EMF signatures detected from power cables and junction boxes are contrasted against ambient background levels and other EMF sources. The potential responses of local marine species were observed at selected representative locations using divers on SCUBA, complemented with fixed cameras on the sea bottom and by a set of video cameras mounted on the AUV. The objectives of the study were: 1) to characterize the EMF emission levels associated with submarine cables 2) to monitor potential responses of aquatic animals to the emissions and 3) to develop an associated database of field observations. As control, observations of EMF levels and in situ marine species were conducted with power in the cable turned off. Good quality measurements of EMF emissions were obtained using the mobile AUV platform and the data from the surveys were used to develop contour maps of the EMF levels in the water column above the live cable as well as to provide information about how the field decays away from the cable. The measurements show good agreement with theoretical models of the how EMF levels decay away from the cable in deep and shallow water environment. Electric fields in excess of 200µV/m were measured in the vicinity of the cable during the power on state. Quarterly surveys by SCUBA divers were conducted, using point and transect count methods, over a period of one year at three locations, one at a shallow site where the water depth is approximately 5m, and the other at the Barracuda Reef where the water depth is approximately 10m. The sampling results were analyzed to determine if the presence of an SFOMF generated EMF alters: (1) abundance, species richness, and assemblage structure of coral reef fishes, (2) the behavior of fishes including elasmobranchs, and (3) the distribution of marine turtles and mammals. Diver observations were also used in attempt to discern if there were any noticeable organismal responses during the transitional period between ambient OFF to energized AC or DC power states, and video footage was intended to augment the in-situ visual survey data and aid in interpretation of the results. Comparisons are provided between observation datasets between the three sites and between the point and transect count methods. Presence of several individual elasmobranch species, including sharks and stingrays, were recorded during the surveys. No apparent effect on richness could be discerned between the power on and off states. No apparent sudden animal movements were observed during transitions between power states.

16 TIDAL AND WAVE POWER↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗

X-ray Computed Tomography Data of Dense Metallic Components

The data shared in here are X-ray computed tomography (XCT) scans of a hexagonal fuel nozzle in 3 sections with the Metrotom 800 system at the Manufacturing Demonstration Facility (MDF) at Oak Ridge National Laboratory. The data are used in the paper "Tomographic Sparse View Selection using the View Covariance Loss, by Lin et al. (doi:10.1109/TPAMI.2025.36000720), accepted to the international conference on computational imaging (ICCP 2025). Figures 4-7 in the paper describe the part/XCT scan. File name Descriptions: Bottom section: TCR- Single Channeled SRC L 2019-3-18 12-26-41.hdf5 Medium section: TCR- Single Channeled SRC M 2019-3-18 13-8-9.hdf5 Top section: TCR- Single Channeled SRC T 2019-3-18 13-45-39.hdf5 Each hdf5 file contains projection data, and all the relevant X-ray CT scan setting. The full list of included attributes: distance_unit: Units of all distances specified angle_unit : Units of the angles angles: Array of all angles used voxel_size_xy: Baseline recon (if any) has this voxel size in the in-plane direction voxel_size_z: Baseline recon (if any) has this voxel size in the cross-plane direction det_pixel_size_col: Size of the detector pixels in the column dimension det_pixel_size_row: Size of the detector pixels in the row dimension src_iso_dist: Source to iso-center distance iso_det_dist: Iso-center to detector distance det_angle: If the detector is rotated/tilted, this angle corresponds to that value det_row_offset: Center of rotation offset in the vertical direction det_col_offset: Center of rotation offset in the horizontal direction reconstruction: A baseline reconstruction stored as 3D array BHC params: Beam-hardening parameters - Van De Casteel Model - if it has been used to pre-process the projections We also provided a python script (hdf_io.py) that allows the user to read the relevant data from each hdf5 file.

Ziabari, Amir [Oak Ridge National Laboratory]↗

Irrigation Infrastructure and Modernization – Setting a Baseline: Estimates of Irrigation Water Conveyance Infrastructure Extents and Composition and the Potential Water, Energy, and Economic Benefits of Modernization in the Western U.S.

In the Western United States (U.S.), water delivery for irrigation is still largely managed using century-old equipment and designs. Modernization of this vital water conveyance infrastructure, such as piping of earthen canals, is known to improve water availability and water quality for farmers, while saving energy and enabling new hydropower. However, there is sparse information about the extent of irrigation water delivery infrastructure, which makes it challenging to estimate the cost of upgrades at scale and the potential benefits of accelerating modernization work. This report estimates a variety of previously unquantified data points related to irrigation water delivery infrastructure in the Western U.S. to support stakeholders interested in nationwide modernization planning. The findings should be considered approximations, useful for understanding the scale, range, or variability of these indicators. Taken together, the findings of this report illustrate some of the challenges and opportunities involved in modernizing the agricultural water delivery infrastructure in the Western U.S. Accelerating the pace of modernization could strengthen the long-term resilience of U.S. food systems while providing significant economic, energy, water, and environmental benefits.

13 HYDRO ENERGY↗

TU-EF-204-04: Feasibility Study of a Novel Stationary Spectral CT Scanner

Purpose: To evaluate a cadmium zinc telluride (CZT) detector module and to develop a proof-of-concept bench-top system to examine the concept and feasibility of a stationary spectral scanner that would consist of a CZT detector ring and a distributed source for rotationless imaging. Methods: The bench-top system employs a double-rotation set-up with two concentric but independent rotating stages, one for turning the object at sparse angles to mimic the imaging from a sequentially activated source distributed on a ring, while the other for translating the detector module to simulate a projection arc along a virtual detector ring. A source of 30-degree fan is used in the set-up, and the ring is designed to be 85cm in diameter in order to provide a 22cm field-of-view that is large enough for an average human head. The CZT detector module has 16×16 0.5mm pixels and eight global energy thresholds, and is attached to an experimental data acquisition board from the same vendor (Nova R&D). Its pixel gain is first calibrated using radioisotope Tc-99m to align the photo-peaks. Count rate performance is assessed using the X-ray source. Air and offset corrections are done prior to each CT scan. A 10cm acrylic phantom with 5 different inserts is imaged at 100kVp, 2mA, with an effective exposure window of 150ms per projection. Reconstruction is done using a total variation-type iterative method. Results: The detector module exhibited large gain variations among pixels. Average count rate was over 1Mcps per pixel. Parallax effect was observed along the arcs but was corrected. Reconstructed images from two energy bins demonstrated good contrast, spatial resolution and image uniformity, with little artifacts. Conclusion: The CZT detector tested is suitable for imaging relatively small objects. A stationary spectral CT appears feasible should we have enough buttable modules and a distributed source. This work was supported by Ministry of Science and Technology of China through grants 11YQ040082 and 2012BAI13B04.

60 APPLIED LIFE SCIENCES↗

Reassessing long-standing meteorological records: an example using the national hottest day in Ireland

This analysis highlights the potential value in reanalysing early national meteorological records from around the world. These were oftentimes measured via techniques that preceded standardisation of instrumentation and methods of observation and thus could be subject to considerable biases and uncertainties. This analysis uses the techniques pioneered by WMO record assessment teams. The highest currently recognised air temperature (33.3 °C) ever recorded in the Republic of Ireland was logged at Kilkenny Castle in 1887. The original observational record however no longer exists. Given that Ireland is now the only country in Europe to have a national heat record that was set in the 19th century, a reassessment of the verity of this record is both timely and valuable. The present analysis undertakes a fundamental reassessment of the plausibility of the 1887 temperature record using methods similar to those used to assess various weather extremes under WMO auspices over recent years. Specifically, we undertake an inter-station reassessment using sparse available records and make recourse to the new and improved 20CRv3 sparse-input reanalysis product. Neither surrounding available stations nor the reanalysis offer substantive support for the Kilkenny record of 33.3 °C being correct. Moreover, recent data rescue efforts have uncovered several earlier extreme values, one of which exceeds the Kilkenny value (33.5 °C on 16 July 1876 recorded at the Phoenix Park). However, the sparsity of early observational networks, a distinct lack of synoptic support from 20CRv3 for many of the extreme heat values, and the fact that these measurements were obtained using non-standard exposures lead us to conclude that there is grossly insufficient evidence to support any of these 19th century extremes as robust national heat record candidates. Data from the early 20th century onwards benefit from a denser network of stations undertaking measurements in a more standardised manner, many under the direct auspices of Met Éireann and its predecessors, adhering to WMO guidance and protocols. This enables more robust cross-checking of records. We argue that the Met Éireann-recognised 20th century heat record from Boora in 1976 is verified as the most plausible robust national temperature record based upon the synoptic situation and comparisons with nearby neighbouring stations. This measurement of 32.5°C thus likely constitutes the highest reliably recorded temperature measurement in the Republic of Ireland. Ultimately, the formal decision on any reassessment and reassignment of the national record rests with the national meteorological service, Met Éireann.

15 GEOTHERMAL ENERGY↗

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗

Phase curves of small bodies from the SLOAN Moving Objects Catalog

Extensive photometric surveys continue to produce enormous stores of data on small bodies. These data are typically sparsely obtained at arbitrary (or unknown) rotational phases. Therefore, new methods for processing such data need to be developed to make the most of these vast catalogs. We aim to produce a method of recreating the phase curves of small bodies by considering the uncertainties introduced by the nominal errors in the magnitudes and the effect introduced by rotational variations. Here, we use the SLOAN Moving Objects Catalog data as a benchmark to construct phase curves of all small bodies in u', g', r', i', and z' filters. From the phase curves, we obtain the absolute magnitudes and we use them to set up the absolute colors, which are the colors of the asteroids that are not affected by changes in the phase angle. We selected objects with ≥3 observations taken in at least one filter and spanning over a minimum of 5 degrees in the phase angle. We developed a method that combines Monte Carlo simulations and Bayesian inference to estimate the absolute magnitudes using the HG 12 * photometric system. We obtained almost 15 000 phase curves, with about 12 000 of these including all five filters. The absolute magnitudes and absolute colors are compatible with previously published data that support our method. The method we developed is fully automatic and well suited for a run based on large amounts of data. Moreover, it includes the nominal uncertainties in the magnitudes and the whole distribution of possible rotational states of the objects producing what are possibly less precise values, that is, larger uncertainties, but more accurate, namely, closer to the actual value. To our knowledge, this work is the first to include the effect of rotational variations in such a manner.

79 ASTRONOMY AND ASTROPHYSICS↗

The High Latitude Spectroscopic Survey on the Nancy Grace Roman Space Telescope

The Nancy Grace Roman Space Telescope will conduct a High Latitude Spectroscopic Survey (HLSS) over a large volume at high redshift, using the near-IR grism (1.0–1.93 μm, R = 435–865) and the 0.28 deg 2 wide-field camera. We present a reference HLSS that maps 2000 deg 2 and achieves an emission-line flux limit of 10 -16 erg s -1 cm -2 at 6.5σ, requiring ~0.6 yr of observing time. We summarize the flowdown of the Roman science objectives to the science and technical requirements of the HLSS. We construct a mock redshift survey over the full HLSS volume by applying a semianalytic galaxy formation model to a cosmological N-body simulation and use this mock survey to create pixel-level simulations of 4 deg 2 of HLSS grism spectroscopy. We find that the reference HLSS would measure ~10 million H α galaxy redshifts that densely map large-scale structure at z = 1–2 and 2 million [O III] galaxy redshifts that sparsely map structures at z = 2–3. We forecast the performance of this survey for measurements of the cosmic expansion history with baryon acoustic oscillations and the growth of large-scale structure with redshift-space distortions. We also study possible deviations from the reference design and find that a deep HLSS at f line > 7 × 10 -17 erg s -1 cm -2 over 4000 deg 2 (requiring ~1.5 yr of observing time) provides the most compelling stand-alone constraints on dark energy from Roman alone. This provides a useful reference for future optimizations. The reference survey, simulated data sets, and forecasts presented here will inform community decisions on the final scope and design of the Roman HLSS.

79 ASTRONOMY AND ASTROPHYSICS↗

Invertible Neural Networks for Aerodynamic Design of Wind Turbine Blades

The state-of-the-practice methods for aerodynamic design of wind turbine blads use linearized blade element momentum theory (BEM) to optimize the twist and chord profiles from a pre-selected set of 2D airfoil shapes. In this work, we apply invertible neural network (INN) tools to enable the rapid inverse aerodynamic design of wind turbine blades including component airfoils. The INN is trained on data obtained through the use of robust automated mesh generation and the HAMSTR computational fluid dynamics solver with advanced turbulence and transition models validated for turbine applications. Our design technique is a significant improvement over the state-of-the-practice linearized blade element momentum (BEM) techniques in capturing 3D nonlinear aerodynamic effects that are critical for optimal design of the rotors. This is made possible by developing sparse, invertible neural networks (INNs) for inverse design and optimization that realize a 100x cost reduction compared to adjoint-based computational fluid dynamics (CFD) approaches, while enabling increased robustness of the final design. We demonstrate the INN tool for design of a section of the NREL 5-MW blade. All generated shapes satisfy the desired aerodynamic characteristics, demonstrating the success of the INN approach for inverse design of wind turbine blades.

aerodynamic design↗

An experimental and ab initio study of the electronic spectrum of the jet-cooled F{sub 2}BO free radical

We have studied the B{sup ~} {sup 2}A{sub 1}–X{sup ~} {sup 2}B{sub 2} laser-induced fluorescence (LIF) spectrum of the jet-cooled F{sub 2}BO radical for the first time. The transition consists of a strong 0{sub 0}{sup 0} band at 446.5 nm and eight weak sequence bands to shorter wavelengths. Single vibronic level emission spectra obtained by laser excitation of individual levels of the B{sup ~} state exhibit two electronic transitions: a very weak, sparse B{sup ~}–X{sup ~} band system in the 450–500 nm region and a stronger, more extensive set of B{sup ~} {sup 2}A{sub 1}–A{sup ~} {sup 2}B{sub 1} bands in the 580–650 nm region. We have also performed a series of high level ab initio calculations to predict the electronic energies, molecular structures, vibrational frequencies, and rotational and spin-rotation constants in the X{sup ~} {sup 2}B{sub 2}, A{sup ~2}B{sub 1} and B{sup ~} {sup 2}A{sub 1} electronic states as an aid to the analysis of the experimental data. The theoretical results have been used as input for simulations of the rotationally resolved B{sup ~} {sup 2}A{sub 1}–X{sup ~} {sup 2}B{sub 2} 0{sub 0}{sup 0} LIF band and Franck-Condon profiles of the LIF and single vibronic level emission spectra. The agreement between the simulations obtained with purely ab initio parameters and the experimental spectra validates the geometries calculated for the ground and excited states and the conclusion that the radical has C{sub 2v} symmetry in the X{sup ~}, A{sup ~}, and B{sup ~} states. The spectra provide considerable new information about the vibrational energy levels of the X{sup ~} and A{sup ~} states, but very little for the B{sup ~} state, due to the very restrictive Franck-Condon factors in the LIF spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗