Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling 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,333 records · Page 74

Stochastic optimization of a uranium oxide reaction mechanism using plasma flow reactor measurements

Abstract In this work, a coupled Monte Carlo Genetic Algorithm (MCGA) approach is used to optimize a gas phase uranium oxide reaction mechanism based on plasma flow reactor (PFR) measurements. The PFR produces a steady Ar plasma containing U, O, H, and N species with high temperature regions (3000–5000 K) relevant to observing UO formation via optical emission spectroscopy. A global kinetic treatment is used to model the chemical evolution in the PFR and to produce synthetic emission signals for direct comparison with experiments. The parameter space of a uranium oxide reaction mechanism is then explored via Monte Carlo sampling using objective functions to quantify the model-experiment agreement. The Monte Carlo results are subsequently refined using a genetic algorithm to obtain an experimentally corroborated set of reaction pathways and rate coefficients. Out of 12 reaction channels targeted for optimization, four channels are found to be well constrained across all optimization runs while another three channels are constrained in select cases. The optimized channels highlight the importance of the OH radical in oxidizing uranium in the PFR. This study comprises a first step toward producing a comprehensive experimentally validated reaction mechanism for gas phase uranium molecular species formation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated Construction of Artificial Lattice Structures with Designer Electronic States

Manipulating matter with a scanning tunneling microscope (STM) enables the creation of atomically defined artificial structures that host designer quantum states. However, the time-consuming nature of the manipulation process, coupled with the sensitivity of the STM tip, constrains the exploration of diverse configurations and limits the size of the designed features. In this study, we present a reinforcement learning (RL)-based framework for creating artificial structures by spatially manipulating carbon monoxide (CO) molecules on a copper substrate by using the STM tip. The automated workflow combines molecule detection and manipulation, employing deep-learning-based object detection to locate CO molecules and linear assignment algorithms to allocate these molecules to designated target sites. We initially perform molecule maneuvering based on randomized parameter sampling for sample bias, tunneling current set point, and manipulation speed. This data set is then structured into an action trajectory used to train an RL agent. The model is subsequently deployed on the STM for real-time fine-tuning of the manipulation parameters during structure construction. Our approach incorporates path-planning protocols coupled with active drift compensation to enable atomically precise fabrication of structures with significantly reduced human input while realizing larger-scale artificial lattices with the desired electronic properties. Furthermore, using our approach, we demonstrate the automated construction of an extended artificial graphene lattice and confirm the existence of a characteristic Dirac point in its electronic structure. Further challenges regarding the RL-based structural assembly scalability are discussed.

Algorithms↗

Testing Classical Properties from Quantum Data

Many properties of Boolean functions can be tested far more efficiently than the function itself can be learned. However, this dramatic advantage often disappears when testers are limited to random samples of ƒ instead of adaptively chosen queries to f. In this work we investigate the quantum version of this restriction: quantum algorithms that test properties of a Boolean function f solely from copies of either the function state |ƒ⟩ ∝ ∑ x |x, ƒ(x)⟩ or the phase state |(-1) ƒ ⟩ ∝ ∑ x (-1) ƒ(x) |x⟩. For monotonicity, symmetry, and triangle-freeness, we show passive quantum testers are unboundedly or super-polynomially better than their classical passive testing counterparts. They are competitive with classic query -based testers in each case. Our new testers use techniques beyond quantum Fourier sampling, and it turns out this is necessary: we show a certain class of bent functions can be tested from 𝒪(1) function states but has a sample complexity lower bound of 2 Ω(n) for any tester relying exclusively on Fourier and classical samples. Our passive quantum testers are competitive with classical query -based testers, but this isn't universal: we exhibit a testing problem that can be solved from 𝒪(1) classical queries but requires Ω(2 n/2 ) function state copies. The Forrelation problem provides a separation of the same magnitude in the opposite direction, so we conclude that quantum data and classical queries are "maximally incomparable" resources for testing. We also begin the study of lower bounds for testing from quantum data. For quantum monotonicity testing, we prove that the ensembles of [Goldreich et al., 2000; Black, 2024], which give exponential lower bounds for classical sample-based testing, do not yield any nontrivial lower bounds for testing from quantum data. New insights specific to quantum data will be required for proving copy complexity lower bounds for testing in this model.

