Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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,063 records · Page 59

An apparatus for generation and quantitative measurement of homogeneous isotropic turbulence in He ii

The superfluid phase of helium-4, known as He ii, exhibits extremely small kinematic viscosity and may be a useful tool for economically producing and studying high Reynolds number turbulent flow. Such applications are not currently possible because a comprehensive understanding of the complex two-fluid behavior of He ii is lacking. This situation could be remedied by a systematic investigation of simple, well controlled turbulence that can be directly compared with theoretical models. To this end, we have developed a new apparatus that combines flow visualization with second sound attenuation to study turbulence in the wake of a mesh grid towed through a He ii filled channel. One of three mesh grids (mesh number M = 3, 3.75, or 5 mm) can be pulled at speeds between 0.1 and 60 cm/s through a cast acrylic flow channel which has a 16 mm × 16 mm cross section and measures 330 mm long. The motion of solidified deuterium tracer particles, with diameter of the order 1 μm, in the resulting flow is captured by a high speed camera, and a particle tracking velocimetry algorithm resolves the Lagrangian particle trajectories through the turbulent flow field. A pair of oscillating superleak second sound transducers installed in the channel allows complementary measurement of vortex line density in the superfluid throughout the turbulent decay process. Here, success in early experiments demonstrates the effectiveness of both probes, and preliminary analysis of the data shows that both measurements strongly correlate with each other. Further investigations will provide comprehensive information that can be used to address open questions about turbulence in He ii and move toward the application of this fluid to high Reynolds number fluid research

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Self-Supervised Cloud Classification

Abstract Low-level marine clouds play a pivotal role in Earth’s weather and climate through their interactions with radiation, heat and moisture transport, and the hydrological cycle. These interactions depend on a range of dynamical and microphysical processes that result in a broad diversity of cloud types and spatial structures, and a comprehensive understanding of cloud morphology is critical for continued improvement of our atmospheric modeling and prediction capabilities moving forward. Deep learning has recently accelerated our ability to study clouds using satellite remote sensing, and machine learning classifiers have enabled detailed studies of cloud morphology. A major limitation of deep learning approaches to this problem, however, is the large number of hand-labeled samples that are required for training. This work applies a recently developed self-supervised learning scheme to train a deep convolutional neural network (CNN) to map marine cloud imagery to vector embeddings that capture information about mesoscale cloud morphology and can be used for satellite image classification. The model is evaluated against existing cloud classification datasets and several use cases are demonstrated, including training cloud classifiers with very few labeled samples, interrogation of the CNN’s learned internal feature representations, cross-instrument application, and resilience against sensor calibration drift and changing scene brightness. The self-supervised approach learns meaningful internal representations of cloud structures and achieves comparable classification accuracy to supervised deep learning methods without the expense of creating large hand-annotated training datasets. Significance Statement Marine clouds heavily influence Earth’s weather and climate, and improved understanding of marine clouds is required to improve our atmospheric modeling capabilities and physical understanding of the atmosphere. Recently, deep learning has emerged as a powerful research tool that can be used to identify and study specific marine cloud types in the vast number of images collected by Earth-observing satellites. While powerful, these approaches require hand-labeling of training data, which is prohibitively time intensive. This study evaluates a recently developed self-supervised deep learning method that does not require human-labeled training data for processing images of clouds. We show that the trained algorithm performs competitively with algorithms trained on hand-labeled data for image classification tasks. We also discuss potential downstream uses and demonstrate some exciting features of the approach including application to multiple satellite instruments, resilience against changing image brightness, and its learned internal representations of cloud types. The self-supervised technique removes one of the major hurdles for applying deep learning to very large atmospheric datasets.

54 ENVIRONMENTAL SCIENCES↗

On the interaction between turbulence and a planar rarefaction

