Search NASA⌕ Search

SEARCH · Search NASA

Results for “reduced set methods”

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 451 records · Page 25

THE CARNEGIE SUPERNOVA PROJECT: LIGHT-CURVE FITTING WITH SNooPy

In providing an independent measure of the expansion history of the universe, the Carnegie Supernova Project (CSP) has observed 71 high-z Type Ia supernovae (SNe Ia) in the near-infrared bands Y and J. These can be used to construct rest-frame i-band light curves which, when compared to a low-z sample, yield distance moduli that are less sensitive to extinction and/or decline-rate corrections than in the optical. However, working with NIR observed and i-band rest-frame photometry presents unique challenges and has necessitated the development of a new set of observational tools in order to reduce and analyze both the low-z and high-z CSP sample. We present in this paper the methods used to generate uBVgriYJH light-curve templates based on a sample of 24 high-quality low-z CSP SNe. We also present two methods for determining the distances to the hosts of SN Ia events. A larger sample of 30 low-z SNe Ia in the Hubble flow is used to calibrate these methods. We then apply the method and derive distances to seven galaxies that are so nearby that their motions are not dominated by the Hubble flow.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗

Remote Sensing-Informed Zonation for Understanding Snow, Plant and Soil Moisture Dynamics within a Mountain Ecosystem

In the headwater catchments of the Rocky Mountains, plant productivity and its dynamics are largely dependent upon water availability, which is influenced by changing snowmelt dynamics associated with climate change. Understanding and quantifying the interactions between snow, plants and soil moisture is challenging, since these interactions are highly heterogeneous in mountainous terrain, particularly as they are influenced by microtopography within a hillslope. Recent advances in satellite remote sensing have created an opportunity for monitoring snow and plant dynamics at high spatiotemporal resolutions that can capture microtopographic effects. In this study, we investigate the relationships among topography, snowmelt, soil moisture and plant dynamics in the East River watershed, Crested Butte, Colorado, based on a time series of 3-meter resolution PlanetScope normalized difference vegetation index (NDVI) images. To make use of a large volume of high-resolution time-lapse images (17 images total), we use unsupervised machine learning methods to reduce the dimensionality of the time lapse images by identifying spatial zones that have characteristic NDVI time series. We hypothesize that each zone represents a set of similar snowmelt and plant dynamics that differ from other identified zones and that these zones are associated with key topographic features, plant species and soil moisture. We compare different distance measures (Ward and complete linkage) to understand the effects of their influence on the zonation map. Results show that the identified zones are associated with particular microtopographic features; highly productive zones are associated with low slopes and high topographic wetness index, in contrast with zones of low productivity, which are associated with high slopes and low topographic wetness index. The zones also correspond to particular plant species distributions; higher forb coverage is associated with zones characterized by higher peak productivity combined with rapid senescence in low moisture conditions, while higher sagebrush coverage is associated with low productivity and similar senescence patterns between high and low moisture conditions. In addition, soil moisture probe and sensor data confirm that each zone has a unique soil moisture distribution. This cluster-based analysis can tractably analyze high-resolution time-lapse images to examine plant-soil-snow interactions, guide sampling and sensor placements and identify areas likely vulnerable to ecological change in the future.

54 ENVIRONMENTAL SCIENCES↗

Chaos in the sunspot cycle - Analysis and prediction

The variability of solar activity over long time scales, given semiquantitatively by measurements of sunspot numbers, is examined as a nonlinear dynamical system. First, a discussion of the data set used and the techniques utilized to reduce the noise and capture the long-term dynamics inherent in the data is presented. Subsequently, an attractor is reconstructed from the data set using the method of time delays. The reconstructed attractor is then used to determine both the dimension of the underlying system and also the largest Lyapunov exponent, which together indicate that the sunspot cycle is indeed chaotic and also low dimensional. In addition, recent techniques of exploiting chaotic dynamics to provide accurate, short-term predictions are utilized in order to improve upon current forecasting methods and also to place theoretical limits on predictability extent. The results are compared to chaotic solar-dynamo models as a possible physically motivated source of this chaotic behavior.