Boolean Functions↗

Pulmonary lobe segmentation based on ridge surface sampling and shape model fitting

Purpose: Performing lobe-based quantitative analysis of the lung in computed tomography (CT) scans can assist in efforts to better characterize complex diseases such as chronic obstructive pulmonary disease (COPD). While airways and vessels can help to indicate the location of lobe boundaries, segmentations of these structures are not always available, so methods to define the lobes in the absence of these structures are desirable. Methods: The authors present a fully automatic lung lobe segmentation algorithm that is effective in volumetric inspiratory and expiratory computed tomography (CT) datasets. The authors rely on ridge surface image features indicating fissure locations and a novel approach to modeling shape variation in the surfaces defining the lobe boundaries. The authors employ a particle system that efficiently samples ridge surfaces in the image domain and provides a set of candidate fissure locations based on the Hessian matrix. Following this, lobe boundary shape models generated from principal component analysis (PCA) are fit to the particles data to discriminate between fissure and nonfissure candidates. The resulting set of particle points are used to fit thin plate spline (TPS) interpolating surfaces to form the final boundaries between the lung lobes. Results: The authors tested algorithm performance on 50 inspiratory and 50 expiratory CT scans taken from the COPDGene study. Results indicate that the authors' algorithm performs comparably to pulmonologist-generated lung lobe segmentations and can produce good results in cases with accessory fissures, incomplete fissures, advanced emphysema, and low dose acquisition protocols. Dice scores indicate that only 29 out of 500 (5.85%) lobes showed Dice scores lower than 0.9. Two different approaches for evaluating lobe boundary surface discrepancies were applied and indicate that algorithm boundary identification is most accurate in the vicinity of fissures detectable on CT. Conclusions: The proposed algorithm is effective for lung lobe segmentation in absence of auxiliary structures such as vessels and airways. The most challenging cases are those with mostly incomplete, absent, or near-absent fissures and in cases with poorly revealed fissures due to high image noise. However, the authors observe good performance even in the majority of these cases.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

ERRATUM: “Automated Transient Identification in the Dark Energy Survey” (2015, AJ, 150, 82)

Here, we describe an algorithm for identifying point-source transients and moving objects on reference-subtracted optical images containing artifacts of processing and instrumentation. The algorithm makes use of the supervised machine learning technique known as Random Forest. We present results from its use in the Dark Energy Survey Supernova program (DES-SN), where it was trained using a sample of 898,963 signal and background events generated by the transient detection pipeline. After reprocessing the data collected during the first DES-SN observing season (2013 September through 2014 February) using the algorithm, the number of transient candidates eligible for human scanning decreased by a factor of 13.4, while only 1.0% of the artificial Type Ia supernovae (SNe) injected into search images to monitor survey efficiency were lost, most of which were very faint events. Here we characterize the algorithm's performance in detail, and we discuss how it can inform pipeline design decisions for future time-domain imaging surveys, such as the Large Synoptic Survey Telescope and the Zwicky Transient Facility. An implementation of the algorithm and the training data used in this paper are available at at http://portal.nersc.gov/project/dessn/autoscan.

79 ASTRONOMY AND ASTROPHYSICS↗

A novel cosmic filament catalogue from SDSS data