The modeling of turbulence, whether it be numerical or analytical, is a difficult challenge. Turbulence is amenable to analysis with linear theory if it is subject to rapid distortions, i.e., motions occurring on a timescale that is short compared to the timescale for nonlinear interactions. Such an approach (referred to as rapid distortion theory) could prove useful for understanding aspects of astrophysical turbulence, which is often subject to rapid distortions, such as supernova explosions or the free-fall associated with gravitational instability. As a proof of principle, a particularly simple problem is considered here: the evolution of vorticity due to a planar rarefaction in an ideal gas. Analytical solutions are obtained for incompressive modes having a wave vector perpendicular to the distortion; as in the case of gradient-driven instabilities, these are the modes that couple most strongly to the mean flow. Vorticity can either grow or decay in the wake of a rarefaction front, and there are two competing effects that determine which outcome occurs: entropy fluctuations couple to the mean pressure gradient to produce vorticity via baroclinic effects, whereas vorticity is damped due to the conservation of angular momentum as the fluid expands. Whether vorticity grows or decays depends upon the ratio of entropic to vortical fluctuations at the location of the front; growth occurs if this ratio is of order unity or larger. In the limit of purely entropic fluctuations in the ambient fluid, a strong rarefaction generates vorticity with a turbulent Mach number on the order of the rms of the ambient entropy fluctuations. The analytical results are shown to compare well with results from two- and three-dimensional numerical simulations. Analytical solutions are also derived in the linear regime of Reynolds-averaged turbulence models. This highlights an inconsistency in standard turbulence models that prevents them from accurately capturing the physics of rarefaction-turbulence interaction. In addition to providing physical insight, the solutions derived here can be used to verify algorithms of both the Reynolds-averaged and direct numerical simulation variety. Finally, dimensional analysis of the equations indicates that rapid distortion of turbulence can give rise to two distinct regimes in the turbulent spectrum: a distortion range at large scales where linear distortion effects dominate, and an inertial range at small scales where nonlinear effects dominate.

79 ASTRONOMY AND ASTROPHYSICS↗

Manifold corrections on spinning compact binaries

This paper deals mainly with a discussion of three new manifold correction methods and three existing ones, which can numerically preserve or correct all integrals in the conservative post-Newtonian Hamiltonian formulation of spinning compact binaries. Two of them are listed here. One is a new momentum-position scaling scheme for complete consistency of both the total energy and the magnitude of the total angular momentum, and the other is the Nacozy's approach with least-squares correction of the four integrals including the total energy and the total angular momentum vector. The post-Newtonian contributions, the spin effects, and the classification of orbits play an important role in the effectiveness of these six manifold corrections. They are all nearly equivalent to correct the integrals at the level of the machine epsilon for the pure Kepler problem. Once the third-order post-Newtonian contributions are added to the pure orbital part, three of these corrections have only minor effects on controlling the errors of these integrals. When the spin effects are also included, the effectiveness of the Nacozy's approach becomes further weakened, and even gets useless for the chaotic case. In all cases tested, the new momentum-position scaling scheme always shows the optimal performance. It requires a little but not much expensive additional computational cost when the spin effects exist and several time-saving techniques are used. As an interesting case, the efficiency of the correction to chaotic eccentric orbits is generally better than one to quasicircular regular orbits. Besides this, the corrected fast Lyapunov indicators and Lyapunov exponents of chaotic eccentric orbits are large as compared with the uncorrected counterparts. The amplification is a true expression of the original dynamical behavior. With the aid of both the manifold correction added to a certain low-order integration algorithm as a fast and high-precision device and the fast Lyapunov indicators of two nearby trajectories, phase space scans for chaos in the spinning compact binary system are given.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Geometric Interpretation of the Cluster Location Problem Part I: Theory

We present a new framing of the seismic location problem using principles drawn from differential geometry. Our interpretation relies upon the common assumption that travel times observed across a network are continuous, differentiable functions of source location. In consequence, travel‐time functions constitute a differentiable map between the source region and a Riemannian manifold. The manifold is said to be the image of the source region embedded in a generally high‐dimension travel‐time vector space. A cluster of events in the source region has an image of discrete points on the manifold, that, except in the simplest cases, cannot be viewed directly. However, it is possible to project the image of a cluster into a tangent space of the manifold for direct visualization. The projection operator can be computed directly from the data without a velocity model, but produces a distorted rendering of the cluster geometry. With a model we can predict the distortions and correct them to estimate cluster geometry. We develop these points with the simplest possible example, one for which direct visualization of the manifold is possible, using the example as an introduction to the relevant concepts from differential geometry in a familiar setting. The tangent space, a local linearization of the manifold, plays a key role. We develop a metric to estimate the limits of linearization, that is, to determine when the curvature of the manifold invalidates the linear assumption. We also examine the interplay of model error, inadequate network geometry, and pick error. We then generalize our results from the simple case to the general case of 3D source regions observed by general networks. Although we do suggest a new “project and correct” method for location, we do not develop it into a practical algorithm. In conclusion, our intention rather is to highlight new analytical methods grounded in differential geometry.

