Search NASA⌕ Search

SEARCH · Search NASA

Results for “hybrid 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,729 records · Page 96

Precise Motion Control of Hybrid Hydraulic Electric Architecture (HHEA)

Off-highway heavy-duty vehicles have been long-standing users of hydraulic systems for power transmission and control. However, traditional hydraulic systems suffer from significant energy losses which lead to increased operating costs and a larger carbon footprint due to higher CO2 emissions. Improving the efficiency of these mobile machines is crucial not only for reducing their environmental impact but also for saving billions of dollars in operating costs. Currently, the state-of-the-art Load Sensing Architecture uses throttling valves for control, which significantly reduces its efficiency and does not recuperate energy from over-running loads. Researchers have developed several architectures such as Common Pressure Rail systems, Displacement Control, STEAM, and Electrohydraulic Architecture to improve the efficiency of off-road mobile machines. However, each of these architectures has its drawbacks. To increase system efficiency and take advantage of electrification benefits, our research group has developed a novel Hybrid Hydraulic-Electric Architecture (HHEA). The HHEA can significantly improve efficiency, decrease the size of electrical components, and maintain control performance. This new architecture has the potential to revolutionize the off-highway mobile machine industry and lead to a more sustainable future. The HHEA uses a set of common pressure rails to provide the majority of power to the actuators via power-dense hydraulics and uses electric motors for precise control and power modulation. In the context of off-road mobile machines, energy savings are undoubtedly important but it is equally important to consider the machines’ ability to perform tasks with precision and accuracy according to given commands. Therefore, precise motion control is of utmost importance to maintain the utility of Hybrid Hydraulic-Electric Architecture (HHEA). The HHEA presents a unique challenge to motion control due to the discrete pressure changes that occur when the system switches between selected pressure rails. These changes are made to minimize system inefficiencies or to keep the system within the torque capability of the electric motor. Hence, it is important to solve the motion control challenges for HHEA. This thesis aims at developing an effective motion control strategy for HHEA. The dissertation presents a two-tiered control strategy for HHEA, comprising a high-level and a low-level controller. The primary responsibility of the high- level controller is to optimize energy efficiency by making informed pressure rail selections. On the other hand, the low-level controller is focused on achieving precise motion control of the HHEA, which is crucial for realizing the desired reference trajectories. To achieve this, the low-level controller utilizes a passivity-based backstepping integral controller as the nominal control, which handles the motion control between two pressure rail switches. Additionally, a separate least norm controller is utilized as a transition controller to manage motion control during pressure rail transitions. The effectiveness of the combined control strategy is demonstrated through experiments conducted on two hardware-in-the-loop testbeds. Furthermore, the HHEA is installed on the boom and stick actuators of a backhoe arm to build a Human-in-the-Loop system that a human operator can control. A real-time rail switching algorithm is developed to determine pressure rail switching based on present duty cycle information from the operator. Modifications have been made to the human-machine interface to achieve more intuitive control. Modifications include performing control in the task-oriented coordinates, incorporating pressure feedback to enhance control with physical interaction, and using velocity field control to simplify multi-degree-of-freedom tasks and to enable novice operators to perform them with reduced risk, improved efficiency, and productivity. The research in this dissertation makes significant contributions to the field of off-road mobile machine control, providing a novel and effective control strategy for the HHEA, and demonstrating the potential for simplified machine operation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

TH-E-18A-01: Developments in Monte Carlo Methods for Medical Imaging

