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 1,315 records · Page 73

Spectroscopic Needs for Imaging Dark Energy Experiments

Ongoing and near-future imaging-based dark energy experiments are critically dependent upon photometric redshifts (a.k.a. photo-z’s): i.e., estimates of the redshifts of objects based only on flux information obtained through broad filters. Higher-quality, lower-scatter photo-z’s will result in smaller random errors on cosmological parameters; while systematic errors in photometric redshift estimates, if not constrained, may dominate all other uncertainties from these experiments. The desired optimization and calibration is dependent upon spectroscopic measurements for secure redshift information; this is the key application of galaxy spectroscopy for imaging-based dark energy experiments. Hence, to achieve their full potential, imaging-based experiments will require large sets of objects with spectroscopically-determined redshifts, for two purposes: Training: Objects with known redshift are needed to map out the relationship between object color and z (or, equivalently, to determine empirically-calibrated templates describing the rest-frame spectra of the full range of galaxies, which may be used to predict the color-z relation). The ultimate goal of training is to minimize each moment of the distribution of differences between photometric redshift estimates and the true redshifts of objects, making the relationship between them as tight as possible. The larger and more complete our “training set” of spectroscopic redshifts is, the smaller the RMS photo-z errors should be, increasing the constraining power of imaging experiments; Requirements: Spectroscopic redshift measurements for ~30,000 objects over >~15 widely-separated regions, each at least ~20 arcmin in diameter, and reaching the faintest objects used in a given experiment, will likely be necessary if photometric redshifts are to be trained and calibrated with conventional techniques. Larger, more complete samples (i.e., with longer exposure times) can improve photo-z algorithms and reduce scatter further, enhancing the science return from planned experiments greatly (increasing the Dark Energy Task Force figure of merit by up to ~50%); Options: This spectroscopy will most efficiently be done by covering as much of the optical and near-infrared spectrum as possible at modestly high spectral resolution (λ/Δλ > ~3000), while maximizing the telescope collecting area, field of view on the sky, and multiplexing of simultaneous spectra. The most efficient instrument for this would likely be either the proposed GMACS/MANIFEST spectrograph for the Giant Magellan Telescope or the OPTIMOS spectrograph for the European Extremely Large Telescope, depending on actual properties when built. The PFS spectrograph at Subaru would be next best and available considerably earlier, c. 2018; the proposed ngCFHT and SSST telescopes would have similar capabilities but start later. Other key options, in order of increasing total time required, are the WFOS spectrograph at TMT, MOONS at the VLT, and DESI at the Mayall 4 m telescope (or the similar 4MOST and WEAVE projects); of these, only DESI, MOONS, and PFS are expected to be available before 2020. Table 2-3 of this white paper summarizes the observation time required at each facility for strawman training samples. To attain secure redshift measurements for a high fraction of targeted objects and cover the full redshift span of future experiments, additional near-infrared spectroscopy will also be required; this is best done from space, particularly with WFIRST-2.4 and JWST; Calibration: The first several moments of redshift distributions (the mean, RMS redshift dispersion, etc.), must be known to high accuracy for cosmological constraints not to be systematics-dominated (equivalently, the moments of the distribution of differences between photometric and true redshifts could be determined instead). The ultimate goal of calibration is to characterize these moments for every subsample used in analyses - i.e., to minimize the uncertainty in their mean redshift, RMS dispersion, etc. – rather than to make the moments themselves small. Calibration may be done with the same spectroscopic dataset used for training if that dataset is extremely high in redshift completeness (i.e., no populations of galaxies to be used in analyses are systematically missed). Accurate photo-z calibration is necessary for all imaging experiments; Requirements: If extremely low levels of systematic incompleteness (<~0.1%) are attained in training samples, the same datasets described above should be sufficient for calibration. However, existing deep spectroscopic surveys have failed to yield secure redshifts for 30–60% of targets, so that would require very large improvements over past experience. This incompleteness would be a limiting factor for training, but catastrophic for calibration. If <~0.1% incompleteness is not attainable, the best known option for calibration of photometric redshifts is to utilize cross-correlation statistics in some form. The most direct method for this uses cross-correlations between positions on the sky of bright objects of known spectroscopic redshift with the sample of objects that we wish to calibrate the redshift distribution for, measured as a function of spectroscopic z. For such a calibration, redshifts of ~100,000 objects over at least several hundred square degrees, spanning the full redshift range of the samples used for dark energy, would be necessary; and Options: The proposed BAO experiment eBOSS would provide sufficient spectroscopy for basic calibrations, particularly for ongoing and near-future imaging experiments. The planned DESI experiment would provide excellent calibration with redundant cross-checks, but will start after the conclusion of some imaging projects. An extension of DESI to the Southern hemisphere would provide the best possible calibration from cross-correlation methods for DES and LSST. We thus anticipate that our two primary needs for spectroscopy – training and calibration of photometric redshifts – will require two separate solutions. For ongoing and future projects to reach their full potential, new spectroscopic samples of faint objects will be needed for training; those new samples may be suitable for calibration, but the latter possibility is uncertain. In contrast, wide-area samples of bright objects are poorly suited for training, but can provide high-precision calibrations via cross-correlation techniques. Additional training/calibration redshifts and/or host galaxy spectroscopy would enhance the use of supernovae and galaxy clusters for cosmology. We also summarize additional work on photometric redshift techniques that will be needed to prepare for data from ongoing and future dark energy experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Two-dimensional signal reconstruction: The correlation sampling method

