Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

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 667 records · Page 37

The importance of shear on the collective charge transport in CDWs revealed by an XFEL source

Charge transport in materials has an impact on a wide range of devices based on semiconductor, battery, or superconductor technology. Charge transport in sliding charge density waves (CDW) differs from all others in that the atomic lattice is directly involved in the transport process. To obtain an overall picture of the structural changes associated to the collective transport, the large coherent x-ray beam generated by an x-ray free-electron laser (XFEL) source was used. The CDW phase can be retrieved over the entire sample from diffracted intensities using a genetic algorithm. For currents below threshold, increasing shear deformation is observed in the central part of the sample while longitudinal deformation appears above threshold when shear relaxes. Shear thus precedes longitudinal deformation, with relaxation of one leading to the appearance of the other. Moreover, strain accumulates on surface steps in the sliding regime, demonstrating the strong pinning character of these surface discontinuities. The sliding process of nanometric CDW involves macroscopic sample dimensions.

36 MATERIALS SCIENCE↗

Demand Capacity Balancing at Vertiports for Initial Strategic Conflict Management of Urban Air Mobility Operations

Urban Air Mobility (UAM) is a new transportation concept that enables highly automated, cooperative, passenger or cargo-carrying air transportation services in and around urban areas. To achieve the high level of operational density and complexity desired by the UAM community, an airspace system that allows UAM operators to readily access and operate safely and efficiently in the airspace is needed. This airspace system will require air traffic management designed to reduce the risk of conflicts and loss of separation between UAM flights. In general, strategic conflict management is considered as the first layer of conflict management for safe flight operations to condition the traffic to reduce the need for airborne separation provision, the second layer of conflict management. Demand Capacity Balancing (DCB) is one of the concept components to achieve strategic conflict management. DCB strategically evaluates traffic demand and resource capacities to allow UAM operators to determine when, where and how they operate, while mitigating conflicting needs for airspace and vertiport capacity. DCB can be applied whenever UAM demand exceeds the capacity in airspace or at vertiports. As the UAM ecosystem evolves with advanced technologies and matured operational procedures, more complicated conflict management will likely be needed. In the current UAM ‘Concept of Operation (ConOps) 1.0’ operational stage defined by FAA, however, it will be meaningful to explore the demand capacity balancing at vertiports only, as an initial strategic conflict management approach for UAM operations because vertiport capacity seems to be a bottleneck of UAM traffic. For this research, we developed a demand-capacity imbalance detection and resolution service for UAM. This DCB service identifies the demand from operators and compares the demand to a given capacity at the shared resources (i.e., vertiports) over the upcoming time horizon which is divided into time bins having a constant interval. When a new flight plan is submitted, the algorithm embedded in the DCB service checks the available time bins based on the desired departure time and estimated arrival time at origin and destination vertiports, respectively. If the time bins for the originally desired times are already occupied by other flights (i.e., demand is at or above capacity), the algorithm finds the next available time bins for takeoff and landing and shifts the conflicting departure time to the earliest time that satisfies the capacity constraints at both origin and destination vertiports. The details of the algorithm will be described in the final manuscript. Figure 1 shows that the proposed DCB algorithm works well for a sample traffic scenario. In this example, a total of 144 flights, split between two operators, are planned over 2 hours, traveling 10 routes between five vertiports. In the heatmaps, the horizontal axis shows 12 time bins where each bin represents a 12-minute interval, and the vertical axis shows five vertiports. The number in each cell shows the number of operations, counting both departures and arrivals, at a specific vertiport in each time bin. For the given capacity of 2 operations/vertiport/bin, Figure 1 shows that the original demand sometimes exceeds the capacity, but the modified demand is reduced to the given capacity after resolving demand-capacity imbalances. When UAM flights are operated, it is expected that many practical issues would arise in the federated system architecture with multiple operators. UAM operators may experience a time synchronization issue due to communication delay between operator and vehicle. UAM vehicles would fly at different flight speeds, depending on vehicle models. Actual departure and arrival times can have large variations, compared to the schedule. The lead time from flight plan submission to desired departure time can vary by service type (e.g., regular shuttle service vs. on-demand service). Using the proposed DCB algorithm, we also investigated how the actual flight schedule and DCB performance are affected by these uncertainties such as unsynchronized times between operators, flight speed differences, lead time differences, and departure time errors. The final manuscript will include the background of this research work, the description of the DCB algorithm and its use cases with traffic scenarios. It will also provide the analytical results about the impact of various uncertainties that can occur in actual UAM operations on the DCB at vertiports, in terms of demand distribution changes, number of simultaneous operations, and delay propagation.