Mundt, Michael D.↗

A Method for Integrating Thrust-Vectoring and Actuated Forebody Strakes with Conventional Aerodynamic Controls on a High-Performance Fighter Airplane

A method, called pseudo controls, of integrating several airplane controls to achieve cooperative operation is presented. The method eliminates conflicting control motions, minimizes the number of feedback control gains, and reduces the complication of feedback gain schedules. The method is applied to the lateral/directional controls of a modified high-performance airplane. The airplane has a conventional set of aerodynamic controls, an experimental set of thrust-vectoring controls, and an experimental set of actuated forebody strakes. The experimental controls give the airplane additional control power for enhanced stability and maneuvering capabilities while flying over an expanded envelope, especially at high angles of attack. The flight controls are scheduled to generate independent body-axis control moments. These control moments are coordinated to produce stability-axis angular accelerations. Inertial coupling moments are compensated. Thrust-vectoring controls are engaged according to their effectiveness relative to that of the aerodynamic controls. Vane-relief logic removes steady and slowly varying commands from the thrust-vectoring controls to alleviate heating of the thrust turning devices. The actuated forebody strakes are engaged at high angles of attack. This report presents the forward-loop elements of a flight control system that positions the flight controls according to the desired stability-axis accelerations. This report does not include the generation of the required angular acceleration commands by means of pilot controls or the feedback of sensed airplane motions.

Lallman, Frederick J.↗

Advanced Background Subtraction Applied to Aeroacoustic Wind Tunnel Testing

An advanced form of background subtraction is presented and applied to aeroacoustic wind tunnel data. A variant of this method has seen use in other fields such as climatology and medical imaging. The technique, based on an eigenvalue decomposition of the background noise cross-spectral matrix, is robust against situations where isolated background auto-spectral levels are measured to be higher than levels of combined source and background signals. It also provides an alternate estimate of the cross-spectrum, which previously might have poor definition for low signal-to-noise ratio measurements. Simulated results indicate similar performance to conventional background subtraction when the subtracted spectra are weaker than the true contaminating background levels. Superior performance is observed when the subtracted spectra are stronger than the true contaminating background levels. Experimental results show limited success in recovering signal behavior for data where conventional background subtraction fails. They also demonstrate the new subtraction technique's ability to maintain a proper coherence relationship in the modified cross-spectral matrix. Beam-forming and de-convolution results indicate the method can successfully separate sources. Results also show a reduced need for the use of diagonal removal in phased array processing, at least for the limited data sets considered.

Bahr, Christopher J.↗

The clustering of galaxies in the completed SDSS-III Baryon Oscillation Spectroscopic Survey: cosmological analysis of the DR12 galaxy sample

Here we present cosmological results from the final galaxy clustering data set of the Baryon Oscillation Spectroscopic Survey, part of the Sloan Digital Sky Survey III. Our combined galaxy sample comprises 1.2 million massive galaxies over an effective area of 9329 deg 2 and volume of 18.7 Gpc 3 , divided into three partially overlapping redshift slices centred at effective redshifts 0.38, 0.51 and 0.61. We measure the angular diameter distance DM and Hubble parameter H from the baryon acoustic oscillation (BAO) method, in combination with a cosmic microwave background prior on the sound horizon scale, after applying reconstruction to reduce non-linear effects on the BAO feature. Using the anisotropic clustering of the pre-reconstruction density field, we measure the product DMH from the Alcock–Paczynski (AP) effect and the growth of structure, quantified by fσ8(z), from redshift-space distortions (RSD). We combine individual measurements presented in seven companion papers into a set of consensus values and likelihoods, obtaining constraints that are tighter and more robust than those from any one method; in particular, the AP measurement from sub-BAO scales sharpens constraints from post-reconstruction BAOs by breaking degeneracy between DM and H. Combined with Planck 2016 cosmic microwave background measurements, our distance scale measurements simultaneously imply curvature ΩK = 0.0003 ± 0.0026 and a dark energy equation-of-state parameter w = -1.01 ± 0.06, in strong affirmation of the spatially flat cold dark matter (CDM) model with a cosmological constant (ΛCDM). Our RSD measurements of fσ8, at 6 per cent precision, are similarly consistent with this model. When combined with supernova Ia data, we find H0 = 67.3 ± 1.0 km s -1 Mpc -1 even for our most general dark energy model, in tension with some direct measurements. Adding extra relativistic species as a degree of freedom loosens the constraint only slightly, to H0 = 67.8 ± 1.2km s -1 Mpc -1 . Assuming flat ΛCDM, we find Ωm = 0.310 ± 0.005 and H0 = 67.6 ± 0.5 km s -1 Mpc -1 , and we find a 95 per cent upper limit of 0.16 eV c -2 on the neutrino mass sum.

