Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adaptable”

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 937 records · Page 52

General-Surrogate Adaptive Sampling Using Interquartile Range for Design Space Exploration

Abstract A surrogate model is a common tool to approximate system response at untested points for design space exploration. Adaptive sampling has been studied for improving the accuracy of surrogates iteratively by introducing additional samples (simulations and experiments). New samples are often selected based on the estimated uncertainty in the design space. While some surrogates such as kriging have readily available uncertainty models for their predictions, other surrogates do not. Consequently, there have been studies of using the process of leaving-samples-out (LSO) used in cross-validation tools to estimate prediction uncertainty, such as the universal prediction distribution (UPD). In this paper, an adaptive sampling scheme for general surrogates is proposed based on LSO, similar to cross-validation and interquartile range (IQR). Multiple submodels are first developed from LSO. The uncertainty is then estimated from the IQR of these surrogates at a given point. New samples are added iteratively at the point with maximum IQR for design space exploration. The proposed scheme is illustrated using kriging, radial basis function, and neural network surrogates. The proposed scheme is evaluated using four algebraic test functions. Multiple sets of initial samples were produced to account for randomness. For these test functions, the proposed scheme was found to be more accurate and robust than kriging with its own uncertainty model. The proposed scheme was more accurate than the UPD for three out of the four test functions. For a fixed number of samples, the IQR-based adaptive sampling also proved to be more accurate than all-at-once sampling in most cases even when the estimated uncertainty was only mildly correlated with prediction errors.

Engineering↗

SU-C-202-03: A Tool for Automatic Calculation of Delivered Dose Variation for Off-Line Adaptive Therapy Using Cone Beam CT

Purpose: Monitoring the delivered dose is an important task for the adaptive radiotherapy (ART) and for determining time to re-plan. A software tool which enables automatic delivered dose calculation using cone-beam CT (CBCT) has been developed and tested. Methods: The tool consists of four components: a CBCT Colleting Module (CCM), a Plan Registration Moduel (PRM), a Dose Calculation Module (DCM), and an Evaluation and Action Module (EAM). The CCM is triggered periodically (e.g. every 1:00 AM) to search for newly acquired CBCTs of patients of interest and then export the DICOM files of the images and related registrations defined in ARIA followed by triggering the PRM. The PRM imports the DICOM images and registrations, links the CBCTs to the related treatment plan of the patient in the planning system (RayStation V4.5, RaySearch, Stockholm, Sweden). A pre-determined CT-to-density table is automatically generated for dose calculation. Current version of the DCM uses a rigid registration which regards the treatment isocenter of the CBCT to be the isocenter of the treatment plan. Then it starts the dose calculation automatically. The AEM evaluates the plan using pre-determined plan evaluation parameters: PTV dose-volume metrics and critical organ doses. The tool has been tested for 10 patients. Results: Automatic plans are generated and saved in the order of the treatment dates of the Adaptive Planning module of the RayStation planning system, without any manual intervention. Once the CTV dose deviates more than 3%, both email and page alerts are sent to the physician and the physicist of the patient so that one can look the case closely. Conclusion: The tool is capable to perform automatic dose tracking and to alert clinicians when an action is needed. It is clinically useful for off-line adaptive therapy to catch any gross error. Practical way of determining alarming level for OAR is under development.

60 APPLIED LIFE SCIENCES↗

SU-F-J-58: Evaluation of RayStation Hybrid Deformable Image Registration for Accurate Contour Propagation in Adaptive Planning