East Pacific Ocean Islands↗

New experimental possibility to search for the ratio of a possible T-violating amplitude to the weak-interaction amplitude in polarized neutron transmission through a polarized nuclear target

This paper considers a spin-dependent neutron interaction with optical potentials (fields) from the strong interaction, the weak interaction, and an assumed T-violating interaction. The vector sum of these fields and their interferences determines an effective field of the target with an angular position in space due to polar and azimuthal angles. The phase of the azimuthal component is found to be the sum of two angles. The tangent of the first angle is equal to the ratio of the T-violating forward-scattering amplitude D to the weak-interaction amplitude C. The quantity is of interest. The tangent of the second angle depends on the spin rotation in the residual pseudomagnetic field of the target, and it can be treated as a background effect. This paper shows that the second angle has different signs in measurements with polarized and unpolarized neutrons; thus, two measurements allow it to be compensated for. In addition, the use of the Ramsey method of separated oscillatory fields for measurement of the neutron spin rotation angle, depending on the phase of the rf field in the Ramsey cell, allows a cosine-like spectrum to be measured. This spectrum is called a phase spectrum. The phase spectra measured with polarized and unpolarized targets have a phase shift. The measurements of this phase shift with polarized and nonpolarized neutrons at a p-wave resonance enable the ratio D/C to be isolated. We also describe the algorithm for separating the ratio D/C, taking into account the influence of the fringing fields of the Ramsey coil magnet and the target magnet.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and $\mathbb{Z}$ 2 ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization X = W$\land$H has a unique W, a unique H (for a fixed W), and when both W and H are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMFk, and show on numerical examples that BMFk not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.

97 MATHEMATICS AND COMPUTING↗

Noise Decoherence and Errors from Entanglement-function Theory for Quantum Computing

A significant problem in quantum computing is the development of physical realizations of algorithms that are robust against noise. One way to examine and mitigate noise would be to simulate large sets of qubits coupling to the external environment on classical computers. This is extremely challenging as quantum information processing is in some sense tied to computing resources that scale exponentially with the number of computing elements (qubits). In this LDRD, we set the foundation for a computational framework potentially allowing simulations of 1000s of qubits vs. 10s now possible. Exact wave-function-based methods demand exponentially increasing resources with system size. The method proposed, entanglement-functional theory (EFT), requires vastly fewer resources. The crucial step is to map the information contained in the wave-functions into a simpler object with associated 1.) auxiliary gate operations and 2.) entanglement functionals of this object. This is similar to the Time-dependent Density Functional Theory (TDDFT) approach that has revolutionized chemistry and materials science. Instead of dealing with the exponentially large wave-function, EFT works with a polynomially large set of projections (the density) that are easily manipulated through unitary operations. For a given set of quantum gates, an isomorphism exists that relates the sequence of events to the time-dependent density. A system of entangled qubits can be simulated at drastically reduced cost relative to existing state-of-the-art vector-state simulation codes.

97 MATHEMATICS AND COMPUTING↗

An Approach to Quad Meshing Based On Cross Valued Maps and the Ginzburg-Landau Theory

A generalization of vector fields, referred to as N-direction fields or cross fields when N=4, has been recently introduced and studied for geometry processing, with applications in quadrilateral (quad) meshing, texture mapping, and parameterization. We make the observation that cross field design for two-dimensional quad meshing is related to the well-known Ginzburg-Landau problem from mathematical physics. This identification yields a variety of theoretical tools for efficiently computing boundary-aligned quad meshes, with provable guarantees on the resulting mesh, for example, the number of mesh defects and bounds on the defect locations. The procedure for generating the quad mesh is to (i) find a complex-valued "representation" field that minimizes the Dirichlet energy subject to a boundary constraint, (ii) convert the representation field into a boundary-aligned, smooth cross field, (iii) use separatrices of the cross field to partition the domain into four sided regions, and (iv) mesh each of these four-sided regions using standard techniques. Under certain assumptions on the geometry of the domain, we prove that this procedure can be used to produce a cross field whose separatrices partition the domain into four sided regions. To solve the energy minimization problem for the representation field, we use an extension of the Merriman-Bence-Osher (MBO) threshold dynamics method, originally conceived as an algorithm to simulate motion by mean curvature, to minimize the Ginzburg-Landau energy for the optimal representation field. Lastly, we demonstrate the method on a variety of test domains.

Computational Geometry↗