Here, in this work, we present a new catalogue of cosmic filaments obtained from the latest Sloan Digital Sky Survey (SDSS) public data. In order to detect filaments, we implement a version of the Subspace-Constrained Mean-Shift algorithm that is boosted by machine learning techniques. This allows us to detect cosmic filaments as one-dimensional maxima in the galaxy density distribution. Our filament catalogue uses the cosmological sample of SDSS, including Data Release 16, and therefore inherits its sky footprint (aside from small border effects) and redshift coverage. In particular, this means that, taking advantage of the quasar sample, our filament reconstruction covers redshifts up to z = 2.2, making it one of the deepest filament reconstructions to our knowledge. We follow a tomographic approach and slice the galaxy data in 269 shells at different redshift. The reconstruction algorithm is applied to 2D spherical maps. The catalogue provides the position and uncertainty of each detection for each redshift slice. The quality of our detections, which we assess with several metrics, show improvement with respect to previous public catalogues obtained with similar methods. We also detect a highly significant correlation between our filament catalogue and galaxy cluster catalogues built from microwave observations of the Planck Satellite and the Atacama Cosmology Telescope.

79 ASTRONOMY AND ASTROPHYSICS↗

Objective assessment of deformable image registration in radiotherapy: A multi-institution study

The looming potential of deformable alignment tools to play an integral role in adaptive radiotherapy suggests a need for objective assessment of these complex algorithms. Previous studies in this area are based on the ability of alignment to reproduce analytically generated deformations applied to sample image data, or use of contours or bifurcations as ground truth for evaluation of alignment accuracy. In this study, a deformable phantom was embedded with 48 small plastic markers, placed in regions varying from high contrast to roughly uniform regional intensity, and small to large regional discontinuities in movement. CT volumes of this phantom were acquired at different deformation states. After manual localization of marker coordinates, images were edited to remove the markers. The resulting image volumes were sent to five collaborating institutions, each of which has developed previously published deformable alignment tools routinely in use. Alignments were done, and applied to the list of reference coordinates at the inhale state. The transformed coordinates were compared to the actual marker locations at exhale. A total of eight alignment techniques were tested from the six institutions. All algorithms performed generally well, as compared to previous publications. Average errors in predicted location ranged from 1.5 to 3.9 mm, depending on technique. No algorithm was uniformly accurate across all regions of the phantom, with maximum errors ranging from 5.1 to 15.4 mm. Larger errors were seen in regions near significant shape changes, as well as areas with uniform contrast but large local motion discontinuity. Although reasonable accuracy was achieved overall, the variation of error in different regions suggests caution in globally accepting the results from deformable alignment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Genarris 2.0: A Random Structure Generator for Molecular Crystals

Genarris is an open source Python package for generating random molecular crystal structures with physical constraints for seeding crystal structure prediction algorithms and training machine learning models. Here we present a new version of the code, containing several major improvements. A MPI-based parallelization scheme has been implemented, which facilitates the seamless sequential execution of user-defined workflows. A new method for estimating the unit cell volume based on the single molecule structure has been developed using a machine-learned model trained on experimental structures. A new algorithm has been implemented for generating crystal structures with molecules occupying special Wyckoff positions. A new hierarchical structure check procedure has been developed to detect unphysical close contacts efficiently and accurately. New intermolecular distance settings have been implemented for strong hydrogen bonds. To demonstrate these new features, we study two specific cases: benzene and glycine. Genarris finds the experimental structures of the two polymorphs of benzene and the three polymorphs of glycine. Program summary Program Title: Genarris 2.0 Program Files doi: http://dx.doi.org/10.17632/grx6mz4pjn.1 Licensing provisions: BSD-3 Clause Programming language: Python, C External routines/libraries: Spglib, ASE, pymatgen, SciPy, mpi4py, scikit-learn, PyTorch, FHI-aims. Nature of problem: Molecular crystal structure prediction. Solution method: Genarris 2.0 generates molecular crystal structures over the 230 space groups, on general and special Wyckoff positions, using physical constraints. Down-sampling of the generated structures may be performed subsequently, based on molecular crystal packing descriptors and an unsupervised machine learning algorithm. Lastly, ab initio structure relaxation may be performed for the final pool. Depending on the user-defined workflow implemented, Genarris may be used to generate diverse molecular crystal datasets to seed evolutionary algorithms or to train machine learning algorithms or as a standalone crystal structure prediction method. Restrictions: For crystal structure generation, the molecule of interest must be semi-rigid with no bond rotational degrees of freedom. Unusual features: Genarris 2.0 is a highly distributed program, making use of MPI for Python parallelization. The user has the ability to design and implement workflows by executing a user-defined list of procedures. Genarris 2.0 offers new features including a machine learning model for estimating the molecular volume in the solid state from the single molecule structure, structure generation in special Wyckoff positions of space groups, hierarchical structure checks including rigorous treatment of non-orthogonal structures, and clustering and down-selection workflows combining first principles simulations with machine learning. (C) 2020 Elsevier B.V. All rights reserved.