Purpose: Adaptive radiotherapy requires complete new sets of regions of interests (ROIs) delineation on the mid-treatment CT images. This work aims at evaluating the accuracy of the RayStation hybrid deformable image registration (DIR) algorithm for its overall integrity and accuracy in contour propagation for adaptive planning. Methods: The hybrid DIR is based on the combination of intensity-based algorithm and anatomical information provided by contours. Patients who received mid-treatment CT scans were identified for the study, including six lung patients (two mid-treatment CTs) and six head-and-neck (HN) patients (one mid-treatment CT). DIRpropagated ROIs were compared with physician-drawn ROIs for 8 ITVs and 7 critical organs (lungs, heart, esophagus, and etc.) for the lung patients, as well as 14 GTVs and 20 critical organs (mandible, eyes, parotids, and etc.) for the HN patients. Volume difference, center of mass (COM) difference, and Dice index were used for evaluation. Clinical-relevance of each propagated ROI was scored by two physicians, and correlated with the Dice index. Results: For critical organs, good agreement (Dice>0.9) were seen on all 7 for lung patients and 13 out of 20 for HN patients, with the rest requiring minimal edits. For targets, COM differences were within 5 mm on average for all patients. For Lung, 5 out of 8 ITVs required minimal edits (Dice 0.8–0.9), with the rest 2 needed re-drawn due to their small volumes (<10 cc). However, the propagated HN GTVs resulted in relatively low Dice values (0.5–0.8) due to their small volumes (3–40 cc) and high variability, among which 2 required re-drawn due to new nodal target identified on the mid-treatment CT scans. Conclusion: The hybrid DIR algorithm was found to be clinically useful and efficient for lung and HN patients, especially for propagated critical organ ROIs. It has potential to significantly improve the workflow in adaptive planning.

60 APPLIED LIFE SCIENCES↗

SU-G-TeP1-06: Fast GPU Framework for Four-Dimensional Monte Carlo in Adaptive Intensity Modulated Proton Therapy (IMPT) for Mobile Tumors

Purpose: To demonstrate the feasibility of fast Monte Carlo (MC) treatment planning and verification using four-dimensional CT (4DCT) for adaptive IMPT for lung cancer patients. Methods: A validated GPU MC code, gPMC, has been linked to the patient database at our institution and employed to compute the dose-influence matrices (Dij) on the planning CT (pCT). The pCT is an average of the respiratory motion of the patient. The Dijs and patient structures were fed to the optimizer to calculate a treatment plan. To validate the plan against motion, a 4D dose distribution averaged over the possible starting phases is calculated using the 4DCT and a model of the time structure of the delivered spot map. The dose is accumulated using vector maps created by a GPU-accelerated deformable image registration program (DIR) from each phase of the 4DCT to the reference phase using the B-spline method. Calculation of the Dij matrices and the DIR are performed on a cluster, with each field and vector map calculated in parallel. Results: The Dij production takes ∼3.5s per beamlet for 10e6 protons, depending on the energy and the CT size. Generating a plan with 4D simulation of 1000 spots in 4 fields takes approximately 1h. To test the framework, IMPT plans for 10 lung cancer patients were generated for validation. Differences between the planned and the delivered dose of 19% in dose to some organs at risk and 1.4/21.1% in target mean dose/homogeneity with respect to the plan were observed, suggesting potential for improvement if adaptation is considered. Conclusion: A fast MC treatment planning framework has been developed that allows reliable plan design and verification for mobile targets and adaptation of treatment plans. This will significantly impact treatments for lung tumors, as 4D-MC dose calculations can now become part of planning strategies.

60 APPLIED LIFE SCIENCES↗

MO-FG-CAMPUS-IeP2-04: Multiple Penalties with Different Orders for Structure Adaptive CBCT Reconstruction

Purpose: To combine total variation (TV) and Hessian penalty in a structure adaptive way for cone-beam CT (CBCT) reconstruction. Methods: TV is a widely used first order penalty with good ability in suppressing noise and preserving edges but leads to the staircase effect in regions with smooth intensity transition. The second order Hessian penalty can effectively suppress the staircase effect with extra cost of blurring object edges. To take the best of both penalties we proposed a novel method to combine both for CBCT reconstruction in a structure adaptive way. The proposed method adaptively determined the weight of each penalty according to the geometry of local regions. An specially-designed exponent term with image gradient involved was used to characterize the local geometry such that the weights for Hessian and TV were 1 and 0 respectively at uniform local regions and 0 and 1 at edge regions. For other local regions the weights varied from 0 to 1. The objective functional was minimized using the majorzationminimization approach. We evaluated the proposed method on a modified 3D shepp-logan and a CatPhan 600 phantom. The full-width-at-halfmaximum (FWHM) and contrast-to-noise (CNR) were calculated. Results: For 3D shepp-logan the reconstructed images using TV had an obvious staircase effect while those using the proposed method and Hessian preserved the smooth transition regions well. FWHMs of the proposed method TV and Hessian penalty were 1.75 1.61 and 3.16 respectively, indicating that both TV and the proposed method is able to preserve edges. For CatPhan 600 CNR values of the proposed method were similar to those of TV and Hessian. Conclusion: The proposed method retains favorable properties of TV like preserving edges and also has the ability in better preserving gradual transition structure as Hessian does. All methods performs similarly in suppressing noise. This work was supported in part by National Natural Science Foundation of China (NNSFC) under Grant Nos.60971112 and 61375018 grants from the Cancer Prevention and Research Institute of Texas (RP130109 and RP110562-P2) National Institute of Biomedical Imaging and Bioengineering (R01 EB020366) and a grant from the American Cancer Society (RSG-13-326-01-CCE).