Monte Carlo simulation methods are widely used in medical physics research and are starting to be implemented in clinical applications such as radiation therapy planning systems. Monte Carlo simulations offer the capability to accurately estimate quantities of interest that are challenging to measure experimentally while taking into account the realistic anatomy of an individual patient. Traditionally, practical application of Monte Carlo simulation codes in diagnostic imaging was limited by the need for large computational resources or long execution times. However, recent advancements in high-performance computing hardware, combined with a new generation of Monte Carlo simulation algorithms and novel postprocessing methods, are allowing for the computation of relevant imaging parameters of interest such as patient organ doses and scatter-to-primaryratios in radiographic projections in just a few seconds using affordable computational resources. Programmable Graphics Processing Units (GPUs), for example, provide a convenient, affordable platform for parallelized Monte Carlo executions that yield simulation times on the order of 10{sup 7} xray/ s. Even with GPU acceleration, however, Monte Carlo simulation times can be prohibitive for routine clinical practice. To reduce simulation times further, variance reduction techniques can be used to alter the probabilistic models underlying the x-ray tracking process, resulting in lower variance in the results without biasing the estimates. Other complementary strategies for further reductions in computation time are denoising of the Monte Carlo estimates and estimating (scoring) the quantity of interest at a sparse set of sampling locations (e.g. at a small number of detector pixels in a scatter simulation) followed by interpolation. Beyond reduction of the computational resources required for performing Monte Carlo simulations in medical imaging, the use of accurate representations of patient anatomy is crucial to the virtual generation of medical images and accurate estimation of radiation dose and other imaging parameters. For this, detailed computational phantoms of the patient anatomy must be utilized and implemented within the radiation transport code. Computational phantoms presently come in one of three format types, and in one of four morphometric categories. Format types include stylized (mathematical equation-based), voxel (segmented CT/MR images), and hybrid (NURBS and polygon mesh surfaces). Morphometric categories include reference (small library of phantoms by age at 50th height/weight percentile), patient-dependent (larger library of phantoms at various combinations of height/weight percentiles), patient-sculpted (phantoms altered to match the patient's unique outer body contour), and finally, patient-specific (an exact representation of the patient with respect to both body contour and internal anatomy). The existence and availability of these phantoms represents a very important advance for the simulation of realistic medical imaging applications using Monte Carlo methods. New Monte Carlo simulation codes need to be thoroughly validated before they can be used to perform novel research. Ideally, the validation process would involve comparison of results with those of an experimental measurement, but accurate replication of experimental conditions can be very challenging. It is very common to validate new Monte Carlo simulations by replicating previously published simulation results of similar experiments. This process, however, is commonly problematic due to the lack of sufficient information in the published reports of previous work so as to be able to replicate the simulation in detail. To aid in this process, the AAPM Task Group 195 prepared a report in which six different imaging research experiments commonly performed using Monte Carlo simulations are described and their results provided. The simulation conditions of all six cases are provided in full detail, with all necessary data on material composition, source, geometry, scoring and other parameters provided. The results of these simulations when performed with the four most common publicly available Monte Carlo packages are also provided in tabular form. The Task Group 195 Report will be useful for researchers needing to validate their Monte Carlo work, and for trainees needing to learn Monte Carlo simulation methods. In this symposium we will review the recent advancements in highperformance computing hardware enabling the reduction in computational resources needed for Monte Carlo simulations in medical imaging. We will review variance reduction techniques commonly applied in Monte Carlo simulations of medical imaging systems and present implementation strategies for efficient combination of these techniques with GPU acceleration. Trade-offs involved in Monte Carlo acceleration by means of denoising and “sparse sampling” will be discussed. A method for rapid scatter correction in cone-beam CT (<5 min/scan) will be presented as an illustration of the simulation speeds achievable with optimized Monte Carlo simulations. We will also discuss the development, availability, and capability of the various combinations of computational phantoms for Monte Carlo simulation of medical imaging systems. Finally, we will review some examples of experimental validation of Monte Carlo simulations and will present the AAPM Task Group 195 Report. Learning Objectives: Describe the advances in hardware available for performing Monte Carlo simulations in high performance computing environments. Explain variance reduction, denoising and sparse sampling techniques available for reduction of computational time needed for Monte Carlo simulations of medical imaging. List and compare the computational anthropomorphic phantoms currently available for more accurate assessment of medical imaging parameters in Monte Carlo simulations. Describe experimental methods used for validation of Monte Carlo simulations in medical imaging. Describe the AAPM Task Group 195 Report and its use for validation and teaching of Monte Carlo simulations in medical imaging.

60 APPLIED LIFE SCIENCES↗

From Competence to Efficiency: A Tale of GA Progress

Genetic algorithms (GAs) - search procedures based on the mechanics of natural selection and genetics - have grown in popularity for the solution of difficult optimization problems. Concomitant with this growth has been a rising cacaphony of complaint asserting that too much time must be spent by the GA practitioner diddling with codes, operators, and GA parameters; and even then these GA cassandras continue, and the user is still unsure that the effort will meet with success. At the same time, there has been a rising interest in GA theory by a growing community - a theorocracy - of mathematicians and theoretical computer scientists, and these individuals have turned their efforts increasingly toward elegant abstract theorems and proofs that seem to the practitioner to offer little in the way of answers for GA design or practice. What both groups seem to have missed is the largely unheralded 1993 assembly of integrated, applicable theory and its experimental confirmation. This theory has done two key things. First, it has predicted that simple GAs are severely limited in the difficulty of problems they can solve, and these limitations have been confirmed experimentally. Second, it has shown the path to circumventing these limitations in nontraditional GA designs such as the fast messy GA. This talk surveys the history, methodology, and accomplishment of the 1993 applicable theory revolution. After arguing that these accomplishments open the door to universal GA competence, the paper shifts the discussion to the possibility of universal GA efficiency in the utilization of time and real estate through effective parallelization, temporal decomposition, hybridization, and relaxed function evaluation. The presentation concludes by suggesting that these research directions are quickly taking us to a golden age of adaptation.

Goldberg, David E.↗

Network Community Detection on Small Quantum Computers

In recent years, a number of quantum computing devices with small numbers of qubits have become available. A hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size is presented. Herein, the proposed approach is applied to the network community detection problem. QLS is hardware-agnostic and easily extendable to new quantum computing devices as they become available. It is demonstrated to solve the 2-community detection problem on graphs of sizes of up to 410 vertices using the 16-qubit IBM quantum computer and D-Wave 2000Q, and compare their performance with the optimal solutions. The results herein demonstrate that QLS performs similarly in terms of quality of the solution and the number of iterations to convergence on both types of quantum computers and it is capable of achieving results comparable to state-of-the-art solvers in terms of quality of the solution including reaching the optimal solutions.

97 MATHEMATICS AND COMPUTING↗

An Adaptively-Refined, Cartesian, Cell-Based Scheme for the Euler and Navier-Stokes Equations

A Cartesian, cell-based scheme for solving the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal 'cut' cells are created. The geometry of the cut cells is computed using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a different formulation of the viscous terms are shown to be necessary. A hybrid Cartesian/body-fitted grid generation approach is demonstrated. In addition, a grid-generation procedure based on body-aligned cell cutting coupled with a viscous stensil-construction procedure based on quadratic programming is presented.

Coirier, William John↗

Hybrid quantum-classical approach for coupled-cluster Green's function theory

The three key elements of a quantum simulation are state preparation, time evolution, and measurement. While the complexity scaling of time evolution and measurements are well known, many state preparation methods are strongly system-dependent and require prior knowledge of the system's eigenvalue spectrum. Here, we report on a quantum-classical implementation of the coupled-cluster Green's function (CCGF) method, which replaces explicit ground state preparation with the task of applying unitary operators to a simple product state. While our approach is broadly applicable to many models, we demonstrate it here for the Anderson impurity model (AIM). The method requires a number of T gates that grows as O ( N 5 ) per time step to calculate the impurity Green's function in the time domain, where N is the total number of energy levels in the AIM. Since the number of T gates is analogous to the computational time complexity of a classical simulation, we achieve an order of magnitude improvement over a classical CCGF calculation of the same order, which requires O ( N 6 ) computational resources per time step.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SPoRT's Participation in the GOES-R Proving Ground Activity

The next generation geostationary satellite, GOES-R, will carry two new instruments with unique atmospheric and surface observing capabilities, the Advanced Baseline Imager (ABI) and the Geostationary Lightning Mapper (GLM), to study short-term weather processes. The ABI will bring enhanced multispectral observing capabilities with frequent refresh rates for regional and full disk coverage to geostationary orbit to address many existing and new forecast challenges. The GLM will, for the first time, provide the continuous monitoring of total lightning flashes over a hemispherical region from space. NOAA established the GOES-R Proving Ground activity several years ago to demonstrate the new capabilities of these instruments and to prepare forecasters for their day one use. Proving Ground partners work closely with algorithm developers and the end user community to develop and transition proxy data sets representing GOES-R observing capabilities. This close collaboration helps to maximize refine algorithms leading to the delivery of a product that effectively address a forecast challenge. The NASA Short-term Prediction Research and Transition (SPoRT) program has been a participant in the NOAA GOES-R Proving Ground activity by developing and disseminating selected GOES-R proxy products to collaborating WFOs and National Centers. Established in 2002 to demonstrate the weather and forecasting application of real-time EOS measurements, the SPoRT program has grown to be an end-to-end research to operations activity focused on the use of advanced NASA modeling and data assimilation approaches, nowcasting techniques, and unique high-resolution multispectral data from EOS satellites to improve short-term weather forecasts on a regional and local scale. Participation in the Proving Ground activities extends SPoRT s activities and taps its experience and expertise in diagnostic weather analysis, short-term weather forecasting, and the transition of research and experimental data to operational decision support systems like NAWIPS, AWIPS, AWIPS2, and Google Earth. Recent SPoRT Proving Ground activities supporting the development and use of a pseudo GLM total lightning product and the transition of the AWG s Convective Initiation (CI) product, both of which were available in AWIPS and AWIPS II environments, by forecasters during the Hazardous Weather Testbed (HWT) Spring Experiment. SPoRT is also providing a suite of SEVIRI and MODIS RGB image products, and a high resolution composite SST product to several National Centers for use in there ongoing demonstration activities. Additionally, SPoRT has involved numerous WFOs in the evaluation of a GOES-MODIS hybrid product which brings ABI-like data sets in front of the forecaster for everyday use. An overview of this activity will be presented at the conference.

Jedlovec, Gary↗

Experimental and numerical validation of an ultrasonic visualization system for nuclear reactor application

This paper deals with the design of ultrasonic imaging systems for the next generation of nuclear reactors cooled by liquid metal. Indeed, a generation IV research nuclear reactor is being developed by the Belgian Nuclear Research Center (SCK-CEN) in the frame of the MYRRHA project (for Multipurpose hYbrid Research Reactor for High-tech Applications). This sub-critical/critical reactor is cooled by Lead-Bismuth Eutectic (LBE). The opacity of this liquid metal requires the development of an ultrasonic visualization system for internal inspection and object detection. But due to the peculiar conditions met in the core of the reactor, velocity as well as temperature gradients are expected and are likely to affect directly the ultrasonic propagation. The objective of this work is to validate the ultrasonic imaging strategy by tests performed in a dedicated test rig and by numerical simulations using a ray-tracing method. The experimental investigations have been performed on a specific water facility reproducing conditions similar to those encountered in the core of the MYRRHA reactor. These conditions include the propagation over large distance, and the presence of temperature and velocity gradients. In the MYRRHA reactor application, the distance to be travelled by the acoustic waves of the visualization system is about 5 m, including a reflection. The acoustic absorption, the scattering losses, the beam divergence and the transmitted energy during reflection have been determined as a function of the travelled distance. The experimental values are compared with the literature for validation. The presence of temperature and velocity gradients in the core of the reactor is due to the coolant circulation. These gradients are about 5 K over 0.1 m and 1 m/s over 0.2 m, respectively, and are reproduced in the facility for investigating their influence on the propagation of ultrasounds. The experimental data are used for improving and validating a ray-tracing algorithm. This algorithm is then applied to the full scale application for validating the ultrasonic visualization system for nuclear reactor application. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A hybrid finite element-boundary integral for the analysis of cavity-backed antennas of arbitrary shape

This is the final report on this project which was concerned with the analysis of cavity-backed antennas and more specifically spiral antennas. The project was a continuation of a previous analysis, which employed rectangular brick elements, and was, thus, restricted to planar rectangular patch antennas. A total of five reports were submitted under this project and we expect that at least four journal papers will result from the research described in these reports. The abstracts of the four previous reports are included. The first of the reports (028918-1-T) is over 75 pages and describes the general formulation using tetrahedral elements and the computer program. Report 028918-2-T was written after the completion of the computer program and reviews the capability of the analysis and associated software for planar circular rectangular patches and for a rectangular planar spiral. Measurements were also done at the University of Michigan and at Mission Research Corp. for the purpose of validating the software. We are pleased to acknowledge a partial support from Mission Research Corp. in carrying out the work described in this report. The third report (028918-3-T) describes the formulation and partial validation (using 2D data) for patch antennas on a circular platform. The 3D validation and development of the formulation for patch antennas on circular platforms is still in progress. The fourth report (028918-4-T) is basically an invited journal paper which will appear in the 'J. Electromagnetic Waves and Applications' in early 1994. It describes the application of the finite element method in electromagnetics and is primarily based on our work here at U-M. This final report describes the culmination of our efforts in characterizing complex cavity-backed antennas on planar platforms. The report describes for the first time the analysis of non-planar spirals and non-rectangular slot antennas as well as traditional planar patch antennas. The comparisons between measurements and calculations are truly impressive. Another unique aspect of this work is the incorporation of the FFT as part of the BiCG solver by overlaying a structured triangular mesh over the unstructured mesh. The implementation of this BiCG-FFT solution algorithm is important in minimizing the CPU and storage requirements. This final report will be submitted for publication in a refereed journal.

Gong, Jian↗

Automated Fiber Placement Through Thickness Defect Stacking Optimization

In its 2022 commercial market outlook, Boeing forecasted an 80% increase in the global fleet through 2041 compared to 2019 pre-pandemic levels. This sharp rise in demand will drive pressure onto airframe manufacturers to ramp up production and find more efficient ways to design and manufacture airplanes. Complicating this challenge is the industry’s recent transformation from traditional metal-based airframes towards hybrid composite-metal aircraft. While composites have been used in aviation for decades, aircraft manufacturers are still struggling to design and manufacture quality parts at a high rate. Automated Fiber Placement (AFP) is one of the main manufacturing techniques used to produce large-scale composite parts. After a design has been created, a manufacturing strategy has to be developed based on the working material, part geometry, and machine capabilities. This process planning stage is essential to the AFP workflow and currently requires a high level of manual input from an experienced process planner. In an effort to automate and optimize this stage, the Computer Aided Process Planning (CAPP) module was developed. CAPP assists process planners in identifying optimal starting point location and layup strategy for each ply of a laminate. This Ply-Level Optimization (PLO) phase operates on the quantification of ply quality through predictable geometry-based defects such as gaps, overlaps, angle deviation, and steering. As you move from PLO to Laminate-Level Optimization (LLO) the design space grows exponentially, emphasizing the need for automated optimization. The work presented in this thesis expands CAPP’s functionality by comparing the planned fiber paths through the thickness of the laminate to mitigate stacked area defects and achieve an optimal laminate-level manufacturing strategy. Within CAPP, predicted gap and overlap defects are imported from Vericut Composites Programming (VCP) and then discretized to streamline the through-thickness comparison. Two objective functions are used to score different combinations of ply layup strategies based on defect stacking both globally and locally. Four combinatorial optimization algorithms were coupled with these objective functions to investigate the laminate-level manufacturing strategy design space and converge on the optimal plan. These algorithms were evaluated based on accuracy and efficiency through virtual testing on a complex tool surface. A separate LLO approach was developed to achieve near-optimal laminates in significantly less time. The end result is a software package which greatly reduces the required input from process planners, shortening the design-build cycle time and improving part quality.

AFP↗

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗

Deterministically estimated fission source distributions for Monte Carlo k-eigenvalue problems

The standard Monte Carlo (MC) k-eigenvalue algorithm involves iteratively converging the fission source distribution using a series of potentially time-consuming inactive cycles before quantities of interest can be tallied. One strategy for reducing the computational time requirements of these inactive cycles is the Sourcerer method, in which a deterministic eigenvalue calculation is performed to obtain an improved initial guess for the fission source distribution. This method has been implemented in the Exnihilo software suite within SCALE using the SPNSPN or SNSN solvers in Denovo and the Shift MC code. The efficacy of this method is assessed with different Denovo solution parameters for a series of typical k-eigenvalue problems including small criticality benchmarks, full-core reactors, and a fuel cask. Here it is found that, in most cases, when a large number of histories per cycle are required to obtain a detailed flux distribution, the Sourcerer method can be used to reduce the computational time requirements of the inactive cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Understanding and Utilizing PBL Height Data from Multiple Observing Systems in the GEOS System

The accuracy of PBL height simulation is a key issue in many applications including forecasting near surface meteorology and air quality, however, it is a very challenging problem due to the lack of not only comprehensive, global Planetary Boundary Layer (PBL) observations but also a strategy and infrastructure to utilize PBL height data from a variety of sensors. Following the designation of PBL as an incubation class observable in the 2017 Decadal Survey, the PBL Incubation Study Team Report [14] made clear that “a future global PBL observing system requires modeling and data assimilation as essential components.” There is an urgent need for global modeling development in order to utilize Program of Record (POR) observations, assess their impacts, and identify gaps to be filled by future PBL missions. Our overall objective is to develop PBL data assimilation capabilities in the NASA Global Earth Observing System (GEOS), focusing on PBL height from multiple observing systems, to support the assessment and use of future PBL observations. The NASA GEOS system is composed of the GEOS global atmospheric general circulation model (AGCM) and the atmospheric data assimilation system (ADAS). The PBL parameterizations include the “Lock” K-profile scheme driven by surface and cloud-top buoyancy fluxes ([4]), and the “Louis” local scheme for stable conditions based on the Richardson number ([5]). Above the mixed layer defined by the Lock surface plume, shallow cumulus convection is represented by the mass flux scheme of [9]. Additional parameterizations are summarized in [1]. The ADAS employs the hybrid 4D Ensemble- Variational (EnVar) configuration ([15]), with the ensemble providing flow-dependent background error covariance information. The resultant analysis increments are fed back to the forecast model through the 4D incremental analysis update (IAU) approach ([11]). In this study, PBL height data are being or have been generated from radiosondes, GNSS RO, satellite (CATS, CALIPSO and ICESat-2) and ground-based (MPLNET) lidars, and wind profiler. Investigations have been conducted to specify quality marks for PBL height retrievals for the data assimilation purpose. These PBL height data have different strengths and weaknesses ([2], [3], [6], [7], [8], [10]), and the satellite PBL height data provide better global coverage and complement in-situ PBL height data. Radiosondes offer high accuracy and in situ measurement of temperature and humidity profiles, but with poor spatio-temporal sampling. The in-situ observing systems like MPLNET and wind profiler provide long history of PBL height records at each station. The GNSS RO based PBL height is retrieved based on the sharp gradients in refractivity profile that represent the fine vertical structure of temperature and moisture changes above the PBL. However, not all RO refractivity profiles reach the surface depending on location and regime, and RO refractivity retrievals can be negatively biased below 2km. The PBL height data from satellite lidars provide high resolution along track PBL height retrievals, but over land they are affected by previous day convective PBL aerosol and strongly associated with mixing layer and retrievals cannot be made below thick, attenuating clouds. A successful assimilation of PBL height data requires a thorough understanding of the observing method and the retrieval algorithm for each observing system in order to use the PBL height data from multiple observing systems properly. Due to the sensitivity of PBL height data to the observing method and choice of algorithm, it is important to use a model definition appropriate for each observation type to compute differences between PBL height data and model PBL height (OmFs). The GEOS model currently includes two PBL height definitions suitable for direct comparison with observed PBL height, and additional definitions are being added in this study. Evaluation of different model PBL height definitions is underway. Meanwhile, efforts have been made in the GEOS data assimilation system to develop PBL height data assimilation capability. PBL height data can be assimilated using two different approaches. The traditional approach is to construct an observation operator and its tangent linear and adjoint, which link control variables to PBL height data from each observing system. This observation operator can be very complicated, e.g., the lidar-based PBL height observation operator includes the backscatter lidar forward observation operator, the algorithm to derive PBL height from attenuated total backscatter, interpolation, and calculations handling the mismatch between observed and model scales. The other approach is to augment PBL height to the control variable vector, and it is adopted in this study. The latter approach was also used in previous studies, e.g., the assimilation of PBL height data from radiosonde and aircraft in the Real Time Mesoscale Analysis (RTMA) system for a dispersion modelling study ([13]); the PBL height assimilation study using lidar PBL height data at Greensburg, Kansas for a field campaign ([12]). The PBL height assimilation from multiple observing systems in this study allows us to take advantage of the diverse PBL height data that provide much better global coverage collectively under different meteorological conditions and with different temporal and spatial scales. As all the PBL heights are tightly coupled with the PBL thermodynamic variables, the strong correlations, which are provided by the 4D ensemble forecast, enable PBL height data from various sources to interact and combine coherently and provide additional information for PBL temperature and moisture fields. The results of comparisons among PBL height data from different sources and the evaluation of the model PBL height definitions with the PBL height data will be presented, and the PBL height data synergy strategies and preliminary results will also be discussed at the conference.

Y. Zhu↗

Cost function dependent barren plateaus in shallow parametrized quantum circuits

Variational quantum algorithms (VQAs) optimize the parameters θ of a parametrized quantum circuit V(θ) to minimize a cost function C. While VQAs may enable practical applications of noisy quantum computers, they are nevertheless heuristic methods with unproven scaling. Here, we rigorously prove two results, assuming V(θ) is an alternating layered ansatz composed of blocks forming local 2-designs. Our first result states that defining C in terms of global observables leads to exponentially vanishing gradients (i.e., barren plateaus) even when V(θ) is shallow. Hence, several VQAs in the literature must revise their proposed costs. On the other hand, our second result states that defining C with local observables leads to at worst a polynomially vanishing gradient, so long as the depth of V(θ) is Ο(logn). Our results establish a connection between locality and trainability. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.

97 MATHEMATICS AND COMPUTING↗

Towards Exascale: High Performance Visualization and Analytics – Project Status Report

The LBNL Visualization research program focuses on a key set of problems facing our community as we move towards the exascale regime of computing. First, we aim to better understand how to effectively take advantage of an evolving architectural landscape where there are an increasing number of cores per processor by examining algorithmic reformulation and alternative methods of programming these increasingly complex platforms. Second, as the gap widens between computational and I/O capacity, it is increasingly imperative to perform more visual data exploration and analysis operations concurrent with the simulation to avoid increasingly expensive I/O. Our approach is to examine several interrelated issues aimed at minimizing the memory footprint, data movement, and design/implementation issues related to deploying tools that can have broad applicability across many different simulation codes and science domains. Third, increasing computational power produces larger and more complex scientific data, and our research program focuses on new technologies aimed at enabling scientific data understanding with ever-larger data. Here, we explore how multi-resolution data representation techniques can reduce data movement, and study novel approaches that focus visualization and analysis processing on subsets of data that are “scientifically interesting,” thereby also minimizing data movement while accelerating scientific knowledge discovery.

97 MATHEMATICS AND COMPUTING↗

New Approaches in Reusable Booster System Life Cycle Cost Modeling

This paper presents the results of a 2012 life cycle cost (LCC) study of hybrid Reusable Booster Systems (RBS) conducted by NASA Kennedy Space Center (KSC) and the Air Force Research Laboratory (AFRL). The work included the creation of a new cost estimating model and an LCC analysis, building on past work where applicable, but emphasizing the integration of new approaches in life cycle cost estimation. Specifically, the inclusion of industry processes/practices and indirect costs were a new and significant part of the analysis. The focus of LCC estimation has traditionally been from the perspective of technology, design characteristics, and related factors such as reliability. Technology has informed the cost related support to decision makers interested in risk and budget insight. This traditional emphasis on technology occurs even though it is well established that complex aerospace systems costs are mostly about indirect costs, with likely only partial influence in these indirect costs being due to the more visible technology products. Organizational considerations, processes/practices, and indirect costs are traditionally derived ("wrapped") only by relationship to tangible product characteristics. This traditional approach works well as long as it is understood that no significant changes, and by relation no significant improvements, are being pursued in the area of either the government acquisition or industry?s indirect costs. In this sense then, most launch systems cost models ignore most costs. The alternative was implemented in this LCC study, whereby the approach considered technology and process/practices in balance, with as much detail for one as the other. This RBS LCC study has avoided point-designs, for now, instead emphasizing exploring the trade-space of potential technology advances joined with potential process/practice advances. Given the range of decisions, and all their combinations, it was necessary to create a model of the original model and use genetic algorithms to explore results. A strong business case occurs when viable paths are identified for an affordable up-front investment, and these paths can credibly achieve affordable, responsive operations, characterized by smaller direct touch labor efforts at the wing level from flight to flight. The results supporting this approach, its potential, and its conclusions are presented here.

Zapata, Edgar↗

New Approaches in Reuseable Booster System Life Cycle Cost Modeling

This paper presents the results of a 2012 life cycle cost (LCC) study of hybrid Reusable Booster Systems (RBS) conducted by NASA Kennedy Space Center (KSC) and the Air Force Research Laboratory (AFRL). The work included the creation of a new cost estimating model and an LCC analysis, building on past work where applicable, but emphasizing the integration of new approaches in life cycle cost estimation. Specifically, the inclusion of industry processes/practices and indirect costs were a new and significant part of the analysis. The focus of LCC estimation has traditionally been from the perspective of technology, design characteristics, and related factors such as reliability. Technology has informed the cost related support to decision makers interested in risk and budget insight. This traditional emphasis on technology occurs even though it is well established that complex aerospace systems costs are mostly about indirect costs, with likely only partial influence in these indirect costs being due to the more visible technology products. Organizational considerations, processes/practices, and indirect costs are traditionally derived ("wrapped") only by relationship to tangible product characteristics. This traditional approach works well as long as it is understood that no significant changes, and by relation no significant improvements, are being pursued in the area of either the government acquisition or industry?s indirect costs. In this sense then, most launch systems cost models ignore most costs. The alternative was implemented in this LCC study, whereby the approach considered technology and process/practices in balance, with as much detail for one as the other. This RBS LCC study has avoided point-designs, for now, instead emphasizing exploring the trade-space of potential technology advances joined with potential process/practice advances. Given the range of decisions, and all their combinations, it was necessary to create a model of the original model and use genetic algorithms to explore results. A strong business case occurs when viable paths are identified for an affordable up-front investment, and these paths can credibly achieve affordable, responsive operations, characterized by smaller direct touch labor efforts at the wing level from flight to flight. The results supporting this approach, its potential, and its conclusions are presented here.

Zapata, Edgar↗

3D automatic anatomy segmentation based on iterative graph-cut-ASM

Purpose: This paper studies the feasibility of developing an automatic anatomy segmentation (AAS) system in clinical radiology and demonstrates its operation on clinical 3D images. Methods: The AAS system, the authors are developing consists of two main parts: object recognition and object delineation. As for recognition, a hierarchical 3D scale-based multiobject method is used for the multiobject recognition task, which incorporates intensity weighted ball-scale (b-scale) information into the active shape model (ASM). For object delineation, an iterative graph-cut-ASM (IGCASM) algorithm is proposed, which effectively combines the rich statistical shape information embodied in ASM with the globally optimal delineation capability of the GC method. The presented IGCASM algorithm is a 3D generalization of the 2D GC-ASM method that they proposed previously in Chen et al.[Proc. SPIE, 7259, 72590C1-72590C-8 (2009)]. The proposed methods are tested on two datasets comprised of images obtained from 20 patients (10 male and 10 female) of clinical abdominal CT scans, and 11 foot magnetic resonance imaging (MRI) scans. The test is for four organs (liver, left and right kidneys, and spleen) segmentation, five foot bones (calcaneus, tibia, cuboid, talus, and navicular). The recognition and delineation accuracies were evaluated separately. The recognition accuracy was evaluated in terms of translation, rotation, and scale (size) error. The delineation accuracy was evaluated in terms of true and false positive volume fractions (TPVF, FPVF). The efficiency of the delineation method was also evaluated on an Intel Pentium IV PC with a 3.4 GHZ CPU machine. Results: The recognition accuracies in terms of translation, rotation, and scale error over all organs are about 8 mm, 10 deg. and 0.03, and over all foot bones are about 3.5709 mm, 0.35 deg. and 0.025, respectively. The accuracy of delineation over all organs for all subjects as expressed in TPVF and FPVF is 93.01% and 0.22%, and all foot bones for all subjects are 93.75% and 0.28%, respectively. While the delineations for the four organs can be accomplished quite rapidly with average of 78 s, the delineations for the five foot bones can be accomplished with average of 70 s. Conclusions: The experimental results showed the feasibility and efficacy of the proposed automatic anatomy segmentation system: (a) the incorporation of shape priors into the GC framework is feasible in 3D as demonstrated previously for 2D images; (b) our results in 3D confirm the accuracy behavior observed in 2D. The hybrid strategy IGCASM seems to be more robust and accurate than ASM and GC individually; and (c) delineations within body regions and foot bones of clinical importance can be accomplished quite rapidly within 1.5 min.

62 RADIOLOGY AND NUCLEAR MEDICINE↗