Urban Air Mobility↗

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗

Autoregressive Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation

The theory of open quantum systems lays the foundation for a substantial part of modern research in quantum science and engineering. Rooted in the dimensionality of their extended Hilbert spaces, the high computational complexity of simulating open quantum systems calls for the development of strategies to approximate their dynamics. In this Letter, we present an approach for tackling open quantum system dynamics. Using an exact probabilistic formulation of quantum physics based on positive operator-valued measure, we compactly represent quantum states with autoregressive neural networks; such networks bring significant algorithmic flexibility due to efficient exact sampling and tractable density. We further introduce the concept of string states to partially restore the symmetry of the autoregressive neural network and improve the description of local correlations. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator using a forward-backward trapezoid method and find the steady state via a variational formulation. Our approach is benchmarked on prototypical one-dimensional and two-dimensional systems, finding results which closely track the exact solution and achieve higher accuracy than alternative approaches based on using Markov chain Monte Carlo method to sample restricted Boltzmann machines. Our Letter provides general methods for understanding quantum dynamics in various contexts, as well as techniques for solving high-dimensional probabilistic differential equations in classical setups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗

A high speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗

A high-speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗

Semiclassical Monte-Carlo approach for modelling non-adiabatic dynamics in extended molecules

Modelling of non-adiabatic dynamics in extended molecular systems and solids is a next frontier of atomistic electronic structure theory. The underlying numerical algorithms should operate only with a few quantities (that can be efficiently obtained from quantum chemistry), provide a controlled approximation (which can be systematically improved) and capture important phenomena such as branching (multiple products), detailed balance and evolution of electronic coherences. Here we propose a new algorithm based on Monte-Carlo sampling of classical trajectories, which satisfies the above requirements and provides a general framework for existing surface hopping methods for non-adiabatic dynamics simulations. In particular, our algorithm can be viewed as a post-processing technique for analysing numerical results obtained from the conventional surface hopping approaches. Presented numerical tests for several model problems demonstrate efficiency and accuracy of the new method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Laser-induced breakdown spectroscopy in industrial and security applications

Laser-induced breakdown spectroscopy (LIBS) offers rapid, localized chemical analysis of solid or liquid materials with high spatial resolution in lateral and depth profiling, without the need for sample preparation. Principal component analysis and partial least squares algorithms were applied to identify a variety of complex organic and inorganic samples. This work illustrates how LIBS analyzers can answer a multitude of real-world needs for rapid analysis, such as determination of lead in paint and children's toys, analysis of electronic and solder materials, quality control of fiberglass panels, discrimination of coffee beans from different vendors, and identification of generic versus brand-name drugs. Lateral and depth profiling was performed on children's toys and paint layers. Traditional one-element calibration or multivariate chemometric procedures were applied for elemental quantification, from single laser shot determination of metal traces at {approx}10 {mu}g/g to determination of halogens at 90 {mu}g/g using 50-shot spectral accumulation. The effectiveness of LIBS for security applications was demonstrated in the field by testing the 50-m standoff LIBS rasterizing detector.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Neutron sub-micrometre tomography from scattering data

Neutrons are valuable probes for various material samples across many areas of research. Neutron imaging typically has a spatial resolution of larger than 20 µm, whereas neutron scattering is sensitive to smaller features but does not provide a real-space image of the sample. A computed-tomography technique is demonstrated that uses neutron-scattering data to generate an image of a periodic sample with a spatial resolution of ∼300 nm. The achieved resolution is over an order of magnitude smaller than the resolution of other forms of neutron tomography. This method consists of measuring neutron diffraction using a double-crystal diffractometer as a function of sample rotation and then using a phase-retrieval algorithm followed by tomographic reconstruction to generate a map of the sample's scattering-length density. Topological features found in the reconstructions are confirmed with scanning electron micrographs. This technique should be applicable to any sample that generates clear neutron-diffraction patterns, including nanofabricated samples, biological membranes and magnetic materials, such as skyrmion lattices.

nanoscience↗

SU-F-J-211: Scatter Correction for Clinical Cone-Beam CT System Using An Optimized Stationary Beam Blocker with a Single Scan