60 APPLIED LIFE SCIENCES↗

TU-AB-202-05: GPU-Based 4D Deformable Image Registration Using Adaptive Tetrahedral Mesh Modeling

Purpose: Deformable image registration (DIR) has been employed today as an automated and effective segmentation method to transfer tumor or organ contours from the planning image to daily images, instead of manual segmentation. However, the computational time and accuracy of current DIR approaches are still insufficient for online adaptive radiation therapy (ART), which requires real-time and high-quality image segmentation, especially in a large datasets of 4D-CT images. The objective of this work is to propose a new DIR algorithm, with fast computational speed and high accuracy, by using adaptive feature-based tetrahedral meshing and GPU-based parallelization. Methods: The first step is to generate the adaptive tetrahedral mesh based on the image features of a reference phase of 4D-CT, so that the deformation can be well captured and accurately diffused from the mesh vertices to voxels of the image volume. Subsequently, the deformation vector fields (DVF) and other phases of 4D-CT can be obtained by matching each phase of the target 4D-CT images with the corresponding deformed reference phase. The proposed 4D DIR method is implemented on GPU, resulting in significantly increasing the computational efficiency due to its parallel computing ability. Results: A 4D NCAT digital phantom was used to test the efficiency and accuracy of our method. Both the image and DVF results show that the fine structures and shapes of lung are well preserved, and the tumor position is well captured, i.e., 3D distance error is 1.14 mm. Compared to the previous voxel-based CPU implementation of DIR, such as demons, the proposed method is about 160x faster for registering a 10-phase 4D-CT with a phase dimension of 256×256×150. Conclusion: The proposed 4D DIR method uses feature-based mesh and GPU-based parallelism, which demonstrates the capability to compute both high-quality image and motion results, with significant improvement on the computational speed.

60 APPLIED LIFE SCIENCES↗

TU-H-CAMPUS-JeP3-05: Adaptive Determination of Needle Sequence HDR Prostate Brachytherapy with Divergent Needle-By-Needle Delivery

Purpose: To develop a new method which adaptively determines the optimal needle insertion sequence for HDR prostate brachytherapy involving divergent needle-by-needle dose delivery by e.g. a robotic device. A needle insertion sequence is calculated at the beginning of the intervention and updated after each needle insertion with feedback on needle positioning errors. Methods: Needle positioning errors and anatomy changes may occur during HDR brachytherapy which can lead to errors in the delivered dose. A novel strategy was developed to calculate and update the needle sequence and the dose plan after each needle insertion with feedback on needle positioning errors. The dose plan optimization was performed by numerical simulations. The proposed needle sequence determination optimizes the final dose distribution based on the dose coverage impact of each needle. This impact is predicted stochastically by needle insertion simulations. HDR procedures were simulated with varying number of needle insertions (4 to 12) using 11 patient MR data-sets with PTV, prostate, urethra, bladder and rectum delineated. Needle positioning errors were modeled by random normally distributed angulation errors (standard deviation of 3 mm at the needle’s tip). The final dose parameters were compared in the situations where the needle with the largest vs. the smallest dose coverage impact was selected at each insertion. Results: Over all scenarios, the percentage of clinically acceptable final dose distribution improved when the needle selected had the largest dose coverage impact (91%) compared to the smallest (88%). The differences were larger for few (4 to 6) needle insertions (maximum difference scenario: 79% vs. 60%). The computation time of the needle sequence optimization was below 60s. Conclusion: A new adaptive needle sequence determination for HDR prostate brachytherapy was developed. Coupled to adaptive planning, the selection of the needle with the largest dose coverage impact increases chances of reaching the clinical constraints. M. Borot de Battisti is funded by Philips Medical Systems Nederland B.V.; M. Moerland is principal investigator on a contract funded by Philips Medical Systems Nederland B.V.; G. Hautvast and D. Binnekamp are fulltime employees of Philips Medical Systems Nederland B.V.