An accurate approach for reconstructing a time-dependent two-dimensional signal from non-synchronized time series recorded at points located on a grid is discussed. The method, denoted as correlation sampling, improves the standard conditional sampling approach commonly employed in the study of turbulence in magnetoplasma devices. Its implementation is illustrated in the case of an artificial time-dependent signal constructed using a fractal algorithm that simulates a fluctuating surface. A statistical method is also discussed for distinguishing coherent (i.e., collective) from purely random (noisy) behavior for such two-dimensional fluctuating phenomena.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast widefield imaging of neuronal structure and function with optical sectioning in vivo

Optical microscopy, owing to its noninvasiveness and subcellular resolution, enables in vivo visualization of neuronal structure and function in the physiological context. Optical-sectioning structured illumination microscopy (OS-SIM) is a widefield fluorescence imaging technique that uses structured illumination patterns to encode in-focus structures and optically sections 3D samples. However, its application to in vivo imaging has been limited. In this study, we optimized OS-SIM for in vivo neural imaging. We modified OS-SIM reconstruction algorithms to improve signal-to-noise ratio and correct motion-induced artifacts in live samples. Incorporating an adaptive optics (AO) module to OS-SIM, we found that correcting sample-induced optical aberrations was essential for achieving accurate structural and functional characterizations in vivo. With AO OS-SIM, we demonstrated fast, high-resolution in vivo imaging with optical sectioning for structural imaging of mouse cortical neurons and zebrafish larval motor neurons, and functional imaging of quantal synaptic transmission at Drosophila larval neuromuscular junctions.

42 ENGINEERING↗

Adaptive Identification and Control of Flow-Induced Cavity Oscillations

Progress towards an adaptive self-tuning regulator (STR) for the cavity tone problem is discussed in this paper. Adaptive system identification algorithms were applied to an experimental cavity-flow tested as a prerequisite to control. In addition, a simple digital controller and a piezoelectric bimorph actuator were used to demonstrate multiple tone suppression. The control tests at Mach numbers of 0.275, 0.40, and 0.60 indicated approx. = 7dB tone reductions at multiple frequencies. Several different adaptive system identification algorithms were applied at a single freestream Mach number of 0.275. Adaptive finite-impulse response (FIR) filters of orders up to N = 100 were found to be unsuitable for modeling the cavity flow dynamics. Adaptive infinite-impulse response (IIR) filters of comparable order better captured the system dynamics. Two recursive algorithms, the least-mean square (LMS) and the recursive-least square (RLS), were utilized to update the adaptive filter coefficients. Given the sample-time requirements imposed by the cavity flow dynamics, the computational simplicity of the least mean squares (LMS) algorithm is advantageous for real-time control.

Kegerise, M. A.↗

Intensity-Modulated Radiotherapy Optimization in a Quasi-Periodically Deforming Patient Model

