SEARCH · Search NASA

Results for “sampling algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Harmonic analysis of discrete tracers of large-scale structure

It is commonplace in cosmology to analyze fields projected onto the celestial sphere, and in particular density fields that are defined by a set of points e.g. galaxies. When performing an harmonic-space analysis of such data (e.g. an angular power spectrum) using a pixelized map one has to deal with aliasing of small-scale power and pixel window functions. We compare and contrast the approaches to this problem taken in the cosmic microwave background and large-scale structure communities, and advocate for a direct approach that avoids pixelization. We describe a method for performing a pseudo-spectrum analysis of a galaxy data set and show that it can be implemented efficiently using well-known algorithms for special functions that are suited to acceleration by graphics processing units (GPUs). The method returns the same spectra as the more traditional map-based approach if in the latter the number of pixels is taken to be sufficiently large and the mask is well sampled. The method is readily generalizable to cross-spectra and higher-order functions. It also provides a convenient route for distributing the information in a galaxy catalog directly in harmonic space, as a complement to releasing the configuration-space positions and weights, and a route to spectral apodization. Finally, we make public a code enabling the application of our method to existing and upcoming datasets.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Lossy Compression: An Online Multi-Stage Technology for High-Fidelity Synchro- Waveform Measurements

Effective real-time monitoring and analysis of distributed grids necessitate the use of synchro-waveform measurements, which capture almost all high-frequency disturbances and transient phenomena. However, due to limitations in high-speed measurements and network bandwidth, it is challenging to transfer all high-fidelity synchro-waveforms losslessly and successfully. To cope with these challenges, a hybrid-based online multi-stage compression algorithm is proposed to significantly improve the compression efficiency for synchro-waveform measurements. Initially, the multiple discrete Wavelet transformation is deployed to deconstruct the waveform components. The delta encoding is further developed to decrease the magnitude. In conjunction with the Lempel-Ziv-Markov chain, the hybrid compression algorithm is implemented to achieve real-time compression for the synchro-waveform measurements. Moreover, an innovative error index that synergizes the time and frequency domain error and correlation is formulated to evaluate the waveform distortion. By integrating compression ratio, suitable parameters can be optimally selected. Finally, the simulation, laboratory experiments, as well as field tests across a spectrum of sampling frequencies and time intervals are conducted to substantiate the efficacy of the proposed method. Here, the outcomes demonstrated that a compression ratio of approximately 15.5 and 17.83 can be reached for 0.5 s and 1 s data under both offline and online scenarios, which equates to a substantial 93.5% to 94.39% reduction in data storage requirements.

High-fidelity synchro-waveform measurements↗

DOE OSTI2025

Fine-tuning machine-learned particle-flow reconstruction for new detector geometries in future colliders

We demonstrate transfer learning capabilities in a machine-learned algorithm trained for particle-flow reconstruction in high energy particle colliders. This paper presents a cross-detector fine-tuning study, where we initially pretrain the model on a large full simulation dataset from one detector design, and subsequently fine-tune the model on a sample with a different collider and detector design. Specifically, we use the Compact Linear Collider detector (CLICdet) model for the initial training set and demonstrate successful knowledge transfer to the CLIC-like detector (CLD) proposed for the Future Circular Collider in electron-positron mode. We show that with an order of magnitude less samples from the second dataset, we can achieve the same performance as a costly training from scratch, across particle-level and event-level performance metrics, including jet and missing transverse momentum resolution. Furthermore, we find that the fine-tuned model achieves comparable performance to the traditional rule-based particle-flow approach on event-level metrics after training on 100,000 CLD events, whereas a model trained from scratch requires at least 1 million CLD events to achieve similar reconstruction performance. To our knowledge, this represents the first full-simulation cross-detector transfer learning study for particle-flow reconstruction. These findings offer valuable insights towards building large foundation models that can be fine-tuned across different detector designs and geometries, helping to accelerate the development cycle for new detectors and opening the door to rapid detector design and optimization using machine learning.