60 APPLIED LIFE SCIENCES↗

WE-DE-BRA-01: SCIENCE COUNCIL JUNIOR INVESTIGATOR COMPETITION WINNER: Acceleration of a Limited-Angle Intrafraction Verification (LIVE) System Using Adaptive Prior Knowledge Based Image Estimation

Purpose: To develop an adaptive prior knowledge based image estimation method to reduce the scan angle needed in the LIVE system to reconstruct 4D-CBCT for intrafraction verification. Methods: The LIVE system has been previously proposed to reconstructs 4D volumetric images on-the-fly during arc treatment for intrafraction target verification and dose calculation. This system uses limited-angle beam’s eye view (BEV) MV cine images acquired from the treatment beam together with the orthogonally acquired limited-angle kV projections to reconstruct 4D-CBCT images for target verification during treatment. In this study, we developed an adaptive constrained free-form deformation reconstruction technique in LIVE to further reduce the scanning angle needed to reconstruct the CBCT images. This technique uses free form deformation with energy minimization to deform prior images to estimate 4D-CBCT based on projections acquired in limited angle (orthogonal 6°) during the treatment. Note that the prior images are adaptively updated using the latest CBCT images reconstructed by LIVE during treatment to utilize the continuity of patient motion.The 4D digital extended-cardiac-torso (XCAT) phantom was used to evaluate the efficacy of this technique with LIVE system. A lung patient was simulated with different scenario, including baseline drifts, amplitude change and phase shift. Limited-angle orthogonal kV and beam’s eye view (BEV) MV projections were generated for each scenario. The CBCT reconstructed by these projections were compared with the ground-truth generated in XCAT.Volume-percentage-difference (VPD) and center-of-mass-shift (COMS) were calculated between the reconstructed and the ground-truth tumors to evaluate the reconstruction accuracy. Results: Using orthogonal-view of 6° kV and BEV- MV projections, the VPD/COMS values were 12.7±4.0%/0.7±0.5 mm, 13.0±5.1%/0.8±0.5 mm, and 11.4±5.4%/0.5±0.3 mm for the three scenarios, respectively. Conclusion: The technique enables LIVE to accurately reconstruct 4D-CBCT images using only orthogonal 6° angle, which greatly improves the efficiency and reduces dose of LIVE for intrafraction verification.

60 APPLIED LIFE SCIENCES↗

TH-AB-202-04: Auto-Adaptive Margin Generation for MLC-Tracked Radiotherapy

Purpose: To develop an auto-adaptive margin generator for MLC tracking. The generator is able to estimate errors arising in image guided radiotherapy, particularly on an MR-Linac, which depend on the latencies of machine and image processing, as well as on patient motion characteristics. From the estimated error distribution, a segment margin is generated, able to compensate errors up to a user-defined confidence. Method: In every tracking control cycle (TCC, 40ms), the desired aperture D(t) is compared to the actual aperture A(t), a delayed and imperfect representation of D(t). Thus an error e(t)=A(T)-D(T) is measured every TCC. Applying kernel-density-estimation (KDE), the cumulative distribution (CDF) of e(t) is estimated. With CDF-confidence limits, upper and lower error limits are extracted for motion axes along and perpendicular leaf-travel direction and applied as margins. To test the dosimetric impact, two representative motion traces were extracted from fast liver-MRI (10Hz). The traces were applied onto a 4D-motion platform and continuously tracked by an Elekta Agility 160 MLC using an artificially imposed tracking delay. Gafchromic film was used to detect dose exposition for static, tracked, and error-compensated tracking cases. The margin generator was parameterized to cover 90% of all tracking errors. Dosimetric impact was rated by calculating the ratio between underexposed points (>5% underdosage) to the total number of points inside FWHM of static exposure. Results: Without imposing adaptive margins, tracking experiments showed a ratio of underexposed points of 17.5% and 14.3% for two motion cases with imaging delays of 200ms and 300ms, respectively. Activating the margin generated yielded total suppression (<1%) of underdosed points. Conclusion: We showed that auto-adaptive error compensation using machine error statistics is possible for MLC tracking. The error compensation margins are calculated on-line, without the need of assuming motion or machine models. Further strategies to reduce consequential overdosages are currently under investigation. This work was funded by the SoRTS consortium, which includes the industry partners Elekta, Philips and Technolution.