Purpose: To present the implementation of a probability-based, four-dimensional (4D) intensity-modulated radiotherapy (IMRT) planning approach that explicitly optimizes the accumulated dose to moving tissue, estimated using the patient's probability density function (pdf) of respiratory motion. This is termed 'optimization in tissue's-eye-view'. Methods and Materials: The method incorporates 4D Monte Carlo dose calculation in multiple geometries of a respiratory-correlated CT dataset. The instance doses are weighted according to the breathing pdf and accumulated in a common reference geometry, which involves dose warping based on deformable registration. The algorithm produces deliverable multileaf collimator segments and was tested on a sample lung cancer patient dataset with large target excursion. Accumulated doses of the moving target and organs at risk of this plan were compared with those of corresponding margin-based static IMRT plans for free-breathing and gated treatment, as well as target tracking. Results: Target tracking provided best target coverage. Both the presented 4D IMRT approach for free-breathing treatment and gated treatment gave similar results for target coverage and lung dose, with significantly better target coverage than the margin-based static IMRT plan for free-breathing treatment. Conclusions: The presented 4D planning concept offers an alternative to gating by providing the optimal dose for free-breathing IMRT treatment. Although the focus of this study was 4D lung planning, the approach can be generally applied for IMRT optimization in randomly deforming patient models.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Wedge sampling for computing clustering coefficients and triangle counts on large graphs

Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics are based on triangles, such as those measuring social cohesion. Despite the importance of these triadic measures, algorithms to compute them can be extremely expensive. We discuss the method of wedge sampling. This versatile technique allows for the fast and accurate approximation of various types of clustering coefficients and triangle counts. Furthermore, these techniques are extensible to counting directed triangles in digraphs. Our methods come with provable and practical time-approximation tradeoffs for all computations. We provide extensive results that show our methods are orders of magnitude faster than the state of the art, while providing nearly the accuracy of full enumeration.

97 MATHEMATICS AND COMPUTING↗

Design of nonlinear discrete-time controllers using a parameter space sampling procedure

The design of nonlinear discrete-time controllers is investigated where the control algorithm assumes a special form. State-dependent control actions are obtained from tables whose values are the design parameters. A new design methodology capable of dealing with nonlinear systems containing parameter uncertainty is used to obtain the controller design. Various controller strategies are presented and illustrated through an example.

Young, G. E.↗

Real-Time Adaptive Drag Minimization Wind Tunnel Investigation of a Flexible Wing with Variable Camber Continuous Trailing Edge Flap System