Purpose: X-ray scatter photons result in significant image quality degradation of cone-beam CT (CBCT). Measurement based algorithms using beam blocker directly acquire the scatter samples and achieve significant improvement on the quality of CBCT image. Within existing algorithms, single-scan and stationary beam blocker proposed previously is promising due to its simplicity and practicability. Although demonstrated effectively on tabletop system, the blocker fails to estimate the scatter distribution on clinical CBCT system mainly due to the gantry wobble. In addition, the uniform distributed blocker strips in our previous design results in primary data loss in the CBCT system and leads to the image artifacts due to data insufficiency. Methods: We investigate the motion behavior of the beam blocker in each projection and design an optimized non-uniform blocker strip distribution which accounts for the data insufficiency issue. An accurate scatter estimation is then achieved from the wobble modeling. Blocker wobble curve is estimated using threshold-based segmentation algorithms in each projection. In the blocker design optimization, the quality of final image is quantified using the number of the primary data loss voxels and the mesh adaptive direct search algorithm is applied to minimize the objective function. Scatter-corrected CT images are obtained using the optimized blocker. Results: The proposed method is evaluated using Catphan@504 phantom and a head patient. On the Catphan©504, our approach reduces the average CT number error from 115 Hounsfield unit (HU) to 11 HU in the selected regions of interest, and improves the image contrast by a factor of 1.45 in the high-contrast regions. On the head patient, the CT number error is reduced from 97 HU to 6 HU in the soft tissue region and image spatial non-uniformity is decreased from 27% to 5% after correction. Conclusion: The proposed optimized blocker design is practical and attractive for CBCT guided radiation therapy. This work is supported by grants from Guangdong Innovative Research Team Program of China (Grant No. 2011S013), National 863 Programs of China (Grant Nos. 2012AA02A604 and 2015AA043203), the National High-tech R&D Program for Young Scientists by the Ministry of Science and Technology of China (Grant No. 2015AA020917)

60 APPLIED LIFE SCIENCES↗

Quantifying the magic of quantum channels

Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.

Wang, Xin (ORCID:0000000206413186)↗

A Deep Neural Network for Simultaneous Estimation of b Jet Energy and Resolution

We describe a method to obtain point and dispersion estimates for the energies of jets arising from b quarks produced in proton–proton collisions at an energy of $\sqrt{s}=13\,\text {TeV} $ at the CERN LHC. The algorithm is trained on a large sample of simulated b jets and validated on data recorded by the CMS detector in 2017 corresponding to an integrated luminosity of 41 $\,\text {fb}^{-1}$. A multivariate regression algorithm based on a deep feed-forward neural network employs jet composition and shape information, and the properties of reconstructed secondary vertices associated with the jet. The results of the algorithm are used to improve the sensitivity of analyses that make use of b jets in the final state, such as the observation of Higgs boson decay to $\hbox {b}\bar{\hbox {b}}$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Assessment of measurement error due to sampling perspective in the space-based Doppler lidar wind profiler

A Multipair Algorithm (MPA) has been developed to minimize the contribution of the sampling error in the simulated Doppler lidar wind profiler measurements (due to angular and spatial separation between shots in a shot pair) to the total measurement uncertainty. Idealized wind fields are used as input to the profiling model, and radial wind estimates are passed through the MPA to yield a wind measurement for 300 x 300 sq km areas. The derived divergence fields illustrate the gradient patterns that are particular to the Doppler lidar sampling strategy and perspective.

Houston, S. H.↗

Phase retrieval by coherent modulation imaging

Phase retrieval is a long-standing problem in imaging when only the intensity of the wavefield can be recorded. Coherent diffraction imaging (CDI) is a lensless technique that uses iterative algorithms to recover amplitude and phase contrast images from diffraction intensity data. For general samples, phase retrieval from a single diffraction pattern has been an algorithmic and experimental challenge. Here we report a method of phase retrieval that uses a known modulation of the sample exit-wave. This coherent modulation imaging (CMI) method removes inherent ambiguities of CDI and uses a reliable, rapidly converging iterative algorithm involving three planes. It works for extended samples, does not require tight support for convergence, and relaxes dynamic range requirements on the detector. CMI provides a robust method for imaging in materials and biological science, while its single-shot capability will benefit the investigation of dynamical processes with pulsed sources, such as X-ray free electron laser.

36 MATERIALS SCIENCE↗

HIV drug resistance during antiretroviral therapy scale-up in Uganda, 2012–19: a population-based, longitudinal study