Crystal structure prediction↗

SU-E-T-653: Quantifying Inter-Fraction Range Uncertainty for Input Into Robust Proton Planning

Purpose: To provide a method for quantifying centre- and tumour site-specific population range uncertainty due to inter-fraction motion for use within robust proton planning and plan analysis. PTV-based and probabilistic/robust plans depend upon accurate knowledge of geometric and range uncertainties. If the uncertainty model is inaccurate, both types of plan, PTV or probabilistic, could produce under-dosing of the target and/or overdosing of OAR. Methods: Daily mega-voltage volumetric imaging data from previously treated radiotherapy patients has been used to investigate inter-fraction changes to water equivalent path-length (WEPL). Daily image-guidance scans were carried out for each patient and corrected for changes in CTV position (using rigid transformations). An effective depth algorithm was used to determine residual range changes, after corrections were applied, by comparing WEPL within the CTV at each fraction for several beam angles. This method has been demonstrated for nine prostate and seven head and neck. Results: Inter-fraction range changes for the head and neck patient sample were Σ=3.39mm, σ=4.72mm and overall mean =−1.82mm; for prostate Σ=5.64mm, σ=5.91mm and overall mean =0.98 mm. The choice of beam angle for head and neck did not affect the inter-fraction range error significantly; however this was not the same for prostate. Greater range changes were seen using a lateral beam compared to an anterior beam for prostate due to relative motion of the prostate and femoral heads. Conclusion: A method has been developed to quantify population range changes due to inter-fraction motion. The results show a non-zero mean for these samples, as well as significant Σ and σ, highlighting the importance of quantifying uncertainties and use of image guidance. Such information can be used in robust optimisation algorithms and for analysing treatment plan robustness. It may also help in establishing beam start conditions at planning and for establishing adaptive planning protocols.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Cable Damage Detection System and Algorithms Using Time Domain Reflectometry