43 PARTICLE ACCELERATORS↗

DOE OSTI2024

MENT-Flow: maximum-entropy phase space tomography using normalizing flows

Generative models can be trained to reproduce low-dimensional projections of high-dimensional phase space distributions. Normalizing flows are generative models that parameterize invertible transformations, allowing exact probability density evaluation and sampling. Consequently, flows are unbiased entropy estimators and could be used to solve the high-dimensional maximum-entropy tomography (MENT) problem. In this work, we evaluate a flow-based MENT solver (MENT-Flow) against exact maximum-entropy solutions and Minerbo's iterative MENT algorithm in two dimensions.

Hoover, Austin↗

DOE OSTI2026

The Art of Automation: Translating Electron Microscopy Workflows Into Automated Processes

Acquiring data using a scanning transmission electron microscope (STEM) is a complex, multi-step process. The intricacy of the process depends on the type of sample, composition of the material, desired results of the experiment, resolution requirement and other experimental factors. Each experiment presents unique complications, such as sample drift and contamination, that the microscopist must consider when acquiring data. All these challenges are handled fluidly and expertly by experienced microscopists, but to reach new levels of innovation in material development, including greater reproducibility, throughput, and precision, the automation of these workflows is essential. The initial phase of this work involved translating intuition-based workflows into discrete, programmable steps. Some common key stages in STEM workflows are the initial tuning, scanning the sample for areas of interest, and then acquiring the data. Each stage can be broken further into specific parameter adjustments, such as aberration correction and dwell time optimization, depending on the experiment. When deconstructing various experiments each step was assessed for automation feasibility based on the amount of real time operator decisions. There are steps that lend themselves to automation more readily than others, such as course focusing and sample screening, but there is potential for full automation of all stages with time. As an initial step, an automated montage routine was developed, allowing for the efficient acquisition of large portions of the sample without requiring continuous intervention from the operator. The automation of this small process of the procedure demonstrates the value of this capability. A major challenge in automation arises from discrepancies between commanded, reported and actual stage movements. Using systematic tests, stage movement was quantified. This error can be corrected algorithmically for more accurate workflows in the future. Expanding automation capabilities would result in larger, more efficient data acquisition which allows for more robust statistical analysis. Additionally, this work lays the groundwork for a closed loop system where machine learning algorithms would intake automatically acquired data and make real time decisions. By progressively automating this instrument, this work establishes the foundation for fully automated experimentation in transmission electron microscopy.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Terahertz time-domain spectroscopy imaging of pancreatic ductal adenocarcinoma tissues

Pancreatic ductal adenocarcinoma (PDAC) ranks among the malignancies with the highest fatality and morbidity rates. This is predominantly attributable to an absence of understanding the intricate and diverse microenvironment of the tumor. We use terahertz time-domain spectroscopy (THz-TDS) imaging in transmission geometry to probe ex-vivo the heterogenous microenvironment of the genetically modified murine PDAC tissue that closely resembles the PDAC heterogeneity in human malignancy. We introduced a maximum a-posteriori probability estimation algorithm to objectively the tumor’s heterogenous microenvironment using the average values of refractive index and absorption coefficient within the useable terahertz bandwidth as imaging markers. Furthermore, direct comparison of stained histopathologic images and the refractive index and the absorption coefficient high-resolution, two dimensional maps of the same PDAC samples confirms the high potential of the THz-TDS method for tumor tissue characterization.

absorption↗

DOE OSTI2024

Using scalable computer vision to automate high-throughput semiconductor characterization