This paper reports the results of a recently completed real-time adaptive drag minimization wind tunnel investigation of a highly flexible wing wind tunnel model equipped with the Variable Camber Continuous Trailing Flap (VCCTEF) technology at the University of Washington Aeronautical Laboratory (UWAL). The wind tunnel investigation is funded by NASA SBIR Phase II contract with Scientific Systems Company, Inc. (SSCI) and University of Washington (UW) as a subcontractor. The wind tunnel model is a sub-scale Common Research Model (CRM) wing constructed of foam core and fiberglass skin and is aeroelastically scaled to achieve a wing tip deflection of 10% of the wing semi-span which represents a typical wing tip deflection for a modern transport such as Boeing 787. The jig-shape twist of the CRM wing is optimized using a CART3D aero-structural model to achieve the minimum induced drag for the design cruise lift coefficient of 0.5. The wing is equipped with two chord wise cambered segments for each of the six span wise flap sections for a total of 12 individual flap segments that comprise the VCCTEF system. Each of the 12 flap segments is actively controlled by an electric servo-actuator. The real-time adaptive drag optimization strategy includes an on-board aerodynamic model identification, a model excitation, and a real-time drag optimization. The on-board aerodynamic model is constructed parametrically as a function of the angle of attack and flap positions to model the lift and drag coefficients of the wing. The lift coefficient models include a linear model and a second-order model. The drag coefficient models include a quadratic model and a higher-order up to 6th-order model to accurately model the drag coefficient at high angles of attack. The onboard aerodynamic model identification includes a recursive least-squares (RLS) algorithm and a batch least-squares (BLS) algorithm designed to estimate the model parameters. The model excitation method is designed to sample the input set that comprises the angle of attack and the flap positions. Three model excitation methods are developed: random excitation method, sweep method, and iterative angle-of-attack seeking method. The real-time drag optimization includes a generic algorithm developed by SSCI and several optimization methods developed by NASA which include a second-order gradient Newton-Raphson optimization method, an iterative gradient optimization method, a pseudo-inverse optimization method, an analytical optimization method, and an iterative refinement optimization method. The first wind tunnel test entry took place in September 2017. This test revealed major hardware issues and required further redesign of the flap servo mechanisms. The second test entry took place in April 2018. However, the test was not successful due to the issues with the onboard aerodynamic model identification RLS algorithm which incorrectly identified model parameters. This test also provides an experimental comparison study between the VCCTEF and a variable camber discrete trailing edge flap (VCDTEF) without the elastomer transition mechanisms. The experimental result confirms the benefit of the VCCTEF which produces lower drag by 5% than the VCDTEF. The third and final test entry took place in June 2018 after the issues with the RLS algorithm have been identified and corrected. Additional improvements were implemented. These include the BLS algorithm, the iterative angle-of-attack seeking method, the iterative gradient optimization method, and the pseudo-inverse optimization method. The test objectives were successfully demonstrated as the real-time drag optimization identifies several optimal solutions at off-design lift coefficients. The iterative gradient optimization method is found to achieve up to 4.7% drag reduction for the off-design lift coefficient of 0.7. The pseudo-inverse optimization method which does not require the drag coefficient model is found to be quite effective in reducing drag. Up to 9.4% drag reduction for the off-design lift coefficient of 0.7 is achieved with the pseudo-inverse optimization method. The wind tunnel investigation demonstrates the potential of real-time drag optimization technology. Several new capabilities are developed that could enable future adaptive wing technologies for flexible wings equipped with drag control devices such as the VCCTEF.

Drag Optimization↗

An evaluation of the signature extension approach to large area crop inventories utilizing space image data

The author has identified the following significant results. Two examples of haze correction algorithms were tested: CROP-A and XSTAR. The CROP-A was tested in a unitemporal mode on data collected in 1973-74 over ten sample segments in Kansas. Because of the uniformly low level of haze present in these segments, no conclusion could be reached about CROP-A's ability to compensate for haze. It was noted, however, that in some cases CROP-A made serious errors which actually degraded classification performance. The haze correction algorithm XSTAR was tested in a multitemporal mode on 1975-76 LACIE sample segment data over 23 blind sites in Kansas and 18 sample segments in North Dakota, providing wide range of haze levels and other conditions for algorithm evaluation. It was found that this algorithm substantially improved signature extension classification accuracy when a sum-of-likelihoods classifier was used with an alien rejection threshold.

Nalepka, R. F.↗

Simulation-based optimal Bayesian experimental design for nonlinear systems

The optimal selection of experimental conditions is essential to maximizing the value of data for inference and prediction, particularly in situations where experiments are time-consuming and expensive to conduct. We propose a general mathematical framework and an algorithmic approach for optimal experimental design with nonlinear simulation-based models; in particular, we focus on finding sets of experiments that provide the most information about targeted sets of parameters. Our framework employs a Bayesian statistical setting, which provides a foundation for inference from noisy, indirect, and incomplete data, and a natural mechanism for incorporating heterogeneous sources of information. An objective function is constructed from information theoretic measures, reflecting expected information gain from proposed combinations of experiments. Polynomial chaos approximations and a two-stage Monte Carlo sampling method are used to evaluate the expected information gain. Stochastic approximation algorithms are then used to make optimization feasible in computationally intensive and high-dimensional settings. These algorithms are demonstrated on model problems and on nonlinear parameter inference problems arising in detailed combustion kinetics.

97 MATHEMATICS AND COMPUTING↗

GPU acceleration of Swendsen–Wang dynamics