79 ASTRONOMY AND ASTROPHYSICS↗

Combined full shape analysis of BOSS galaxies and eBOSS quasars using an iterative emulator

ABSTRACT Standard full-shape clustering analyses in Fourier space rely on a fixed power spectrum template, defined at the fiducial cosmology used to convert redshifts into distances, and compress the cosmological information into the Alcock–Paczynski parameters and the linear growth rate of structure. In this paper, we propose an analysis method that operates directly in the cosmology parameter space and varies the power spectrum template accordingly at each tested point. Predictions for the power spectrum multipoles from the TNS model are computed at different cosmologies in the framework of $\Lambda \rm {CDM}$. Applied to the final eBOSS QSO and LRG samples together with the low-z DR12 BOSS galaxy sample, our analysis results in a set of constraints on the cosmological parameters Ωcdm, H0, σ8, Ωb, and ns. To reduce the number of computed models, we construct an iterative process to sample the likelihood surface, where each iteration consists of a Gaussian process regression. This method is validated with mocks from N-body simulations. From the combined analysis of the (e)BOSS data, we obtain the following constraints: σ8 = 0.877 ± 0.049 and $\Omega _{\rm m}=0.304^{+0.016}_{-0.010}$ without any external prior. The eBOSS quasar sample alone shows a 3.1σ discrepancy compared to the Planck prediction.

79 ASTRONOMY AND ASTROPHYSICS↗

The inter- and intrafraction reproducibilities of three common IMRT delivery techniques

Purpose: Intensity modulated radiation therapy (IMRT) treatment delivery requires higher precision than conventional 3D treatment delivery because of the sensitivity of the resulting dose to small geometric misalignment of the modulated beamlets. The chosen treatment delivery technique will affect the treatment precision in different ways, based on the characteristics of the delivery method. Delivery using a multileaf collimator (MLC) can reduce treatment time and therapist workload, but typically requires a greater number of monitor units and the fields are prone to both systematic and random leaf positioning errors. An alternative to MLC-based fields, patient specific brass compensators, do not suffer from these leaf positioning errors. In our study, we set out to investigate which delivery method will provide the highest levels of dosimetric reproducibility and the minimum amount of interfraction variability. Methods: In our study, a seven field IMRT plan for a head and neck treatment was created using the Pinnacle{sup 3} treatment planning system and the intensity maps for each field were obtained. The intensity maps of the fields were delivered with a Varian 2100C/D linear accelerator, using solid compensators and sliding window (SW) and step-and-shoot (SS) MLC segments. Three fields were selected from the seven-beam IMRT plan for comparison. Analysis was carried out using the MatriXX ion chamber array, radiochromic film, and Varian dynalog files. Results: Our results show that the error in MLC leaf positioning has no gantry angle dependence. The compensator and SW deliveries showed excellent agreement, even when stricter than usual gamma criteria were applied. However, we noted that under these strict conditions, the SS fields had at least ten times more pixels out of range than did the compensators. When using step-and-shoot MLC fields, it was observed that the increase in dose rate or the increase of MU/segment degrades the quality of the plan. Analysis of the dynalog files showed that while each individual field had its own propensity for error, all fields showed the same trend: a greater percentage of time the leaves are out of position as dose rate increases, MUs decrease, or both. Conclusions: The compensator-based field and both types of MLC-based fields have MatriXX results that are within the clinically acceptable tolerance of 3% dose difference and 2 mm DTA. However, when the criteria are tightened, it becomes evident that the compensators have a definite advantage over their comparable MLC-based competitors in terms of interfraction reproducibility. Fewer monitor units are required to deliver each portal, potentially improving patient outcomes and reducing unwanted side effects to both patients and therapists. In centers without MLC, compensators represent a simple and cost effective way to offer patients state of the art treatment. Based on the results of this study, compensator-based IMRT is a reliable, viable option for use in clinics both with and without MLC-equipped linacs.