Linear models to perform treaty verification tasks for enhanced information security

Linear mathematical models were applied to binary-discrimination tasks relevant to arms control verification measurements in which a host party wishes to convince a monitoring party that an item is or is not treaty accountable. These models process data in list-mode format and can compensate for the presence of variability in the source, such as uncertain object orientation and location. The Hotelling observer applies an optimal set of weights to binned detector data, yielding a test statistic that is thresholded to make a decision. The channelized Hotelling observer applies a channelizing matrix to the vectorized data, resulting in a lower dimensional vector available to the monitor to make decisions. We demonstrate how incorporating additional terms in this channelizing-matrix optimization offers benefits for treaty verification. We present two methods to increase shared information and trust between the host and monitor. The first method penalizes individual channel performance in order to maximize the information available to the monitor while maintaining optimal performance. Second, we present a method that penalizes predefined sensitive information while maintaining the capability to discriminate between binary choices. Data used in this study was generated using Monte Carlo simulations for fission neutrons, accomplished with the GEANT4 toolkit. Custom models for plutonium inspection objects were measured in simulation by a radiation imaging system. Model performance was evaluated and presented using the area under the receiver operating characteristic curve.

97 MATHEMATICS AND COMPUTING↗

MO-C-17A-08: Evaluation of Lung Deformation Using Three Dimensional Strain Maps

Purpose: To develop a systematic approach to generate three dimensional (3D) strain maps of lung using the displacement vector field (DVF) during the respiratory deformation, and to demonstrate its application in evaluating deformable image registration (DIR). Methods: A DVF based strain tensor at each voxel of interest (VOI) was calculated from the relative displacements between the VOI and each of the six nearest neighbors. The maximum and minimum stretches of a VOI can be determined by the principal strains (E{sub 1}, E{sub 2} and E{sub 3}), which are the eigenvalues and the corresponding strain tensors. Two healthy volunteers enrolled in this study under IRB-approved protocol, each was scanned using 3D Hyperpolarized He-3 tagging-MRI and 3D proton-MRI with TrueFISP sequence at the endof- inhalation (EOI) and the end-of-exhalation (EOE) phases. 3D DVFs of tagging- and proton-MRI were obtained by the direct measurements of the tagging grid trajectory and by the DIR method implemented in commercial software. Results: 3D strain maps were successfully generated for all DVFs. The principal strain E1s were calculated as 0.43±0.05 and 0.17±0.25 for tagging-MRI and proton-MRI, respectively. The large values of E{sub 1} indicate the predominant lung motion in the superior-inferior (SI) direction. Given that the DVFs from the tagging images are considered as the ground truth, the discrepancies in the DIR-based strain maps suggest the inaccuracy of the DIR algorithm. In the E{sub 1} maps of tagging-MRI for subject 1, the fissures were distinguishable by the larger values (0.49±0.02) from the adjacent tissues (0.41±0.03) due to the larger relative displacement between the lung lobes. Conclusion: We have successfully developed a methodology to generate DVF-based 3D strain maps of lung. It can potentially enable us to better understand the pulmonary biomechanics and to evaluate and improve the DIR algorithms for the lung deformation. We are currently studying more subjects to evaluate this tool.

60 APPLIED LIFE SCIENCES↗

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗

Probabilistic variable-length segmentation of protein sequences for discriminative motif discovery (DiMotif) and sequence embedding (ProtVecX)

In this paper, we present peptide-pair encoding (PPE), a general-purpose probabilistic segmentation of protein sequences into commonly occurring variable-length sub-sequences. The idea of PPE segmentation is inspired by the byte-pair encoding (BPE) text compression algorithm, which has recently gained popularity in subword neural machine translation. We modify this algorithm by adding a sampling framework allowing for multiple ways of segmenting a sequence. PPE segmentation steps can be learned over a large set of protein sequences (Swiss-Prot) or even a domain-specific dataset and then applied to a set of unseen sequences. This representation can be widely used as the input to any downstream machine learning tasks in protein bioinformatics. In particular, here, we introduce this representation through protein motif discovery and protein sequence embedding. (i) DiMotif: we present DiMotif as an alignment-free discriminative motif discovery method and evaluate the method for finding protein motifs in three different settings: (1) comparison of DiMotif with two existing approaches on 20 distinct motif discovery problems which are experimentally verified, (2) classification-based approach for the motifs extracted for integrins, integrin-binding proteins, and biofilm formation, and (3) in sequence pattern searching for nuclear localization signal. The DiMotif, in general, obtained high recall scores, while having a comparable F1 score with other methods in the discovery of experimentally verified motifs. Having high recall suggests that the DiMotif can be used for short-list creation for further experimental investigations on motifs. In the classification-based evaluation, the extracted motifs could reliably detect the integrins, integrin-binding, and biofilm formation-related proteins on a reserved set of sequences with high F1 scores. (ii) ProtVecX: we extend k-mer based protein vector (ProtVec) embedding to variablelength protein embedding using PPE sub-sequences. We show that the new method of embedding can marginally outperform ProtVec in enzyme prediction as well as toxin prediction tasks. In addition, we conclude that the embeddings are beneficial in protein classification tasks when they are combined with raw amino acids k-mer features.