When simulating a lattice system near its critical temperature, local algorithms for modeling the system’s evolution can introduce very large autocorrelation times into sampled data. Here, this critical slowing down places restrictions on the analysis that can be completed in a timely manner of the behavior of systems around the critical point. Because it is often desirable to study such systems around this point, a new algorithm must be introduced. Therefore, we turn to cluster algorithms, such as the Swendsen–Wang algorithm and the Wolff clustering algorithm. They incorporate global updates which generate new lattice configurations with little correlation to previous states, even near the critical point. We look to accelerate the rate at which these algorithm are capable of running by implementing and benchmarking a parallel implementation of each algorithm designed to run on GPUs under NVIDIA’s CUDA framework. A 17 and 90 fold increase in the computational rate was, respectively, experienced when measured against the equivalent algorithm implemented in serial code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantifying uncertainties on fission fragment mass yields with mixture density networks

Probabilistic machine learning techniques can learn both complex relations between input features and output quantities of interest as well as take into account stochasticity or uncertainty within a data set. In this initial work, we explore the use of one such probabilistic network, the mixture density network (MDN), to reproduce fission yields and their uncertainties. In this paper, we study mass yields for the spontaneous fission of 252 Cf, exploring the number of training samples needed for converged predictions, how different levels of uncertainty propagate from the training set to the MDN predictions, and how well physical constraints of the yields—such as normalization and symmetry—are upheld by the algorithm. Finally, we test the ability of the MDN to interpolate between and extrapolate beyond samples in the training set using energy-dependent mass yields for the neutron-induced fission on 235 U. The MDN provides a reliable way to include and predict uncertainties and is a promising path forward for supplementing sparse sets of nuclear data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimal structure and parameter learning of Ising models

Reconstruction of the structure and parameters of an Ising model from binary samples is a problem of practical importance in a variety of disciplines, ranging from statistical physics and computational biology to image processing and machine learning. The focus of the research community shifted toward developing universal reconstruction algorithms that are both computationally efficient and require the minimal amount of expensive data. Here, we introduce a new method, interaction screening, which accurately estimates model parameters using local optimization problems. The algorithm provably achieves perfect graph structure recovery with an information-theoretically optimal number of samples, notably in the low-temperature regime, which is known to be the hardest for learning. Here, the efficacy of interaction screening is assessed through extensive numerical tests on synthetic Ising models of various topologies with different types of interactions, as well as on real data produced by a D-Wave quantum computer. Finally, this study shows that the interaction screening method is an exact, tractable, and optimal technique that universally solves the inverse Ising problem.

97 MATHEMATICS AND COMPUTING↗

AutoEMX v1.

The invention consists in the full automation of compositional analysis of inorganic powder samples by scanning electron microscopy (SEM) with energy-dispersive X-ray spectroscopy (EDS). The measurements and analysis are controlled via python-based software, Auto-SEMEDS. Auto-SEMEDS fully automates the SEM-EDS measurements, and analyses the collected data via the use of machine-learning (ML) algorithms, which have never been used before for such scope. Auto-SEMEDS enables the identification in fully-automated fashion of the individual material phases present in a powder sample. Similar technologies, such as commercial SEM-EDS software, can automatically classify particles based on their composition, but they have significant limitations. These solutions typically provide inaccurate composition measurements and struggle to identify single phases in lab samples, where phases are often closely intermixed. In contrast, Auto-SEMEDS achieves unprecedented accuracy in composition measurements of powder samples, and furthermore leverages machine learning algorithms to effectively discern intermixed phases. Notably, while previous studies have demonstrated accurate measurements on individual particles, Auto-SEMEDS stands out by successfully analyzing mixture of different phases, a capability that has not been reported in the literature until now.