This report describes the hardware system and the set of algorithms we have developed for detecting damage in cables for the Advanced Development and Process Technologies (ADAPT) Program. This program is part of the W80 Life Extension Program (LEP). The system could be generalized for application to other systems in the future. Critical cables can undergo various types of damage (e.g. short circuits, open circuits, punctures, compression) that manifest as changes in the dielectric/impedance properties of the cables. For our specific problem, only one end of the cable is accessible, and no exemplars of actual damage are available. This work addresses the detection of dielectric/impedance anomalies in transient time domain reflectometry (TDR) measurements on the cables. The approach is to interrogate the cable using time domain reflectometry (TDR) techniques, in which a known pulse is inserted into the cable, and reflections from the cable are measured. The key operating principle is that any important cable damage will manifest itself as an electrical impedance discontinuity that can be measured in the TDR response signal. Machine learning classification algorithms are effectively eliminated from consideration, because only a small number of cables is available for testing; so a sufficient sample size is not attainable. Nonetheless, a key requirement is to achieve very high probability of detection and very low probability of false alarm. The approach is to compare TDR signals from possibly damaged cables to signals or an empirical model derived from reference cables that are known to be undamaged. This requires that the TDR signals are reasonably repeatable from test to test on the same cable, and from cable to cable. Empirical studies show that the repeatability issue is the 'long pole in the tent' for damage detection, because it is has been difficult to achieve reasonable repeatability. This one factor dominated the project. The two-step model-based approach is summarized as follows: Step 1, Cable Modeling: Given input-output TDR signals s(n) and x{sub U}(n) for a cable known to be free of damage, system identification algorithms are used to compute a dynamic prediction-error cable model that has output {cflx x}{sub U}(n). The model is declared valid when the innovations e{sub U}(n) = x{sub U}(n) {cflx x}{sub U}(n) satisfy a statistical zero-mean whiteness test. This validated model output is then used as a known reference to which other cables can be compared. Step 2, Cable Testing: The TDR output signal x{sub D}(n) from a cable under test is compared with the model output {cflx x}{sub U}(n) by computing the innovations e{sub D}(n) = x{sub D}(n) {cflx x}{sub U}(n). The innovations are tested using a short-term whiteness test statistic, which employs a statistical confidence interval. If the cable passes the test, this implies that the model is valid and the cable is declared undamaged. If the cable fails the test, this indicates a model mismatch, which means that the cable's dielectric properties have changed; and this implies that the cable is damaged. The test threshold is adjusted to maximize probability of detection and minimize probability of false alarm according to an empirically determined receiver operating characteristic (ROC) curve. An associated confidence interval on the probability of correct classification is also provided. The effectiveness of the algorithm is demonstrated using measured TDR signals for undamaged and damaged cables. Experimental and algorithmic methods for coping with repeatability issues are presented. The model-based damage detection algorithms have been shown to perform well for some representative examples of real TDR signals acquired using the two-dimensional (2D) mockup fixture. If the damage causes a short circuit, then damage detection performance is generally good to excellent. Examples include the cases demonstrated in this report for cuts and pinholes. If the damage does not cause a short circuit, then damage detection performance is generally poor to fair. Examples include the cases demonstrated in this report for crushes and partial cuts.

42 ENGINEERING↗

Stochastic quantum Krylov protocol with double-factorized Hamiltonians

Here we propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator e –i$\widehat{H}$$\tau$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than 1 kcal mol -1 with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PHURBAS: AN ADAPTIVE, LAGRANGIAN, MESHLESS, MAGNETOHYDRODYNAMICS CODE. I. ALGORITHM

We present an algorithm for simulating the equations of ideal magnetohydrodynamics and other systems of differential equations on an unstructured set of points represented by sample particles. Local, third-order, least-squares, polynomial interpolations (Moving Least Squares interpolations) are calculated from the field values of neighboring particles to obtain field values and spatial derivatives at the particle position. Field values and particle positions are advanced in time with a second-order predictor-corrector scheme. The particles move with the fluid, so the time step is not limited by the Eulerian Courant-Friedrichs-Lewy condition. Full spatial adaptivity is implemented to ensure the particles fill the computational volume, which gives the algorithm substantial flexibility and power. A target resolution is specified for each point in space, with particles being added and deleted as needed to meet this target. Particle addition and deletion is based on a local void and clump detection algorithm. Dynamic artificial viscosity fields provide stability to the integration. The resulting algorithm provides a robust solution for modeling flows that require Lagrangian or adaptive discretizations to resolve. This paper derives and documents the Phurbas algorithm as implemented in Phurbas version 1.1. A following paper presents the implementation and test problem results.

79 ASTRONOMY AND ASTROPHYSICS↗

Informed-Proteomics: open-source software package for top-down proteomics