59 BASIC BIOLOGICAL SCIENCES↗

Probabilistic variable-length segmentation of protein sequences for discriminative motif discovery (DiMotif) and sequence embedding (ProtVecX)

ABSTRACT In this paper, we present peptide-pair encoding (PPE), a general-purpose probabilistic segmentation of protein sequences into commonly occurring variable-length sub-sequences. The idea of PPE segmentation is inspired by the byte-pair encoding (BPE) text compression algorithm, which has recently gained popularity in subword neural machine translation. We modify this algorithm by adding a sampling framework allowing for multiple ways of segmenting a sequence. PPE segmentation steps can be learned over a large set of protein sequences (Swiss-Prot) or even a domain-specific dataset and then applied to a set of unseen sequences. This representation can be widely used as the input to any downstream machine learning tasks in protein bioinformatics. In particular, here, we introduce this representation through protein motif discovery and protein sequence embedding. (i) DiMotif: we present DiMotif as an alignment-free discriminative motif discovery method and evaluate the method for finding protein motifs in three different settings: (1) comparison of DiMotif with two existing approaches on 20 distinct motif discovery problems which are experimentally verified, (2) classification-based approach for the motifs extracted for integrins, integrin-binding proteins, and biofilm formation, and (3) in sequence pattern searching for nuclear localization signal. The DiMotif, in general, obtained high recall scores, while having a comparable F1 score with other methods in the discovery of experimentally verified motifs. Having high recall suggests that the DiMotif can be used for short-list creation for further experimental investigations on motifs. In the classification-based evaluation, the extracted motifs could reliably detect the integrins, integrin-binding, and biofilm formation-related proteins on a reserved set of sequences with high F1 scores. (ii) ProtVecX: we extend k-mer based protein vector (ProtVec) embedding to variable-length protein embedding using PPE sub-sequences. We show that the new method of embedding can marginally outperform ProtVec in enzyme prediction as well as toxin prediction tasks. In addition, we conclude that the embeddings are beneficial in protein classification tasks when they are combined with raw k-mer features. Availability Implementations of our method will be available under the Apache 2 licence at http://llp.berkeley.edu/dimotif and http://llp.berkeley.edu/protvecx .

Asgari, Ehsaneddin↗

Measurement of $Z/\gamma^* + b$-jet Production Cross section in $p\bar{p}$ collisions at $\sqrt{s}= 1.96$ TeV with the CDF detector

Processes at hadron colliders, such as the production of jets, are described by the Quantum Chromodynamics theory (QCD). Precise descriptions of processes involving jets in association with a vector boson have nowadays large relevance as they represent irreducible background to other Standard Model (SM) processes and searches for new physics. The experimental study and understanding of the b-jet production in association with a Z boson are crucial for many reasons. For one side, it is the most important background for a light Higgs boson decaying into a bottom-antibottom quark pair and produced in the ZH mode.This is one of the most promising channels for the Higgs search at Tevatron in particular since the latest results have excluded the high mass region (MH > 127 GeV/c 2 ). For another side the signature of b-jets and a Z boson is also background to new physics searches, such as supersymmetry, where a large coupling of the Higgs boson to bottom quarks is allowed. The produ ction cross section measurement of b-jets in events with a Z boson has already been performed at hadron colliders, at the Tevatron by CDF and D0 experiments and are now pursued at the LHC by ATLAS and CMS. In particular the CDF measurement was performed with only 2 fb -1 and was limited by the statistical uncertainty. This PhD thesis presents a new measurement of the $Z/\gamma^* + b$-jet production cross section using the complete dataset collected by CDF during the Run II. $Z/\gamma^*$ bosons are selected in the electron and muon decay modes and are required to have 66 < MZ < 116 GeV/c 2 while jets, reconstructed with the MidPoint algorithm, have to be central (|Y| < 1.5) with pT > 20 GeV/c . The per jet cross section is measured with respect to the $Z/\gamma^*$ inclusive and the $Z/\gamma^* +$ jets cross sections. Results are compared to leading order (LO) event generator plus parton shower and next-to-leading order (NLO) predictions corrected for non perturbative effects such as hadronizat ion and underlying event. Differential distributions as a fu! nction of jet transverse moment and jet rapidity are also presented together with the comparison to NLO pQCD predictions for different renormalization and factorization scales and various PDF sets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Machine Learning in the Context of Laser-Induced Breakdown Spectroscopy