Abstract High-throughput materials synthesis methods, crucial for discovering novel functional materials, face a bottleneck in property characterization. These high-throughput synthesis tools produce 10 4 samples per hour using ink-based deposition while most characterization methods are either slow (conventional rates of 10 1 samples per hour) or rigid (e.g., designed for standard thin films), resulting in a bottleneck. To address this, we propose automated characterization (autocharacterization) tools that leverage adaptive computer vision for an 85x faster throughput compared to non-automated workflows. Our tools include a generalizable composition mapping tool and two scalable autocharacterization algorithms that: (1) autonomously compute the band gaps of 200 compositions in 6 minutes, and (2) autonomously compute the environmental stability of 200 compositions in 20 minutes, achieving 98.5% and 96.9% accuracy, respectively, when benchmarked against domain expert manual evaluation. These tools, demonstrated on the formamidinium (FA) and methylammonium (MA) mixed-cation perovskite system FA 1−x MA x PbI 3 , 0 ≤ x ≤ 1, significantly accelerate the characterization process, synchronizing it closer to the rate of high-throughput synthesis.

Science & Technology - Other Topics↗

DOE OSTI2024

Measurement of jet substructure in boosted $t\overline{t}$ events with the ATLAS detector using 140 fb -1 of 13 TeV $pp$ collisions

Measurements of the substructure of top-quark jets are presented, using 140 fb -1 of 13 TeV pp collision data recorded with the ATLAS detector at the LHC. Top-quark jets reconstructed with the anti-k t algorithm with a radius parameter R = 1.0 are selected in top-quark pair ($t\overline{t}$) events where one top quark decays semileptonically and the other hadronically, or where both top quarks decay hadronically. The top-quark jets are required to have transverse momentum p T > 350 GeV, yielding large samples of data events with jet p T values between 350 and 600 GeV. One- and two-dimensional differential cross sections for eight substructure variables, defined using only the charged components of the jets, are measured in a particle-level phase space by correcting for the smearing and acceptance effects induced by the detector. The differential cross sections are compared with the predictions of several Monte Carlo simulations in which top-quark pair-production quantum chromodynamic matrix-element calculations at next-to-leading-order precision in the strong coupling constant α S are passed to leading-order parton shower and hadronization generators. The Monte Carlo predictions for measures of the broadness, and also the two-body structure, of the top-quark jets are found to be in good agreement with the measurements, while variables sensitive to the three-body structure of the top-quark jets exhibit some tension with the measured distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2026

The DESI DR1 peculiar velocity survey: growth rate measurements from the maximum likelihood fields method

We present the constraint on the growth rate of structure from the combination of DESI DR1 BGS sample, Fundamental Plane, and Tully-Fisher peculiar velocity catalogues using the maximum likelihood fields method. The combined catalogue contains 415,523 galaxy redshifts and 76,616 peculiar velocity measurements. To handle the large amount of data in the DESI DR1 peculiar velocity catalogue, we significantly improve the computational efficiency by rewriting the algorithm with JAX. After removing outliers and Tully-Fisher galaxies that are affected by systematics, we find fσ 8 = 0.483 -0.043 +0.080 (stat) ± 0.018(sys), consistent within 1σ with the power spectrum and correlation function analysis using the same dataset. Combining all three measurements with appropriate correlations, the consensus measurement is fσ 8 (z eff = 0.07) = 0.450±0.055, consistent with Planck +ΛCDM cosmology (fσ 8 = 0.449±0.008). Combining with the high redshift growth rate of structure measurements from DESI ShapeFit, the constraint on the growth index is γ = 0.58±0.11, consistent with GR.

cosmic flows↗

DOE OSTI2025

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Materials Learning Algorithms (MALA): Scalable machine learning for electronic structure calculations in large-scale atomistic simulations

We present the Materials Learning Algorithms (MALA) package, a scalable machine learning framework designed to accelerate density functional theory (DFT) calculations suitable for large-scale atomistic simulations. Using local descriptors of the atomic environment, MALA models efficiently predict key electronic observables, including local density of states, electronic density, density of states, and total energy. The package integrates data sampling, model training and scalable inference into a unified library, while ensuring compatibility with standard DFT and molecular dynamics codes. We demonstrate MALA's capabilities with examples including boron clusters, aluminum across its solid-liquid phase boundary, and predicting the electronic structure of a stacking fault in a large beryllium slab. Scaling analyses reveal MALA's computational efficiency and identify bottlenecks for future optimization. With its ability to model electronic structures at scales far beyond standard DFT, MALA is well suited for modeling complex material systems, making it a versatile tool for advanced materials research.