60 APPLIED LIFE SCIENCES↗

Adaptation to Environmental Extremes Structures Functional Traits in Biological Soil Crust and Hypolithic Microbial Communities

Biological soil crusts (biocrusts) are widespread in drylands and deserts. At the microhabitat scale, they also host hypolithic communities that live under semitranslucent stones. Both environmental niches experience exposure to extreme conditions such as high UV radiation, desiccation, temperature fluctuations, and resource limitation. However, hypolithic communities are somewhat protected from extremes relative to biocrust communities. Conditions are otherwise similar, so comparing them can answer outstanding questions regarding adaptations to environmental extremes. Using metagenomic sequencing, we assessed the functional potential of dryland soil communities and identified the functional underpinnings of ecological niche differentiation in biocrusts versus hypoliths. We also determined the effect of the anchoring photoautotroph (moss or cyanobacteria). Genes and pathways differing in abundance between biocrusts and hypoliths indicate that biocrust communities adapt to the higher levels of UV radiation, desiccation, and temperature extremes through an increased ability to repair damaged DNA, sense and respond to environmental stimuli, and interact with other community members and the environment. Intracellular competition appears to be crucial to both communities, with biocrust communities using the Type VI Secretion System (T6SS) and hypoliths favoring a diversity of antibiotics. The dominant primary producer had a reduced effect on community functional potential compared with niche, but an abundance of genes related to monosaccharide, amino acid, and osmoprotectant uptake in moss-dominated communities indicates reliance on resources provided to heterotrophs by mosses. Our findings indicate that functional traits in dryland communities are driven by adaptations to extremes and we identify strategies that likely enable survival in dryland ecosystems.

59 BASIC BIOLOGICAL SCIENCES↗

High-Order Mesh r-Adaptivity with Tangential Relaxation and Guaranteed Mesh Validity

High-order meshes are crucial for achieving optimal convergence rates in curvilinear domains, preserving symmetry, and aligning with key flow features in moving mesh simulations [1], but their quality is challenging to control. In prior work, we have developed techniques based on Target-Matrix Optimization Paradigm (TMOP) to adapt a given high-order mesh to the geometry and solution of the partial differential equation (PDE) [2, 3]. Here, we extend this framework to address two key gaps in the literature for highorder mesh 𝑟-adaptivity. First, we introduce tangential relaxation on curved surfaces using solely the discrete mesh representation, eliminating the need for access to underlying geometry (e.g., CAD model). Second, we ensure a continuously positive Jacobian determinant throughout the domain. This determinant positivity is essential for using the high-order mesh resulting from 𝑟-adaptivity with arbitrary quadrature schemes in simulations. The proposed approach is demonstrated to be robust using a variety of numerical experiments.

Mathematics and Computing↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗

PAGANI: a parallel adaptive GPU algorithm for numerical integration

We present a new adaptive parallel algorithm for the challenging problem of multi-dimensional numerical integration on massively parallel architectures. Adaptive algorithms have demonstrated the best performance, but efficient many-core utilization is difficult to achieve because the adaptive work-load can vary greatly across the integration space and is impossible to predict a priori. Existing parallel algorithms utilize sequential computations on independent processors, which results in bottlenecks due to the need for data redistribution and processor synchronization. Our algorithm employs a high-throughput approach in which all existing sub-regions are processed and sub-divided in parallel. Repeated sub-region classification and filtering improves upon a brute-force approach and allows the algorithm to make efficient use of computation and memory resources. A CUDA implementation shows orders of magnitude speedup over the fastest open-source CPU method and extends the achievable accuracy for difficult integrands. Our algorithm typically outperforms other existing deterministic parallel methods.

Sakiotis, Ioannis↗

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization [SWR-25-166]

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization aims to demonstrate the effect of adaptive sampling-based bi-fidelity stochastic trust region method (ASTRO-BFDF). ASTRO-BFDF, derived from a derivative-free adaptive sampling trust-region optimization (ASTRO-DF) (Shashaani et al. 2018, Ha and Shashaani 2023), intended to efficiently solve the bi-fidelity simulation optimization.