The integration of machine learning (ML) with Laser-Induced Breakdown Spectroscopy (LIBS) has revolutionized the analytical capabilities of LIBS. The combi-nation of both methods enables more accurate and efficient data analysis. While LIBS itself is a powerful technique for elemental analysis, the vast amount of spectral data it generates can be hard to interpret. Machine learning addresses these challenges by leveraging algorithms that can learn from data, identify patterns, and make predictions without explicit programming for the interpretation of each specific task. In LIBS application, ML techniques are used to enhance various analytical processes. For example, ML algorithms can classify materials based on their spectral fingerprints, predict the concentration of elements in a sample, and identify underlying patterns within complex datasets. Here, this application improves the precision of LIBS analyses while significantly reducing the time required for data processing and interpretation. In this chapter, the fundamental concepts of ML will be discussed first. Following this, the process of data splitting and the importance of feature selection will be examined. Several machine learning methods will then be closely examined, exploring how each can benefit LIBS analysis and highlighting their respective advantages and shortcomings. This structured approach will provide a comprehensive understanding of the integration of ML in the context of LIBS analysis.

47 OTHER INSTRUMENTATION↗

A generalized multi-resolution expansion for uncertainty propagation with application to cardiovascular modeling

Computational models are used in a variety of fields to improve our understanding of complex physical phenomena. Recently, the realism of model predictions has been greatly enhanced by transitioning from deterministic to stochastic frameworks, where the effects of the intrinsic variability in parameters, loads, constitutive properties, model geometry and other quantities can be more naturally included. A general stochastic system may be characterized by a large number of arbitrarily distributed and correlated random inputs, and a limited support response with sharp gradients or event discontinuities. This motivates continued research into novel adaptive algorithms for uncertainty propagation, particularly those handling high dimensional, arbitrarily distributed random inputs and non-smooth stochastic responses. Here, we generalize a previously proposed multi-resolution approach to uncertainty propagation to develop a method that improves computational efficiency, can handle arbitrarily distributed random inputs and non-smooth stochastic responses, and naturally facilitates adaptivity, i.e., the expansion coefficients encode information on solution refinement. Our approach relies on partitioning the stochastic space into elements that are subdivided along a single dimension, or, in other words, progressive refinements exhibiting a binary tree representation. We also show how these binary refinements are particularly effective in avoiding the exponential increase in the multi-resolution basis cardinality and significantly reduce the regression complexity for moderate to high dimensional random inputs. The performance of the approach is demonstrated through previously proposed uncertainty propagation benchmarks and stochastic multi-scale finite element simulations in cardiovascular flow.

59 BASIC BIOLOGICAL SCIENCES↗

Cheaper and more noise-resilient quantum state preparation using eigenvector continuation

Subspace methods are powerful, noise-resilient methods that can effectively prepare ground states on quantum computers. The challenge is to get a subspace with a small condition number that spans the states of interest using minimal quantum resources. In this work, we will use eigenvector continuation to build a subspace from the low-lying states of a set of Hamiltonians. The basis vectors are prepared using truncated versions of standard state preparation methods such as imaginary-time evolution (ITE), adiabatic state preparation (ASP), and variational quantum eigensolver. By using these truncated methods combined with eigenvector continuation, we can directly improve upon them, obtaining more accurate ground-state energies at a reduced cost. We use several spin systems to demonstrate convergence even when methods like ITE and ASP fail, such as ASP in the presence of level crossings and ITE with vanishing energy gaps. We also showcase the noise resilience of this approach beyond the gains already made by having shallower quantum circuits. Furthermore, our findings suggest that eigenvector continuation can be used to improve existing state preparation methods in the near term.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