Density functional theory↗

DOE OSTI2025

Extreme Longitudinal Compression of Optimized Beams for MEV Ultrafast Electron Diffraction (Final Technical Report)

We worked out the design of a high repetition rate MeV energy ultrafast electron diffraction instrument based on the existing Cornell photoinjector, which can readily be applied to the presented findings. This example is a blueprint of other similarly arranged UED setups. Using particle tracking simulations in conjunction with multiobjective genetic algorithm optimization, we explored the smallest bunch lengths, emittance, and probe spot sizes achievable. As two limits, we defined stroboscopic conditions (with single electrons per pulse) and operation with 10 5 electrons per bunch which may be suitable for single-shot diffraction images. In the stroboscopic case, the flexibility provided by the many cavity bunching and acceleration allows for longitudinal phase space linearization without a higher harmonic field, providing sub-fs bunch lengths at the sample. Given low emittance photoemission conditions, these small bunch lengths can be maintained with probe transverse sizes at the single micron (1 μm) scale and below. In the case of 10 5 electrons per pulse, we simulated state-of-the-art 5D brightness conditions: rms bunch lengths of 10 fs with 3-nm normalized emittances, while permitting repetition rates as high as 1.3 GHz. We showed that in conjunction with collimating apertures, a novel focusing scheme achieves very high-quality emittance compensation for the central core of the beam composing 40% of particles, for a resulting beam size of 5 μm (rms). Finally, to aid in the design of new SRF-based ultrafast electron diffraction machines, we simulated the trade-off between the number of cavities used and achievable bunch length and emittance. In the longitudinal dimension, we made use of the fact that MeV UED requires much lower energy than the 15-MeV maxi mum energy of Cornell’s CBETA injector, and we may therefore use several of the SRF cavities for bunch length compression. In practice, we used a genetic optimization algorithm to choose the phases and amplitudes of the cavities appropriately for optimal bunching. In the zero space charge case, we found that bunching and acceleration are distributed across the six cavities in a way that produces a linearizing effect. And we showed that the ultimate bunch length can be limited by time-of-flight differences arising from transverse size and transverse momentum spread. The space charge code developed and used for this development is now permanent part of the Bmad accelerator simulation code and has already contributed to other developments, e.g., for the EIC electron cooler design.

43 PARTICLE ACCELERATORS↗

DOE OSTI2025

Covariance-Free Bifidelity Control Variates Importance Sampling for Rare Event Reliability Analysis

Multifidelity modeling has been steadily gaining attention as a tool to address the problem of exorbitant model evaluation costs that makes the estimation of failure probabilities a significant computational challenge for complex real-world problems, particularly when failure is a rare event. To implement multifidelity modeling, estimators that efficiently combine information from multiple models/sources are necessary. In past works, the variance reduction techniques of control variates (CV) and importance sampling (IS) have been leveraged for this task. In this paper, we present the CVIS framework—a creative take on a coupled CV and IS estimator for bifidelity reliability analysis. The framework addresses some of the practical challenges of the CV method by using an estimator for the control variate mean and sidestepping the need to estimate the covariance between the original estimator and the control variate through a clever choice for the tuning constant. Furthermore, the task of selecting an efficient IS distribution is also considered, with a view towards maximally leveraging the bifidelity structure and maintaining expressivity. Additionally, a diagnostic is provided that indicates both the efficiency of the algorithm as well as the relative predictive quality of the models utilized. Finally, the behavior and performance of the framework is explored through analytical and numerical examples.

Markov chain Monte Carlo↗

DOE OSTI2024

High redshift LBGs from deep broadband imaging for future spectroscopic surveys