61 RADIATION PROTECTION AND DOSIMETRY↗

Refining Principal Stress Measurements in Reservoir Underburden in Regions of Induced Seismicity through Seismological Tools, Laboratory Experiments - Final Technical Report

This project developed methodologies to measure the in-situ principal stress in the deep subsurface through use of multiple independent, but complementary, seismic methods, laboratory verification, and development of theoretical frameworks. By leveraging existing regional and local datasets we developed, tested, and refined a set of diagnostic tools for determining the in-situ stress state with reduced uncertainty at and below reservoir depths (1.5-6 km). A set of novel tools was produced that are scale independent, such that their utility is equivalent on regional, field scale, and near borehole monitoring of principal stresses in reservoir underburden for carbon storage projects. During a 4-year Department of Energy (DOE) and Southern Company funded project, carried out by the Electric Power Research Institute (EPRI), Lawrence Livermore National Laboratory (LLNL), the University of Oklahoma (OU), and the U.S. Geological Survey (USGS), the project team developed methodologies to measure the far-field in-situ principal stress in the deep subsurface, leveraging induced seismicity data from waste-water disposal projects. These methodologies consisted in the use of well-established and technically advanced seismic processing methods, such as virtual seismometer method-moment tensor (VSM-MT) and shear wave splitting (SWS), that are adept at recovering the stress orientation and certain components of the stress tensor. These methods were applied to robust seismicity catalogs created with matched filter techniques near sites of active fluid disposal—a proxy for carbon storage sites where such datasets are more limited. Estimates of the stress orientation made with seismic processing tools were considered along with laboratory acoustic emission experiments conducted on rock samples from the region of interest. Stress orientations in the studied region do not vary significantly across distances of ~100 km, nor are they found to rotate through time as a consequence of local wastewater disposal, as previously speculated. Finally, the project team investigated the trade-offs among the different seismic methods and evaluated the range of uncertainty that is generated with these methodologies, which led to a practical use and refinement of the VSM-MT technique when it is applied to field datasets. Understanding the trade-offs between these different methods highlighted the potential benefits of improved quantification of uncertainties on stress field estimations.

58 GEOSCIENCES↗

GOTTCHA, Version2

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗

GOTTCHA, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗

An adaptive lattice Boltzmann scheme for modeling two-fluid-phase flow in porous medium systems

In this paper, we formulate a multiple-relaxation-time (MRT) lattice-Boltzmann method (LBM) to simulate two-fluid-phase flow in porous medium systems. The MRT LBM is applied to simulate the displacement of a wetting fluid by a nonwetting fluid in a system corresponding to a microfluidic cell. Analysis of the simulation shows widely varying time scales for the dynamics of fluid pressures, fluid saturations, and interfacial curvatures that are typical characteristics of such systems. Displacement phenomena include Haines jumps, which are relatively short duration isolated events of rapid fluid displacement driven by capillary instability. An adaptive algorithm is advanced using a level-set method to locate interfaces and estimate their rate of advancement. Because the displacement dynamics are confined to the interfacial regions for a majority of the relaxation time, the computational effort is focused on these regions. The proposed algorithm is shown to reduce computational effort by an order of magnitude, while yielding essentially identical solutions to a conventional fully coupled approach. Finally, the challenges posed by Haines jumps are also resolved by the adaptive algorithm. Possible extensions to the advanced method are discussed.