Giunto, Andrea [Lawrence Berkeley National Laborat↗

The Case for Strong Scaling in Deep Learning: Training Large 3D CNNs with Hybrid Parallelism

Here, we present scalable hybrid-parallel algorithms for training large-scale 3D convolutional neural networks. Deep learning-based emerging scientific workflows often require model training with large, high-dimensional samples, which can make training much more costly and even infeasible due to excessive memory usage. We solve these challenges by extensively applying hybrid parallelism throughout the end-to-end training pipeline, including both computations and I/O. Our hybrid-parallel algorithm extends the standard data parallelism with spatial parallelism, which partitions a single sample in the spatial domain, realizing strong scaling beyond the mini-batch dimension with a larger aggregated memory capacity. We evaluate our proposed training algorithms with two challenging 3D CNNs, CosmoFlow and 3D U-Net. Our comprehensive performance studies show that good weak and strong scaling can be achieved for both networks using up to 2K GPUs. More importantly, we enable training of CosmoFlow with much larger samples than previously possible, realizing an order-of-magnitude improvement in prediction accuracy.

97 MATHEMATICS AND COMPUTING↗

Statistics for characterizing data on the periphery

We introduce a class of statistics for characterizing the periphery of a distribution, and show that these statistics are particularly valuable for problems in target detection. Because so many detection algorithms are rooted in Gaussian statistics, we concentrate on ellipsoidal models of high-dimensional data distributions (that is to say: covariance matrices), but we recommend several alternatives to the sample covariance matrix that more efficiently model the periphery of a distribution, and can more effectively detect anomalous data samples.

97 MATHEMATICS AND COMPUTING↗

Improved Acquisition and Reconstruction for Wavelength-Resolved Neutron Tomography

Wavelength-resolved neutron tomography (WRNT) is an emerging technique for characterizing samples relevant to the materials sciences in 3D. WRNT studies can be carried out at beam lines in spallation neutron or reactor-based user facilities. Because of the limited availability of experimental time, potential imperfections in the neutron source, or constraints placed on the acquisition time by the type of sample, the data can be extremely noisy resulting in tomographic reconstructions with significant artifacts when standard reconstruction algorithms are used. Furthermore, making a full tomographic measurement even with a low signal-to-noise ratio can take several days, resulting in a long wait time before the user can receive feedback from the experiment when traditional acquisition protocols are used. In this paper, we propose an interlaced scanning technique and combine it with a model-based image reconstruction algorithm to produce high-quality WRNT reconstructions concurrent with the measurements being made. The interlaced scan is designed to acquire data so that successive measurements are more diverse in contrast to typical sequential scanning protocols. The model-based reconstruction algorithm combines a data-fidelity term with a regularization term to formulate the wavelength-resolved reconstruction as minimizing a high-dimensional cost-function. Using an experimental dataset of a magnetite sample acquired over a span of about two days, we demonstrate that our technique can produce high-quality reconstructions even during the experiment compared to traditional acquisition and reconstruction techniques. In summary, the combination of the proposed acquisition strategy with an advanced reconstruction algorithm provides a novel guideline for designing WRNT systems at user facilities.

47 OTHER INSTRUMENTATION↗

Models and Algorithms for Equilibrium Analysis of Mixed-Material Nucleic Acid Systems

Dynamic programming algorithms within the NUPACK software suite enable analysis of equilibrium base-pairing properties for complex and test tube ensembles containing arbitrary numbers of interacting nucleic acid strands. Currently, calculations are limited to single-material systems that are either all-RNA or all-DNA. Here, to enable analysis of mixed-material systems that are critical for modern applications in vitro, in situ, and in vivo, we develop physical models and dynamic programming algorithms that allow the material of the system to be specified at nucleotide resolution. Free energy parameter sets are constructed for both RNA/DNA and RNA/2'OMe-RNA mixed-material systems by combining available empirical mixed-material parameters with single-material parameter sets to enable treatment of the full complex and test tube ensembles. New dynamic programming recursions account for the material of each nucleotide throughout the recursive process. For a complex with N nucleotides, the mixed-material dynamic programming algorithms maintain the O(N 3 ) time complexity of the single-material algorithms, enabling efficient calculation of diverse physical quantities over complex and test tube ensembles (e.g., complex partition function, equilibrium complex concentrations, equilibrium base-pairing probabilities, minimum free energy secondary structure(s), and Boltzmann-sampled secondary structures) at a cost increase of roughly 2.0-3.5×. The results of existing single-material algorithms are exactly reproduced when applying the new mixed-material algorithms to single-material systems. Accuracy is significantly enhanced using mixed-material models and algorithms to predict RNA/DNA and RNA/2'OMe-RNA duplex melting temperatures from the experimental literature as well as RNA/DNA melt profiles from new experiments. In conclusion, mixed-material analyses can be performed online using the NUPACK web app (www.nupack.org) or locally using the NUPACK Python module.

2′OMe-RNA↗