Top-down proteomics involves the analysis of intact proteins. This approach is very attractive as it allows for analyzing proteins in their endogenous form without proteolysis, preserving valuable information about post-translation modifications, isoforms, proteolytic processing or their combinations collectively called proteoforms. Moreover, the quality of the top-down LC-MS/MS datasets is rapidly increasing due to advances in the liquid chromatography and mass spectrometry instrumentation and sample processing protocols. However, the top-down mass spectra are substantially more complex compare to the more conventional bottom-up data. To take full advantage of the increasing quality of the top-down LC-MS/MS datasets there is an urgent need to develop algorithms and software tools for confident proteoform identification and quantification. In this study we present a new open source software suite for top-down proteomics analysis consisting of an LC-MS feature finding algorithm, a database search algorithm, and an interactive results viewer. The presented tool along with several other popular tools were evaluated using human-in-mouse xenograft luminal and basal breast tumor samples that are known to have significant differences in protein abundance based on bottom-up analysis.

Environmental Molecular Sciences Laboratory↗

A Study on Efficient Reinforcement Learning Through Knowledge Transfer

Although Reinforcement Learning (RL) algorithms have made impressive progress in learning complex tasks over the past years, there are still prevailing short-comings and challenges. Specifically, the sample-inefficiency and limited adaptation across tasks often make classic RL techniques impractical for real-world applications despite the gained representational power when combining deep neural networks with RL, known as Deep Reinforcement Learning (DRL). Recently, a number of approaches to address those issues have emerged. Many of those solutions are based on smart DRL architectures that enhance single task algorithms with the capability to share knowledge between agents and across tasks by introducing Transfer Learning (TL) capabilities. Here this survey addresses strategies of knowledge transfer from simple parameter sharing to privacy preserving federated learning and aims at providing a general overview of the field of TL in the DRL domain, establishes a classification framework, and briefly describes representative works in the area.

97 MATHEMATICS AND COMPUTING↗

Learning with Delayed Rewards—A Case Study on Inverse Defect Design in 2D Materials

Defect dynamics in materials are of central importance to a broad range of technologies from catalysis to energy storage systems to microelectronics. Material functionality depends strongly on the nature and organization of defects-their arrangements often involve intermediate or transient states that present a high barrier for transformation. The lack of knowledge of these intermediate states and the presence of this energy barrier presents a serious challenge for inverse defect design, especially for gradient-based approaches. Here, we present a reinforcement learning (RL) [Monte Carlo Tree Search (MCTS)] based on delayed rewards that allow for efficient search of the defect configurational space and allows us to identify optimal defect arrangements in low-dimensional materials. Using a representative case of two-dimensional MoS 2 , we demonstrate that the use of delayed rewards allows us to efficiently sample the defect configurational space and overcome the energy barrier for a wide range of defect concentrations (from 1.5 to 8% S vacancies)-the system evolves from an initial randomly distributed S vacancies to one with extended S line defects consistent with previous experimental studies. Detailed analysis in the feature space allows us to identify the optimal pathways for this defect transformation and arrangement. Comparison with other global optimization schemes like genetic algorithms suggests that the MCTS with delayed rewards takes fewer evaluations and arrives at a better quality of the solution. The implications of the various sampled defect configurations on the 2H to 1T phase transitions in MoS 2 are discussed. In this study, we introduce a RL strategy employing delayed rewards that can accelerate the inverse design of defects in materials for achieving targeted functionality.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗

The completed SDSS-IV extended baryon oscillation spectroscopic survey: geometry and growth from the anisotropic void–galaxy correlation function in the luminous red galaxy sample