Mueller, Juliane [National Laboratory of the Rocki↗

Long-term Multimodal Recording Reveals Epigenetic Adaptation Routes in Dormant Breast Cancer Cells

Patients with estrogen receptor–positive breast cancer receive adjuvant endocrine therapies (ET) that delay relapse by targeting clinically undetectable micrometastatic deposits. Yet, up to 50% of patients relapse even decades after surgery through unknown mechanisms likely involving dormancy. To investigate genetic and transcriptional changes underlying tumor awakening, we analyzed late relapse patients and longitudinally profiled a rare cohort treated with long-term neoadjuvant ETs until progression. Next, we developed an in vitro evolutionary study to record the adaptive strategies of individual lineages in unperturbed parallel experiments. Our data demonstrate that ETs induce nongenetic cell state transitions into dormancy in a stochastic subset of cells via epigenetic reprogramming. Single lineages with divergent phenotypes awaken unpredictably in the absence of recurrent genetic alterations. Targeting the dormant epigenome shows promising activity against adapting cancer cells. Overall, this study uncovers the contribution of epigenetic adaptation to the evolution of resistance to ETs.

60 APPLIED LIFE SCIENCES↗

A Scale-Adaptive Turbulent Kinetic Energy Closure for the Dry Convective Boundary Layer

Abstract A pragmatic scale-adaptive turbulent kinetic energy (TKE) closure is proposed to simulate the dry convective boundary layer for a variety of horizontal grid resolutions: from 50 m, typical of large-eddy simulation models that use three-dimensional turbulence parameterizations/closures, up to 100 km, typical of climate models that use one-dimensional turbulence and convection parameterizations/closures. Since parameterizations/closures using the TKE approach have been frequently used in these two asymptotic limits, a simple method is proposed to merge them with a mixing-length-scale formulation for intermediate resolutions. This new scale-adaptive mixing length naturally increases with increasing grid length until it saturates as the grid length reaches mesoscale-model resolution. The results obtained using this new approach for dry convective boundary layers are promising. The mean vertical profiles of potential temperature and heat flux remain in good agreement for different resolutions. A continuous transition (in terms of resolution) across the gray zone is illustrated through the partitioning between the model-resolved and the subgrid-scale transports as well as by documenting the transition of the subgrid-scale TKE source/sink terms. In summary, a natural and continuous transition across resolutions (from 50 m to 100 km) is obtained, for dry convection, using exactly the same atmospheric model for all resolutions with a simple scale-adaptive mixing-length formulation.

Kurowski, Marcin J.↗

Multisensor Agile Adaptive Sampling (MAAS): A Methodology to Collect Radar Observations of Convective Cell Life Cycle

Abstract Multisensor Agile Adaptive Sampling (MAAS), a smart sensing framework, was adapted to increase the likelihood of observing the vertical structure (with little to no gaps), spatial variability (at subkilometer scale), and temporal evolution (at ∼2-min resolution) of convective cells. This adaptation of MAAS guided two mechanically scanning C-band radars (CSAPR2 and CHIVO) by automatically analyzing the latest NEXRAD data to identify, characterize, track, and nowcast the location of all convective cells forming in the Houston domain. MAAS used either a list of predetermined rules or real-time user input to select a convective cell to be tracked and sampled by the C-band radars. The CSAPR2 tracking radar was first tasked to collect three sector plan position indicator (PPI) scans toward the selected cell. Edge computer processing of the PPI scans was used to identify additional targets within the selected cell. In less than 2 min, both the CSAPR2 and CHIVO radars were able to collect bundles of three to six range–height indicator (RHI) scans toward different targets of interest within the selected cell. Bundles were successively collected along the path of cell advection for as long as the cell met a predetermined set of criteria. Between 1 June and 30 September 2022 over 315 000 vertical cross-section observations were collected by the C-band radars through ∼1300 unique isolated convective cells, most of which were observed for over 15 min of their life cycle. To the best of our knowledge, this dataset, collected primarily through automatic means, constitutes the largest dataset of its kind.

54 ENVIRONMENTAL SCIENCES↗

Extreme scale unstructured adaptive CFD for aerodynamic flow control

Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and mathematics have progressively built up a hierarchy of fluid models since fluid flow impacts our lives in so many fundamental ways - from the early days of flow of water in viaducts to cities, to today's flight of planes. This chapter is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10 6 larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales motivating the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features - non-linear, anisotropy, adaptivity, and implicit - dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this chapter, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.

42 ENGINEERING↗