42 ENGINEERING↗

Retrospective analysis of pulse oximeter alarm settings in an intensive care unit patient population

Background: The cacophony of alerts and alarms in a hospital produced by medical devices results in alarm fatigue. The pulse oximeter is one of the most common sources of alarms. One of the ways to reduce alarm rates is to adjust alarm settings at the bedside. This study is aimed to retrospectively examine individual pulse oximeter alarm settings on alarm rates and inter- and intra- patient variability. Methods: Nine hundred sixty-two previously collected intensive care unit (ICU) patient records were obtained from the Multiparameter Intelligent Monitoring in Intensive Care II Database (Beth Israel Deaconess Medical Center, Boston, MA). Inclusion criteria included patient records that contained SpO 2 trend data sampled at 1 Hz for at least 1 h and a matching clinical record. SpO 2 alarm rates were simulated by applying a range of thresholds (84, 86, 88, and 90 %) and delay times (10 to 60 s) to the SpO 2 data. Patient records with at least 12 h of SpO 2 data were examined for the variability in alarm rate over time. Results: Decreasing SpO 2 thresholds and increasing delay times resulted in decreased alarm rates. A limited number of patient records accounted for most alarms, and this number increased as alarm settings loosened (the top 10 % of patient records were responsible for 57.4 % of all alarms at an SpO 2 threshold of 90 % and 15 s delay and 81.6 % at an SpO 2 threshold of 84 % and 45 s delay). Alarm rates were not consistent over time for individual patients with periods of high and low alarms for all alarm settings. Conclusion: Pulse oximeter SpO 2 alarm rates are variable between patients and over time, and the alarm rate and the extent of inter- and intra-patient variability can be affected by the alarm settings. Personalized alarm settings for a patient’s current status may help to reduce alarm fatigue for nurses.

59 BASIC BIOLOGICAL SCIENCES↗

Investigating explainable transfer learning for battery lifetime prediction under state transitions

Battery lifetime prediction at early cycles is crucial for researchers and manufacturers to examine product quality and promote technology development. Machine learning has been widely utilized to construct data-driven solutions for high-accuracy predictions. However, the internal mechanisms of batteries are sensitive to many factors, such as charging/discharging protocols, manufacturing/storage conditions, and usage patterns. These factors will induce state transitions, thereby decreasing the prediction accuracy of data-driven approaches. Transfer learning is a promising technique that overcomes this difficulty and achieves accurate predictions by jointly utilizing information from various sources. Hence, we develop two transfer learning methods, Bayesian Model Fusion and Weighted Orthogonal Matching Pursuit, to strategically combine prior knowledge with limited information from the target dataset to achieve superior prediction performance. From our results, our transfer learning methods reduce root-mean-squared error by 41% through adapting to the target domain. Furthermore, the transfer learning strategies identify the variations of impactful features across different sets of batteries and therefore disentangle the battery degradation mechanisms and the root cause of state transitions from the perspective of data mining. These findings suggest that the transfer learning strategies proposed in our work are capable of acquiring knowledge across multiple data sources for solving specialized issues.

25 ENERGY STORAGE↗

Geometry optimization speedup through a geodesic approach to internal coordinates

We present a new geodesic-based method for geometry optimization in a basis set of redundant internal coordinates. Overall, our method updates the molecular geometry by following the geodesic generated by a displacement vector on the internal coordinate manifold, which dramatically reduces the number of steps required to converge to a minimum. Our method can be implemented in any existing optimization code, requiring only implementation of derivatives of the Wilson B-matrix and the ability to numerically solve an ordinary differential equation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