ABSTRACT We present an analysis of the anisotropic redshift-space void–galaxy correlation in configuration space using the Sloan Digital Sky Survey extended Baryon Oscillation Spectroscopic Survey (eBOSS) Data Release 16 luminous red galaxy (LRG) sample. This sample consists of LRGs between redshifts 0.6 and 1.0, combined with the high redshift z > 0.6 tail of the Baryon Oscillation Spectroscopic Survey Data Release 12 CMASS sample. We use a reconstruction method to undo redshift-space distortion (RSD) effects from the galaxy field before applying a watershed void-finding algorithm to remove bias from the void selection. We then perform a joint fit to the multipole moments of the correlation function for the growth rate fσ8 and the geometrical distance ratio DM/DH, finding $f\sigma _8(z_\rm {eff})=0.356\pm 0.079$ and $D_M/D_H(z_\rm {eff})=0.868\pm 0.017$ at the effective redshift $z_\rm {eff}=0.69$ of the sample. The posterior parameter degeneracies are orthogonal to those from galaxy clustering analyses applied to the same data, and the constraint achieved on DM/DH is significantly tighter. In combination with the consensus galaxy BAO and full-shape analyses of the same sample, we obtain fσ8 = 0.447 ± 0.039, DM/rd = 17.48 ± 0.23, and DH/rd = 20.10 ± 0.34. These values are in good agreement with the ΛCDM model predictions and represent reductions in the uncertainties of $13{{\ \rm per\ cent}}$, $23{{\ \rm per\ cent}}$, and $28{{\ \rm per\ cent}}$, respectively, compared to the combined results from galaxy clustering, or an overall reduction of 55 per cent in the allowed volume of parameter space.

Nadathur, Seshadri↗

Validation of a new control system for Elekta accelerators facilitating continuously variable dose rate

Purpose: Elekta accelerators controlled by the current clinically used accelerator control system, Desktop 7.01 (D7), uses binned variable dose rate (BVDR) for volumetric modulated arc therapy (VMAT). The next version of the treatment control system (Integrity) supports continuously variable dose rate (CVDR) as well as BVDR. Using CVDR opposed to BVDR for VMAT has the potential of reducing the treatment time but may lead to lower dosimetric accuracy due to faster moving accelerator parts. Using D7 and a test version of Integrity, differences in ability to control the accelerator, treatment efficiency, and dosimetric accuracy between the two systems were investigated. Methods: Single parameter tests were designed to expose differences in the way the two systems control the movements of the accelerator. In these tests, either the jaws, multi leaf collimators (MLCs), or gantry moved at constant speed while the dose rate was changed in discrete steps. The positional errors of the moving component and dose rate were recorded using the control systems with a sampling frequency of 4 Hz. The clinical applicability of Integrity was tested using 15 clinically used VMAT plans (5 prostate, 5 H and N, and 5 lung) generated by the SmartArc algorithm in PINNACLE. The treatment time was measured from beam-on to beam-off and the accuracy of the dose delivery was assessed by comparing DELTA4 measurements and PINNACLE calculated doses using gamma evaluation. Results: The single parameter tests showed that Integrity had an improved feedback between gantry motion and dose rate at the slight expense of MLC control compared to D7. The single parameter test did not reveal any significant differences in the control of either jaws or backup jaws between the two systems. These differences in gantry and MLC control together with the use of CVDR gives a smoother Integrity VMAT delivery compared to D7 with less abrupt changes in accelerator motion. Gamma evaluation (2% of 2 Gy and 2 mm) of the calculated doses and DELTA4 measured doses corrected for systematic errors showed an average pass rate of more than 97.8% for both D7, Integrity BVDR, and Integrity CVDR deliveries. Direct comparisons between the measured doses using strict gamma criteria of 0.5% and 0.5 mm showed excellent agreement between D7 and Integrity delivered doses with average pass rates above 95.7%. Finally, the Integrity control system resulted in a significant 35% (55 {+-} 13 s) reduction in treatment time, on average. Conclusions: Single parameter tests showed that the two control systems differed in their feedback loops between MLC, gantry, and dose rate. These differences made the VMAT deliveries more smooth using the new Integrity treatment control system, compared to the current Desktop 7.01. Together with the use of CVDR, which results in less abrupt changes in dose rate, this further increases the smoothness of the delivery. The use of CVDR for VMAT with the Integrity desktop results in a significant reduction in treatment time compared to BVDR with an average reduction of 35%. This decrease in delivery time was achieved without compromising the dosimetric accuracy.

07 ISOTOPE AND RADIATION SOURCES↗