Lyman break galaxies (LBGs) are promising probes for clustering measurements at high redshift, z > 2, a region only covered so far by Lyman-α forest measurements. Here, in this paper, we investigate the feasibility of selecting LBGs by exploiting the existence of a strong deficit of flux shortward of the Lyman limit, due to various absorption processes along the line of sight. The target selection relies on deep imaging data from the HSC and CLAUDS surveys in the g, r, z and u bands, respectively, with median depths reaching 27 AB in all bands. The selections were validated by several dedicated spectroscopic observation campaigns with DESI. Visual inspection of spectra has enabled us to develop an automated spectroscopic typing and redshift estimation algorithm specific to LBGs. Based on these data and tools, we assess the efficiency and purity of target selections optimised for different purposes. Selections providing a wide redshift coverage retain 57% of the observed targets after spectroscopic confirmation with DESI, and provide an efficiency for LBGs of 83 ± 3%, for a purity of the selected LBG sample of 90 ± 2%. This would deliver a confirmed LBG density of ~ 620 deg$^{-2}$ in the range 2.3 < z < 3.5 for a r-band limiting magnitude r < 24.2. Selections optimised for high redshift efficiency retain 73% of the observed targets after spectroscopic confirmation, with 89 ± 4% efficiency for 97 ± 2% purity. This would provide a confirmed LBG density of ~ 470 deg$^{-2}$ in the range 2.8 < z < 3.5 for a r-band limiting magnitude r < 24.5.A preliminary study of the LBG sample 3d-clustering properties is also presented and used to estimate the LBG linear bias. A value of b$_{LBG}$ = 3.3 ± 0.2 (stat.) is obtained for a mean redshift of 2.9 and a limiting magnitude in r of 24.2, in agreement with results reported in the literature.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Effects of Aluminum Plate Initial Residual Stress on Machined-Part Distortion

Dimensional tolerances for high-speed-machined aluminum products continue to tighten due to the demand for automated assembly of complex monolithic parts in aerospace and other industries. Understanding the contribution of inherent residual stress in wrought Al 7050-T7451 plate, common in aircraft manufacture, to distortion of high-aspect-ratio machined parts is critical but remains problematic due to the alloy's low residual stress magnitude over large geometries. Prior investigations into residual stress effects on machined part distortion suffer inadequate characterizations of the wrought material stress field, either because of low fidelity due to “slitting” methods, confounding effects in machined-layer removal methods, or small sample size when using neutron diffraction (ND). In this work, inherent residual stress is measured via ND at 860 locations in a 90.5 mm thick Al 7050-T7451 plate having dimensions 399 mm in the rolling direction and 335 mm in the transverse direction. Unlike prior studies, the ND residual stress is reconstructed using an iterative algorithm to ensure fully compatible, equilibrated 3D field prior to examining its effect on distortion. Further, the findings from simulations and experiments show that inherent residual stress alone could distort a high-aspect-ratio part beyond aerospace industry requirements, that slitting measurements may not sufficiently characterize residual stress for predicted distortion, and that parts machined from different plate thickness locations could exhibit reversed distortion patterns. Thus, research into distortion prediction that considers machining should carefully characterize and reconstruct inherent residual stress so that the coupled machining effects are accurately modeled.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra

Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as topological order. Extracting such information with small additive error is #BQP-complete in the worst case. In this work, we introduce QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra), a quantum algorithm that efficiently identifies clusters of closely spaced dominant eigenvalues and determines their multiplicities under physically motivated assumptions, which allows us to bypass worst-case complexity barriers. QFAMES also enables the estimation of observable expectation values within targeted energy clusters, providing a powerful tool for studying quantum phase transitions and other physical properties. We validate the effectiveness of QFAMES through numerical demonstrations, including its applications to characterizing quantum phases in the transverse-field Ising model and estimating the ground-state degeneracy of a topologically ordered phase in the two-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach offers rigorous theoretical guarantees and significant advantages over existing subspace-based quantum spectral analysis methods, particularly in terms of the sample complexity and the ability to resolve degeneracies.

97 MATHEMATICS AND COMPUTING↗