Background With scale-up of antiretroviral therapy (ART) in sub-Saharan Africa, increasing pretreatment HIV drug resistance has been reported; however, the broader effect of ART expansion on population-level resistance patterns remains insufficiently quantified. We aimed to estimate the longitudinal prevalence of drug resistance and resistance-conferring mutations. Methods This study used data collected as part of the Rakai Community Cohort Study (RCCS), an open population-based census and cohort study conducted in southern Uganda. At each survey round, residents aged 15–49 years are invited to participate and receive a structured questionnaire that obtains sociodemographic, behavioural, and health information, including self-reported past and current ART use. Voluntary HIV testing is conducted using a rapid test algorithm and a venous blood sample. People with HIV provide samples for viral load quantification and deep sequencing. We analysed RCCS survey, HIV viral load, and deep sequencing (which was used to predict resistance) data from five survey rounds. The key outcomes were the population prevalence of viraemic people with HIV with non-nucleoside reverse transcriptase inhibitor (NNRTI), nucleoside reverse transcriptase inhibitor (NRTI), protease inhibitor, or multiclass resistance among all participants (regardless of HIV serostatus) in the 2015 and 2017 surveys. Prevalence of class-specific resistance and resistance-conferring substitutions were estimated using robust log-Poisson regression. Findings Between Aug 10, 2011, and Nov 4, 2020, there were 43 361 participants in the RCCS and 7923 (18·27%) people with HIV. Over five survey rounds, 93 622 participant visits occurred, among which 17 460 (18·65%) were from people with HIV. Over the analysis period, the median age of study participants remained similar (28 years [22–35] in 2012 and 29 years [21–38] in 2019). Sufficient data were available to reliably genotype 4072 (90·03%) of 4523 participant visits from 3407 people with HIV for at least one drug. Overall population prevalence of resistance contributed by viraemic pretreatment people with HIV decreased between 2012 and 2017 from 0·56% (95% CI 0·42–0·75) to 0·25% (0·18–0·33) for NNRTI and from 0·24% (0·15–0·37) to 0·05% (0·02–0·10) for NRTI (prevalence ratio 0·44 [0·29–0·68] for NNRTI and 0·21 [0·09–0·47] for NRTI). Between 2012 and 2017, NNRTI resistance among viraemic pretreatment people with HIV increased from 4·86% (3·69–6·42) to 9·61% (7·27–12·7; prevalence ratio 1·98 [1·34–2·91]). The prevalence of NNRTI and NRTI resistance was substantially higher among viraemic treatment-experienced people with HIV (51·49% [46·24–57·34] for NNRTI and 36·46% [30·06–44·22] for NRTI in 2017) than among pretreatment people with HIV. NNRTI and NRTI resistance was predominantly attributable to rtK103N and rtM184V. inT97A was observed at a similar prevalence among viraemic treatment-experienced (9·96% [6·41–15·48]) and viraemic pretreatment (10·56% [8·01–13·93]) people with HIV; no major dolutegravir resistance mutations were observed. Interpretation Despite rising NNRTI resistance among pretreatment people with HIV, overall population prevalence of pretreatment HIV drug-resistant viraemia decreased due to increasing ART uptake and viral suppression. This finding underscores the crucial role of achieving and maintaining high ART coverage in reducing transmission of drug-resistant HIV. The high prevalence of mutations conferring resistance to components of first-line ART regimens among viraemic people with HIV is potentially concerning. Funding National Institutes of Health, Johns Hopkins University Center for AIDS Research, Bill & Melinda Gates Foundation, and the US Centers for Disease Control and Prevention.

59 BASIC BIOLOGICAL SCIENCES↗

Quantifying uncertainty for deep learning based forecasting and flow-reconstruction using neural architecture search ensembles

Classical problems in computational physics such as data-driven forecasting and signal reconstruction from sparse sensors have recently seen an explosion in deep neural network (DNN) based algorithmic approaches. However, most DNN models do not provide uncertainty estimates, which are crucial for establishing the trustworthiness of these techniques in downstream decision making tasks and scenarios. In recent years, ensemble-based methods have achieved significant success for the uncertainty quantification in DNNs on a number of benchmark problems. However, their performance on real-world applications remains under-explored. In this work, we present an automated approach to DNN discovery and demonstrate how this may also be utilized for ensemble-based uncertainty quantification. Specifically, we propose the use of a scalable neural and hyperparameter architecture search for discovering an ensemble of DNN models for complex dynamical systems. We highlight how the proposed method not only discovers high-performing neural network ensembles for our tasks, but also quantifies uncertainty seamlessly. This is achieved by using genetic algorithms and Bayesian optimization for sampling the search space of neural network architectures and hyperparameters. Subsequently, a model selection approach is used to identify candidate models for an ensemble set construction. Afterwards, a variance decomposition approach is used to estimate the uncertainty of the predictions from the ensemble. We demonstrate the feasibility of this framework for two tasks — forecasting from historical data and flow reconstruction from sparse sensors for the sea-surface temperature. In conclusion, we demonstrate superior performance from the ensemble in contrast with individual high-performing models and other benchmarks.

Deep ensembles↗